Borderou de evaluare (job #1942157)

Utilizator sfechisalin@yahoo.comSfechis Alin [email protected] Data 27 martie 2017 20:31:54
Problema Arbore partial de cost minim Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 30

Raport evaluator

Compilare: user.cpp: In member function ‘int Heap::best_ind(int)’: user.cpp:91:10: warning: suggest parentheses around ‘+’ inside ‘<<’ [-Wparentheses] if (ind << 1 + 1 < Elems.size()) ^ user.cpp:91:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if (ind << 1 + 1 < Elems.size()) ^ user.cpp: In member function ‘void Heap::del_elem()’: user.cpp:107:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] while (ind << 1 < Elems.size()) ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms444kbCorect10
20ms448kbCorect10
30ms464kbCost incorect0
40ms468kbCost incorect0
50ms472kbCost incorect0
6136ms3596kbCost incorect0
7256ms6488kbCost incorect0
848ms1528kbCost incorect0
956ms1732kbCorect10
10224ms5660kbCost incorect0
Punctaj total30

Ceva nu functioneaza?