Pagini recente » Borderou de evaluare (job #900615) | Borderou de evaluare (job #3147387) | Borderou de evaluare (job #2530239) | Borderou de evaluare (job #2735397) | Borderou de evaluare (job #2590128)
Borderou de evaluare (job #2590128)
Raport evaluator
Compilare:
main.cpp: In function 'int main()':
main.cpp:3:117: warning: unused variable 'x' [-Wunused-variable]
using namespace std;FILE *f=fopen("sume.in","r");FILE *g=fopen("sume.out","w");int main(){int i,v[25001],w[25001],n,x,m,p,s1=0,s2=0;fscanf(f,"%d",&n);for(i=1;i<=n;i++){fscanf(f,"%d",&v[i]);s1=s1+v[i];}m=sqrt(2*n)+1;w[1]=(v[1]+v[2]-v[m])/2;s2=w[1];for(i=2;i<=m;i++){w[i]=v[i-1]-w[1];s2=s2+w[i];}if(s1%s2!=0)fprintf(g,"-1");else{fprintf(g,"%d\n",m);for(i=1;i<=m;i++)fprintf(g,"%d ",w[i]);}}
^
main.cpp:3:121: warning: unused variable 'p' [-Wunused-variable]
using namespace std;FILE *f=fopen("sume.in","r");FILE *g=fopen("sume.out","w");int main(){int i,v[25001],w[25001],n,x,m,p,s1=0,s2=0;fscanf(f,"%d",&n);for(i=1;i<=n;i++){fscanf(f,"%d",&v[i]);s1=s1+v[i];}m=sqrt(2*n)+1;w[1]=(v[1]+v[2]-v[m])/2;s2=w[1];for(i=2;i<=m;i++){w[i]=v[i-1]-w[1];s2=s2+w[i];}if(s1%s2!=0)fprintf(g,"-1");else{fprintf(g,"%d\n",m);for(i=1;i<=m;i++)fprintf(g,"%d ",w[i]);}}
^
main.cpp:3:150: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
using namespace std;FILE *f=fopen("sume.in","r");FILE *g=fopen("sume.out","w");int main(){int i,v[25001],w[25001],n,x,m,p,s1=0,s2=0;fscanf(f,"%d",&n);for(i=1;i<=n;i++){fscanf(f,"%d",&v[i]);s1=s1+v[i];}m=sqrt(2*n)+1;w[1]=(v[1]+v[2]-v[m])/2;s2=w[1];for(i=2;i<=m;i++){w[i]=v[i-1]-w[1];s2=s2+w[i];}if(s1%s2!=0)fprintf(g,"-1");else{fprintf(g,"%d\n",m);for(i=1;i<=m;i++)fprintf(g,"%d ",w[i]);}}
^
main.cpp:3:189: warning: ignoring return value of 'int fscanf(FILE*, const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
using namespace std;FILE *f=fopen("sume.in","r");FILE *g=fopen("sume.out","w");int main(){int i,v[25001],w[25001],n,x,m,p,s1=0,s2=0;fscanf(f,"%d",&n);for(i=1;i<=n;i++){fscanf(f,"%d",&v[i]);s1=s1+v[i];}m=sqrt(2*n)+1;w[1]=(v[1]+v[2]-v[m])/2;s2=w[1];for(i=2;i<=m;i++){w[i]=v[i-1]-w[1];s2=s2+w[i];}if(s1%s2!=0)fprintf(g,"-1");else{fprintf(g,"%d\n",m);for(i=1;i<=m;i++)fprintf(g,"%d ",w[i]);}}
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 2ms | 131kb | OK! | 5 |
| 2 | 7ms | 131kb | OK! | 5 |
| 3 | 14ms | 200kb | Wrong answer! | 0 |
| 4 | 2ms | 131kb | Wrong answer! | 0 |
| 5 | 5ms | 131kb | Wrong answer! | 0 |
| 6 | 6ms | 131kb | Wrong answer! | 0 |
| 7 | 4ms | 131kb | Wrong answer! | 0 |
| 8 | 5ms | 131kb | Wrong answer! | 0 |
| 9 | 6ms | 131kb | Wrong answer! | 0 |
| 10 | 11ms | 258kb | Wrong answer! | 0 |
| 11 | 2ms | 131kb | Wrong answer! | 0 |
| 12 | 6ms | 131kb | Wrong answer! | 0 |
| 13 | 6ms | 131kb | Wrong answer! | 0 |
| 14 | 6ms | 131kb | Wrong answer! | 0 |
| 15 | 10ms | 262kb | Wrong answer! | 0 |
| 16 | 8ms | 262kb | Wrong answer! | 0 |
| 17 | 10ms | 262kb | Wrong answer! | 0 |
| 18 | 11ms | 262kb | Wrong answer! | 0 |
| 19 | 16ms | 229kb | Wrong answer! | 0 |
| 20 | 15ms | 200kb | Wrong answer! | 0 |
| Punctaj total | 10 |