Pagini recente » Borderou de evaluare (job #1697060) | Borderou de evaluare (job #1964273) | Borderou de evaluare (job #2692188) | Borderou de evaluare (job #22189) | Borderou de evaluare (job #1263122)
Borderou de evaluare (job #1263122)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:17:45: warning: array subscript has type ‘char’ [-Wchar-subscripts]
for (i=0; i<12; ++i) ord[s[i]]=i;
^
user.cpp:21:40: warning: array subscript has type ‘char’ [-Wchar-subscripts]
a[i]=ord[s1[4]]+ord[s1[3]]*10+ord[s1[2]]*100+ord[s1[1]]*1000+ord[s1[0]]*10000;
^
user.cpp:21:51: warning: array subscript has type ‘char’ [-Wchar-subscripts]
a[i]=ord[s1[4]]+ord[s1[3]]*10+ord[s1[2]]*100+ord[s1[1]]*1000+ord[s1[0]]*10000;
^
user.cpp:21:65: warning: array subscript has type ‘char’ [-Wchar-subscripts]
a[i]=ord[s1[4]]+ord[s1[3]]*10+ord[s1[2]]*100+ord[s1[1]]*1000+ord[s1[0]]*10000;
^
user.cpp:21:80: warning: array subscript has type ‘char’ [-Wchar-subscripts]
a[i]=ord[s1[4]]+ord[s1[3]]*10+ord[s1[2]]*100+ord[s1[1]]*1000+ord[s1[0]]*10000;
^
user.cpp:21:96: warning: array subscript has type ‘char’ [-Wchar-subscripts]
a[i]=ord[s1[4]]+ord[s1[3]]*10+ord[s1[2]]*100+ord[s1[1]]*1000+ord[s1[0]]*10000;
^
user.cpp:39:39: warning: array subscript has type ‘char’ [-Wchar-subscripts]
for (i=0; i<12; ++i) ord[s[i]]=i;
^
user.cpp:43:24: warning: array subscript has type ‘char’ [-Wchar-subscripts]
a[i]=ord[s1[4]]+ord[s1[3]]*10+ord[s1[2]]*100+ord[s1[1]]*1000+ord[s1[0]]*10000;
^
user.cpp:43:35: warning: array subscript has type ‘char’ [-Wchar-subscripts]
a[i]=ord[s1[4]]+ord[s1[3]]*10+ord[s1[2]]*100+ord[s1[1]]*1000+ord[s1[0]]*10000;
^
user.cpp:43:49: warning: array subscript has type ‘char’ [-Wchar-subscripts]
a[i]=ord[s1[4]]+ord[s1[3]]*10+ord[s1[2]]*100+ord[s1[1]]*1000+ord[s1[0]]*10000;
^
user.cpp:43:64: warning: array subscript has type ‘char’ [-Wchar-subscripts]
a[i]=ord[s1[4]]+ord[s1[3]]*10+ord[s1[2]]*100+ord[s1[1]]*1000+ord[s1[0]]*10000;
^
user.cpp:43:80: warning: array subscript has type ‘char’ [-Wchar-subscripts]
a[i]=ord[s1[4]]+ord[s1[3]]*10+ord[s1[2]]*100+ord[s1[1]]*1000+ord[s1[0]]*10000;
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 424kb | OK | 5 |
2 | 0ms | 432kb | Incorect | 0 |
3 | 12ms | 620kb | Incorect | 0 |
4 | 28ms | 820kb | Incorect | 0 |
5 | 56ms | 1212kb | Incorect | 0 |
6 | 116ms | 1992kb | Incorect | 0 |
7 | 0ms | 420kb | Incorect | 0 |
8 | 0ms | 432kb | Incorect | 0 |
9 | 0ms | 436kb | Incorect | 0 |
10 | 8ms | 448kb | Incorect | 0 |
11 | 12ms | 472kb | Incorect | 0 |
12 | 28ms | 504kb | Incorect | 0 |
13 | 60ms | 584kb | Incorect | 0 |
14 | 120ms | 740kb | Incorect | 0 |
15 | 152ms | 820kb | Incorect | 0 |
16 | 224ms | 1016kb | Incorect | 0 |
17 | Depăşit | 1212kb | Time limit exceeded. | 0 |
18 | Depăşit | 1392kb | Time limit exceeded. | 0 |
19 | Depăşit | 1668kb | Time limit exceeded. | 0 |
20 | Depăşit | 1968kb | Time limit exceeded. | 0 |
Punctaj total | 5 |