Pagini recente » Borderou de evaluare (job #1132282) | Borderou de evaluare (job #2364466) | Borderou de evaluare (job #100268) | Borderou de evaluare (job #1832332) | Borderou de evaluare (job #2950830)
Borderou de evaluare (job #2950830)
Raport evaluator
Compilare:
main.cpp:1:2: warning: #import is a deprecated GCC extension [-Wdeprecated]
1 | #import<fstream>
| ^~~~~~
main.cpp:2:64: warning: multi-character character constant [-Wmultichar]
2 | std::ifstream f("scmax.in");std::ofstream g("scmax.out");int v['썐'],p['썐'],q['썐'],i,j,Q;int a(int Z){while(p[--Z]!=Q);if(Q>1)Q--,a(Z);g<<v[Z]<<" ";}main(){f>>j;while(f>>v[i]){j=0;while(v[i]>q[j]&&j<=Q)j++;q[j]=v[i],p[i++]=j,Q=Q>j?Q:j;}g<<Q<<"\n";a(i);}
| ^~~~
main.cpp:2:73: warning: multi-character character constant [-Wmultichar]
2 | std::ifstream f("scmax.in");std::ofstream g("scmax.out");int v['썐'],p['썐'],q['썐'],i,j,Q;int a(int Z){while(p[--Z]!=Q);if(Q>1)Q--,a(Z);g<<v[Z]<<" ";}main(){f>>j;while(f>>v[i]){j=0;while(v[i]>q[j]&&j<=Q)j++;q[j]=v[i],p[i++]=j,Q=Q>j?Q:j;}g<<Q<<"\n";a(i);}
| ^~~~
main.cpp:2:82: warning: multi-character character constant [-Wmultichar]
2 | std::ifstream f("scmax.in");std::ofstream g("scmax.out");int v['썐'],p['썐'],q['썐'],i,j,Q;int a(int Z){while(p[--Z]!=Q);if(Q>1)Q--,a(Z);g<<v[Z]<<" ";}main(){f>>j;while(f>>v[i]){j=0;while(v[i]>q[j]&&j<=Q)j++;q[j]=v[i],p[i++]=j,Q=Q>j?Q:j;}g<<Q<<"\n";a(i);}
| ^~~~
main.cpp: In function 'int a(int)':
main.cpp:2:154: warning: no return statement in function returning non-void [-Wreturn-type]
2 | std::ifstream f("scmax.in");std::ofstream g("scmax.out");int v['썐'],p['썐'],q['썐'],i,j,Q;int a(int Z){while(p[--Z]!=Q);if(Q>1)Q--,a(Z);g<<v[Z]<<" ";}main(){f>>j;while(f>>v[i]){j=0;while(v[i]>q[j]&&j<=Q)j++;q[j]=v[i],p[i++]=j,Q=Q>j?Q:j;}g<<Q<<"\n";a(i);}
| ^
main.cpp: At global scope:
main.cpp:2:155: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
2 | std::ifstream f("scmax.in");std::ofstream g("scmax.out");int v['썐'],p['썐'],q['썐'],i,j,Q;int a(int Z){while(p[--Z]!=Q);if(Q>1)Q--,a(Z);g<<v[Z]<<" ";}main(){f>>j;while(f>>v[i]){j=0;while(v[i]>q[j]&&j<=Q)j++;q[j]=v[i],p[i++]=j,Q=Q>j?Q:j;}g<<Q<<"\n";a(i);}
| ^~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 19ms | 397kb | Killed by Signal 11 | 0 | 0 |
2 | 21ms | 401kb | Killed by Signal 11 | 0 | 0 |
3 | 19ms | 389kb | Killed by Signal 11 | 0 | 0 |
4 | 18ms | 385kb | Killed by Signal 11 | 0 | 0 |
5 | 20ms | 315kb | Killed by Signal 11 | 0 | 0 |
6 | 17ms | 344kb | Killed by Signal 11 | 0 | 0 |
7 | 17ms | 364kb | Killed by Signal 11 | 0 | 0 |
8 | 64ms | 1122kb | Killed by Signal 11 | 0 | 0 |
9 | 33ms | 1187kb | Killed by Signal 11 | 0 |
10 | 65ms | 1138kb | Killed by Signal 11 | 0 |
Punctaj total | 0 |