Pagini recente »
Borderou de evaluare (job #654861)
|
Borderou de evaluare (job #636883)
|
Clasament 2022-09-28-clasa-6-tema-03
|
Borderou de evaluare (job #170887)
|
Borderou de evaluare (job #718922)
Borderou de evaluare (job #718922)
Raport evaluator
Compilare:
main.cpp: In function 'int main()':
main.cpp:10:21: warning: unused variable 'ndiv' [-Wunused-variable]
10 | int N, ver = 0, ndiv = 0, nrd = 0, divp = 0, ct;
| ^~~~
main.cpp:33:30: warning: iteration 6 invokes undefined behavior [-Waggressive-loop-optimizations]
33 | v[i] = 0;
| ~~~~~^~~
main.cpp:32:39: note: within this loop
32 | for (int i = 1; i <= 7; i++)
| ~~^~~~
In file included from /usr/lib/gcc/i686-pc-linux-gnu/12/include/g++-v12/algorithm:61,
from main.cpp:3:
In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]',
inlined from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' at /usr/lib/gcc/i686-pc-linux-gnu/12/include/g++-v12/bits/stl_algo.h:1844:5,
inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' at /usr/lib/gcc/i686-pc-linux-gnu/12/include/g++-v12/bits/stl_algo.h:1940:31,
inlined from 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_less_iter]' at /usr/lib/gcc/i686-pc-linux-gnu/12/include/g++-v12/bits/stl_algo.h:1932:5,
inlined from 'void std::sort(_RAIter, _RAIter) [with _RAIter = int*]' at /usr/lib/gcc/i686-pc-linux-gnu/12/include/g++-v12/bits/stl_algo.h:4820:18,
inlined from 'int main()' at main.cpp:48:10:
/usr/lib/gcc/i686-pc-linux-gnu/12/include/g++-v12/bits/stl_algo.h:1849:32: warning: array subscript 17 is outside array bounds of 'int [7]' [-Warray-bounds]
1849 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'int main()':
main.cpp:7:5: note: at offset 68 into object 'v' of size 28
7 | int v[7];
| ^
main.cpp:33:28: warning: array subscript 7 is above array bounds of 'int [7]' [-Warray-bounds]
33 | v[i] = 0;
| ~~~^
main.cpp:7:5: note: while referencing 'v'
7 | int v[7];
| ^
Test |
Timp execuție |
Memorie folosită |
Mesaj |
Punctaj/test |
1
|
1 ms
|
245 kb
|
OK
|
10
|
2
|
1 ms
|
245 kb
|
OK
|
10
|
3
|
1 ms
|
245 kb
|
OK
|
10
|
4
|
1 ms
|
245 kb
|
OK
|
10
|
5
|
9 ms
|
249 kb
|
Killed by Signal 11
|
0
|
6
|
1 ms
|
245 kb
|
OK
|
10
|
7
|
1 ms
|
245 kb
|
OK
|
10
|
8
|
1 ms
|
245 kb
|
OK
|
10
|
9
|
9 ms
|
249 kb
|
Killed by Signal 11
|
0
|
10
|
9 ms
|
249 kb
|
Incorect
|
0
|
Punctaj total
|
70
|