Pagini recente » Borderou de evaluare (job #2250990) | Borderou de evaluare (job #612854) | Borderou de evaluare (job #1077430) | Borderou de evaluare (job #405412) | Borderou de evaluare (job #2257236)
Borderou de evaluare (job #2257236)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:14:9: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
for(i=1;i<=n;i++) v[i][1]=i; k=n*n-n+1;
^~~
user.cpp:14:38: note: ...this statement, but the latter is misleadingly indented as if it is guarded by the ‘for’
for(i=1;i<=n;i++) v[i][1]=i; k=n*n-n+1;
^
user.cpp:20:9: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
for(i=1;i<=n;i++) v[i][1]=i; for(i=2;i<=n;i++) v[n][i]=n+i-1;
^~~
user.cpp:20:38: note: ...this statement, but the latter is misleadingly indented as if it is guarded by the ‘for’
for(i=1;i<=n;i++) v[i][1]=i; for(i=2;i<=n;i++) v[n][i]=n+i-1;
^~~
user.cpp:26:9: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
for(i=1;i<=n;i++) v[i][1]=i; for(i=2;i<=n-1;i++) v[n][i]=n+i-1; v[n][n]=n*n;
^~~
user.cpp:26:38: note: ...this statement, but the latter is misleadingly indented as if it is guarded by the ‘for’
for(i=1;i<=n;i++) v[i][1]=i; for(i=2;i<=n-1;i++) v[n][i]=n+i-1; v[n][n]=n*n;
^~~
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 0ms | 1324kb | Solutie gresita | 0 |
| 2 | 0ms | 1340kb | OK | 10 |
| 3 | 0ms | 1324kb | OK | 10 |
| 4 | 0ms | 1348kb | Killed by signal 11(SIGSEGV). | 0 |
| 5 | 0ms | 1348kb | Killed by signal 11(SIGSEGV). | 0 |
| 6 | 4ms | 1352kb | Solutie gresita | 0 |
| 7 | 0ms | 1352kb | Killed by signal 11(SIGSEGV). | 0 |
| 8 | 0ms | 1356kb | Killed by signal 11(SIGSEGV). | 0 |
| 9 | 0ms | 1352kb | Killed by signal 11(SIGSEGV). | 0 |
| 10 | 0ms | 1348kb | Killed by signal 11(SIGSEGV). | 0 |
| Punctaj total | 20 |