Pagini recente » Cod sursa (job #1919504) | Cod sursa (job #2530944) | Cod sursa (job #498112) | Cod sursa (job #2344842) | Cod sursa (job #2114629)
#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, f[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] = 1;
for( int i = 1; i <= K; i++ ){
for( int j = MAX; j >= - MAX; j-- )
if( D[j + MAX] != 0 && j + v[i] <= MAX )
D[ j + MAX + v[i] ] = ( D[j + MAX] + D[ j + MAX + v[i] ] ) % MOD, f[ j + MAX + v[i] ] = 1;
for( int j = -MAX; j <= MAX; j++ )
if( D[j + MAX] != 0 && j - v[i] >= -MAX && f[j + MAX] == 0 )
D[ j + MAX - v[i] ] = ( D[ j + MAX - v[i] ] + D[j + MAX] ) % MOD;
memset( f, 0, sizeof(f) );
}
fout << D[X + MAX] % MOD << "\n";
return 0;
}