Pagini recente » Cod sursa (job #1743774) | Cod sursa (job #292787) | Cod sursa (job #951838) | Cod sursa (job #1255562) | Cod sursa (job #1374690)
#include <iostream>
#include <cstdio>
using namespace std;
#define mx 22
#define mod 10000
int n,m,x,t;
void back( int i , int j , int sum )
{
if ( j > m )
{
i ++ ;
j = 1 ;
}
if ( i == n + 1 )
{
if ( sum == x )
{
t++ ;
t %= mod ;
}
return ;
}
back( i , j + 1 , sum ) ;
back( i , j + 1 , sum + i * j ) ;
back( i , j + 1 , sum - i * j ) ;
}
int main()
{
freopen( "diamant.in" , "r" , stdin ) ;
freopen( "diamant.out" , "w" , stdout ) ;
scanf( "%d %d %d" , &n , &m , &x ) ;
back(1,1,0) ;
printf( "%d\n" , t ) ;
return 0;
}