Pagini recente » Cod sursa (job #2424354) | Cod sursa (job #58400) | Cod sursa (job #430776) | Cod sursa (job #2118454) | Cod sursa (job #2882505)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("diamant.in");
ofstream fout("diamant.out");
long long n, m, x, i, j;
vector <long long> d, dp;
const long long neg = 50000;
int main()
{
fin >> n >> m >> x; d.resize(100001); dp.resize(100001);
d[neg] = 1;
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++)
{
long long val = i*j;
dp = d;
for (long long k = 50000; k >= -50000; k--)
{
if (dp[neg+k] > 0)
{
d[neg+k+val] += dp[neg+k];
d[neg+k-val] += dp[neg+k];
d[neg+k+val] %= 10000;
d[neg+k-val] %= 10000;
}
}
}
if (x < 50000) fout << d[neg+x]%10000;
else fout << 0;
return 0;
}