Pagini recente » Cod sursa (job #864055) | Cod sursa (job #3265928) | Cod sursa (job #3136350) | Cod sursa (job #590047) | Cod sursa (job #1838003)
#include <bits/stdc++.h>
#define MAXSUM 44100
#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;
r=1;
dp[0][sum]=1;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++){
for(p=i*j;p<=2*sum;p++){
dp[r][p]+=dp[1-r][p-i*j];
if(dp[r][p]>=MOD)
dp[r][p]-=MOD;
}
for(p=0;p+i*j<=2*sum;p++){
dp[r][p]+=dp[1-r][p+i*j];
if(dp[r][p]>=MOD)
dp[r][p]-=MOD;
}
for(p=0;p<=2*sum;p++){
dp[r][p]+=dp[1-r][p];
if(dp[r][p]>=MOD)
dp[r][p]-=MOD;
}
r=(r+1)%2;
}
fout << dp[1-r][x+sum];
fin.close();
fout.close();
return 0;
}