Pagini recente » Cod sursa (job #1125601) | Cod sursa (job #2027903) | Cod sursa (job #523161) | Cod sursa (job #151999) | Cod sursa (job #3228917)
#include <fstream>
#include <iostream>
#include <vector>
#define NMAX 100000
#define MOD 10000
using namespace std;
ifstream fin("diamant.in");
ofstream fout("diamant.out");
int dp[NMAX*2+9];
int dp1[NMAX*2+9];
long long int n,m,k,sum;
int main()
{
fin>>n>>m>>k;
dp[NMAX]=1;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
sum+=i*j;
if(k>0 && k>sum || sum<-1*k && k<=0)
{
fout<<0;
return 0;
}
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
int aux=i*j;
for(int g=NMAX+sum;g>=NMAX-sum;g--)
{
if(g-aux>=NMAX-sum)
dp1[g]=(dp1[g]+dp[g-aux])%MOD;
if(g+aux<=NMAX+sum)
dp1[g]=(dp1[g]+dp[g+aux])%MOD;
dp1[g]=(dp1[g]+dp[g])%MOD;
}
for(int g=NMAX+sum;g>=NMAX-sum;g--)
{
//if(dp1[g])
dp[g]=dp1[g]%MOD;
dp1[g]=0;
}
}
fout<<dp[NMAX+k];
return 0;
}