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