Pagini recente » Cod sursa (job #577961) | Cod sursa (job #2736251) | Cod sursa (job #893819) | Cod sursa (job #1515826) | Cod sursa (job #3153825)
#include <iostream>
#include <map>
#define pb push_back
#define int long long
using namespace std;
//ifstream cin("diamant.in");
//ofstream cout("diamant.out");
using pii = pair<int,int>;
const int mod = 1e4;
const int add = 44100;
int dp[2][add*2+1];
int n , m , x;
signed main()
{
cin >> n >> m >> x;
int d = 0;
for(int i = 1 ; i <= n ; i++)
{
for(int j = 1 ; j <= m ; j++) d += i*j;
}
int h = d*2;
int cnt = 0;
dp[0][d] = 1;
for(int i = 1 ; i <= n ; ++i)
{
for(int j = 1 ; j <= m ; ++j)
{
++cnt;
int p = (cnt&1);
for(int l = 0 ; l <= h ; ++l)
{
dp[p][l] = dp[1-p][l];
}
for(int l = 0 ; l <= h-i*j ; ++l)
{
dp[p][l+i*j] = (dp[p][l+i*j] + dp[1-p][l])%mod;
}
for(int l = i*j ; l <= h ; ++l)
{
dp[p][l-i*j] = (dp[p][l-i*j] + dp[1-p][l])%mod;
}
}
}
cout << dp[cnt&1][x+d];
return 0;
}