# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
389092 | denkendoemeer | Asceticism (JOI18_asceticism) | C++14 | 16 ms | 1872 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.
#include<bits/stdc++.h>
#define ll long long
const int inf=1e9;
#define mod 1000000007
using namespace std;
int fact[200005],inv[200005];
int po(int b,int e)
{
int p=1;
while(e){
if (e%2==1)
p=1LL*p*b%mod;
b=1LL*b*b%mod;
e=e/2;
}
return p;
}
int comb(int n,int k)
{
return 1LL*fact[n]*inv[k]%mod*inv[n-k]%mod;
}
int calc(int n,int k)
{
if (k>n)
return 0;
int ans=0,i;
for(i=0;i<=k;i++){
int aux=1LL*comb(n+1,i)*po(k+1-i,n)%mod;
if (i%2==1)
ans=(ans-aux+mod)%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... |