Pagini recente » Borderou de evaluare (job #2148767) | Borderou de evaluare (job #188569) | Borderou de evaluare (job #541827) | Borderou de evaluare (job #3190625) | Borderou de evaluare (job #2451906)
Borderou de evaluare (job #2451906)
Raport evaluator
Compilare:
main.cpp: In function 'void solve(int, int, int)':
main.cpp:134:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
for (int i=0;i<=k;i++) /// cate noduri a, in subarorele fiului drept
^~~
main.cpp:137:13: note: ...this statement, but the latter is misleadingly indented as if it is guarded by the 'for'
for (int j=0;j<=min(nr1[nod1],nr2[nod2])&&j<=k;j++){
^~~
main.cpp: In function 'int main()':
main.cpp:230:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i=0;i<sol_mch.size();i++)
~^~~~~~~~~~~~~~~
main.cpp:232:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i=0;i<sol_flori.size();i++)
~^~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 3ms | 262kb | Arborii rezultati nu sunt similari | 0 |
2 | 2ms | 131kb | Greseala la afisare | 0 |
3 | 2ms | 131kb | Arborii rezultati nu sunt similari | 0 |
4 | 2ms | 131kb | Rup mai multe flori decat sunt intr-un nod | 0 |
5 | 3ms | 131kb | Arborii rezultati nu sunt similari | 0 |
6 | 3ms | 131kb | Arborii rezultati nu sunt similari | 0 |
7 | 4ms | 262kb | Arborii rezultati nu sunt similari | 0 |
8 | 5ms | 262kb | Arborii rezultati nu sunt similari | 0 |
9 | 4ms | 262kb | Arborii rezultati nu sunt similari | 0 |
10 | 3ms | 262kb | Arborii rezultati nu sunt similari | 0 |
Punctaj total | 0 |