Pagini recente » Cod sursa (job #2926931) | Cod sursa (job #1914153) | Cod sursa (job #408676) | Cod sursa (job #2645016) | Cod sursa (job #2696037)
#include <fstream>
using namespace std;
ifstream fin ("diamant.in");
ofstream fout ("diamant.out");
int v[50001],dp1[100001],dp2[100001];
int main ()
{
int nr=0,s=0,n,m,x,i,j;
fin>>n>>m>>x;
if (x<0)
x=-x;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
{
nr++;
v[nr]=i*j;
s+=v[nr];
}
if (x>s)
fout<<0;
else
{
dp1[s]=1;
for (i=1;i<=nr;i++)
{
for (j=0;j<=2*s;j++)
dp2[j]=dp1[j];
for (j=0;j<=2*s;j++)
{
if (j-v[i]>=0)
dp1[j]+=dp2[j-v[i]];
if (j+v[i]<=2*s)
dp1[j]+=dp2[j+v[i]];
dp1[j]%=10000;
}
}
fout<<dp1[x+s];
}
return 0;
}