Pagini recente » Borderou de evaluare (job #3133648) | Borderou de evaluare (job #131923) | Borderou de evaluare (job #2040396) | Borderou de evaluare (job #1920643) | Borderou de evaluare (job #1322942)
Borderou de evaluare (job #1322942)
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 |
1 | 0ms | 428kb | OK | 5 | 10 |
2 | 0ms | 424kb | OK | 5 |
3 | 0ms | 428kb | OK | 5 | 15 |
4 | 0ms | 428kb | OK | 5 |
5 | 0ms | 432kb | OK | 5 |
6 | 0ms | 428kb | OK | 5 | 10 |
7 | 0ms | 436kb | OK | 5 |
8 | 0ms | 432kb | OK | 5 | 15 |
9 | 0ms | 432kb | OK | 5 |
10 | 0ms | 436kb | OK | 5 |
11 | 24ms | 468kb | OK | 5 | 15 |
12 | 16ms | 464kb | OK | 5 |
13 | 12ms | 468kb | OK | 5 |
14 | 44ms | 496kb | OK | 5 | 15 |
15 | 72ms | 496kb | OK | 5 |
16 | 44ms | 492kb | OK | 5 |
17 | 24ms | 484kb | OK | 5 | 20 |
18 | 92ms | 500kb | OK | 5 |
19 | 56ms | 500kb | OK | 5 |
20 | 56ms | 500kb | OK | 5 |
Punctaj total | 100 |