# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1162266 | sofija6 | Binaria (CCO23_day1problem1) | C++20 | 93 ms | 70728 KiB |
#include <bits/stdc++.h>
#define ll long long
#define MAXN 1000010
#define MOD 1000003
using namespace std;
ll a[MAXN],val[MAXN],fact[MAXN];
vector<ll> p[MAXN];
void Init()
{
fact[0]=1;
for (ll i=1;i<MAXN;i++)
fact[i]=(fact[i-1]*i)%MOD;
return;
}
ll Exp(ll n,ll k)
{
ll val[30];
val[0]=n;
for (ll i=1;i<30;i++)
val[i]=(val[i-1]*val[i-1])%MOD;
ll ans=1,cur=29;
while (k)
{
if ((1<<cur)<=k)
{
k-=(1<<cur);
ans=(ans*val[cur])%MOD;
}
cur--;
}
# | 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... |