Pagini recente » Borderou de evaluare (job #689886) | Borderou de evaluare (job #3170097) | Borderou de evaluare (job #949167) | Borderou de evaluare (job #1392582) | Borderou de evaluare (job #1417923)
Borderou de evaluare (job #1417923)
Raport evaluator
Compilare:
user.cpp:3:512: warning: "/*" within comment [-Wcomment]
FILE *fin = fopen("farfurii.in", "r");FILE *fout = fopen("farfurii.out","w");long long N, M, i, j, K, ok, minim, T, X, Y, Z;void CodeExpert(){fscanf(fin, "%ld%ld", &N, &K); X = 1;while((X+1) * 1LL * (X+2) <= K * 2)X ++;Y = X * 1LL * (X+1) / 2;for(i = 1; i <= N-X-2; i ++) /*V[++T] = i;*/fprintf(fout,"%ld ", i);Z = K-Y; Z = N-X-1+Z; fprintf(fout,"%ld ", Z);for(i = N; i >= N-X-1; i --)if(i == Z) continue;else fprintf(fout,"%ld ", i);/*for(i = 1; i <= N; i ++) /*fout << V[i] << " ";*//*fprintf(fout,"%d ", V[i]);*/return;}int main(){CodeExpert();return 0;}
^
user.cpp: In function ‘void CodeExpert()’:
user.cpp:3:171: warning: format ‘%ld’ expects argument of type ‘long int*’, but argument 3 has type ‘long long int*’ [-Wformat=]
FILE *fin = fopen("farfurii.in", "r");FILE *fout = fopen("farfurii.out","w");long long N, M, i, j, K, ok, minim, T, X, Y, Z;void CodeExpert(){fscanf(fin, "%ld%ld", &N, &K); X = 1;while((X+1) * 1LL * (X+2) <= K * 2)X ++;Y = X * 1LL * (X+1) / 2;for(i = 1; i <= N-X-2; i ++) /*V[++T] = i;*/fprintf(fout,"%ld ", i);Z = K-Y; Z = N-X-1+Z; fprintf(fout,"%ld ", Z);for(i = N; i >= N-X-1; i --)if(i == Z) continue;else fprintf(fout,"%ld ", i);/*for(i = 1; i <= N; i ++) /*fout << V[i] << " ";*//*fprintf(fout,"%d ", V[i]);*/return;}int main(){CodeExpert();return 0;}
^
user.cpp:3:171: warning: format ‘%ld’ expects argument of type ‘long int*’, but argument 4 has type ‘long long int*’ [-Wformat=]
user.cpp:3:316: warning: format ‘%ld’ expects argument of type ‘long int’, but argument 3 has type ‘long long int’ [-Wformat=]
FILE *fin = fopen("farfurii.in", "r");FILE *fout = fopen("farfurii.out","w");long long N, M, i, j, K, ok, minim, T, X, Y, Z;void CodeExpert(){fscanf(fin, "%ld%ld", &N, &K); X = 1;while((X+1) * 1LL * (X+2) <= K * 2)X ++;Y = X * 1LL * (X+1) / 2;for(i = 1; i <= N-X-2; i ++) /*V[++T] = i;*/fprintf(fout,"%ld ", i);Z = K-Y; Z = N-X-1+Z; fprintf(fout,"%ld ", Z);for(i = N; i >= N-X-1; i --)if(i == Z) continue;else fprintf(fout,"%ld ", i);/*for(i = 1; i <= N; i ++) /*fout << V[i] << " ";*//*fprintf(fout,"%d ", V[i]);*/return;}int main(){CodeExpert();return 0;}
^
user.cpp:3:362: warning: format ‘%ld’ expects argument of type ‘long int’, but argument 3 has type ‘long long int’ [-Wformat=]
FILE *fin = fopen("farfurii.in", "r");FILE *fout = fopen("farfurii.out","w");long long N, M, i, j, K, ok, minim, T, X, Y, Z;void CodeExpert(){fscanf(fin, "%ld%ld", &N, &K); X = 1;while((X+1) * 1LL * (X+2) <= K * 2)X ++;Y = X * 1LL * (X+1) / 2;for(i = 1; i <= N-X-2; i ++) /*V[++T] = i;*/fprintf(fout,"%ld ", i);Z = K-Y; Z = N-X-1+Z; fprintf(fout,"%ld ", Z);for(i = N; i >= N-X-1; i --)if(i == Z) continue;else fprintf(fout,"%ld ", i);/*for(i = 1; i <= N; i ++) /*fout << V[i] << " ";*//*fprintf(fout,"%d ", V[i]);*/return;}int main(){CodeExpert();return 0;}
^
user.cpp:3:483: warning: format ‘%ld’ expects argument of type ‘long int’, but argument 3 has type ‘long long int’ [-Wformat=]
FILE *fin = fopen("farfurii.in", "r");FILE *fout = fopen("farfurii.out","w");long long N, M, i, j, K, ok, minim, T, X, Y, Z;void CodeExpert(){fscanf(fin, "%ld%ld", &N, &K); X = 1;while((X+1) * 1LL * (X+2) <= K * 2)X ++;Y = X * 1LL * (X+1) / 2;for(i = 1; i <= N-X-2; i ++) /*V[++T] = i;*/fprintf(fout,"%ld ", i);Z = K-Y; Z = N-X-1+Z; fprintf(fout,"%ld ", Z);for(i = N; i >= N-X-1; i --)if(i == Z) continue;else fprintf(fout,"%ld ", i);/*for(i = 1; i <= N; i ++) /*fout << V[i] << " ";*//*fprintf(fout,"%d ", V[i]);*/return;}int main(){CodeExpert();return 0;}
^
user.cpp:3:172: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
FILE *fin = fopen("farfurii.in", "r");FILE *fout = fopen("farfurii.out","w");long long N, M, i, j, K, ok, minim, T, X, Y, Z;void CodeExpert(){fscanf(fin, "%ld%ld", &N, &K); X = 1;while((X+1) * 1LL * (X+2) <= K * 2)X ++;Y = X * 1LL * (X+1) / 2;for(i = 1; i <= N-X-2; i ++) /*V[++T] = i;*/fprintf(fout,"%ld ", i);Z = K-Y; Z = N-X-1+Z; fprintf(fout,"%ld ", Z);for(i = N; i >= N-X-1; i --)if(i == Z) continue;else fprintf(fout,"%ld ", i);/*for(i = 1; i <= N; i ++) /*fout << V[i] << " ";*//*fprintf(fout,"%d ", V[i]);*/return;}int main(){CodeExpert();return 0;}
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 260kb | OK! | 10 |
2 | 0ms | 260kb | OK! | 10 |
3 | 0ms | 256kb | OK! | 10 |
4 | 0ms | 252kb | OK! | 10 |
5 | 0ms | 260kb | OK! | 10 |
6 | 0ms | 256kb | OK! | 10 |
7 | 4ms | 252kb | OK! | 10 |
8 | 8ms | 252kb | OK! | 10 |
9 | 16ms | 260kb | OK! | 10 |
10 | 20ms | 256kb | Wrong answer! | 0 |
Punctaj total | 90 |