Pagini recente » Cod sursa (job #2170537) | Cod sursa (job #3207767) | Cod sursa (job #2190959) | Cod sursa (job #2893858) | Cod sursa (job #2967321)
#include<iostream>
#include<fstream>
#define SUMAMAX 44100
using namespace std;
ifstream f("diamant.in");
ofstream g("diamant.out");
int dp[405][88200];
int n,m,x;
void citire()
{
f>>n>>m>>x;
}
void solve()
{
int summax = 0,sum = 0;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
summax = summax + i * j;
int casute = 0;
dp[0][SUMAMAX] = 1;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
sum = i * j;
summax = summax - sum;
int ma = max(-SUMAMAX + summax,x-summax);
int mi = min(SUMAMAX - summax, x + summax);
casute++;
for(int k = ma; k<= mi;k++)
{
dp[casute][k + SUMAMAX] = dp[casute-1][k + SUMAMAX];
dp[casute][k + SUMAMAX] += dp[casute-1][k - sum + SUMAMAX];
dp[casute][k + SUMAMAX] += dp[casute-1][k + sum + SUMAMAX];
dp[casute][k + SUMAMAX] = dp[casute][k + SUMAMAX] % 10000
}
}
}
g<<dp[n*m][SUMAMAX + x];
}
int main()
{
citire();
solve();
}