Pagini recente » Cod sursa (job #467495) | Cod sursa (job #1046770) | Cod sursa (job #628274) | Cod sursa (job #3190412) | Cod sursa (job #2397742)
#include <vector>
#include <fstream>
using std::vector;
std::ifstream fin("diamant.in");
std::ofstream fout("diamant.out");
int main() {
int m, n, x;
fin >> m >> n >> x;
int dim = (m * (m + 1) / 2) * (n * (n + 1) / 2);
if (!(-dim <= x && x <= dim)) {
fout << "0\n";
fout.close();
return 0;
}
vector<int> dp(2 * dim + 1);
vector<int> dp1(2 * dim + 1);
vector<int> dp2(2 * dim + 1);
dp[dim] = 1;
for (int i = 1; i <= m; i++)
for (int j = 1; j <= n; j++) {
for (int k = 0; k < (int) dp.size(); k++)
dp1[k] = dp[k];
for (int k = (int) dp1.size() - 1; k >= 0; k--)
if (k + i * j < (int) dp1.size())
dp1[k + i * j] += dp1[k];
for (int k = 0; k < (int) dp.size(); k++)
dp2[k] = dp[k];
for (int k = 0; k < (int) dp2.size(); k++)
if (k - i * j >= 0)
dp2[k - i * j] += dp2[k];
for (int k = 0; k < (int) dp.size(); k++)
dp[k] = (dp1[k] + dp2[k] - dp[k]) % 10000;
}
fout << dp[dim + x] << '\n';
fout.close();
return 0;
}