Submission #471224

#TimeUsernameProblemLanguageResultExecution timeMemory
471224mosiashvililukaPeru (RMI20_peru)C++14
0 / 100
0 ms340 KiB
#include "peru.h"
#include<bits/stdc++.h>
using namespace std;
long long a,b,c,d,e,i,j,ii,jj,zx,xc,k,f[2500009],dp[2500009],mod=1000000007LL,xr[2500009],pas,P=23;
int PAS;
int solve(int nn, int kk, int* vv){
	a=nn;k=kk;
	for(i=1; i<=a; i++){
		f[i]=(*vv);if(i!=a) vv++;
	}
	xr[0]=1;
	for(i=1; i<=a+1; i++){
		xr[i]=xr[i-1]*P;xr[i]%=mod;
	}
    PAS=pas;return PAS;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...