Submission #1235766

#TimeUsernameProblemLanguageResultExecution timeMemory
1235766annnModsum (NOI12_modsum)C++20
25 / 25
136 ms512 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define endl "\n" #define pb push_back #define ff first #define ss second #define ii pair<int, int> #define vi vector<int> #define vii vector<pair<int, int>> #define vvi vector<vi> #define mii map<int, int> #define rep(i, a, b) for (int i = a; i <= b; i++) #define _READ(name) freopen(name, "r", stdin) #define _WRITE(name) freopen(name, "w", stdout) const int INF = 4e18; const int MOD = 1e9 + 7; int n; const int mx = 1e3 + 3; int u[mx], v[mx]; int ans = 0; void Prepare() { cin >> n; rep(i, 1, n) cin >> u[i] >> v[i]; } void ql(int i, int sum) { if (i > n) { int f = (sum*sum%5*sum%5*sum%5 + 2*sum%5*sum%5)%5+1; ans += f; return; } for (int j = u[i]; j <= v[i]; j++) { ql(i+1, (sum+j)%5); } } void COOOOK() { ql(1, 0); } void Eat() { cout << ans << endl; } void Wash() { } signed main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int TEST = 1; // cin >> TEST; while (TEST--) { Prepare(); COOOOK(); Eat(); Wash(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...