# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1059942 | vjudge1 | Modsum (NOI12_modsum) | C++17 | 67 ms | 2652 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
Author:52ducbanh
The best say which I think is:Never give up _ Let me see your attemption because you deserve to get it.
*/
#include<bits/stdc++.h>
using namespace std;
using namespace chrono;
mt19937 rd(steady_clock::now().time_since_epoch().count());
#define name "task"
#define ll long long
#define int long long
#define ld long double
#define pll pair<ll,ll>
#define fi first
#define se second
#define eb emplace_back
#define pb push_back
#define el '\n'
#define all(s) s.begin(),s.end()
#define bit(mask,i) ((mask >> i) & 1)
//For_constant//
const int MAX = 1e5 + 7;
const ll MOD = 1e9 + 7;
const ll MOD_power = 5;
const ll INF32 = 1e9 + 7;
const ll INF64 = 1e18;
const ll BASE = 333;
//For_initial_function//
template<typename T> T power(T a,T n) {
T res = 1;
while(n > 0)
{
if(n & 1)
{
res *= a;
res %= MOD_power;
}
a *= a;
a %= MOD_power;
n >>= 1;
}
return res;
}
template<typename T> T gcd(T a,T b) {
if(a == 0 || b == 0) return a + b;
else return gcd(b,a % b);
}
template<typename T> T lcm(T a,T b) {
return a/gcd(a,b) * b;
}
void initial(){
srand(time(NULL));
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
if(fopen(name".INP","r"))
{
freopen(name".INP","r",stdin);
freopen(name".OUT","w",stdout);
}
time_t now = time(0);
cerr << ctime(&now);
}
//For_solving//
int n,k;
pair<ll,ll> query[MAX];
ll ans = 0;
ll val[MAX];
void Try(int j)
{
for(int i = query[j].fi;i <= query[j].se;i++)
{
val[j] = i;
if(j == n)
{
ll sum = 0;
for(int h = 1;h <= n;h++) sum += val[h];
ans += (power(sum,4ll) + 2 * power(sum,2ll))%5 + 1;
}
else Try(j + 1);
}
}
void solve()
{
cin >> n;
for(int i = 1;i <= n;i++) cin >> query[i].fi >> query[i].se;
Try(1);
cout << ans;
}
void process_test()
{
initial();
int test;test = 1;
while(test--) solve();
}
int32_t main()
{
//Started_time
time_point<high_resolution_clock> st,ed;
st = high_resolution_clock::now();
//Solving
process_test();
//End_time
ed = high_resolution_clock::now();
auto start = time_point_cast<milliseconds>(st).time_since_epoch().count();
auto end = time_point_cast<milliseconds>(ed).time_since_epoch().count();
cerr <<"Time_wasting(milliseconds): " << end - start << el;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |