Pagini recente » Borderou de evaluare (job #1489494) | Borderou de evaluare (job #1827565) | Borderou de evaluare (job #1075515) | Borderou de evaluare (job #1724577) | Borderou de evaluare (job #2721619)
Borderou de evaluare (job #2721619)
Raport evaluator
Compilare:
main.cpp: In function 'long long int numarAparitii(int, long long int, char)':
main.cpp:39:36: warning: array subscript has type 'char' [-Wchar-subscripts]
return frecvLit[pos][cautat];
^
main.cpp:51:56: warning: array subscript has type 'char' [-Wchar-subscripts]
val += frecvLitSecv[depth - 1][caps(cautat)];
^
main.cpp:55:50: warning: array subscript has type 'char' [-Wchar-subscripts]
val += frecvLitSecv[depth - 1][cautat];
^
main.cpp: In function 'int main()':
main.cpp:117:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
in >> l >> q >> sir + 1;
~~~~^~~
main.cpp:157:91: warning: array subscript has type 'char' [-Wchar-subscripts]
frecvLitSecv[i][j] = 2 * (frecvLitSecv[i - 1][j] + frecvLitSecv[i - 1][caps(j)]);
^
main.cpp:162:91: warning: array subscript has type 'char' [-Wchar-subscripts]
frecvLitSecv[i][j] = 2 * (frecvLitSecv[i - 1][j] + frecvLitSecv[i - 1][caps(j)]);
^
main.cpp:157:32: warning: iteration 25 invokes undefined behavior [-Waggressive-loop-optimizations]
frecvLitSecv[i][j] = 2 * (frecvLitSecv[i - 1][j] + frecvLitSecv[i - 1][caps(j)]);
~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:155:29: note: within this loop
for (int j = 'a'; j <= 'z'; j++)
~~^~~~~~
main.cpp:144:43: warning: iteration 25 invokes undefined behavior [-Waggressive-loop-optimizations]
frecvLitSecv[1][i] = frecvLit[l][i];
~~~~~~~~~~~~~^
main.cpp:142:25: note: within this loop
for (int i = 'a'; i <= 'z'; i++)
~~^~~~~~
main.cpp:123:47: warning: iteration 25 invokes undefined behavior [-Waggressive-loop-optimizations]
frecvLit[i][j] = frecvLit[i - 1][j];
~~~~~~~~~~~~~~~~~^
main.cpp:121:29: note: within this loop
for (int j = 'a'; j <= 'z'; j++)
~~^~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 2ms | 131kb | Corect | 10 |
2 | 2ms | 131kb | Corect | 5 |
3 | 3ms | 262kb | Corect | 5 |
4 | 3ms | 262kb | Corect | 5 |
5 | 36ms | 1634kb | Corect | 5 |
6 | 42ms | 2359kb | Corect | 5 |
7 | 48ms | 2883kb | Corect | 5 |
8 | 55ms | 3407kb | Corect | 5 |
9 | 6ms | 1179kb | Corect | 5 |
10 | 7ms | 1703kb | Corect | 5 |
11 | 7ms | 1048kb | Corect | 5 |
12 | 9ms | 1572kb | Corect | 5 |
13 | 92ms | 10354kb | Corect | 5 |
14 | 112ms | 17694kb | Corect | 5 |
15 | 134ms | 34865kb | Corect | 5 |
16 | 180ms | 42336kb | Corect | 5 |
17 | 230ms | 44957kb | Corect | 5 |
18 | 280ms | 47579kb | Corect | 5 |
19 | 262ms | 50069kb | Corect | 5 |
Punctaj total | 100 |