Pagini recente » Cod sursa (job #2831824) | Cod sursa (job #673341) | Cod sursa (job #1562983) | Cod sursa (job #2677246) | Cod sursa (job #425851)
Cod sursa(job #425851)
#include<stdio.h>
const int pur[]={-1,0,1};
int n,m,x,rez;
void afis()
{
for( int i=1 ; i<=n ; ++i,printf("\n") )
for( int j=1 ; j<=m ; ++j )
//printf("%d ",mp[i][j]);
printf("\n\n\n");
}
void bec( int i,int j,int p )
{
if(i==n+1)
{
//afis();
if(p==x)
++rez;
return;
}
if( j==m )
{
for( int o=0 ; o<=2 ; ++o )
{
//mp[i][j]=pur[o];
bec(i+1,1,p+i*j*pur[o]);
}
return;
}
for( int o=0 ; o<=2 ; ++o )
{
//mp[i][j]=pur[o];
bec(i,j+1,p+i*j*pur[o]);
}
}
int main()
{
freopen("diamant.in","r",stdin);
freopen("diamant.out","w",stdout);
scanf("%d%d%d",&n,&m,&x);
bec(1,1,0);
printf("%d\n",rez);
return 0;
}