Pagini recente » Cod sursa (job #16741) | Cod sursa (job #2255363) | Cod sursa (job #991345) | Cod sursa (job #4407) | Cod sursa (job #1208164)
#include <fstream>
#define INF 1000000000
using namespace std;
ifstream f("lapte.in");
ofstream g("lapte.out");
int n,l,i,j,k,t;
int cost[150][150],d[150][150],a[150],b[150];
void write_sol(int x, int y, int z)
{
if(x!=0) {
write_sol(x-1,y-cost[x][y],y);
g<<cost[x][y]<<" "<<(t-cost[x][y]*a[x])/b[x]<<"\n";
}
}
int main()
{
f>>n>>l;
for(i=1;i<=n;i++)
f>>a[i]>>b[i];
for(t=1;t<=100;t++)
{
for(i=0;i<=n;i++)
for(j=0;j<=l;j++)
d[i][j]=-INF;
d[0][0]=0;
for(i=1;i<=n;i++)
for(j=0;j<=l;j++)
for(k=0;k*a[i]<=t;k++)
if(d[i][j]<d[i-1][j-k]+(t-k*a[i])/b[i])
{
cost[i][j]=k;
d[i][j]=d[i-1][j-k]+(t-k*a[i])/b[i];
}
if(d[n][l]>=l)
{
g<<t<<"\n";
write_sol(n,l,t);
break;
}
}
return 0;
}