Pagini recente » Cod sursa (job #2612859) | Cod sursa (job #2428704) | Cod sursa (job #1436521) | Cod sursa (job #312143) | Cod sursa (job #1435854)
#include <fstream>
using namespace std;
ifstream fin ("diamant.in");
ofstream fout ("diamant.out");
const int seredinu = 45000;
int N, M, X, V[90100], A[90010];
int main()
{
fin >> N >> M >> X;
if (X > 44000 || X < -44000) fout << "0\n";
else
{
V[seredinu] = A[seredinu] = 1;
for (int i = 1; i <= N; i++)
{
for (int j = 1; j <= M; j++)
{
int val = (i * j);
for (int k = 1; k <= 90000; k++)
{
if (V[k])
{
A[k + val] = (A[k + val] + V[k]) % 10000;
A[k - val] = (A[k - val] + V[k]) % 10000;
}
}
for (int k = 1; k <= 90000; k++) V[k] = A[k];
}
}
fout << V[X + seredinu] << '\n';
}
fout.close();