Pagini recente » Cod sursa (job #346007) | Cod sursa (job #2947481) | Cod sursa (job #2167624) | Cod sursa (job #1221073) | Cod sursa (job #1386893)
#include <fstream>
#include <algorithm>
#include <string.h>
#define MOD 10000
using namespace std;
ifstream fin("diamant.in");
ofstream fout("diamant.out");
long int a[90010],b[90010],vect[1000],i,j,n,m,s,h,sum,p,pp,k;
int main()
{
fin>>n>>m>>s;
if(s<=-44100||s>=44100)
fout<<0;
else
{
a[44100]=1;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
p=i*j;
pp+=p;
for(k=44100+pp;k>=44100-pp;k--)
b[k]=(a[k]+a[k-p]+a[k+p])%MOD;
memcpy(a,b,sizeof(b));
}
}
fout<<a[s+44100]%MOD;
}
return 0;
}