Pagini recente » Cod sursa (job #133980) | Cod sursa (job #3127509) | Cod sursa (job #158144) | Cod sursa (job #2538946) | Cod sursa (job #2574195)
#include <fstream>
using namespace std;
ifstream fin("diamant.in");
ofstream fout("diamant.out");
const int c = 44100;
const int r = 10000;
int v[401];
int dp[2][2*44100+1];
int main()
{
int smax = 0, n, m, i, j, x;
fin >> n >> m >> x;
for (i = 1; i<=n; i++)
for (j = 1; j<=m; j++)
{
smax = smax + i*j;
v[(i-1)*m+j] = i*j;
}
if (x < 0)
x = -x;
if (x > smax)
{
fout << 0;
return 0;
}
for (i = 1; i<=n*m; i++)
{
for (j = -smax; j<=smax; j++)
dp[1][j+c] = 0;
dp[1][v[i]+c] = dp[1][-v[i]+c] = 1;
for (j = -smax+v[i]; j<=smax; j++)
dp[1][j+c] += dp[0][j-v[i]+c];
for (j = smax-v[i]; j>=-smax; j--)
dp[1][j+c] += dp[0][j+v[i]+c];
for (j = -smax; j<=smax; j++)
dp[0][j+c] = (dp[0][j+c] + dp[1][j+c])%r;
}
fout << dp[0][x+c];
return 0;
}