Cod sursa(job #1905868)
Utilizator | Data | 6 martie 2017 11:26:06 | |
---|---|---|---|
Problema | Lapte | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream f("lapte.in");
ofstream g("lapte.out");
int n,L,T,i,j,l,x,d[102][102];
struct abc
{
int a,b;
}t[102];
int main()
{
f>>n>>L>>T;
for(i=1;i<=n;i++)
f>>t[i].a>>t[i].b;
for(i=1;i<=n;i++)
{
for(l=0;l<=T/t[i].a;l++)
{
x=(T-l*t[i].a)/t[i].b;
for(j=0;j<=L;j++)
d[i][j]=max(d[i][j-l]+x,d[i][j]);
}
}
i=1;
return 0;
}