Pagini recente » Borderou de evaluare (job #1356661) | Borderou de evaluare (job #1938827) | Borderou de evaluare (job #1809101) | Borderou de evaluare (job #2242248) | Borderou de evaluare (job #3191462)
Borderou de evaluare (job #3191462)
Raport evaluator
Compilare:
main.cpp: In function 'void nextLine(int, int)':
main.cpp:27:25: warning: iteration 25 invokes undefined behavior [-Waggressive-loop-optimizations]
27 | nr[1][i]=nr[2][i];
| ~~~~~~~^
main.cpp:25:19: note: within this loop
25 | for(int i=1; i<=26; i++)
| ~^~~~
main.cpp:20:25: warning: iteration 25 invokes undefined behavior [-Waggressive-loop-optimizations]
20 | if(comb[i][j]==false) nr[2][i]= (nr[2][i] + nr[1][j]) %MOD;
| ~~~~~~~~~^
main.cpp:18:23: note: within this loop
18 | for(int j=1; j<=26; j++)
| ~^~~~
main.cpp: In function 'int main()':
main.cpp:48:38: warning: iteration 25 invokes undefined behavior [-Waggressive-loop-optimizations]
48 | for(int i=1; i<=26; i++) nr[1][i]=1;
| ~~~~~~~~^~
main.cpp:48:19: note: within this loop
48 | for(int i=1; i<=26; i++) nr[1][i]=1;
| ~^~~~
main.cpp:53:45: warning: iteration 25 invokes undefined behavior [-Waggressive-loop-optimizations]
53 | for(int i=1; i<=26; i++) s= (s + nr[1][i]) %MOD;
| ~~~~~~~^
main.cpp:53:19: note: within this loop
53 | for(int i=1; i<=26; i++) s= (s + nr[1][i]) %MOD;
| ~^~~~
main.cpp: In function 'void nextLine(int, int)':
main.cpp:27:17: warning: 'void* __builtin_memcpy(void*, const void*, long unsigned int)' forming offset [312, 315] is out of the bounds [0, 312] of object 'nr' with type 'int [3][26]' [-Warray-bounds]
27 | nr[1][i]=nr[2][i];
| ~~~~~~~~^~~~~~~~~
main.cpp:10:5: note: 'nr' declared here
10 | int nr[3][26];
| ^~
main.cpp:28:17: warning: 'void* __builtin_memset(void*, int, long unsigned int)' forming offset [312, 315] is out of the bounds [0, 312] of object 'nr' with type 'int [3][26]' [-Warray-bounds]
28 | nr[2][i]=0;
| ~~~~~~~~^~
main.cpp:10:5: note: 'nr' declared here
10 | int nr[3][26];
| ^~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 303kb | Fisier de iesire lipsa | 0 |
2 | 0ms | 303kb | Fisier de iesire lipsa | 0 |
3 | 0ms | 303kb | Fisier de iesire lipsa | 0 |
4 | 0ms | 303kb | Fisier de iesire lipsa | 0 |
5 | 0ms | 303kb | Fisier de iesire lipsa | 0 |
6 | 0ms | 303kb | Fisier de iesire lipsa | 0 |
7 | 0ms | 303kb | Fisier de iesire lipsa | 0 |
8 | 0ms | 303kb | Fisier de iesire lipsa | 0 |
9 | 0ms | 303kb | Fisier de iesire lipsa | 0 |
10 | 0ms | 303kb | Fisier de iesire lipsa | 0 |
11 | 0ms | 303kb | Fisier de iesire lipsa | 0 |
12 | 0ms | 303kb | Fisier de iesire lipsa | 0 |
13 | 0ms | 303kb | Fisier de iesire lipsa | 0 |
14 | 0ms | 303kb | Fisier de iesire lipsa | 0 |
15 | 0ms | 303kb | Fisier de iesire lipsa | 0 |
16 | 0ms | 303kb | Fisier de iesire lipsa | 0 |
17 | 0ms | 303kb | Fisier de iesire lipsa | 0 |
18 | 1ms | 303kb | Fisier de iesire lipsa | 0 |
19 | 1ms | 303kb | Fisier de iesire lipsa | 0 |
20 | 0ms | 303kb | Fisier de iesire lipsa | 0 |
Punctaj total | 0 |