Pagini recente » Cod sursa (job #1597695) | Cod sursa (job #1641651) | Cod sursa (job #2603587) | Cod sursa (job #2494881) | Cod sursa (job #2260325)
#pragma once
#include<iostream>
#include<fstream>
#include<algorithm>
#include<vector>
using namespace std;
#define MM 3*49100
ifstream fin("diamant.in");
ofstream fout("diamant.out");
int dp[2][MM]; // dp[i][j] nr moduri in care din primele i elem obtii greutatea j
int N, M, X;
void bu(int n, int m, int x) {
int k = 0;
dp[0][44100] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
k++;
for (int g = 0; g <= 2 * 44100; g++) {
dp[k % 2][g] = (dp[(k - 1) % 2][g] + dp[(k - 1) % 2][g - i * j] + dp[(k - 1) % 2][g + i * j]) % 10000;
}
}
}
fout << dp[k % 2][x + 44100];
}
int main() {
fin >> N >> M >> X;
if (X<-44100 || X>44100)
fout << 0;
else
bu(N, M, X);
return 0;
}