Pagini recente » Cod sursa (job #1528824) | Cod sursa (job #631040) | Cod sursa (job #1133830) | Cod sursa (job #1668469) | Cod sursa (job #2223261)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("diamant.in");
ofstream fout("diamant.out");
const int MOD=1e4;
int n,m,x,maxim,lg;
int v[402],dp[2][91003];
int main()
{
fin>>n>>m>>x;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
maxim+=i*j;
v[++lg]=i*j;
}
if(abs(x)>maxim)
{
fout<<0<<"\n";
return 0;
}
int lin=0;
x+=45000;
dp[lin][45000]=1;
for(int i=1;i<=lg;i++)
{
lin=1-lin;
for(int j=0;j<=90000;j++)
{
dp[lin][j]=dp[1-lin][j];
if(j>=v[i])dp[lin][j]+=dp[1-lin][j-v[i]];
dp[lin][j]+=dp[1-lin][j+v[i]];
dp[lin][j]%=MOD;
}
}
fout<<dp[lin][x]<<"\n";
fin.close();
fout.close();
return 0;
}