Borderou de evaluare (job #2856895)

Utilizator CraniXortDumitrescul Eduard CraniXort Data 24 februarie 2022 15:46:09
Problema Numinum Status done
Runda Arhiva de probleme Compilator cpp-64 | Vezi sursa
Scor 100

Raport evaluator

Compilare: main.cpp: In function 'void solve()': main.cpp:51:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<bool>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 51 | for(i = 0; i < path1.size() and i < path2.size() and path1[i] == path2[i] and count1[i] == count2[i]; i ++) | ~~^~~~~~~~~~~~~~ main.cpp:51:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<bool>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 51 | for(i = 0; i < path1.size() and i < path2.size() and path1[i] == path2[i] and count1[i] == count2[i]; i ++) | ~~^~~~~~~~~~~~~~ main.cpp:54:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<bool>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 54 | if(i < path1.size() and i < path2.size() and path1[i] == path2[i]) | ~~^~~~~~~~~~~~~~ main.cpp:54:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<bool>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 54 | if(i < path1.size() and i < path2.size() and path1[i] == path2[i]) | ~~^~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
12ms188kbOK4
22ms184kbOK4
32ms184kbOK4
42ms184kbOK4
52ms184kbOK4
62ms184kbOK4
72ms184kbOK4
82ms184kbOK4
92ms184kbOK4
102ms184kbOK4
112ms184kbOK4
122ms184kbOK4
1325ms344kbOK4
1421ms327kbOK4
1520ms327kbOK4
1616ms311kbOK4
1711ms274kbOK4
186ms270kbOK4
1911ms274kbOK4
2011ms274kbOK4
216ms200kbOK4
222ms184kbOK4
232ms184kbOK4
242ms184kbOK4
252ms184kbOK4
Punctaj total100

Ceva nu functioneaza?