Pagini recente » Cod sursa (job #209037) | Cod sursa (job #2553760) | Cod sursa (job #990720) | Cod sursa (job #872493) | Cod sursa (job #2664574)
//#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("diamant.in");
ofstream cout("diamant.out");
int n,m,x,sum=0,v[405],d[3][200005],cnt=0;
int main()
{
cin>>n>>m>>x;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
sum+=i*j;
v[++cnt]=i*j;
}
}
if(abs(x)>sum){
cout<<0;
return 0;
}
d[0][45000]=1;
sum+=45000;
x+=45000;
for(int i=1;i<=n*m;i++){
for(int j=0;j<=100005;j++){
d[i%2][j]=d[(i+1)%2][j+v[i]]+d[(i+1)%2][j];
if(v[i]<=j){
d[i%2][j]+=d[(i+1)%2][j-v[i]];
}
d[i%2][j]%=10000;
}
}
cout<<d[cnt%2][x];
return 0;
}