# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1027242 | nathan4690 | Binaria (CCO23_day1problem1) | C++17 | 71 ms | 29776 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.
// CCO '23 P1 - Binaria
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define el cout << '\n'
#define f1(i,n) for(ll i=1;i<=n;i++)
#define __file_name ""
using namespace std;
const ll maxn = 1e6+5, inf=1e18, mod=1e6+3;
ll n, k, a[maxn], l, r, ans;
char res[maxn];
ll fac[maxn], inv[maxn];
ll powmod(ll base, ll exp){
if(exp == 0) return 1ll;
if(exp == 1) return base % mod;
ll v = powmod(base, exp/2);
if(exp % 2) return v*v%mod*base%mod;
else return v*v%mod;
}
void preprocess(){
fac[0] = 1;
f1(i,n) fac[i] = fac[i-1] * i % mod;
inv[n] = powmod(fac[n], mod-2);
inv[0] = 1;
for(ll i=n-1;i>=1;i--){
inv[i] = (inv[i+1] * (i+1)) % mod;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |