Pagini recente » Borderou de evaluare (job #1424348) | Borderou de evaluare (job #1011469) | Borderou de evaluare (job #3312857) | Borderou de evaluare (job #2891597) | Borderou de evaluare (job #3312824)
Borderou de evaluare (job #3312824)
Raport evaluator
Compilare:
main.cpp: In function 'int main()':
main.cpp:19:20: warning: array subscript has type 'char' [-Wchar-subscripts]
19 | fr[s2[x]]++;
| ~~~~^
main.cpp:28:24: warning: array subscript has type 'char' [-Wchar-subscripts]
28 | if (fr[s1[x]]>0)
| ~~~~^
main.cpp:31:24: warning: array subscript has type 'char' [-Wchar-subscripts]
31 | fr[s1[x]]--;
| ~~~~^
main.cpp:50:20: warning: array subscript has type 'char' [-Wchar-subscripts]
50 | fr[s2[x]]++;
| ~~~~^
main.cpp:59:24: warning: array subscript has type 'char' [-Wchar-subscripts]
59 | if (fr[s1[x]]>0)
| ~~~~^
main.cpp:62:24: warning: array subscript has type 'char' [-Wchar-subscripts]
62 | fr[s1[x]]--;
| ~~~~^
main.cpp:81:21: warning: array subscript has type 'char' [-Wchar-subscripts]
81 | fr2[s1[x]]++;
| ~~~~^
main.cpp:93:25: warning: array subscript has type 'char' [-Wchar-subscripts]
93 | if (fr[s1[y]]!=0)
| ~~~~^
main.cpp:95:65: warning: array subscript has type 'char' [-Wchar-subscripts]
95 | while (s.size ()>0 && s.top()>s1[y] && fr2[s.top()]>=fr[s.top()]+1)
| ~~~~~^~
main.cpp:95:78: warning: array subscript has type 'char' [-Wchar-subscripts]
95 | while (s.size ()>0 && s.top()>s1[y] && fr2[s.top()]>=fr[s.top()]+1)
| ~~~~~^~
main.cpp:97:30: warning: array subscript has type 'char' [-Wchar-subscripts]
97 | fr[s.top()]--;
| ~~~~~^~
main.cpp:101:25: warning: array subscript has type 'char' [-Wchar-subscripts]
101 | fr[s1[y]]++;fr2[s1[y]]--;
| ~~~~^
main.cpp:101:38: warning: array subscript has type 'char' [-Wchar-subscripts]
101 | fr[s1[y]]++;fr2[s1[y]]--;
| ~~~~^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 0ms | 303kb | OK! | 3 |
| 2 | 0ms | 303kb | OK! | 3 |
| 3 | 0ms | 303kb | OK! | 3 |
| 4 | 0ms | 303kb | OK! | 3 |
| 5 | 0ms | 303kb | OK! | 3 |
| 6 | 0ms | 303kb | OK! | 3 |
| 7 | 0ms | 303kb | OK! | 3 |
| 8 | 0ms | 303kb | OK! | 3 |
| 9 | 0ms | 303kb | OK! | 3 |
| 10 | 0ms | 303kb | OK! | 3 |
| 11 | 0ms | 303kb | Wrong answer! | 0 |
| 12 | 0ms | 303kb | OK! | 2 |
| 13 | 0ms | 303kb | Wrong answer! | 0 |
| 14 | 0ms | 303kb | Wrong answer! | 0 |
| 15 | 0ms | 303kb | Wrong answer! | 0 |
| 16 | 0ms | 303kb | Wrong answer! | 0 |
| 17 | 0ms | 303kb | Wrong answer! | 0 |
| 18 | 0ms | 303kb | Wrong answer! | 0 |
| 19 | 2ms | 303kb | Wrong answer! | 0 |
| 20 | 2ms | 1081kb | Wrong answer! | 0 |
| 21 | 2ms | 557kb | Wrong answer! | 0 |
| 22 | 2ms | 557kb | Wrong answer! | 0 |
| 23 | 2ms | 557kb | Wrong answer! | 0 |
| 24 | 2ms | 557kb | Wrong answer! | 0 |
| 25 | 2ms | 557kb | Wrong answer! | 0 |
| 26 | 2ms | 1085kb | Wrong answer! | 0 |
| 27 | 2ms | 1081kb | Wrong answer! | 0 |
| 28 | 2ms | 1081kb | Wrong answer! | 0 |
| 29 | 2ms | 1081kb | Wrong answer! | 0 |
| 30 | 2ms | 1081kb | Wrong answer! | 0 |
| Punctaj total | 32 |