Pagini recente » Cod sursa (job #731742) | Cod sursa (job #1147704) | Cod sursa (job #3239193) | Cod sursa (job #1498410) | Cod sursa (job #2564292)
#include <bits/stdc++.h>
using namespace std;
ifstream f("diamant.in");
ofstream g("diamant.out");
int n,m,i,j,s,dp[1000000],sum,l;
int main()
{
f>>n>>m>>s;
if(s<0)s=-s;
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)sum=sum+i*j;
if(s==0){g<<1;return 0;}
if(s==sum){g<<1;return 0;}
if(s>sum/2)s=sum-s;
dp[0]=1;
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)
for(l=s; l>=i*j; l--)
{
dp[l]+=dp[l-i*j];
if(l>=2*i*j)
dp[l]+=dp[l-2*i*j];
dp[l]=dp[l]%10000;
}
g<<dp[s];
}