Pagini recente » Borderou de evaluare (job #1821237) | Borderou de evaluare (job #1660173) | Borderou de evaluare (job #893902) | Borderou de evaluare (job #826376) | Borderou de evaluare (job #2202034)
Borderou de evaluare (job #2202034)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:15:2: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
{for(l=j+1;l<=m;l++)
^~~
user.cpp:20:5: note: ...this statement, but the latter is misleadingly indented as if it is guarded by the ‘for’
for(l=i+1;l<=n;l++)
^~~
user.cpp:44:9: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
for(l=j;l<=dr[i][j]+j;l++)
^~~
user.cpp:47:13: note: ...this statement, but the latter is misleadingly indented as if it is guarded by the ‘for’
if(s<(maxx+1)*(dr[i][j]+1))
^~
user.cpp:47:13: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
user.cpp:48:41: note: ...this statement, but the latter is misleadingly indented as if it is guarded by the ‘if’
s=(maxx+1)*(dr[i][j]+1);maxx=999999;}
^~~~
user.cpp:9:23: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
fscanf(f,"%d%d",&n,&m);
^
user.cpp:12:24: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
fscanf(f,"%d",&h[i][j]);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 4760kb | Corect | 5 |
2 | 0ms | 4764kb | Corect | 5 |
3 | 0ms | 4764kb | Corect | 4 |
4 | 0ms | 4792kb | Corect | 4 |
5 | 0ms | 4872kb | Corect | 4 |
6 | 4ms | 5028kb | Corect | 4 |
7 | 4ms | 5068kb | Corect | 4 |
8 | 32ms | 5340kb | Raspuns gresit | 0 |
9 | 52ms | 5436kb | Corect | 5 |
10 | 68ms | 5496kb | Corect | 5 |
11 | 76ms | 5536kb | Raspuns gresit | 0 |
12 | 244ms | 7904kb | Corect | 7 |
13 | 488ms | 12004kb | Corect | 9 |
14 | 488ms | 12004kb | Corect | 9 |
15 | Depăşit | 7900kb | Time limit exceeded. | 0 |
16 | Depăşit | 7900kb | Time limit exceeded. | 0 |
Punctaj total | 65 |