Pagini recente » Borderou de evaluare (job #2388612) | Cod sursa (job #1756635) | Borderou de evaluare (job #2314051) | Borderou de evaluare (job #1543403) | Borderou de evaluare (job #1713270)
Borderou de evaluare (job #1713270)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:35:14: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
if(v[j]<M&&size[i]>size[j]+1||(size[i]==size[j]+1&&v[P]<v[bef[i]]))size[i]=size[j]+1,bef[i]=j;
^
user.cpp:20:36: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("subsir2.in","r",stdin);
^
user.cpp:21:38: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("subsir2.out","w",stdout);
^
user.cpp:24:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&N);
^
user.cpp:26:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&v[i]);
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 0ms | 288kb | Solutia nu este minim lexicografic! | 4 |
| 2 | 0ms | 292kb | Nu e bine! | 0 |
| 3 | 0ms | 292kb | Nu e bine! | 0 |
| 4 | 0ms | 292kb | Solutia nu este minim lexicografic! | 4 |
| 5 | 0ms | 288kb | Nu e bine! | 0 |
| 6 | 0ms | 296kb | Solutia nu este minim lexicografic! | 4 |
| 7 | 0ms | 292kb | Nu e bine! | 0 |
| 8 | 0ms | 300kb | Nu e bine! | 0 |
| 9 | 0ms | 296kb | Nu e bine! | 0 |
| 10 | 0ms | 296kb | Nu e bine! | 0 |
| 11 | 0ms | 304kb | Nu e bine! | 0 |
| 12 | 0ms | 304kb | Solutia nu este minim lexicografic! | 4 |
| 13 | 8ms | 316kb | Solutia nu este minim lexicografic! | 4 |
| 14 | 16ms | 316kb | Solutia nu este minim lexicografic! | 4 |
| 15 | 20ms | 328kb | Solutia nu este minim lexicografic! | 4 |
| 16 | 28ms | 336kb | Solutia nu este minim lexicografic! | 4 |
| 17 | 40ms | 336kb | Solutia nu este minim lexicografic! | 4 |
| 18 | 60ms | 352kb | Solutia nu este minim lexicografic! | 4 |
| 19 | 64ms | 352kb | Solutia nu este minim lexicografic! | 4 |
| 20 | 64ms | 352kb | Solutia nu este minim lexicografic! | 4 |
| Punctaj total | 48 |