Pagini recente » Cod sursa (job #570215) | Cod sursa (job #1396710) | Cod sursa (job #1781203) | Cod sursa (job #3273954) | Cod sursa (job #2239494)
#include <bits/stdc++.h>
#define N 45000
using namespace std;
ifstream fin("diamant.in") ;
ofstream fout("diamant.out") ;
int dp[5][3*N] ;
int main()
{
int n , m , x , i , j , ii , p , q ;
fin >> n >> m >> x ;
p = 0 ;
q = 1 ;
dp[0][N] = 1 ;
for ( i = 1 ; i <= n ; i++ )
{
for ( j = 1 ; j <= m ; j++ )
{
p = 1-p ;
q = 1-p ;
for ( ii = 0 ; ii <= 2*N ; ii++ )
{
dp[p][ii] = ( dp[q][ii] + dp[q][ii-i*j] + dp[q][ii+i*j] ) % 10000 ;
}
}
}
if ( x < -45000 || x > 45000 )
fout << "0" ;
else
fout << dp[p][x+N] ;
}