Pagini recente »
Borderou de evaluare (job #351894)
|
Borderou de evaluare (job #447555)
|
Borderou de evaluare (job #690952)
|
Borderou de evaluare (job #196427)
|
Borderou de evaluare (job #631735)
Borderou de evaluare (job #631735)
Raport evaluator
Compilare:
main.c: In function 'main':
main.c:51:41: warning: statement with no effect [-Wunused-value]
51 | a[i][j] == 0;
| ~~~~~~~~^~~~
main.c:87:41: warning: statement with no effect [-Wunused-value]
87 | a[i][j] == 0;
| ~~~~~~~~^~~~
main.c:14:5: warning: ignoring return value of 'fscanf' declared with attribute 'warn_unused_result' [-Wunused-result]
14 | fscanf( fin, "%d%d%d%d", &ceri,&n,&m,&k);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.c:28:13: warning: ignoring return value of 'fscanf' declared with attribute 'warn_unused_result' [-Wunused-result]
28 | fscanf( fin, "%ld", &a[i][j]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.c:20:17: warning: iteration 3162 invokes undefined behavior [-Waggressive-loop-optimizations]
20 | patr[i] = i*i;
| ~~~~~~~~^~~~~
main.c:18:19: note: within this loop
18 | for( i = 1; i <= 3163; i++)
| ~~^~~~~~~
main.c:85:52: warning: iteration 3162 invokes undefined behavior [-Waggressive-loop-optimizations]
85 | if( a[i][j]-cnt == patr[p] )
| ~~~~^~~
main.c:83:39: note: within this loop
83 | for( p = 1; p <= 3163; p++)
| ~~^~~~~~~
main.c:49:52: warning: iteration 3162 invokes undefined behavior [-Waggressive-loop-optimizations]
49 | if( a[i][j]-cnt == patr[p] )
| ~~~~^~~
main.c:47:39: note: within this loop
47 | for( p = 1; p <= 3163; p++)
| ~~^~~~~~~
Test |
Timp execuție |
Memorie folosită |
Mesaj |
Punctaj/test |
1
|
609 ms
|
245 kb
|
Time limit exceeded
|
0
|
2
|
604 ms
|
118 kb
|
Time limit exceeded
|
0
|
3
|
607 ms
|
118 kb
|
Time limit exceeded
|
0
|
4
|
607 ms
|
249 kb
|
Time limit exceeded
|
0
|
5
|
609 ms
|
245 kb
|
Time limit exceeded
|
0
|
6
|
605 ms
|
249 kb
|
Time limit exceeded
|
0
|
7
|
608 ms
|
118 kb
|
Time limit exceeded
|
0
|
8
|
608 ms
|
118 kb
|
Time limit exceeded
|
0
|
9
|
609 ms
|
118 kb
|
Time limit exceeded
|
0
|
10
|
609 ms
|
118 kb
|
Time limit exceeded
|
0
|
11
|
608 ms
|
118 kb
|
Time limit exceeded
|
0
|
12
|
608 ms
|
249 kb
|
Time limit exceeded
|
0
|
13
|
609 ms
|
118 kb
|
Time limit exceeded
|
0
|
14
|
608 ms
|
118 kb
|
Time limit exceeded
|
0
|
15
|
604 ms
|
118 kb
|
Time limit exceeded
|
0
|
16
|
1 ms
|
114 kb
|
a) linie incorecta; b) linie incorecta
|
0
|
17
|
605 ms
|
249 kb
|
Time limit exceeded
|
0
|
18
|
605 ms
|
118 kb
|
Time limit exceeded
|
0
|
19
|
608 ms
|
249 kb
|
Time limit exceeded
|
0
|
20
|
600 ms
|
245 kb
|
Time limit exceeded
|
0
|
21
|
601 ms
|
118 kb
|
Time limit exceeded
|
0
|
22
|
609 ms
|
118 kb
|
Time limit exceeded
|
0
|
23
|
609 ms
|
114 kb
|
Time limit exceeded
|
0
|
24
|
602 ms
|
118 kb
|
Time limit exceeded
|
0
|
25
|
607 ms
|
118 kb
|
Time limit exceeded
|
0
|
26
|
607 ms
|
118 kb
|
Time limit exceeded
|
0
|
27
|
609 ms
|
118 kb
|
Time limit exceeded
|
0
|
28
|
607 ms
|
249 kb
|
Time limit exceeded
|
0
|
29
|
604 ms
|
376 kb
|
Time limit exceeded
|
0
|
30
|
603 ms
|
245 kb
|
Time limit exceeded
|
0
|
Punctaj total
|
0
|