Pagini recente » Borderou de evaluare (job #562820) | Borderou de evaluare (job #1692285) | Borderou de evaluare (job #1626698) | Borderou de evaluare (job #1247514) | Borderou de evaluare (job #2365743)
Borderou de evaluare (job #2365743)
Raport evaluator
Compilare:
main.cpp: In function 'int main()':
main.cpp:50:26: warning: spurious trailing '%' in format [-Wformat=]
scanf("%d%d%", &c, &n);
^
main.cpp:48:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen("rover.in", "r", stdin);
^
main.cpp:49:38: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen("rover.out", "w", stdout);
^
main.cpp:50:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%", &c, &n);
^
main.cpp:51:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
if(c == 1) scanf("%d", &g);
^
main.cpp:54:81: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
for(int j = 1; j <= n; ++j) scanf("%d", &a[i][j]), mx = max(mx, a[i][j]);
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 2ms | 131kb | OK | 5 |
| 2 | 4ms | 1179kb | OK | 5 |
| 3 | 2ms | 131kb | OK | 5 |
| 4 | 6ms | 524kb | OK | 5 |
| 5 | 9ms | 655kb | OK | 5 |
| 6 | 19ms | 917kb | OK | 5 |
| 7 | 30ms | 1179kb | OK | 5 |
| 8 | 83ms | 2359kb | OK | 5 |
| 9 | 96ms | 2097kb | OK | 5 |
| 10 | 100ms | 2228kb | OK | 5 |
| 11 | 108ms | 2359kb | OK | 5 |
| 12 | 4ms | 1179kb | OK | 5 |
| 13 | 8ms | 1310kb | OK | 5 |
| 14 | 20ms | 1835kb | OK | 5 |
| 15 | 30ms | 1835kb | OK | 5 |
| 16 | 72ms | 3407kb | OK | 5 |
| 17 | 100ms | 4325kb | OK | 5 |
| 18 | 95ms | 4325kb | OK | 5 |
| 19 | 86ms | 5505kb | OK | 5 |
| 20 | 74ms | 2883kb | OK | 5 |
| Punctaj total | 100 |