Borderou de evaluare (job #810883)

Utilizator avatar www_www Veveriță Tudor www_www IP ascuns
Problemă Divizori Primi (clasa a 9-a) Compilator c-32
Rundă lasm_22_02_2025_clasa10_11 Status evaluat
Dată 22 feb. 2025 15:41:42 Scor 0

Raport evaluator

Compilare: main.c: In function 'main': main.c:28:5: warning: ignoring return value of 'fscanf' declared with attribute 'warn_unused_result' [-Wunused-result] 28 | fscanf(fin, "%d", &T); | ^~~~~~~~~~~~~~~~~~~~~ main.c:31:9: warning: ignoring return value of 'fscanf' declared with attribute 'warn_unused_result' [-Wunused-result] 31 | fscanf(fin, "%d %d", &N, &K); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.c: In function 'ciur': main.c:8:15: warning: iteration 999999 invokes undefined behavior [-Waggressive-loop-optimizations] 8 | if (pD[i] == 0) | ~~^~~ main.c:7:23: note: within this loop 7 | for (int i = 2; i <= 1000001; i++) { | ~~^~~~~~~~~~ main.c:13:13: warning: iteration 1000000 invokes undefined behavior [-Waggressive-loop-optimizations] 13 | int k = pD[i]; | ^ main.c:12:23: note: within this loop 12 | for (int i = 1; i <= 1000001; i++) { | ~~^~~~~~~~~~ main.c:19:18: warning: iteration 1000000 invokes undefined behavior [-Waggressive-loop-optimizations] 19 | nK[k][i] += nK[k][i - 1]; | ~~~~~^~~ main.c:18:27: note: within this loop 18 | for (int i = 1; i <= 1000001; i++) | ~~^~~~~~~~~~
Test Timp execuție Memorie folosită Mesaj Punctaj/test
1 259 ms 36155 kb Incorect 0
2 259 ms 36159 kb Incorect 0
3 259 ms 36171 kb Incorect 0
4 269 ms 36130 kb Incorect 0
5 259 ms 36155 kb Incorect 0
6 259 ms 36143 kb Incorect 0
7 259 ms 36151 kb Incorect 0
8 259 ms 36171 kb Incorect 0
9 279 ms 36352 kb Incorect 0
10 289 ms 36282 kb Incorect 0
11 309 ms 36208 kb Incorect 0
12 269 ms 36347 kb Incorect 0
13 329 ms 36139 kb Incorect 0
14 318 ms 36380 kb Incorect 0
15 339 ms 36331 kb Incorect 0
16 349 ms 36274 kb Incorect 0
17 359 ms 36241 kb Time limit exceeded 0
18 355 ms 36265 kb Time limit exceeded 0
19 359 ms 36257 kb Time limit exceeded 0
20 359 ms 36245 kb Time limit exceeded 0
Punctaj total 0