Pagini recente » Cod sursa (job #619676) | Cod sursa (job #1132855) | Cod sursa (job #1759380) | Cod sursa (job #2568214) | Cod sursa (job #2114670)
#include<fstream>
#include<cstring>
using namespace std;
ifstream fin("diamant.in");
ofstream fout("diamant.out");
const int MOD = 10000;
int D[88205], N, M, X, v[405], K, MAX, D1[88205];
int main(){
fin >> N >> M >> X;
for( int i = 1; i <= N; i++ )
for( int j = 1; j <= M; j++ )
v[++K] = i * j;
MAX = N * (N + 1) * M * (M + 1) / 4;
if( X > MAX || X < -MAX ){
fout << "0\n";
return 0;
}
D[MAX] = D1[MAX] = 1;
for( int i = 1; i <= K; i++ ){
for( int j = -MAX; j <= MAX; j++ ){
if( j - v[i] >= -MAX )
D1[j - v[i] + MAX] = ( D1[j - v[i] + MAX] + D[j + MAX] ) % MOD;
if( j + v[i] <= MAX )
D1[j + v[i] + MAX] = ( D1[j + v[i] + MAX] + D[j + MAX] ) % MOD;
}
memcpy( D, D1, sizeof(D1) );
}
fout << D[X + MAX] % MOD << "\n";
return 0;
}