Pagini recente »
Borderou de evaluare (job #89570)
|
Borderou de evaluare (job #185886)
|
Borderou de evaluare (job #778743)
|
Borderou de evaluare (job #335981)
|
Borderou de evaluare (job #703048)
Borderou de evaluare (job #703048)
Raport evaluator
Compilare:
main.cpp: In function 'void drop_ball(int, int, int (*)[510], int (*)[510], int, int, int)':
main.cpp:33:9: warning: variable 'prev_i' set but not used [-Wunused-but-set-variable]
33 | int prev_i = -1,prev_j = -1;
| ^~~~~~
main.cpp: In function 'void read_matrix(int, int, int (*)[510])':
main.cpp:9:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
9 | scanf("%d", &a[i][j]);
| ~~~~~^~~~~~~~~~~~~~~~
main.cpp: In function 'int main()':
main.cpp:112:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
112 | freopen("tuburi.in", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:113:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
113 | freopen("tuburi.out", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:116:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
116 | scanf("%d", &c);
| ~~~~~^~~~~~~~~~
main.cpp:119:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
119 | scanf("%d%d", &n,&m);
| ~~~~~^~~~~~~~~~~~~~~
main.cpp: In function 'void drop_ball(int, int, int (*)[510], int (*)[510], int, int, int)':
main.cpp:34:43: warning: 'next_col' may be used uninitialized in this function [-Wmaybe-uninitialized]
34 | while (i <= n + 1 && j <= m && i >= 1 && j >= 1) {
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
main.cpp:34:38: warning: 'next_lin' may be used uninitialized in this function [-Wmaybe-uninitialized]
34 | while (i <= n + 1 && j <= m && i >= 1 && j >= 1) {
| ~~^~~~
Test |
Timp execuție |
Memorie folosită |
Mesaj |
Punctaj/test |
1
|
1 ms
|
245 kb
|
Incorect
|
0
|
2
|
1 ms
|
249 kb
|
Incorect
|
0
|
3
|
1 ms
|
245 kb
|
Incorect
|
0
|
4
|
1 ms
|
249 kb
|
Incorect
|
0
|
5
|
1 ms
|
245 kb
|
Incorect
|
0
|
6
|
1 ms
|
249 kb
|
Incorect
|
0
|
7
|
9 ms
|
507 kb
|
OK
|
4
|
8
|
1 ms
|
249 kb
|
Incorect
|
0
|
9
|
9 ms
|
512 kb
|
Incorect
|
0
|
10
|
9 ms
|
503 kb
|
Incorect
|
0
|
11
|
69 ms
|
1552 kb
|
OK
|
4
|
12
|
66 ms
|
765 kb
|
Incorect
|
0
|
13
|
29 ms
|
1814 kb
|
OK
|
4
|
14
|
19 ms
|
1032 kb
|
Incorect
|
0
|
15
|
39 ms
|
1552 kb
|
Incorect
|
0
|
16
|
38 ms
|
1036 kb
|
Incorect
|
0
|
17
|
9 ms
|
249 kb
|
Incorect
|
0
|
18
|
9 ms
|
249 kb
|
Incorect
|
0
|
19
|
140 ms
|
2342 kb
|
Incorect
|
0
|
20
|
119 ms
|
1298 kb
|
Incorect
|
0
|
Punctaj total
|
12
|