Pagini recente » Borderou de evaluare (job #2103354) | Borderou de evaluare (job #2762812) | Borderou de evaluare (job #2338066) | Borderou de evaluare (job #1187000) | Borderou de evaluare (job #2554291)
Borderou de evaluare (job #2554291)
Raport evaluator
Compilare:
main.cpp: In function 'bool canAvoidCellForStSuDrJo(int, int, int, int, int, int)':
main.cpp:17:23: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
return !(i == iSt && j == jSt || i == iSf && j == jSf || i == iSf - 1 && j == jSt || i == iSf && j == jSt + 1 || i == iSt && j == jSf - 1 || i == iSt + 1 && j == jSf);
~~~~~~~~~^~~~~~~~~~~
main.cpp:17:75: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
return !(i == iSt && j == jSt || i == iSf && j == jSf || i == iSf - 1 && j == jSt || i == iSf && j == jSt + 1 || i == iSt && j == jSf - 1 || i == iSt + 1 && j == jSf);
~~~~~~~~~~~~~^~~~~~~~~~~
main.cpp:17:99: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
return !(i == iSt && j == jSt || i == iSf && j == jSf || i == iSf - 1 && j == jSt || i == iSf && j == jSt + 1 || i == iSt && j == jSf - 1 || i == iSt + 1 && j == jSf);
~~~~~~~~~^~~~~~~~~~~~~~~
main.cpp:17:127: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
return !(i == iSt && j == jSt || i == iSf && j == jSf || i == iSf - 1 && j == jSt || i == iSf && j == jSt + 1 || i == iSt && j == jSf - 1 || i == iSt + 1 && j == jSf);
~~~~~~~~~^~~~~~~~~~~~~~~
main.cpp:17:159: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
return !(i == iSt && j == jSt || i == iSf && j == jSf || i == iSf - 1 && j == jSt || i == iSf && j == jSt + 1 || i == iSt && j == jSf - 1 || i == iSt + 1 && j == jSf);
~~~~~~~~~~~~~^~~~~~~~~~~
main.cpp: In function 'bool canAvoidCellForStJoDrSu(int, int, int, int, int, int)':
main.cpp:42:23: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
return !(i == iSf && j == jSt || i == iSt && j == jSf || i == iSt && j == jSt + 1 || i == iSt + 1 && j == jSt || i == iSf && j == jSf - 1 || i == iSf - 1 && j == jSf);
~~~~~~~~~^~~~~~~~~~~
main.cpp:42:71: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
return !(i == iSf && j == jSt || i == iSt && j == jSf || i == iSt && j == jSt + 1 || i == iSt + 1 && j == jSt || i == iSf && j == jSf - 1 || i == iSf - 1 && j == jSf);
~~~~~~~~~^~~~~~~~~~~~~~~
main.cpp:42:103: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
return !(i == iSf && j == jSt || i == iSt && j == jSf || i == iSt && j == jSt + 1 || i == iSt + 1 && j == jSt || i == iSf && j == jSf - 1 || i == iSf - 1 && j == jSf);
~~~~~~~~~~~~~^~~~~~~~~~~
main.cpp:42:127: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
return !(i == iSf && j == jSt || i == iSt && j == jSf || i == iSt && j == jSt + 1 || i == iSt + 1 && j == jSt || i == iSf && j == jSf - 1 || i == iSf - 1 && j == jSf);
~~~~~~~~~^~~~~~~~~~~~~~~
main.cpp:42:159: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
return !(i == iSf && j == jSt || i == iSt && j == jSf || i == iSt && j == jSt + 1 || i == iSt + 1 && j == jSt || i == iSf && j == jSf - 1 || i == iSf - 1 && j == jSf);
~~~~~~~~~~~~~^~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 2ms | 262kb | OK | 5 |
2 | 4ms | 393kb | OK | 5 |
3 | 16ms | 655kb | OK | 5 |
4 | 21ms | 786kb | OK | 5 |
5 | 58ms | 1179kb | OK | 5 |
6 | 2ms | 131kb | OK | 5 |
7 | 2ms | 131kb | Ultimele doua numere gresite | 1 |
8 | 57ms | 1179kb | OK | 5 |
9 | 2ms | 131kb | OK | 5 |
10 | 58ms | 1179kb | OK | 5 |
11 | 2ms | 131kb | OK | 5 |
12 | 3ms | 262kb | Raspuns gresit | 0 |
13 | 2ms | 131kb | OK | 5 |
14 | 4ms | 393kb | OK | 5 |
15 | 21ms | 786kb | OK | 5 |
16 | 3ms | 262kb | Raspuns gresit | 0 |
17 | 16ms | 655kb | OK | 5 |
18 | 2ms | 131kb | OK | 5 |
19 | 59ms | 1179kb | OK | 5 |
20 | 2ms | 131kb | OK | 5 |
Punctaj total | 86 |