Pagini recente » Cod sursa (job #2539760) | Cod sursa (job #686672) | Cod sursa (job #290355) | Cod sursa (job #1281847) | Cod sursa (job #1698127)
#include <iostream>
#include<fstream>
using namespace std;
int v[90005],aux[90005],n,m,x,k,c,nmax,fix;
int main()
{
ifstream f("diamant.in");
ofstream g("diamant.out");
f>>n>>m>>x;
nmax=(m*(m+1)/2)*(n*(n+1)/2);
v[0]=1;
aux[0]=1;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
k=i*j;
fix=2*nmax-k;
for(int i1=fix;i1>=0;i1--)
{
if(aux[i1]!=0)
{v[i1+k]+=aux[i1];
v[i1+k]%=10000;}
}
k*=2;
fix=2*nmax-k;
for(int i1=fix;i1>=0;i1--)
{
if(aux[i1]!=0)
{v[i1+k]+=aux[i1];
v[i1+k]%=10000;}
aux[i1+k]=v[i1+k];
}
for(int i1=k;i1>=0;i1--) aux[i1]=v[i1];
}
if(x>nmax||x<(-nmax)) g<<'0';
else g<<v[x+nmax];
return 0;
}