Pagini recente » Cod sursa (job #1293641) | Cod sursa (job #1235446) | Cod sursa (job #1178868) | Cod sursa (job #2938432) | Cod sursa (job #1278906)
#include<bits/stdc++.h>
using namespace std;
ifstream fin("diamant.in");
ofstream fout("diamant.out");
const int MODULO=10000;
const int NMAX=25;
const int XMAX=50000;
int n,m,x;
int dp[2][XMAX];
int main()
{
int i,j,l,aux,linie=0;
fin>>n>>m>>x;
dp[0][0]=1;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
{
aux=i*j;linie=linie^1;
for (l=0;l<=45000;l++)
dp[linie][l]=(dp[linie^1][l]+dp[linie^1][l+aux]+dp[linie^1][abs(l-aux)])%MODULO;
}
x=abs(x+0);
if (x>=0 && x<XMAX) fout<<dp[linie][x]<<"\n";
else fout<<"0\n";
return 0;
}