Pagini recente » Cod sursa (job #2942126) | Cod sursa (job #2049599) | Cod sursa (job #2454629) | Cod sursa (job #20267) | Cod sursa (job #2366418)
#include <bits/stdc++.h>
#define MOD 10000
using namespace std;
ifstream fin ( "diamant.in" );
ofstream fout ( "diamant.out" );
long long DP [2][80005];
int main()
{
long long n, m, X, i, j, vmax=0;
fin >> n >> m >> X;
for( i = 1; i <= n; i ++ ){
for ( j = 1; j <= m; j ++ )
vmax += i * j;
}
X = abs (X);
if( vmax < X ){
fout << 0;
return 0;
}
long long k , alt = 0;
DP [1] [0] = 1;
for( i = 1; i <= n; i ++){
for( j = 1; j <= m; j ++, alt ^= 1){
for( k = 0; k <= vmax; k ++ ){
DP [alt] [k] = ( DP [alt ^ 1] [abs( k - i * j )] + DP [alt ^ 1] [k] + DP [alt ^ 1] [k + i * j] ) % MOD;
}
}
}
fout << DP [alt^1] [X] << "\n";
return 0;
}