Pagini recente » Borderou de evaluare (job #1404524) | Borderou de evaluare (job #433572) | Borderou de evaluare (job #1417538) | Borderou de evaluare (job #213303) | Borderou de evaluare (job #1250327)
Borderou de evaluare (job #1250327)
Raport evaluator
Compilare:
user.cpp: In function ‘long long int solve(std::vector<int>)’:
user.cpp:37:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 1; i + 1 < v.size(); ++i)
^
user.cpp: In function ‘void Infasuratoare(std::vector<int>&, std::vector<int>&)’:
user.cpp:54:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 2 ; i < v.size() ; ++ i) {
^
user.cpp: In function ‘std::string make_solution(std::vector<int>, std::vector<int>)’:
user.cpp:78:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j = 0 ; j < Sol3.size() ; ++j){
^
user.cpp:82:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j = 0 ; j < Sol4.size() ; ++j){
^
user.cpp: In function ‘int main()’:
user.cpp:93:38: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("gradina.in", "r", stdin);
^
user.cpp:95:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
user.cpp:98:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &A, &B);
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 0ms | 528kb | Okay | 10 |
| 2 | 4ms | 528kb | Okay | 10 |
| 3 | 152ms | 536kb | Okay | 10 |
| 4 | 496ms | 532kb | Okay | 10 |
| 5 | 148ms | 532kb | Okay | 10 |
| 6 | 60ms | 532kb | Okay | 10 |
| 7 | 476ms | 536kb | Okay | 10 |
| 8 | 436ms | 540kb | Okay | 10 |
| 9 | 232ms | 532kb | Okay | 10 |
| 10 | 492ms | 536kb | Okay | 10 |
| Punctaj total | 100 |