Pagini recente » Borderou de evaluare (job #2576173) | Borderou de evaluare (job #3151184) | Borderou de evaluare (job #1395432) | Borderou de evaluare (job #140058) | Borderou de evaluare (job #1876938)
Borderou de evaluare (job #1876938)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:3:297: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int v1[350],v2[350];void fold(int x, int* v, int& D){if(D>x*2){D=D-x;for(int i=1;i<=x;++i)v[2*x+1-i]+=v[i];}else{D=x;for(int i=x+1;i<=2*x+1;++i)v[i]+=v[2*x+1-i];}for(int i=x+1;i<=x+D;++i)v[i-x]=v[i];for(int i=D+1;i<=345;++i)v[i]=0;}int main(){freopen("origami.in", "r", stdin);freopen("origami.out", "w", stdout);int n,k,tip,x,max1=0,max2=0,L,H;scanf("%d%d",&n,&k);H=L=n;for(int i=1;i<=n;++i)v1[i]=v2[i]=1;for(int i=1;i<=k;++i){scanf("%d%d",&tip,&x);if(tip==1)fold(x,v1,L);else fold(x,v2,H);}for(int i=1;i<=L;++i)max1=max(max1,v1[i]);for(int i=1;i<=H;++i)max2=max(max2,v2[i]);printf("%d %d %d\n",H,L,max1*max2);return 0;}
^
user.cpp:3:333: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int v1[350],v2[350];void fold(int x, int* v, int& D){if(D>x*2){D=D-x;for(int i=1;i<=x;++i)v[2*x+1-i]+=v[i];}else{D=x;for(int i=x+1;i<=2*x+1;++i)v[i]+=v[2*x+1-i];}for(int i=x+1;i<=x+D;++i)v[i-x]=v[i];for(int i=D+1;i<=345;++i)v[i]=0;}int main(){freopen("origami.in", "r", stdin);freopen("origami.out", "w", stdout);int n,k,tip,x,max1=0,max2=0,L,H;scanf("%d%d",&n,&k);H=L=n;for(int i=1;i<=n;++i)v1[i]=v2[i]=1;for(int i=1;i<=k;++i){scanf("%d%d",&tip,&x);if(tip==1)fold(x,v1,L);else fold(x,v2,H);}for(int i=1;i<=L;++i)max1=max(max1,v1[i]);for(int i=1;i<=H;++i)max2=max(max2,v2[i]);printf("%d %d %d\n",H,L,max1*max2);return 0;}
^
user.cpp:3:385: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int v1[350],v2[350];void fold(int x, int* v, int& D){if(D>x*2){D=D-x;for(int i=1;i<=x;++i)v[2*x+1-i]+=v[i];}else{D=x;for(int i=x+1;i<=2*x+1;++i)v[i]+=v[2*x+1-i];}for(int i=x+1;i<=x+D;++i)v[i-x]=v[i];for(int i=D+1;i<=345;++i)v[i]=0;}int main(){freopen("origami.in", "r", stdin);freopen("origami.out", "w", stdout);int n,k,tip,x,max1=0,max2=0,L,H;scanf("%d%d",&n,&k);H=L=n;for(int i=1;i<=n;++i)v1[i]=v2[i]=1;for(int i=1;i<=k;++i){scanf("%d%d",&tip,&x);if(tip==1)fold(x,v1,L);else fold(x,v2,H);}for(int i=1;i<=L;++i)max1=max(max1,v1[i]);for(int i=1;i<=H;++i)max2=max(max2,v2[i]);printf("%d %d %d\n",H,L,max1*max2);return 0;}
^
user.cpp:3:470: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
using namespace std;int v1[350],v2[350];void fold(int x, int* v, int& D){if(D>x*2){D=D-x;for(int i=1;i<=x;++i)v[2*x+1-i]+=v[i];}else{D=x;for(int i=x+1;i<=2*x+1;++i)v[i]+=v[2*x+1-i];}for(int i=x+1;i<=x+D;++i)v[i-x]=v[i];for(int i=D+1;i<=345;++i)v[i]=0;}int main(){freopen("origami.in", "r", stdin);freopen("origami.out", "w", stdout);int n,k,tip,x,max1=0,max2=0,L,H;scanf("%d%d",&n,&k);H=L=n;for(int i=1;i<=n;++i)v1[i]=v2[i]=1;for(int i=1;i<=k;++i){scanf("%d%d",&tip,&x);if(tip==1)fold(x,v1,L);else fold(x,v2,H);}for(int i=1;i<=L;++i)max1=max(max1,v1[i]);for(int i=1;i<=H;++i)max2=max(max2,v2[i]);printf("%d %d %d\n",H,L,max1*max2);return 0;}
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 260kb | OK | 10 |
2 | 0ms | 260kb | OK | 10 |
3 | 0ms | 256kb | OK | 10 |
4 | 0ms | 264kb | OK | 10 |
5 | 0ms | 264kb | OK | 10 |
6 | 0ms | 260kb | OK | 10 |
7 | 0ms | 256kb | OK | 10 |
8 | 0ms | 256kb | OK | 10 |
9 | 0ms | 260kb | OK | 10 |
10 | 0ms | 260kb | OK | 10 |
Punctaj total | 100 |