Borderou de evaluare (job #1007794)
Utilizator | Data | 9 octombrie 2013 19:10:02 | |
---|---|---|---|
Problema | Statistici de ordine | Status | done |
Runda | Arhiva educationala | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp: In function ‘int solve(int*, int, int)’:
user.cpp:37:22: error: expected ‘,’ or ‘;’ before ‘min’
int sq = sqrt(n) min = 0, max = INT_MAX, index = 0;
^
user.cpp:40:20: error: invalid operands of types ‘<unresolved overloaded function type>’ and ‘int’ to binary ‘operator<’
while (index < k) {
^
user.cpp:42:20: error: invalid operands of types ‘<unresolved overloaded function type>’ and ‘<unresolved overloaded function type>’ to binary ‘operator==’
if (min == max) {
^
user.cpp:48:35: error: invalid operands of types ‘<unresolved overloaded function type>’ and ‘<unresolved overloaded function type>’ to binary ‘operator-’
int bucket_range = (max - min) / sq;
^
user.cpp:51:28: error: invalid operands of types ‘int’ and ‘<unresolved overloaded function type>’ to binary ‘operator-’
frecv[ (v[i] - min) / bucket_range ]++;
^
user.cpp:55:32: error: invalid operands of types ‘<unresolved overloaded function type>’ and ‘int’ to binary ‘operator+’
if (index + frecv[i] < k) {
^
user.cpp:56:23: error: overloaded function with no contextual type information
index += frecv[i];
^
user.cpp:58:33: error: invalid operands of types ‘<unresolved overloaded function type>’ and ‘int’ to binary ‘operator+’
min = min + i * bucket_range;
^
user.cpp:59:29: error: invalid operands of types ‘<unresolved overloaded function type>’ and ‘int’ to binary ‘operator+’
max = min + bucket_range -1;
^
user.cpp:61:33: error: invalid operands of types ‘int’ and ‘<unresolved overloaded function type>’ to binary ‘operator>=’
if (v[j] >= min && v[j] <= max ){
^
user.cpp:61:48: error: invalid operands of types ‘int’ and ‘<unresolved overloaded function type>’ to binary ‘operator<=’
if (v[j] >= min && v[j] <= max ){
^
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !