# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
15235 | tonyjjw | 로봇 심판의 님 게임 (kriii3_F) | C++98 | 622 ms | 2644 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<stdio.h>
int n,m,k;
int p[20];
long long int nim[25];
long long int ns[25];
long long int pp[100000];
long long int qq[100000];
long long int gcd(long long int x,long long int y){
if(x==0)return y;
return gcd(y%x,x);
}
long long int f(long long int x){
long long int i,res=0;
for(i=0;i<(1<<(n+m));i++){
res+=(x/pp[i])*qq[i];
}
return res;
}
int main(){
int i,j;
long long int ii,jj,kk;
scanf("%d%d%d",&n,&m,&k);
for(i=0;i<n;i++){
scanf("%d",&p[i]);
}
for(i=0;i<m;i++){
scanf("%d",&p[i+n]);
}
for(i=0;i<k;i++){
scanf("%lld",&nim[i]);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |