Pagini recente » Borderou de evaluare (job #3311574) | Borderou de evaluare (job #3307067) | Borderou de evaluare (job #2705896) | Borderou de evaluare (job #2069273) | Borderou de evaluare (job #3303308)
Borderou de evaluare (job #3303308)
Raport evaluator
Compilare:
main.cpp: In function 'bool check(int)':
main.cpp:25:13: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
25 | for(int i = 1; i <= N; i++) final[i] = tobuild[i]; return true;
| ^~~
main.cpp:25:64: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
25 | for(int i = 1; i <= N; i++) final[i] = tobuild[i]; return true;
| ^~~~~~
main.cpp:38:13: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
38 | for(int i = 1; i <= N; i++) final[i] = tobuild[i]; return true;
| ^~~
main.cpp:38:64: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
38 | for(int i = 1; i <= N; i++) final[i] = tobuild[i]; return true;
| ^~~~~~
main.cpp: In function 'int main()':
main.cpp:61:29: warning: variable 'best' set but not used [-Wunused-but-set-variable]
61 | int st = 0, dr = 65535, best = 0;
| ^~~~
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 0ms | 303kb | Esti bazat! | 5 |
| 2 | 0ms | 303kb | Esti bazat! | 5 |
| 3 | 0ms | 303kb | Esti bazat! | 5 |
| 4 | 0ms | 303kb | Esti bazat! | 5 |
| 5 | 0ms | 303kb | Esti bazat! | 5 |
| 6 | 0ms | 303kb | Esti bazat! | 5 |
| 7 | 2ms | 557kb | Esti bazat! | 5 |
| 8 | 2ms | 512kb | Esti bazat! | 5 |
| 9 | 2ms | 557kb | Esti bazat! | 5 |
| 10 | 2ms | 557kb | Esti bazat! | 5 |
| 11 | 3ms | 819kb | Esti bazat! | 5 |
| 12 | 4ms | 819kb | Esti bazat! | 5 |
| 13 | 4ms | 819kb | Esti bazat! | 5 |
| 14 | 6ms | 1081kb | Esti bazat! | 5 |
| 15 | 4ms | 819kb | Esti bazat! | 5 |
| 16 | 5ms | 1081kb | Esti bazat! | 5 |
| 17 | 5ms | 1081kb | Esti bazat! | 5 |
| 18 | 5ms | 1081kb | Esti bazat! | 5 |
| 19 | 1ms | 557kb | Esti bazat! | 5 |
| 20 | 1ms | 557kb | Esti bazat! | 5 |
| Punctaj total | 100 |