# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23231 | ainta | hi (KRIII5_HI) | C++14 | 36 ms | 7788 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<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
int P[110], Mod = 1000000007, n, w[60], F[5110], InvF[5110], C[110][110], S[60];
int D1[60][5010], D2[60][5010], D[60][5010], Comb[5110][110], CC[110][110];
int Pow(int a, int b){
int r = 1;
while(b){
if(b&1)r=1ll*r*a%Mod;
a=1ll*a*a%Mod;b>>=1;
}
return r;
}
vector<int> multiply(vector<int> &A, vector<int> &B){
int i, j, an = A.size(), bn = B.size();
vector<int> C(an+bn-1, 0);
for(i=0;i<an;i++)for(j=0;j<bn;j++)C[i+j]=(C[i+j]+(long long)A[i]*B[j])%Mod;
return C;
}
void Add(vector<int> &A, vector<int> &B, int K){
A.resize(max(A.size(), B.size() + K));
int i;
for(i=0;i<B.size();i++) A[i+K] = (A[i+K]+B[i])%Mod;
}
void Sub(vector<int> &A, vector<int> &B){
A.resize(max(A.size(), B.size()));
int i;
for(i=0;i<B.size();i++) A[i] = (A[i]-B[i]+Mod)%Mod;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |