Pagini recente » Cod sursa (job #633681) | Cod sursa (job #2915690) | Cod sursa (job #1005922) | Cod sursa (job #1675507) | Cod sursa (job #2195021)
# include <bits/stdc++.h>
using namespace std;
short a[2][75000],v[20000];
int main(){
int n,g;
ifstream fin("ghiozdan.in");
ofstream fout("ghiozdan.out");
fin>>n>>g;
for (int i=0;i<n;i++) fin>>v[i];
for (int i=0;i<n;i++){
for (int j=1;j<=g;j++){
if (j-v[i]>=0)
a[i%2][j]=a[(i+1)%2][j-v[i]]+1;
cout<<a[i%2][j]<<' ';
}
cout<<'\n';
}
int j=g;
while (a[(n+1)%2][j]==a[(n+1)%2][j-1]) j--;
fout<<j<<' '<<a[(n+1)%2][j];
return 0;
}