Pagini recente » Cod sursa (job #1046354) | Cod sursa (job #2568407) | Cod sursa (job #727972) | Cod sursa (job #697711) | Cod sursa (job #1838017)
#include <bits/stdc++.h>
#define MAXSUM 45000
#define MOD 10000
int dp[2][2*MAXSUM+2];
int main(){
std::ifstream fin("diamant.in");
std::ofstream fout("diamant.out");
int n,m,x,i,j,p,r,sum;
fin >> n >> m >> x;
sum=0;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
sum+=i*j;
if(x>sum||x<-sum)
fout << 0;
else{
r=1;
dp[0][sum]=1;
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
memset(dp[r],0,sizeof(dp[r]));
for(p=0;p<=2*sum;p++){
if(p+i*j<=2*sum){
dp[r][p+i*j]+=dp[1-r][p];
if(dp[r][p+i*j]>=MOD)
dp[r][p+i*j]-=MOD;
}
if(p-i*j>=0){
dp[r][p-i*j]+=dp[1-r][p];
if(dp[r][p-i*j]>=MOD)
dp[r][p-i*j]-=MOD;
}
dp[r][p]+=dp[1-r][p];
}
r=(r+1)%2;
}
}
fout << dp[1-r][x+sum];
}
fin.close();
fout.close();
return 0;
}