Pagini recente » Cod sursa (job #3131572) | Cod sursa (job #2686755) | Cod sursa (job #1269601) | Cod sursa (job #889851) | Cod sursa (job #781466)
Cod sursa(job #781466)
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;
int N, M, X, dp[165010][2], Smax;
int main()
{
freopen("diamant.in", "r", stdin);
freopen("diamant.out", "w", stdout);
int i, j, k;
scanf("%i %i %i", &N, &M, &X);
for(i = 1; i <= N; i++)
for(j = 1; j <= M; j++)
Smax += i * j;
dp[0][0] = 1;
for(i = 1; i <= N; i++)
{
for(j = 1; j <= M; j++)
{
for(k = 0; k <= Smax; k++)
dp[k][1] = (dp[k][0] + dp[k + i * j][0] + dp[abs(k - i * j)][0]) % 10000;
for(k = 0; k <= Smax; k++) dp[k][0] = dp[k][1];
}
}
if(Smax < abs(X)) printf("0\n");
else printf("%i\n", dp[abs(X)][0]);
return 0;
}