Pentru această operație este nevoie să te autentifici.
Borderou de evaluare (job #762014)
| Utilizator |
Leuciuc Ioana
leuciuc.ioana
|
IP | ascuns |
|---|---|---|---|
| Problemă | Divizori Primi (clasa a 9-a) | Compilator | cpp-32 |
| Rundă | Arhiva de probleme | Status | evaluat |
| Dată | 12 feb. 2024 20:24:04 | Scor | 0 |
Raport evaluator
Compilare:
main.cpp: In function 'void f()':
main.cpp:63:26: warning: iteration 7 invokes undefined behavior [-Waggressive-loop-optimizations]
63 | a[ciur[i]][++v[i]] = i;
| ~~~^
main.cpp:62:22: note: within this loop
62 | for (int i = 2; i <= 1000000; i++) // luam fiecare numar intre 2 si 1 milion si vedem pe ce linie trebuie pus in matricea a, varianta 1
| ~~^~~~~~~~~~
| Test | Timp execuție | Memorie folosită | Mesaj | Punctaj/test |
|---|---|---|---|---|
| 1 | 159 ms | 7057 kb | Incorect | 0 |
| 2 | 159 ms | 7057 kb | Incorect | 0 |
| 3 | 169 ms | 7057 kb | Incorect | 0 |
| 4 | 309 ms | 7041 kb | Incorect | 0 |
| 5 | 169 ms | 7061 kb | Incorect | 0 |
| 6 | 189 ms | 7061 kb | Incorect | 0 |
| 7 | 169 ms | 7057 kb | Incorect | 0 |
| 8 | 169 ms | 7057 kb | Incorect | 0 |
| 9 | 309 ms | 7036 kb | Incorect | 0 |
| 10 | 359 ms | 7032 kb | Time limit exceeded | 0 |
| 11 | 359 ms | 7032 kb | Time limit exceeded | 0 |
| 12 | 329 ms | 6991 kb | Incorect | 0 |
| 13 | 359 ms | 7028 kb | Time limit exceeded | 0 |
| 14 | 359 ms | 7032 kb | Time limit exceeded | 0 |
| 15 | 359 ms | 7036 kb | Time limit exceeded | 0 |
| 16 | 359 ms | 7032 kb | Time limit exceeded | 0 |
| 17 | 359 ms | 7036 kb | Time limit exceeded | 0 |
| 18 | 359 ms | 7032 kb | Time limit exceeded | 0 |
| 19 | 359 ms | 7036 kb | Time limit exceeded | 0 |
| 20 | 359 ms | 7036 kb | Time limit exceeded | 0 |
| Punctaj total | 0 | |||
