Borderou de evaluare (job #2590128)

Utilizator alex_benescuAlex Ben alex_benescu Data 27 martie 2020 15:55:07
Problema Sume Status done
Runda Arhiva de probleme Compilator cpp-64 | Vezi sursa
Scor 10

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
12ms131kbOK!5
27ms131kbOK!5
314ms200kbWrong answer!0
42ms131kbWrong answer!0
55ms131kbWrong answer!0
66ms131kbWrong answer!0
74ms131kbWrong answer!0
85ms131kbWrong answer!0
96ms131kbWrong answer!0
1011ms258kbWrong answer!0
112ms131kbWrong answer!0
126ms131kbWrong answer!0
136ms131kbWrong answer!0
146ms131kbWrong answer!0
1510ms262kbWrong answer!0
168ms262kbWrong answer!0
1710ms262kbWrong answer!0
1811ms262kbWrong answer!0
1916ms229kbWrong answer!0
2015ms200kbWrong answer!0
Punctaj total10

Ceva nu functioneaza?