Pagini recente » Borderou de evaluare (job #2813689) | Borderou de evaluare (job #3124319) | Borderou de evaluare (job #1719892) | Borderou de evaluare (job #397838) | Borderou de evaluare (job #1097688)
Borderou de evaluare (job #1097688)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:12:17: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
if(li==2&&ci%2==1 or ci==2&&li%2==1 or li==ci&&li!=2 or li%2!=ci%2)
^
user.cpp:12:54: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
if(li==2&&ci%2==1 or ci==2&&li%2==1 or li==ci&&li!=2 or li%2!=ci%2)
^
user.cpp:33:17: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
if(li==2&&(m-ci+1)%2==1 or m-ci+1==2&&li%2==1 or li==(m-ci+1)&&li!=2 or li%2!=(m-ci+1)%2)
^
user.cpp:33:70: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
if(li==2&&(m-ci+1)%2==1 or m-ci+1==2&&li%2==1 or li==(m-ci+1)&&li!=2 or li%2!=(m-ci+1)%2)
^
user.cpp:70:17: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
if(n-li+1==2&&ci%2==1 or ci==2&&(n-li+1)%2==1 or n-li+1==ci&&(n-li+1)!=2 or (n-li+1)%2!=ci%2 or ci%2==(n-li+1)%2)
^
user.cpp:70:64: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
if(n-li+1==2&&ci%2==1 or ci==2&&(n-li+1)%2==1 or n-li+1==ci&&(n-li+1)!=2 or (n-li+1)%2!=ci%2 or ci%2==(n-li+1)%2)
^
user.cpp:107:17: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
if(n-li+1==2&&(m-ci+1)%2==1 or (m-ci+1)==2&&(n-li+1)%2==1 or n-li+1==m-ci+1&&(n-li+1)!=2 or (n-li+1)%2!=(m-ci+1)%2 or (m-ci+1)%2==(n-li+1)%2&&m-ci+1!=2&&n-li+1!=2)
^
user.cpp:107:80: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
if(n-li+1==2&&(m-ci+1)%2==1 or (m-ci+1)==2&&(n-li+1)%2==1 or n-li+1==m-ci+1&&(n-li+1)!=2 or (n-li+1)%2!=(m-ci+1)%2 or (m-ci+1)%2==(n-li+1)%2&&m-ci+1!=2&&n-li+1!=2)
^
user.cpp:107:156: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
if(n-li+1==2&&(m-ci+1)%2==1 or (m-ci+1)==2&&(n-li+1)%2==1 or n-li+1==m-ci+1&&(n-li+1)!=2 or (n-li+1)%2!=(m-ci+1)%2 or (m-ci+1)%2==(n-li+1)%2&&m-ci+1!=2&&n-li+1!=2)
^
user.cpp:18:30: warning: array subscript is above array bounds [-Warray-bounds]
zone[1][2]++;
^
user.cpp:18:30: warning: array subscript is above array bounds [-Warray-bounds]
user.cpp:25:22: warning: array subscript is above array bounds [-Warray-bounds]
zone[1][2]=3;
^
user.cpp:39:30: warning: array subscript is above array bounds [-Warray-bounds]
zone[2][2]++;
^
user.cpp:39:30: warning: array subscript is above array bounds [-Warray-bounds]
user.cpp:46:22: warning: array subscript is above array bounds [-Warray-bounds]
zone[2][2]=3;
^
user.cpp:66:22: warning: array subscript is above array bounds [-Warray-bounds]
zone[2][2]=(n-li+1)*(m-ci+1)-1;
^
user.cpp:76:30: warning: array subscript is above array bounds [-Warray-bounds]
zone[3][2]++;
^
user.cpp:76:30: warning: array subscript is above array bounds [-Warray-bounds]
user.cpp:83:22: warning: array subscript is above array bounds [-Warray-bounds]
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 436kb | Ultimele doua numere gresite | 1 |
2 | 4ms | 576kb | Ultimele doua numere gresite | 1 |
3 | 16ms | 832kb | OK | 5 |
4 | 20ms | 964kb | OK | 5 |
5 | 56ms | 1356kb | Ultimele doua numere gresite | 1 |
6 | 0ms | 392kb | Ultimele doua numere gresite | 1 |
7 | 0ms | 396kb | Ultimele doua numere gresite | 1 |
8 | 60ms | 1356kb | OK | 5 |
9 | 0ms | 416kb | Ultimele doua numere gresite | 1 |
10 | 56ms | 1352kb | Ultimele doua numere gresite | 1 |
11 | 0ms | 416kb | Raspuns gresit | 0 |
12 | 0ms | 436kb | Raspuns gresit | 0 |
13 | 0ms | 420kb | OK | 5 |
14 | 4ms | 572kb | Ultimele doua numere gresite | 1 |
15 | 20ms | 968kb | OK | 5 |
16 | 0ms | 436kb | Raspuns gresit | 0 |
17 | 16ms | 832kb | Ultimele doua numere gresite | 1 |
18 | 0ms | 388kb | Raspuns gresit | 0 |
19 | 56ms | 1356kb | Ultimele doua numere gresite | 1 |
20 | 0ms | 384kb | Ultimele doua numere gresite | 1 |
Punctaj total | 36 |