Pagini recente » Cod sursa (job #1222829) | Cod sursa (job #925546) | Cod sursa (job #2727966) | Cod sursa (job #524869) | Cod sursa (job #2298918)
#include <fstream>
#define MOD 10000
using namespace std ;
ifstream f ("diamant.in") ;
ofstream g ("diamant.out") ;
int v [ 44105 ] ;
int main ()
{
long long s = 0 , l ;
int n , m ; f >> n >> m >> l ;
if ( l < 0 ) l *= -1 ;
v [ 0 ] = 1 ;
for ( int i = 1 ; i <= n ; ++ i )
for ( int j = 1 ; j <= m ; ++ j )
s += i * j ;
if ( l > s ) { g << 0 ; return 0 ; }
if ( s == l ) { g << 1 ; return 0 ; }
s -= l ;
for ( int i = 1 ; i <= n ; ++ i )
for ( int j = 1 ; j <= m ; ++ j )
for ( int k = s ; k >= i * j ; -- k )
{
v [ k ] += v [ k - i * j ] ;
if ( k >= 2 * i * j ) v [ k ] += v [ k - 2 * i * j ] ;
v [ k ] %= MOD ;
}
g << v [ s ] << "\n" ;
return 0 ;
}