Pagini recente » Cod sursa (job #951833) | Cod sursa (job #1868243) | Cod sursa (job #523000) | Cod sursa (job #1261578) | Cod sursa (job #2516887)
#include <bits/stdc++.h>
using namespace std;
const string file = "diamant";
ifstream fin(file +".in");
ofstream fout(file+".out");
int An[1<<16];
int Ap[1<<16];
int Bn[1<<16];
int Bp[1<<16];
int i,j,n,m,k;
#define A(i) (((i)<0)?(An[-(i)]):(Ap[(i)]))
#define B(i) (((i)<0)?(Bn[-(i)]):(Bp[(i)]))
#define li -50000
#define ls 50000
int main()
{
fin>>n>>m>>k;
if (k>ls){
fout<<0<<"\n";
return 0;
}
A(0)=1;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++){
memcpy(Bn,An,sizeof(An));
memcpy(Bp,Ap,sizeof(Bp));
for (int t=ls;t>=li;t--){
A(t)=B(t-i*j)+B(t)+B(t+i*j);
A(t)%=10000;
}
}
fout<<A(k)<<"\n";
return 0;
}