Pagini recente » Cod sursa (job #2508215) | Cod sursa (job #2603120) | Cod sursa (job #250401) | Cod sursa (job #1010155) | Cod sursa (job #2520886)
#include <fstream>
using namespace std;
ifstream fin("diamant.in");
ofstream fout("diamant.out");
const int r = 10000;
const int c = 50000;
int main()
{
int n, m, x, i, j, l;
int a[401], k = 0, s = 0;
int dp[2][100001] = {};
//dp[i] = numarul de diamante de calitate i;
fin >> n >> m >> x;
for (i = 1; i<=n; i++)
for (j = 1; j<=m; j++)
{
k++;
a[k] = i*j;
s = s + a[k];
}
if (s < abs(x))
{
fout << 0;
return 0;
}
l = 0;
/*
for (i = -s; i<=s; i++)
fout << i << ' ';
fout << '\n';
*/
for (i = 1; i<=k; i++, l = 1-l)
{
for (j = -s; j<=s; j++)
dp[l][c+j] = (dp[1-l][c+j] + dp[1-l][c+j-a[i]] + dp[1-l][c+j+a[i]])%r;
dp[l][c+a[i]]++;
dp[l][c-a[i]]++;
/*
for (j = -s; j<=s; j++)
fout << dp[l][c+j] << " ";
fout << '\n';
*/
}
fout << (dp[1-l][c+x])%r;
return 0;
}