Borderou de evaluare (job #1322942)

Utilizator turbowin120Amarandei-Stanescu Alexandru turbowin120 Data 20 ianuarie 2015 15:39:13
Problema Problema rucsacului Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 100

Raport evaluator

Compilare: user.cpp: In function ‘int main()’: user.cpp:3:93: warning: unused variable ‘m’ [-Wunused-variable] using namespace std;struct produs{int g,p;};produs v[5069];int main(){int profit[11337];int m,k,n;FILE *in,*out;in=fopen("rucsac.in","r");fscanf(in,"%d%d",&n,&k);for(int i=1;i<=n;i++){fscanf(in,"%d%d",&v[i].g,&v[i].p);}for(int i=1;i<=k;i++) profit[i]=-1;profit[0]=0;for(int i=1;i<=n;i++){for(int j=k-v[i].g;j>=0;j--){if(profit[j]!=-1&&profit[j]+v[i].p>profit[j+v[i].g])profit[j+v[i].g]=profit[j]+v[i].p;}}out=fopen("rucsac.out","w");int maxim=-1;for(int i=1;i<=k;i++){if(profit[i]>maxim) maxim=profit[i];}fprintf(out,"%d",maxim);return 0;} ^ user.cpp:3:162: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;struct produs{int g,p;};produs v[5069];int main(){int profit[11337];int m,k,n;FILE *in,*out;in=fopen("rucsac.in","r");fscanf(in,"%d%d",&n,&k);for(int i=1;i<=n;i++){fscanf(in,"%d%d",&v[i].g,&v[i].p);}for(int i=1;i<=k;i++) profit[i]=-1;profit[0]=0;for(int i=1;i<=n;i++){for(int j=k-v[i].g;j>=0;j--){if(profit[j]!=-1&&profit[j]+v[i].p>profit[j+v[i].g])profit[j+v[i].g]=profit[j]+v[i].p;}}out=fopen("rucsac.out","w");int maxim=-1;for(int i=1;i<=k;i++){if(profit[i]>maxim) maxim=profit[i];}fprintf(out,"%d",maxim);return 0;} ^ user.cpp:3:218: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] using namespace std;struct produs{int g,p;};produs v[5069];int main(){int profit[11337];int m,k,n;FILE *in,*out;in=fopen("rucsac.in","r");fscanf(in,"%d%d",&n,&k);for(int i=1;i<=n;i++){fscanf(in,"%d%d",&v[i].g,&v[i].p);}for(int i=1;i<=k;i++) profit[i]=-1;profit[0]=0;for(int i=1;i<=n;i++){for(int j=k-v[i].g;j>=0;j--){if(profit[j]!=-1&&profit[j]+v[i].p>profit[j+v[i].g])profit[j+v[i].g]=profit[j]+v[i].p;}}out=fopen("rucsac.out","w");int maxim=-1;for(int i=1;i<=k;i++){if(profit[i]>maxim) maxim=profit[i];}fprintf(out,"%d",maxim);return 0;} ^
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
10ms428kbOK510
20ms424kbOK5
30ms428kbOK515
40ms428kbOK5
50ms432kbOK5
60ms428kbOK510
70ms436kbOK5
80ms432kbOK515
90ms432kbOK5
100ms436kbOK5
1124ms468kbOK515
1216ms464kbOK5
1312ms468kbOK5
1444ms496kbOK515
1572ms496kbOK5
1644ms492kbOK5
1724ms484kbOK520
1892ms500kbOK5
1956ms500kbOK5
2056ms500kbOK5
Punctaj total100

Ceva nu functioneaza?