제출 #1235794

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1235794		kreukpg	Modsum (NOI12_modsum)	C++20	25 / 25	128 ms	496 KiB

modsum

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define fo(i, a, b, k) for(ll i=a; i<=b; i+=k)
#define fod(i, a, b, k) for(ll i=a; i>=b; i-=k)
#define lop(x, s) for(auto x : s)
#define sz(s) s.size()
#define all(s) s.begin(), s.end()
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
const ll inf=1e18;
const ll mod=1e9+7;
const ll maxn=1e6+5;

struct cap{
    ll v, w;
};

ll n, res;
cap a[1005];

void bt(ll i, ll sum){
    if(i>n){
        res+=(sum*sum%5*sum%5*sum%5+2*sum%5*sum%5)%5+1;
        return;
    }
    fo(j, a[i].v, a[i].w, 1){
        bt(i+1, (sum+j)%5);
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n;
    fo(i, 1, n, 1) cin >> a[i].v >> a[i].w;
    bt(1, 0);
    cout << res;
    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5