Pagini recente » Cod sursa (job #888553) | Cod sursa (job #2397007) | Cod sursa (job #2492975) | Cod sursa (job #2510459) | Cod sursa (job #1992258)
#include <bits/stdc++.h>
#define MOD 10000
using namespace std;
ifstream f("diamant.in");
ofstream g("diamant.out");
int w[45];
int a[45][44105];
int main()
{
int n,m,x,i,j,k;
f>>n>>m>>x;
k=0;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
w[++k]=i*j;
for(i=1;i<=k;i++)
for(j=1;j<=x;j++)
{
a[i][j]=a[i-1][j];
if(j-w[i]<0) continue;
if(a[i-1][j-w[i]]+1>a[i][j])
a[i][j]=(a[i-1][j-w[i]]+1)%MOD;
}
g<<a[k][x];
return 0;
}