Pagini recente » Cod sursa (job #2250708) | Cod sursa (job #2167106) | Cod sursa (job #285306) | Cod sursa (job #1872178) | Cod sursa (job #2397853)
#include <vector>
#include <fstream>
using std::vector;
const int MOD = 10000;
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];
dp[0].resize(2 * dim + 1);
dp[1].resize(2 * dim + 1);
bool ind = false;
dp[ind][dim] = 1;
for (int i = 1; i <= m; i++)
for (int j = 1; j <= n; j++) {
for (int k = 0; k < (int) dp[ind].size(); k++)
dp[!ind][k] = dp[ind][k];
for (int k = (int) dp[ind].size() - 1; k >= 0; k--)
if (k + i * j < (int) dp[ind].size())
dp[!ind][k + i * j] = (dp[!ind][k + i * j] + dp[ind][k]) % MOD;
for (int k = 0; k < (int) dp[ind].size(); k++)
if (k - i * j >= 0)
dp[!ind][k - i * j] = (dp[!ind][k - i * j] + dp[ind][k]) % MOD;
ind ^= true;
}
fout << dp[ind][dim + x] << '\n';
fout.close();
return 0;
}