Pagini recente » Cod sursa (job #1145062) | Cod sursa (job #2592603) | Cod sursa (job #3171178) | Cod sursa (job #216250) | Cod sursa (job #1092399)
#include <fstream>
#include <cstring>
#define MOD 10000
using namespace std;
ifstream f("diamant.in");
ofstream g("diamant.out");
int N,M,X;
long long Sums[2*44100+5],Sums2[2*44100+5];
void Read()
{
f>>N>>M>>X;
}
void Compute_Vector()
{
int i,j,k;
if(X>44100 || X<-44100)
{
g<<0<<"\n";
return;
}
Sums[44100]=1;
for(i=1;i<=N;i++)
for(j=1;j<=M;j++)
{
memcpy(Sums2,Sums,sizeof(Sums));
memset(Sums,0,sizeof(Sums));
for(k=-44100;k<=44100;k++)
Sums[k+44100]=(Sums2[k+44100]+Sums2[k+i*j+44100]+Sums2[k-i*j+44100])%MOD;
}
g<<Sums[X+44100]<<"\n";
}
int main()
{
Read();
Compute_Vector();
return 0;
}