Pagini recente » Borderou de evaluare (job #651235) | Borderou de evaluare (job #2334975) | Borderou de evaluare (job #2109114) | Borderou de evaluare (job #1605510) | Borderou de evaluare (job #2410997)
Borderou de evaluare (job #2410997)
Raport evaluator
Compilare:
main.cpp: In function 'int main()':
main.cpp:16:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
for(i = 1; i <= n; i ++)
^~~
main.cpp:32:6: note: ...this statement, but the latter is misleadingly indented as if it is guarded by the 'for'
for(i = minn; i <= maxx; i ++)
^~~
main.cpp:40:49: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
if((v[i].ok == true && v[j].ok == true) && (v[i].imin == v[j].imin && v[i].jmin == v[j].jmin) || (v[i].imax == v[j].imax && v[i].jmax == v[j].jmax))
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 2ms | 131kb | OK | 1 | 1 |
2 | 2ms | 131kb | Programul nu a gasit nicio solutie desi exista cel putin una! | 0 | 0 |
3 | 3ms | 131kb | Programul nu a gasit nicio solutie desi exista cel putin una! | 0 | 0 |
4 | 2ms | 131kb | Programul nu a gasit nicio solutie desi exista cel putin una! | 0 | 0 |
5 | 2ms | 131kb | Programul nu a gasit nicio solutie desi exista cel putin una! | 0 | 0 |
6 | 2ms | 131kb | Programul nu a gasit nicio solutie desi exista cel putin una! | 0 | 0 |
7 | 2ms | 131kb | Exista o pereche de culori din cele afisate care sunt in conflict! | 0 | 0 |
8 | 2ms | 131kb | Programul nu a gasit nicio solutie desi exista cel putin una! | 0 | 0 |
9 | 2ms | 131kb | Programul nu a gasit nicio solutie desi exista cel putin una! | 0 | 0 |
10 | 3ms | 131kb | Programul nu a gasit nicio solutie desi exista cel putin una! | 0 | 0 |
11 | 3ms | 131kb | Programul nu a gasit nicio solutie desi exista cel putin una! | 0 | 0 |
12 | 10ms | 131kb | Exista o pereche de culori din cele afisate care sunt in conflict! | 0 | 0 |
13 | 10ms | 131kb | Programul nu a gasit nicio solutie desi exista cel putin una! | 0 | 0 |
14 | 2ms | 131kb | Killed by Signal 11 | 0 | 0 |
15 | 2ms | 131kb | Killed by Signal 11 | 0 | 0 |
16 | 2ms | 131kb | Killed by Signal 11 | 0 | 0 |
17 | 2ms | 131kb | Killed by Signal 11 | 0 | 0 |
18 | 3ms | 131kb | Killed by Signal 11 | 0 | 0 |
19 | 2ms | 131kb | Killed by Signal 11 | 0 | 0 |
20 | 2ms | 131kb | Killed by Signal 11 | 0 | 0 |
21 | 2ms | 131kb | Killed by Signal 11 | 0 |
22 | 2ms | 131kb | Killed by Signal 11 | 0 |
23 | 2ms | 131kb | Killed by Signal 11 | 0 |
24 | 2ms | 131kb | Killed by Signal 11 | 0 |
25 | 2ms | 131kb | Killed by Signal 11 | 0 |
26 | 2ms | 131kb | Killed by Signal 11 | 0 |
Punctaj total | 1 |