Pagini recente » Borderou de evaluare (job #1088781) | Borderou de evaluare (job #1210251) | Cod sursa (job #88331) | Borderou de evaluare (job #1818730) | Borderou de evaluare (job #2261616)
Borderou de evaluare (job #2261616)
Raport evaluator
Compilare:
main.cpp: In function 'int binarySearch(std::vector<int>&, int)':
main.cpp:36:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(best + (1<<step) < v.size() && v[best + (1<<step)] <= value) best += (1<<step);
~~~~~~~~~~~~~~~~~^~~~~~~~~~
main.cpp: In function 'int main()':
main.cpp:60:15: warning: statement has no effect [-Wunused-value]
cout.fixed;
^
main.cpp:7:42: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
#define FO(x) {freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);}
^
main.cpp:50:7: note: in expansion of macro 'FO'
FO(aranjare3);
^~
main.cpp:7:71: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
#define FO(x) {freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);}
^
main.cpp:50:7: note: in expansion of macro 'FO'
FO(aranjare3);
^~
main.cpp:52:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
freopen("input", "r", stdin);
^
main.cpp:64:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
main.cpp:68:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &x);
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 4ms | 131kb | final stack is not sorted | 0 |
| 2 | 2ms | 131kb | final stack is not sorted | 0 |
| 3 | 5ms | 131kb | final stack is not sorted | 0 |
| 4 | 4ms | 131kb | final stack is not sorted | 0 |
| 5 | 2ms | 131kb | final stack is not sorted | 0 |
| 6 | 4ms | 131kb | final stack is not sorted | 0 |
| 7 | 2ms | 131kb | final stack is not sorted | 0 |
| 8 | 2ms | 131kb | final stack is not sorted | 0 |
| 9 | 5ms | 131kb | final stack is not sorted | 0 |
| 10 | 3ms | 131kb | final stack is not sorted | 0 |
| 11 | 3ms | 131kb | final stack is not sorted | 0 |
| 12 | 2ms | 131kb | final stack is not sorted | 0 |
| 13 | 2ms | 131kb | final stack is not sorted | 0 |
| 14 | 5ms | 131kb | final stack is not sorted | 0 |
| 15 | 4ms | 131kb | final stack is not sorted | 0 |
| 16 | 4ms | 131kb | final stack is not sorted | 0 |
| 17 | 3ms | 131kb | final stack is not sorted | 0 |
| 18 | 3ms | 131kb | final stack is not sorted | 0 |
| 19 | 2ms | 131kb | final stack is not sorted | 0 |
| 20 | 2ms | 131kb | final stack is not sorted | 0 |
| Punctaj total | 0 |