Pagini recente » Cod sursa (job #2093024) | Cod sursa (job #303824) | Cod sursa (job #293035) | Cod sursa (job #2623223) | Cod sursa (job #1876889)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("diamant.in");
ofstream fout("diamant.out");
int n,m,x;
int v[405],act[100005],pre[100005],lg,s,S0;
const int mod=10000;
int main()
{
fin>>n>>m>>x;
if(x>44100 || x<-44100)
{
fout<<0;
return 0;
}
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
v[++lg]=i*j;
S0=50000;
for(int j=S0-1;j<=S0+1;j++)pre[j]=1;
s=1;
for(int i=2;i<=lg;i++)
{
s+=v[i];
for(int j=S0-s;j<=S0+s;j++)
act[j]=(pre[j-v[i]]%mod+pre[j+v[i]]%mod+pre[j]%mod)%mod;
for(int j=S0-s;j<=S0+s;j++)
pre[j]=act[j];
}
fout<<pre[S0+x];
return 0;
}