Pagini recente » Cod sursa (job #3223399) | Cod sursa (job #686098) | Cod sursa (job #2944728) | Cod sursa (job #504759) | Cod sursa (job #1775641)
#include <fstream>
using namespace std;
ifstream f("diamant.in");
ofstream g("diamant.out");
int d[3][21],gg,w[401],n,m,k,yx;
void sc()
{
int i;
for (i=1;i<=gg;i++)
{
d[1][i]=d[2][i];
}
}
int main()
{
int i,j;
f>>n>>m>>gg;
if (gg<0)gg=gg*(-1);
for (i=1;i<=n;i++)
{
for (j=1;j<=m;j++)
{
w[++k]=i*j;
}
}
d[0][0]=1;
yx=gg;
for (i=1;i<=k;i++)
{
for (j=0;j<=yx;j++)
{
if (w[i]<=j)
{
d[2][j]=max(d[1][j],d[1][j-w[i]]+1);
}
else
{
d[2][j]=d[1][j];
}
}
sc();
}
g<<d[1][yx];
return 0;
}