Pagini recente » Cod sursa (job #1833223) | Cod sursa (job #1842506) | Cod sursa (job #2285035) | Cod sursa (job #873118) | Cod sursa (job #2529893)
#include <iostream>
#include <fstream>
using namespace std;
int sum, m, n, x, dp[88210], dp1[88210], dp2[88210];
int main()
{
ifstream cin("diamant.in");
ofstream cout("diamant.out");
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m >> x;
if(x < 0) x = -x;
if(x > 44100)
{ cout << 0 << '\n';
return 0;
}
dp[0] = 1;
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
{ int val = i * j;
sum += val;
for(int i=sum; i>=-sum; i--)
{ if(i < 0) dp1[i+88200] = dp[i-val+88200];
else if(i >= 0 && i - val < 0) dp1[i] = dp[i-val+88200];
else dp1[i] = dp[i-val];
}
for(int i=-sum; i<=sum; i++)
{ if(i >= 0) dp[i] = (dp[i] + dp1[i] + dp[i+val]) % 10000;
else if(i < 0 && i+val >= 0) dp[i+88200] = (dp[i+88200] + dp1[i+88200] + dp[i+val]) % 10000;
else dp[i+88200] = (dp[i+88200] + dp1[i+88200] + dp[i+val+88200]) % 10000;
}
}
cout << dp[x] << '\n';
return 0;
}