Pagini recente » Cod sursa (job #2613437) | Cod sursa (job #622494) | Cod sursa (job #389) | Cod sursa (job #343169) | Cod sursa (job #2701309)
#include <bits/stdc++.h>
using namespace std;
ifstream f("diamant.in");
ofstream g("diamant.out");
int n,m,dp[100005],l;
long long sum,s;
int main()
{
f>>n>>m>>s;
if(s<0)
s=-s;
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
sum=sum+i*j;
s=sum-s;
dp[0]=1;
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
for(int l=s;l>=i*j;--l)
{
dp[l]+=dp[l-i*j];
if(l>=2*i*j)
dp[l]+=dp[l-2*i*j];
dp[l]=dp[l]%10000;
}
g<<dp[s];
}