Pagini recente » Cod sursa (job #1794115) | Cod sursa (job #138031) | Cod sursa (job #1639458) | Cod sursa (job #1255561) | Cod sursa (job #2096075)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("lapte.in");
ofstream fout("lapte.out");
int n,l,k,t;
int cost[101][101],m[101][101],a[101],b[101];
void afis(int x,int y)
{
if(x!=0)
{
afis(x-1,y-cost[x][y]);
fout << cost[x][y] << ' ' << (t-cost[x][y]*a[x])/b[x] << '\n';
}
}
int main()
{
fin >> n >> l;
int i,j;
for(i=1;i<=n;i++)
{
fin >> a[i] >> b[i];
}
t=0;
while(m[n][l]<l)
{
t++;
for(i=0;i<=n;i++)
for(j=0;j<=l;j++)
m[i][j]=-1000000000;
m[0][0]=0;
for(i=1;i<=n;i++)
for(j=0;j<=l;j++)
for(k=0;k*a[i]<=t;k++)
if(m[i][j]<m[i-1][j-k]+(t-k*a[i])/b[i])
{
cost[i][j]=k;
m[i][j]=m[i-1][j-k]+(t-k*a[i])/b[i];
}
}
fout << t << '\n';
afis(n,l);
return 0;
}