Pagini recente » Cod sursa (job #17234) | Romanii medaliati la IOI | Cod sursa (job #2317561) | Cod sursa (job #3178478) | Cod sursa (job #1093915)
#include <fstream>
using namespace std;
int DP1[90000];
int DP2[90000];
#define DP1 (DP1 + 45000)
#define DP2 (DP2 + 45000)
#define MOD 10000
ifstream is ("diamant.in");
ofstream os ("diamant.out");
int n, m, p, sum;
int main()
{
is >> n >> m >> p;
if (p > 44100 || p < -44100)
{
os << 0;
return 0;
}
DP2[0] = 1;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= m; ++j)
{
sum += i*j;
for (int k = -sum; k <= +sum; ++k)
{
DP1[k] = DP2[k];
DP2[k] = 0;
}
for (int k = -sum; k <= +sum; ++k)
DP2[k] = (DP1[k] + DP1[k+i*j] + DP1[k-i*j])%MOD;
}
os << DP2[p];
is.close();
os.close();
return 0;
}