id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
23,900 | //????????
int x[9][9] = {0}, y[9][9] = {0};
void scan()
{
int i, j;
for(i = 0; i < 9; i++)
for(j = 0; j < 9; j++)
{
if(x[i][j] != 0)
{
y[i][j] += x[i][j] * 2;
y[i-1][j] += x[i][j];
y[i+1][j] += x[i][j];
y[i-1][j-1] += x[i][j];
y[i-1][j+1] += x[i][j];
y[i+1][j-1] += x[i][j];
y[i+1][j+1] += x[i][j];
y[i][j-1] += x[i][j];
y[i][j+1] += x[i][j];
}
}
}
int main()
{
int m, n, i, j;
cin >> m >> n;
x[4][4] = m;
while(n--)
{
scan();
for(i = 0; i < 9; i++)
for(j = 0; j < 9; j++)
{
x[i][j] = y[i][j];
y[i][j] = 0;
}
}
for(i = 0; i < 9; i++)
for(j = 0; j < 9; j++)
{
cout << x[i][j];
if(j == 8)
cout << endl;
else
cout << " ";
}
return 0;
}
| 48 |
23,901 | int main()
{
int sz[9][9];
int sj[9][9];
int a,n,row,col,r,m,x,y;
scanf("%d %d",&a,&n);
for(row=0;row<9;row++)
{
for(col=0;col<9;col++)
{
sz[row][col]=0;
sj[row][col]=0;
}
}
sz[4][4]=a;
for(row=0;row<9;row++)
{
for(col=0;col<9;col++)
{
sj[row][col]=sz[row][col];
}
}
for(row=0;row<9;row++)
{
for(col=0;col<9;col++)
{
if(sz[row][col]!=0)
{
for(r=(row-1);r<=(row+1);r++)
{
for(m=(col-1);m<=(col+1);m++)
{
sj[r][m]+=sz[row][col];
}
}
}
}
}
if(n==1)
{
for(x=0;x<9;x++)
{
for(y=0;y<8;y++)
{
printf("%d ",sj[x][y]);
}
printf("%d\n",sj[x][y]);
}
}
for(row=0;row<9;row++)
{
for(col=0;col<9;col++)
{
sz[row][col]=sj[row][col];
}
}
for(row=0;row<9;row++)
{
for(col=0;col<9;col++)
{
if(sj[row][col]!=0)
{
for(r=row-1;r<=row+1;r++)
{
for(m=col-1;m<=col+1;m++)
{
sz[r][m]+=sj[row][col];
}
}
}
}
}
if(n==2)
{
for(x=0;x<9;x++)
{
for(y=0;y<8;y++)
{
printf("%d ",sz[x][y]);
}
printf("%d\n",sz[x][y]);
}
}
for(row=0;row<9;row++)
{
for(col=0;col<9;col++)
{
sj[row][col]=sz[row][col];
}
}
for(row=0;row<9;row++)
{
for(col=0;col<9;col++)
{
if(sz[row][col]!=0)
{
for(r=row-1;r<=row+1;r++)
{
for(m=col-1;m<=col+1;m++)
{
sj[r][m]+=sz[row][col];
}
}
}
}
}
if(n==3)
{
for(x=0;x<9;x++)
{
for(y=0;y<8;y++)
{
printf("%d ",sj[x][y]);
}
printf("%d\n",sj[x][y]);
}
}
for(row=0;row<9;row++)
{
for(col=0;col<9;col++)
{
sz[row][col]=sj[row][col];
}
}
for(row=0;row<9;row++)
{
for(col=0;col<9;col++)
{
if(sj[row][col]!=0)
{
for(r=row-1;r<=row+1;r++)
{
for(m=col-1;m<=col+1;m++)
{
sz[r][m]+=sj[row][col];
}
}
}
}
}
if(n==4)
{
for(x=0;x<9;x++)
{
for(y=0;y<8;y++)
{
printf("%d ",sz[x][y]);
}
printf("%d\n",sz[x][y]);
}
}
return 0;
}
| 48 |
23,902 | int main()
{
int a[9][9],b[9][9],i,j,k,m,n;
for(i=0;i<9;i++){
for(j=0;j<9;j++){
a[i][j]=0;
b[i][j]=0;
}
}
scanf("%d %d",&m,&n);
a[4][4]=m;
for(k=0;k<n;k++){
for(i=0;i<9;i++){
for(j=0;j<9;j++){
if(a[i][j]!=0){
b[i][j-1]+=a[i][j];
b[i][j+1]+=a[i][j];
b[i-1][j-1]+=a[i][j];
b[i-1][j]+=a[i][j];
b[i-1][j+1]+=a[i][j];
b[i+1][j-1]+=a[i][j];
b[i+1][j]+=a[i][j];
b[i+1][j+1]+=a[i][j];
b[i][j]+=a[i][j]*2;
}
}
}
for(i=0;i<9;i++){
for(j=0;j<9;j++){
a[i][j]=b[i][j];
b[i][j]=0;
}
}
}
for(i=0;i<9;i++){
for(j=0;j<8;j++){
printf("%d ",a[i][j]);
}
printf("%d\n",a[i][8]);
}
return 0;
}
| 48 |
23,903 | int m , n ;
int i , j ;
int a[11][11] = {{0}}, b[11][11] = {{0}};
void fz(int);
int main ()
{
cin >> m >> n ;
a[5][5] = m ;
fz(0);
return 0 ;
}
void fz(int x )
{
if ( x == n )
{
for (i = 1;i < 10;i ++)
{
cout << a[i][1];
for (j = 2;j < 10; j++)
{
cout << " " << a[i][j];
}
cout << endl ;
}
}
else
{
for (i = 4 - x ;i <= 6 + x;i ++)
{
for (j = 4 - x;j <= 6 + x;j ++)
{
b[i][j] = a[i+1][j+1]+a[i][j]+ a[i+1][j-1]+ a[i-1][j+1]+ a[i+1][j] + a[i-1][j] + a[i][j+1]+ a[i][j-1]+ a[i-1][j-1];
}
}
for (i = 4 - x ;i <= 6 + x;i ++)
{
for (j = 4 - x;j <= 6 + x;j ++)
{
a[i][j] += b[i][j];
b[i][j] = 0 ;
}
}
fz(x+1);
}
} | 48 |
23,904 | int a[9][9];
int b[9][9];
int main()
{
void sc(int i,int j);
int n,m,k,i,j;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{a[i][j]=0;b[i][j]=0;}
scanf("%d %d",&m,&n);
a[4][4]=m;
for(k=0;k<n;k++)
{
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
if(a[i][j]!=0) sc(i,j);
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
a[i][j]=b[i][j];b[i][j]=0;
}
}
for(i=0;i<9;i++)
{for(j=0;j<8;j++)
{printf("%d ",a[i][j]);}
printf("%d\n",a[i][8]);}
}
void sc(int i,int j)
{
b[i-1][j]+=a[i][j];
b[i+1][j]+=a[i][j];
b[i][j+1]+=a[i][j];
b[i][j-1]+=a[i][j];
b[i-1][j-1]+=a[i][j];
b[i-1][j+1]+=a[i][j];
b[i+1][j-1]+=a[i][j];
b[i+1][j+1]+=a[i][j];
b[i][j]=b[i][j]+a[i][j]*2;
}
| 48 |
23,905 | main()
{
int *p[6];
int day0[81],day1[81],day2[81],day3[81],day4[81],day5[81];
p[0]=day0;
p[1]=day1;
p[2]=day2;
p[3]=day3;
p[4]=day4;
p[5]=day5;
int m,n;//m??????????? n???????
scanf("%d %d",&m,&n);
int i,j,k;//??????
for(i=0;i<=n;i++)
{
for(j=0;j<81;j++)
{
p[i][j]=0;
}
//??????????????
}
p[0][40]=m;//??????????????
int add;//??
for(k=0;k<n;k++)
{
for(i=0;i<81;i++)
{
add=p[k][i];
p[k+1][i]+=2*add;
p[k+1][i-1]+=add;
p[k+1][i+1]+=add;
p[k+1][i-8]+=add;
p[k+1][i-9]+=add;
p[k+1][i-10]+=add;
p[k+1][i+8]+=add;
p[k+1][i+9]+=add;
p[k+1][i+10]+=add;
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
printf("%d",p[n][i*9+j]);
if(j<8) printf(" ");
else printf("\n");
}
}
}
| 48 |
23,906 | int xi[11][11]={0} , jun[11][11] ={0} ;
int i , j ;
void fanzhi(int t)
{
if(t == 0)
return ;
int jun[11][11] = {0} ;
for (i = 1 ; i <= 9 ; i ++)
{
for (j = 1 ; j <= 9 ; j ++)
{
jun[i-1][j-1] += xi[i][j] ;
jun[i-1][j] += xi[i][j] ;
jun[i-1][j+1] += xi[i][j] ;
jun[i][j-1] += xi[i][j] ;
jun[i][j+1] += xi[i][j] ;
jun[i+1][j-1] += xi[i][j] ;
jun[i+1][j] += xi[i][j] ;
jun[i+1][j+1] += xi[i][j] ;
}
}
for (i = 1 ; i <= 9 ; i ++)
{
for (j = 1 ; j <= 9 ; j ++)
xi[i][j] = 2 * xi[i][j] +jun[i][j] ;
}
fanzhi(t-1) ;
}
int main ()
{
int m , n ;
cin >> m >> n ;
xi[5][5] = m ;
fanzhi(n) ;
for (i = 1 ; i <= 9 ; i ++)
{
for (j = 1 ; j <= 9 ; j ++)
{
if(j>=2)
cout <<' ' ;
cout <<xi[i][j] ;
}
cout <<endl ;
}
return 0 ;
}
| 48 |
23,907 | int main()
{
long i,j,k,n,m,a[10][10],b[10][10];
for (j=1;j<=9;j++)
for (k=1;k<=9;k++)
a[k][j]=b[k][j]=0;
scanf("%d%d",&a[5][5],&n);
m=a[5][5];b[5][5]=m;
for (i=1;i<=n;i++)
{
for (j=1;j<=9;j++)
for (k=1;k<=9;k++)
if (a[k][j]!=0)
{
m=a[k][j];
b[k][j]=b[k][j]+m;b[k+1][j]=b[k+1][j]+m;b[k-1][j]=b[k-1][j]+m;
b[k][j+1]=b[k][j+1]+m;b[k][j-1]=b[k][j-1]+m;
b[k+1][j+1]=b[k+1][j+1]+m;b[k+1][j-1]=b[k+1][j-1]+m;
b[k-1][j-1]=b[k-1][j-1]+m;b[k-1][j+1]=b[k-1][j+1]+m;
}
for (j=1;j<=9;j++)
for (k=1;k<=9;k++)
a[k][j]=b[k][j];
}
for (j=1;j<=9;j++)
{
for (k=1;k<=8;k++)
printf("%d ",a[k][j]);
printf("%d\n",a[9][j]);
}
} | 48 |
23,908 | int main()
{
int a[9][9], b[9][9];
int m, n;
int i, j, k;
cin>>m;
cin>>n;
for(j=0;j<9;j++)
{
for(i=0;i<9;i++)
{
a[j][i]=0;
}
}
for(j=0;j<9;j++)
{
for(i=0;i<9;i++)
{
b[j][i]=0;
}
}
for(k=0;k<n;k++)
{
if(k==0)
{
a[4][4]=2*m;
a[3][3]=m;
a[3][4]=m;
a[3][5]=m;
a[4][3]=m;
a[4][5]=m;
a[5][3]=m;
a[5][4]=m;
a[5][5]=m;
}
if(k==1)
{
for(j=1;j<8;j++)
{
for(i=1;i<8;i++)
{
b[j][i]=2*a[j][i]+a[j-1][i-1]+a[j-1][i]+a[j-1][i+1]+a[j][i-1]+a[j][i+1]+a[j+1][i-1]+a[j+1][i]+a[j+1][i+1];
}
}
for(j=0;j<9;j++)
{
for(i=0;i<9;i++)
{
a[j][i]=b[j][i];
}
}
}
if(k==2)
{
for(j=1;j<8;j++)
{
for(i=1;i<8;i++)
{
b[j][i]=2*a[j][i]+a[j-1][i-1]+a[j-1][i]+a[j-1][i+1]+a[j][i-1]+a[j][i+1]+a[j+1][i-1]+a[j+1][i]+a[j+1][i+1];
}
}
for(j=0;j<9;j++)
{
for(i=0;i<9;i++)
{
a[j][i]=b[j][i];
}
}
}
if(k==3)
{
for(j=1;j<8;j++)
{
for(i=1;i<8;i++)
{
b[j][i]=2*a[j][i]+a[j-1][i-1]+a[j-1][i]+a[j-1][i+1]+a[j][i-1]+a[j][i+1]+a[j+1][i-1]+a[j+1][i]+a[j+1][i+1];
}
}
for(i=1;i<8;i++)
{
b[0][i]=a[1][i-1]+a[1][i]+a[1][i+1];
}
for(i=1;i<8;i++)
{
b[8][i]=a[7][i-1]+a[7][i]+a[7][i+1];
}
for(j=1;j<8;j++)
{
b[j][0]=a[j-1][1]+a[j][1]+a[j+1][1];
}
for(j=1;j<8;j++)
{
b[j][8]=a[j-1][7]+a[j][7]+a[j+1][7];
}
b[0][8]=b[8][8]=b[8][0]=b[0][0]=a[1][1];
for(j=0;j<9;j++)
{
for(i=0;i<9;i++)
{
a[j][i]=b[j][i];
}
}
}
}
for(j=0;j<9;j++)
{
for(i=0;i<8;i++)
{
cout<<a[j][i]<<" ";
}
cout<<a[j][8]<<endl;
}
return 0;
}
| 48 |
23,909 | int main()
{
int a,b,i,m,n;
int c[13][13];
for(a=1;a<=11;a++)
{
for(b=1;b<=11;b++)
{
c[a][b]=0;
}
}
int e[13][13];
scanf("%d%d\n",&m,&n);
c[6][6]=m;
for(i=1;i<=n;i++)
{
for(a=2;a<=10;a++)
{
for(b=2;b<=10;b++)
{
e[a][b]=2*c[a][b]+c[a-1][b-1]+c[a-1][b]+c[a-1][b+1]+c[a][b-1]+c[a][b+1]+c[a+1][b-1]+c[a+1][b]+c[a+1][b+1];
}
}
for(a=2;a<=10;a++)
{
for(b=2;b<=10;b++)
{
c[a][b]=e[a][b];
}
}
}
for(a=2;a<=10;a++)
{
for(b=2;b<=10;b++)
{
if(b==10) printf("%d\n",c[a][b]);
else printf("%d ",c[a][b]);
}
}
return 0;
}
| 48 |
23,910 | int a[10][10]={0},b[10][10]={0},n;
void t(int);
int main()
{
int m ,i,j;
cin >> m >> n;
a[4][4]=m;
t(1);
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
cout <<a[i][j];
if(j==8)
cout <<endl;
else cout << " ";
}
return 0;
}
void t(int m)
{
int i, j,l;
if(m==n+1)
return;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
b[i][j]=a[i][j];
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
if(a[i][j]!=0)
{
l=b[i][j];
a[i][j]+=2*l;
a[i-1][j]+=l;
a[i+1][j]+=l;
a[i][j-1]+=l;
a[i][j+1]+=l;
a[i+1][j+1]+=l;
a[i+1][j-1]+=l;
a[i-1][j-1]+=l;
a[i-1][j+1]+=l;
}
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
a[i][j]-=b[i][j];
t(m+1);
}
| 48 |
23,911 | //*************************************
//**Title:????????????? **
//**Author:??? **
//**Date?2013.12.7 **
//**File?2.cpp **
//****************************
int chess[15][15][5]; //chess[i][j][k]???k?????(i,j)????
int d; //????
int f(int i,int j,int k) //?????????k?????(i,j)????
{
if(i < 1 || i > 9 || j < 1 || j > 9) //??????????
return 0; //??0(??????????????)
if(chess[i][j][k]!=-1) //???????????????????
return chess[i][j][k]; //??????
//????????????????????????*2+??8??????
//???????????????????
chess[i][j][k] = f(i, j, k - 1) * 2 +
f(i, j - 1, k - 1) +
f(i, j + 1, k - 1) +
f(i + 1, j, k - 1)+
f(i - 1, j, k - 1)+
f(i - 1, j - 1, k - 1)+
f(i - 1, j + 1, k - 1)+
f(i + 1, j - 1, k - 1)+
f(i + 1, j + 1, k - 1);
return chess[i][j][k]; //??????
}
int main()
{
int i, j, t;
//?chess????????????
for(i = 1; i <= 9; i++)
{
for(j = 1; j <= 9; j++)
{
chess[i][j][0] = 0; //?0?????????????????0
for(t = 1; t <= 4; t++)
chess[i][j][t] = -1; //-1??????????????????
}
}
//??
cin >> chess[5][5][0] >> d;
//????????????d??(i,j)?????
for(i = 1; i <= 9; i++)
{
cout << f(i, 1, d);
for(j = 2; j <= 9; j++)
{
cout << " " << f(i, j, d);
}
cout << endl;
}
return 0;
}
| 48 |
23,912 | //**********************************
//*?????????.cpp *
//*? ????? *
//*? ??2013.12.4 *
//**********************************
void judge(int m , int n ,int (*p)[9])
{
int str[9][9] , i , j ;
if ( n == 0 ) //??n??0??????n???????
return ;
memcpy(str,p,sizeof(str)); //?p???str??????????????
for ( i = 0 ; i <= 8 ; i++ )
{
for ( j = 0 ; j <=8 ; j++ )
if (str[i][j] != 0)
{
if ( i != 0 ) //???????????????p???
{
if ( j != 0 )
p[i-1][j-1] += str[i][j] ;
if ( j != 8 )
p[i-1][j+1] += str[i][j] ;
p[i-1][j] += str[i][j] ;
}
if ( i != 8 )
{
if ( j != 0 )
p[i+1][j-1] += str[i][j] ;
if ( j != 8 )
p[i+1][j+1] += str[i][j] ;
p[i+1][j] += str[i][j] ;
}
if ( j != 0 )
p[i][j-1] += str[i][j] ;
if ( j != 8 )
p[i][j+1] += str[i][j] ;
p[i][j] += str[i][j] ;
}
}
judge(m,n-1,p); //?????
}
void output(int (*p)[9])
{
int i , j ;
for ( i = 0 ; i <= 8 ; i++ )
{
for ( j = 0 ; j <= 8 ; j++ )
{
cout << p[i][j] ;
if ( j != 8 )
cout << " " ;
else
cout << endl ;
}
}
}
int main ()
{
int m , n ,p[9][9]={0};
cin >> m >> n ;
p[4][4]=m;
judge(m,n,p); //????
output(p); //????
return 0 ;
} | 48 |
23,913 |
void propagate( int day ); //propagete????????????????day????
void print(); //?????
int a[9][9] = {0}, b[9][9] = {0}, m = 0; //a????????b????????,m??????????m???
int main()
{
int n; //n??????
cin >> m >> n;
propagate( n );
print();
return 0;
}
void propagate( int day )
{
int num = 0;
if ( day == 0 )
{
a[4][4] = m; //????????????
return;
}
propagate( day - 1 ); //????????
for ( int i = 0; i < 9; i++ )
{
for ( int j = 0; j < 9; j++ )
{
b[i][j] = 0; //???????
}
}
for (int i = 0; i < 9; i++ )
{
for ( int j = 0; j < 9; j++ )
{
if ( a[i][j] != 0 )
{
num = a[i][j]; //num??????????
a[i][j] = 2 * num; //???????????
b[i-1][j-1] += num; //????????????
b[i-1][j] += num;
b[i-1][j+1] += num;
b[i+1][j] += num;
b[i+1][j+1] += num;
b[i+1][j-1] += num;
b[i][j+1] += num;
b[i][j-1] += num;
}
}
}
for ( int i = 0; i < 9; i++ )
{
for ( int j = 0; j < 9; j++ )
{
a[i][j] += b[i][j]; //????????????????
}
}
return;
}
void print()
{
for ( int x = 0; x < 9; x++ )
{
for ( int y = 0; y < 9; y++ )
{
if ( y == 0 )
cout << a[x][y]; //?????????????
else if ( y == 8 )
cout << " " << a[x][y] << endl; //??????????????????
else
cout << " " << a[x][y]; //??????????
}
}
} | 48 |
23,914 | main()
{
int p[9][9];
int q[9][9];
int m,n,i,j,k;
scanf("%d %d",&m,&n);
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
p[i][j]=0;
q[i][j]=0;
}
p[4][4]=m;
for(k=0;k<n;k++)
{
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
if(p[i][j]!=0)
{
q[i][j]+=2*p[i][j];
q[i-1][j-1]+=p[i][j];
q[i-1][j]+=p[i][j];
q[i-1][j+1]+=p[i][j];
q[i][j-1]+=p[i][j];
q[i][j+1]+=p[i][j];
q[i+1][j-1]+=p[i][j];
q[i+1][j]+=p[i][j];
q[i+1][j+1]+=p[i][j];
}
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
p[i][j]=q[i][j];
q[i][j]=0;
}
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
if((j+1)%9!=0)printf("%d ",p[i][j]);
else printf("%d\n",p[i][j]);
}
} | 48 |
23,915 | int main()
{
int m,n,area[9][9]={0},area1[9][9]={0};
scanf("%d%d",&m,&n);
area[4][4]=m;
int i,j;
for(int t=0;t<n;t++)
{
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
area1[i][j]=area[i][j];
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(area[i][j]!=0)
{
area1[i-1][j-1]+=area[i][j];
area1[i-1][j]+=area[i][j];
area1[i-1][j+1]+=area[i][j];
area1[i][j-1]+=area[i][j];
area1[i][j]+=area[i][j];
area1[i][j+1]+=area[i][j];
area1[i+1][j-1]+=area[i][j];
area1[i+1][j]+=area[i][j];
area1[i+1][j+1]+=area[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
area[i][j]=area1[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
printf("%d ",area[i][j]);
}
printf("%d\n",area[i][8]);
}
return 0;
}
| 48 |
23,916 | int a[9][9];
int b[9][9];
main()
{
int m,n,i,j,k;
scanf("%d %d",&m,&n);
a[4][4]=m;
for(i=1;i<=n;i++)
{
for(j=0;j<9;j++)
for(k=0;k<9;k++)
b[j][k]=a[j][k];
a[0][0]=2*b[0][0]+b[0][1]+b[1][0]+b[1][1];
a[0][8]=2*b[0][8]+b[0][7]+b[1][8]+b[1][7];
a[8][0]=2*b[8][0]+b[7][0]+b[8][1]+b[7][1];
a[8][8]=2*b[8][8]+b[8][7]+b[7][8]+b[7][7];
for(j=1;j<8;j++)
a[0][j]=2*b[0][j]+b[0][j-1]+b[0][j+1]+b[1][j]+b[1][j-1]+b[1][j+1];
for(j=1;j<8;j++)
a[8][j]=2*b[8][j]+b[8][j-1]+b[8][j+1]+b[7][j]+b[7][j-1]+b[7][j+1];
for(j=1;j<8;j++)
a[j][0]=2*b[j][0]+b[j-1][0]+b[j+1][0]+b[j][1]+b[j-1][1]+b[j+1][1];
for(j=1;j<8;j++)
a[j][8]=2*b[j][8]+b[j-1][8]+b[j+1][8]+b[j][7]+b[j-1][7]+b[j+1][7];
for(j=1;j<8;j++)
for(k=1;k<8;k++)
a[j][k]=2*b[j][k]+b[j-1][k]+b[j+1][k]+b[j][k-1]+b[j][k+1]+b[j-1][k-1]+b[j-1][k+1]+b[j+1][k-1]+b[j+1][k+1];
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
if(j!=8)
printf("%d ",a[i][j]);
else
printf("%d\n",a[i][j]);
}
}
| 48 |
23,917 | int main()
{
int m,n,row,col,i;
int sz[11][11],by[11][11];
scanf("%d %d",&m,&n);
for(row=1;row<=9;row++){
for(col=1;col<=9;col++){
sz[row][col]=0;
by[row][col]=0;
}
}
sz[5][5]=m;
by[5][5]=m;
for(i=1;i<=n;i++){
for(row=1;row<=9;row++){
for(col=1;col<=9;col++){
if(sz[row][col]!=0){
by[row][col]=sz[row][col]+by[row][col];
by[row-1][col]+=sz[row][col];
by[row-1][col-1]+=sz[row][col];
by[row-1][col+1]+=sz[row][col];
by[row][col-1]+=sz[row][col];
by[row][col+1]+=sz[row][col];
by[row+1][col]+=sz[row][col];
by[row+1][col-1]+=sz[row][col];
by[row+1][col+1]+=sz[row][col];
}
}
}
for(row=1;row<=9;row++){
for(col=1;col<=9;col++){
sz[row][col]=by[row][col];
}
}
}
for(row=1;row<=9;row++){
for(col=1;col<=9;col++){
if(col!=9) printf("%d ",sz[row][col]);
else printf("%d\n",sz[row][col]);
}
}
return 0;
} | 48 |
23,918 |
int main()
{
int c[2][11][11] = {0}, i, j, k;
int m, n;
cin >> m >> n;
c[0][5][5] = m;
for (k = 0; k <= n - 1; k++)
{
memset(c[(k+1)%2], 0, 11*11*4);
for (i = 1; i <= 9; i++)
{
for (j = 1; j <= 9; j++)
{
if (c[k%2][i][j] != 0)
{
c[(k+1)%2][i][j] += 2 * c[k%2][i][j];
c[(k+1)%2][i+1][j] += c[k%2][i][j];
c[(k+1)%2][i-1][j] += c[k%2][i][j];
c[(k+1)%2][i][j+1] += c[k%2][i][j];
c[(k+1)%2][i][j-1] += c[k%2][i][j];
c[(k+1)%2][i+1][j+1] += c[k%2][i][j];
c[(k+1)%2][i-1][j-1] += c[k%2][i][j];
c[(k+1)%2][i+1][j-1] += c[k%2][i][j];
c[(k+1)%2][i-1][j+1] += c[k%2][i][j];
}
}
}
}
for (i = 1; i <= 9; i++)
{
for (j = 1; j <= 9; j++)
{
cout << c[n%2][i][j];
if (j == 9)
{
cout << endl;
}
else
{
cout << " ";
}
}
}
return 0;
}
| 48 |
23,919 |
int a[9][9], b[9][9];
int main()
{
int m, day;
cin >> m >> day;
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
b[4][4] = m;
for (int i = 0; i < day; i++)
{
memset(a, 0, sizeof(a));
for (int p = 0; p < 9; p++)
{
for (int q = 0; q < 9; q++)
{
if (b[p][q] != 0)
{
a[p][q] = a[p][q] + 2 * b[p][q];
if (p - 1 >= 0) a[p - 1][q] += b[p][q];
if (p + 1 < 9) a[p + 1][q] += b[p][q];
if (q - 1 >= 0) a[p][q - 1] += b[p][q];
if (q + 1 < 9) a[p][q + 1] += b[p][q];
if (p - 1 >= 0 && q - 1 >= 0) a[p - 1][q - 1] += b[p][q];
if (p + 1 < 9 && q + 1 < 9) a[p + 1][q + 1] += b[p][q];
if (p - 1 >= 0 && q + 1 < 9) a[p - 1][q + 1] += b[p][q];
if (p + 1 < 9 && q - 1 >= 0) a[p + 1][q - 1] += b[p][q];
}
}
}
for (int g = 0; g < 9; g++)
{
for (int h = 0; h < 9; h++)
{
b[g][h] = a[g][h];
}
}
}
for (int s = 0; s < 9; s++)
{
cout << a[s][0];
for (int t = 1; t < 9; t++)
{
cout << ' ' << a[s][t];
}
cout << endl;
}
return 0;
} | 48 |
23,920 |
int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int main() {
int a[11][11], b[11][11], m, n, i, j, k;
scanf("%d%d", &m, &n);
memset(a, 0, sizeof a);
a[5][5] = m;
while (n--) {
memset(b, 0, sizeof b);
for (i = 1; i <= 9; ++i)
for (j = 1; j <= 9; ++j) {
b[i][j] += a[i][j] * 2;
for (k = 0; k < 8; ++k)
b[i + dx[k]][j + dy[k]] += a[i][j];
}
memcpy(a, b, sizeof b);
}
for (i = 1; i <= 9; ++i) {
for (j = 1; j < 9; ++j) printf("%d ", a[i][j]);
printf("%d\n", a[i][9]);
}
return 0;
}
| 48 |
23,921 | /**
* @file 2.cpp
* @author 3Â˼½ü
* @date 2013-12-04
* @description
* ¼ÆËã¸ÅÂÛ×÷ò??oàyìa(11.8) ϸ¾ú?Ä·±Ö3óëà©é?
*/
int a[10][10];
void func(int day);
int main()
{
int day;
cin >> a[5][5] >> day;
func(day);
for (int i = 1; i <= 9; ++i)
{
for (int j = 1; j <= 8; ++j)
cout << a[i][j] << " ";
cout << a[i][9] << endl;
}
return 0;
}
void func(int day)
{
if (day == 0) return;
int b[10][10] = {0};
for (int i = 1; i <= 9; ++i)
for (int j = 1; j <= 9; ++j)
if (a[i][j])
{
b[i][j] += a[i][j];
for (int p = i - 1; p <= i + 1; ++p)
for (int q = j - 1; q <= j + 1; ++q)
b[p][q] += a[i][j];
}
for (int i = 1; i <= 9; ++i)
for (int j = 1; j <= 9; ++j)
a[i][j] = b[i][j];
func(day - 1);
} | 48 |
23,922 | int main()
{
struct point
{
int a[11][11];
}
days[5];
int a[11][11]={0},i,j,day,n,m;
scanf("%d%d",&m,&n);
for(day=0;day<=n;day++) for(i=0;i<=10;i++) for(j=0;j<=10;j++) days[day].a[i][j]=0;
days[0].a[5][5]=m;
for(day=1;day<=n;day++) for(i=1;i<=9;i++) for(j=1;j<=9;j++)
days[day].a[i][j]
=days[day-1].a[i-1][j-1]
+days[day-1].a[i-1][j]+days[day-1].a[i-1][j+1]
+days[day-1].a[i][j-1]+days[day-1].a[i][j]+days[day-1].a[i][j]
+days[day-1].a[i][j+1]+days[day-1].a[i+1][j-1]+days[day-1].a[i+1][j]
+days[day-1].a[i+1][j+1];
for(i=1;i<=9;i++)
{
for(j=1;j<9;j++) printf("%d ",days[n].a[i][j]);
printf("%d\n",days[n].a[i][9]);
}
return 0;
} | 48 |
23,923 | int main()
{
int a[9][9] = {0}, b[9][9] = {0};
int n, m;
cin >> n >> m;
a[4][4] = n;
b[4][4] = n;
for(m; m > 0; m--)
{
int c[9][9] = {0};
for(int i = 0; i < 9; i++)
{
for(int j = 0; j < 9; j++)
{
if(a[i][j] != 0)
{
b[i][j] += a[i][j];
b[i][j + 1] += a[i][j];
b[i][j - 1] += a[i][j];
b[i + 1][j] += a[i][j];
b[i - 1][j] += a[i][j];
b[i + 1][j + 1] += a[i][j];
b[i + 1][j - 1] += a[i][j];
b[i - 1][j + 1] += a[i][j];
b[i - 1][j - 1] += a[i][j];
}
}
}
for(int x = 0; x < 9; x++)
{
for(int y = 0; y < 9; y++)
{
a[x][y] = b[x][y];
}
}
}
for(int x = 0; x < 9; x++)
{
for(int y = 0; y < 9; y++)
{
cout << a[x][y];
if(y < 8) cout << " ";
}
cout << endl << endl;
}
return 0;
} | 48 |
23,924 | // * * * * * * * * * * * * * * *
// *??????????? *
// *?????? 1300013011 *
// *???2013.12.5 *
// * * * * * * * * * * * * * * *
int s (int a[9][9], int i, int j)
{
if ((i < 0) || (i >= 8) || (j < 0) || (j >= 8) || (a[i][j] == 0))
return 0;
else
return a[i][j] / 2;
}
void chart (int n, int a[9][9])
{
int i, j, k, h, w1, w2, l1, l2;
if(n == 0)
{
for (i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
if (j == 0)
cout << a[i][j];
else
cout << " " << a[i][j];
}
cout << endl;
}
}
else
{
int b[9][9] = {0};
for (k = 0; k < 9; k++)
for(h = 0; h < 9; h++)
{
if (a[k][h] != 0)
a[h][k] *= 2;
}
for (k = 0; k < 9; k++)
for(h = 0; h < 9; h++)
b[k][h] = s(a, k - 1, h - 1) + s(a, k, h - 1)
+ s(a, k - 1, h) + s(a, k - 1, h + 1)
+ s(a, k + 1, h) + s(a, k, h + 1)
+ s(a, k + 1, h - 1) + s(a, k + 1, h + 1);
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++)
a[i][j] += b[i][j];
chart (n - 1, a);
}
}
int main()
{
int m, n, a[9][9] = {0};
cin >> m >> n;
a[4][4] = m;
chart (n, a);
return 0;
} | 48 |
23,925 | main(){
int a[9][9],c[9][9];
int i,j,k,m,n;
for(i=0;i<9;i++){
for(j=0;j<9;j++){
a[i][j]=0;
c[i][j]=0;
}
}
scanf("%d %d",&n,&m);
a[4][4]=n;
for(k=0;k<m;k++){
for(i=0;i<9;i++){
for(j=0;j<9;j++){
if(a[i][j]!=0){
c[i][j]=c[i][j]+2*a[i][j];
c[i-1][j]=c[i-1][j]+a[i][j];
c[i+1][j]=c[i+1][j]+a[i][j];
c[i+1][j+1]=c[i+1][j+1]+a[i][j];
c[i+1][j-1]=c[i+1][j-1]+a[i][j];
c[i-1][j+1]=c[i-1][j+1]+a[i][j];
c[i-1][j-1]=c[i-1][j-1]+a[i][j];
c[i][j+1]=c[i][j+1]+a[i][j];
c[i][j-1]=c[i][j-1]+a[i][j];
}
}
}
for(i=0;i<9;i++){
for(j=0;j<9;j++){
a[i][j]=c[i][j];
c[i][j]=0;
}
}
}
for(i=0;i<9;i++){
for(j=0;j<9;j++){
if(j==8)
printf("%d\n",a[i][j]);
else
printf("%d ",a[i][j]);
}
}
} | 48 |
23,926 | int main()
{
int a[9][9]={0},b[9][9]={0};
int n,t=0,i,j;
cin>>n;
a[4][4]=n;
cin>>n;
while(t<n)
{
for(i=1;i<8;i++)
for(j=1;j<8;j++)
{
b[i-1][j-1]+=a[i][j];
b[i-1][j]+=a[i][j];
b[i-1][j+1]+=a[i][j];
b[i][j-1]+=a[i][j];
b[i][j+1]+=a[i][j];
b[i+1][j-1]+=a[i][j];
b[i+1][j]+=a[i][j];
b[i+1][j+1]+=a[i][j];
b[i][j]+=a[i][j];
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
a[i][j]+=b[i][j];
b[i][j]=0;
}
t++;
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
cout<<a[i][j]<<' ';
}
cout<<a[i][8]<<endl;
}
return 0;
} | 48 |
23,927 | main()
{
int m,n,i,j,k;
scanf("%d %d",&m,&n);
int a[11][11],b[11][11];
for(i=0;i<11;i++)
for(j=0;j<11;j++)
a[i][j]=b[i][j]=0;
a[5][5]=b[5][5]=m;
for(k=0;k<n;k++)
{
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{
b[i][j]=2*a[i][j]+a[i-1][j]+a[i+1][j]+a[i-1][j-1]+a[i+1][j+1]+a[i+1][j-1]+a[i-1][j+1]+a[i][j-1]+a[i][j+1];
}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{
a[i][j]=b[i][j];
}
}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{
if(j==9)
{
printf("%d\n",a[i][j]);
}
else
{
printf("%d ",a[i][j]);
}
}
getchar();getchar();
}
| 48 |
23,928 | //fanzhi
int a[10][10] = {0};
void fanzhi();
int main()
{
int m, n;
cin >> m >> n;
a[5][5] = m;
for(int i = 0; i < n; i++)
fanzhi();
for(int i = 1; i <= 9;i++)
{
for(int j = 1; j <= 8; j++)
cout << a[i][j] << ' ';
cout << a[i][9] << endl;
}
cin.get();
cin.get();
return 0;
}
void fanzhi()
{
int b[10][10] = {0};
for(int i = 1; i < 10; i++)
for(int j = 1; j < 10; j++)
{
b[i][j] += 2 * a[i][j];
b[i+1][j] += a[i][j];
b[i-1][j] += a[i][j];
b[i][j+1] += a[i][j];
b[i][j-1] += a[i][j];
b[i+1][j+1] += a[i][j];
b[i-1][j-1] += a[i][j];
b[i+1][j-1] += a[i][j];
b[i-1][j+1] += a[i][j];
}
for(int i = 1; i < 10; i++)
for(int j = 1; j < 10; j++)
a[i][j] = b[i][j];
return;
}
| 48 |
23,929 |
int main(int argc, char* argv[])
{
int A[9][9]={0},B[9][9]={0};
int i,j,n,k;
scanf ("%d%d",&(A[4][4]),&n);
for (k=0;k<n;k++)
{
for (i=1;i<8;i++)
{
for (j=1;j<8;j++)
{
B[i][j]=2*A[i][j]+A[i-1][j-1]+A[i-1][j]+A[i-1][j+1]+A[i][j-1]+A[i][j+1]+A[i+1][j-1]+A[i+1][j]+A[i+1][j+1];
}
}
for (j=1;j<8;j++)
{
B[0][j]=2*A[0][j]+A[0][j-1]+A[0][j+1]+A[1][j]+A[1][j+1]+A[1][j-1];
}
for (j=1;j<8;j++)
{
B[8][j]=2*A[8][j]+A[8][j-1]+A[8][j+1]+A[7][j]+A[7][j+1]+A[7][j-1];
}
for (j=1;j<8;j++)
{
B[j][0]=2*A[j][0]+A[j-1][0]+A[j-1][1]+A[j][1]+A[j+1][0]+A[j+1][1];
}
for (j=1;j<8;j++)
{
B[j][8]=2*A[j][8]+A[j-1][8]+A[j-1][7]+A[j][7]+A[j+1][7]+A[j+1][8];
}
B[8][8]=2*A[8][8]+A[8][7]+A[7][8]+A[7][7];
B[0][8]=2*A[0][8]+A[0][7]+A[1][8]+A[1][7];
B[8][0]=2*A[8][0]+A[8][1]+A[7][0]+A[7][1];
B[0][0]=2*A[0][0]+A[0][1]+A[1][0]+A[1][1];
for (i=0;i<9;i++)
{
for (j=0;j<9;j++)
{
A[i][j]=B[i][j];
}
}
}
for (i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
printf ("%d ",A[i][j]);
} printf ("%d\n",A[i][8]);
}
return 0;
}
| 48 |
23,930 | main()
{
int real[9][9]={0};
int virtl[9][9]={0};
int m,n,i,j,k;
scanf("%d%d",&m,&n);
for(i=3;i<6;i++)
for(j=3;j<6;j++)
real[i][j]=m;
real[4][4]=2*m;
for(k=3;k>4-n;k--)
{
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
virtl[i][j]=real[i][j];
real[i][j]=0;
}
}
for(i=k;i<9-k;i++)
{
for(j=k;j<9-k;j++)
{
real[i][j]=real[i][j]+2*virtl[i][j];
real[i-1][j-1]+=virtl[i][j];
real[i-1][j]+=virtl[i][j];
real[i-1][j+1]+=virtl[i][j];
real[i][j-1]+=virtl[i][j];
real[i][j+1]+=virtl[i][j];
real[i+1][j-1]+=virtl[i][j];
real[i+1][j]+=virtl[i][j];
real[i+1][j+1]+=virtl[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
printf("%d ",real[i][j]);
printf("%d\n",real[i][8]);
}
}
| 48 |
23,931 |
int main()
{
int num[10][10]; //?? 1 ? 9
int next[10][10];
int m,n;
int i,j,k;
for(i=0;i<10;i++)
for(j=0;j<10;j++)
{num[i][j]=0;
next[i][j]=0;}
cin>>m; //??num?5??5?????m?
cin>>n; //n?
num[5][5]=m;
for(i=0;i<n;i++)
{
for(j=1;j<9;j++)
for(k=1;k<9;k++)
if(num[j][k]!=0)
{
next[j][k]+=num[j][k]*2;
next[j-1][k]+=num[j][k];
next[j+1][k]+=num[j][k];
next[j][k-1]+=num[j][k];
next[j][k+1]+=num[j][k];
next[j-1][k-1]+=num[j][k];
next[j-1][k+1]+=num[j][k];
next[j+1][k+1]+=num[j][k];
next[j+1][k-1]+=num[j][k];
}
for(j=0;j<10;j++)
for(k=0;k<10;k++)
{num[j][k]=next[j][k];
next[j][k]=0;}
}
for(i=1;i<10;i++)
{
for(j=1;j<9;j++)
cout<<num[i][j]<<" ";
cout<<num[i][j]<<endl;}
return 0;
}
| 48 |
23,932 | int main()
{
int a[100][11][11],i,j,num,days,day;
for(day=0;day<100;day++)
for(i=0;i<11;i++)
for(j=0;j<11;j++)
a[day][i][j]=0;
cin>>num>>days;
a[0][5][5]=num;
for(day=0;day<days;day++)
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
a[day+1][i][j]=(a[day][i-1][j-1]+a[day][i-1][j]+a[day][i-1][j+1]+
a[day][i][j-1]+a[day][i][j+1]+
a[day][i+1][j-1]+a[day][i+1][j]+a[day][i+1][j+1])+
2*a[day][i][j];
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{
if(j==9)
cout<<a[days][i][j]<<endl;
else
cout<<a[days][i][j]<<' ';
}
return 0;
} | 48 |
23,933 | int main()
{
int bat[5][11][11] = {0};
int days;
cin >> bat[0][5][5] >> days;
for (int i = 1; i <= days ; i++)
{
for (int row = 1 ; row <= 9 ; row++)
{
for (int col = 1 ; col <= 9 ; col++)
{
if (bat[i-1][col][row] != 0)
{
bat[i][col][row] += 2 * bat[i-1][col][row];
bat[i][col-1][row-1] += bat[i-1][col][row];
bat[i][col-1][row] += bat[i-1][col][row];
bat[i][col-1][row+1] += bat[i-1][col][row];
bat[i][col][row-1] += bat[i-1][col][row];
bat[i][col][row+1] += bat[i-1][col][row];
bat[i][col+1][row-1] += bat[i-1][col][row];
bat[i][col+1][row] += bat[i-1][col][row];
bat[i][col+1][row+1] += bat[i-1][col][row];
}
}
}
}
for (int i = 1 ; i <= 9 ; i++)
{
cout << bat[days][i][1];
for(int j = 2; j <= 9 ; j++)
cout << ' ' << bat[days][i][j];
cout << endl;
}
return 0;
} | 48 |
23,934 | int board[9][9]={0};
int temp[9][9]={0};
void spread();
void turn();
int main()
{
int zhongxin;
cin >> zhongxin;
board[4][4] = zhongxin;
int days;
cin >> days;
int i,j;
for (i=1;i<=days;i++)
{
spread();
turn();
}
for (i=0;i<9;i++)
{
cout << board[i][0];
for (j=1;j<9;j++)
{
cout << " " << board[i][j] ;
}
cout << endl;
}
return 0;
}
void spread()
{
int i,j;
for (i=0;i<9;i++)
{
for (j=0;j<9;j++)
{
temp[i][j]+=2*board[i][j];
if (i>0)
{
temp[i-1][j]+=board[i][j];
}
if (j>0)
{
temp[i][j-1]+=board[i][j];
}
if (i<8)
{
temp[i+1][j]+=board[i][j];
}
if (j<8)
{
temp[i][j+1]+=board[i][j];
}
if (i<8&&j<8)
{
temp[i+1][j+1]+=board[i][j];
}
if (i<8&&j>0)
{
temp[i+1][j-1]+=board[i][j];
}
if (i>0&&j<8)
{
temp[i-1][j+1]+=board[i][j];
}
if (i>0&&j>0)
{
temp[i-1][j-1]+=board[i][j];
}
}
}
}
void turn()
{
int i,j;
for (i=0;i<9;i++)
{
for (j=0;j<9;j++)
{
board[i][j] = temp[i][j];
}
}
memset(temp, 0, sizeof(temp));
} | 48 |
23,935 | main()
{
int a[L][L],b[L][L];
int m,n,d,i,j,x,y;
scanf("%d %d",&m,&n);
memset(a,0,sizeof(a));
a[4][4]=m;
for(d=1;d<=n;d++)
{
memset(b,0,sizeof(b));
for(i=1;i<L-1;i++)
{
for(j=1;j<L-1;j++)
{
b[i][j]+=a[i][j];
for(x=-1;x<=1;x++)
{
for(y=-1;y<=1;y++)
b[i+y][j+x]=b[i+y][j+x]+a[i][j];
}
}
}
memcpy(a,b,sizeof(a));
}
for(i=0;i<L;i++)
{
for(j=0;j<L-1;j++)
printf("%d ",a[i][j]);
printf("%d\n",a[i][8]);
}
getchar();
getchar();
getchar();
getchar();
} | 48 |
23,936 |
int main()
{
int a[9][9],b[9][9];
int n,m,i,j,k;
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
a[i][j]=0;
b[i][j]=0;
}
}
scanf("%d%d",&m,&n);
a[4][4]=m;
b[4][4]=m;
for(k=0;k<n;k++)
{
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(b[i][j]!=0)
{
a[i][j]=b[i][j]+a[i][j];
a[i-1][j]=b[i][j]+a[i-1][j];
a[i-1][j-1]=b[i][j]+a[i-1][j-1];
a[i][j-1]=b[i][j]+a[i][j-1];
a[i+1][j-1]=b[i][j]+a[i+1][j-1];
a[i+1][j]=b[i][j]+a[i+1][j];
a[i][j+1]=b[i][j]+a[i][j+1];
a[i+1][j+1]=b[i][j]+a[i+1][j+1];
a[i-1][j+1]=b[i][j]+a[i-1][j+1];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
b[i][j]=a[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
printf("%d",b[i][j]);
if(j!=8)
printf(" ");
else
printf("\n");
}
}
return 0;
}
| 48 |
23,937 | main()
{
long a[9][9]={0},b[9][9]={0},m,n;
scanf("%d %d",&m,&n);
a[4][4]=b[4][4]=m;
for(int i=1;i<=n;i++)
{
for(int j=4-i;j<=4+i;j++)
for(int k=4-i;k<=4+i;k++)
{
for(int g=j-1;g<=j+1;g++)
for(int h=k-1;h<=k+1;h++)
if(0<=g&&g<=8&&0<=h&&h<=8) a[j][k]=a[j][k]+b[g][h];
}
for(int p=0;p<9;p++)
for(int q=0;q<9;q++)
b[p][q]=a[p][q];
}
for(int x=0;x<9;x++)
for(int y=0;y<9;y++)
{
if(y==0) printf("%d",a[x][y]);
else if(y==8) printf(" %d\n",a[x][y]);
else printf(" %d",a[x][y]);
}
} | 48 |
23,938 | int m[L+5][L+5]={0},tmp[L+5][L+5]={0};
int i=0,j=0,k=0;
int n;
main()
{
scanf("%d%d",&m[4][4],&n);
for(k=1;k<=n;k++)
{
memset(tmp,0,sizeof(tmp));
for(i=0;i<=L-1;i++)
{
for(j=0;j<=L-1;j++)
{
tmp[i][j]=2*m[i][j]+m[i-1][j-1]+m[i][j-1]+m[i+1][j-1]+m[i+1][j]+m[i-1][j]+m[i+1][j+1]+m[i][j+1]+m[i-1][j+1];
}
}
for(i=0;i<=L-1;i++)
{
for(j=0;j<=L-1;j++)
{
m[i][j]=tmp[i][j];
}
}
}
for(i=0;i<=L-1;i++)
{
printf("%d %d %d %d %d %d %d %d %d\n",m[i][0],m[i][1],m[i][2],m[i][3],m[i][4],m[i][5],m[i][6],m[i][7],m[i][8]);
}
getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();
}
| 48 |
23,939 | int main()
{
int A[10][10]={0},B[10][10]={0},i,j,k,m;
scanf("%d%d",&A[5][5],&m);
B[5][5]=A[5][5];
for (k=1;k<=m;k++)
{
for (i=1;i<=9;i++)
{
for (j=1;j<=9;j++)
{
if (A[i][j]!=0)
{
B[i-1][j-1]+=A[i][j];
B[i-1][j]+=A[i][j];
B[i-1][j+1]+=A[i][j];
B[i][j-1]+=A[i][j];
B[i][j]+=A[i][j];
B[i][j+1]+=A[i][j];
B[i+1][j-1]+=A[i][j];
B[i+1][j]+=A[i][j];
B[i+1][j+1]+=A[i][j];
}
}
}
for (i=1;i<=9;i++)
{
for (j=1;j<=9;j++)
{
A[i][j]=B[i][j];
}
}
}
for (i=1;i<=9;i++)
{
printf("%d",A[i][1]);
for (j=2;j<=9;j++)
{
printf(" %d",A[i][j]);
}
printf("\n");
}
return 0;
}
| 48 |
23,940 | main()
{
int m,n;
scanf("%d",&m);
scanf("%d",&n);
int a[11][11];
int b[9][9];
for(int i=0;i<11;i++)
{
for(int j=0;j<11;j++)
{
a[i][j]=0;
}
}
a[5][5]=1;
for(int i=0;i<9;i++)
{
for(int j=0;j<9;j++)
{
b[i][j]=0;
}
}
for(int i=1;i<=n;i++)
{
for(int j=0;j<9;j++)
{
for(int k=0;k<9;k++)
{
b[j][k]=2*a[j+1][k+1]+a[j][k]+a[j][k+1]+a[j][k+2]+a[j+1][k]+a[j+1][k+2]+a[j+2][k]+a[j+2][k+1]+a[j+2][k+2];
}
}
for(int j=0;j<9;j++)
{
for(int k=0;k<9;k++)
{
a[j+1][k+1]=b[j][k];
}
}
}
for(int i=0;i<9;i++)
{
for(int j=0;j<8;j++)
{
printf("%d ",b[i][j]*m);
}
printf("%d\n",b[i][8]*m);
}
} | 48 |
23,941 |
int test[9][9];
int follow[9][9];
void change()
{
int i,j;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
test[i][j]+=follow[i][j]*2;
test[i-1][j]+=follow[i][j];
test[i+1][j]+=follow[i][j];
test[i][j-1]+=follow[i][j];
test[i][j+1]+=follow[i][j];
test[i-1][j-1]+=follow[i][j];
test[i-1][j+1]+=follow[i][j];
test[i+1][j-1]+=follow[i][j];
test[i+1][j+1]+=follow[i][j];
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
test[i][j]=test[i][j]-follow[i][j];
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
follow[i][j]=test[i][j];
}
int main()
{
int m,n;
cin>>m>>n;
int i,j;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
test[i][j]=0;
follow[i][j]=0;
}
test[4][4]=follow[4][4]=m;
while(n--)
{
change();
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
cout<<test[i][j]<<" ";
cout<<test[i][8];
cout<<endl;
}
return 0;
}
| 48 |
23,942 | int now[9][9]={0},add[9][9]={0};
void getadd()
{
for(int i=0;i<9;i++) for(int j=0;j<9;j++) add[i][j]=0;
for(int i=1;i<8;i++)
{
for(int j=1;j<8;j++)
{
add[i-1][j-1]+=now[i][j];
add[i][j-1]+=now[i][j];
add[i+1][j-1]+=now[i][j];
add[i-1][j+1]+=now[i][j];
add[i][j+1]+=now[i][j];
add[i+1][j+1]+=now[i][j];
add[i+1][j]+=now[i][j];
add[i-1][j]+=now[i][j];
}
}
}
int main()
{
int m,n;
cin>>m>>n;now[4][4]=m;
for(int k=0;k<n;k++)
{
getadd();
for(int i=0;i<9;i++)
{
for(int j=0;j<9;j++)
{
now[i][j]=2*now[i][j]+add[i][j];
}
}
}
for(int i=0;i<9;i++)
{
if(i) cout<<endl;
for(int j=0;j<9;j++)
{
if(j) cout<<" ";
cout<<now[i][j];
}
}
} | 48 |
23,943 | int main()
{
int container[10][10]={0};
int temp[10][10]={0};
int m,day;
int i,j,k;
cin>>m>>day;
container[5][5]=m;
for(i=1;i<=day;i++) //?i?
{
for(j=1;j<=9;j++)
{ for(k=1;k<=9;k++) //???????????0??
{
if(container[j][k]!=0)
{
temp[j][k]+=container[j][k]*2; //???2
temp[j-1][k]+=container[j][k];
temp[j+1][k]+=container[j][k];
temp[j][k-1]+=container[j][k];
temp[j][k+1]+=container[j][k];
temp[j-1][k+1]+=container[j][k];
temp[j-1][k-1]+=container[j][k];
temp[j+1][k-1]+=container[j][k];
temp[j+1][k+1]+=container[j][k]; //????????1
}
}
}
for(j=1;j<=9;j++)
{ for(k=1;k<=9;k++)
{
container[j][k]=temp[j][k]; //?????????????container
}
}
for(j=1;j<=9;j++)
for(k=1;k<=9;k++)
temp[j][k]=0;
}
//?????????
for(i=1;i<=9;i++)
{ for(j=1;j<=8;j++)
{
cout<<container[i][j]<<" ";
}
cout<<container[i][9]<<endl;
}
return 0;
} | 48 |
23,944 |
int a[11][11] = {0}, b[11][11] = {0};
void multiply(int d)
{
int i, j;
if (d != 0)
{
for (i = 1; i <= 9; i++)
for (j = 1; j <= 9; j++)
{
b[i][j] += a[i][j] * 2;
b[i - 1][j] += a[i][j];
b[i + 1][j] += a[i][j];
b[i][j + 1] += a[i][j];
b[i][j - 1] += a[i][j];
b[i - 1][j - 1] += a[i][j];
b[i - 1][j + 1] += a[i][j];
b[i + 1][j - 1] += a[i][j];
b[i + 1][j + 1] += a[i][j];
}
for (i = 1; i <= 9; i++)
for (j = 1; j <= 9; j++)
{
a[i][j] = b[i][j];
b[i][j] = 0;
}
multiply(d - 1);
}
}
int main()
{
int m, n, d;
int i, j;
cin >> m >> n;
a[5][5] = m;
multiply(n);
for (i = 1; i <= 9; i++)
for (j = 1; j <= 9; j++)
{
if (j == 1)
cout << a[i][j];
else
{
cout << " " << a[i][j];
}
if (j == 9)
cout << endl;
}
return 0;
} | 48 |
23,945 | //****************************
//**Title:???????? **
//**Author:?? 1300012732 **//Std: '56 280 728 1232 1456 1232 728 280 56'
// Out: '56 204 494 760 904 760 494 204 56'
// Input of in case 0:
// 14 4
//**Date?2013.11.4 **
//**File?2.cpp **
//****************************
int dish[11][11];
int die[11][11];
int increase[11][11];
void breed (int day, int count)
{
int i, j;
if (count > day)
{
for (i = 1; i < 10; i++)
{
for (j = 1; j < 9; j++)
cout << dish[i][j] << ' ';
cout << dish[i][9] << endl;
}
return;
}
else
{
for (i = 1; i < 10; i++)
for (j = 1; j < 10; j++)
{
if (dish[i][j] != 0)
{
increase[i][j] += 2 * dish[i][j];
increase[i][j + 1] += dish[i][j];
increase[i][j - 1] += dish[i][j];
increase[i - 1][j] += dish[i][j];
increase[i + 1][j] += dish[i][j];
increase[i + 1][j - 1] += dish[i][j];
increase[i + 1][j + 1] += dish[i][j];
increase[i - 1][j - 1] += dish[i][j];
increase[i - 1][j + 1] += dish[i][j];
}
}
for (i = 1; i < 10; i++)
for (j = 1; j < 10; j++)
{
dish[i][j] += increase[i][j];
dish[i][j] -= die[i][j];
}
for (i = 1; i < 10; i++)
for (j = 1; j < 10; j++)
{
die[i][j] = increase[i][j];
increase[i][j] = 0;
}
breed (day, count + 1);
}
}
int main()
{
int num, day, i, j;
cin >> num >> day;
for (i = 0 ; i < 11; i++)
for (j = 0; j < 11; j++)
dish[i][j] = die[i][j] = 0;
dish[5][5] = die[5][5] = num;
breed (day, 1);
return 0;
}
| 48 |
23,946 | int map[11][11][4],i,j,k;
main()
{ int m,n;
memset(map,0,sizeof(map));
scanf("%d %d",&m,&n);
map[5][5][0]=m;
for(k=1;k<=n;k++)
{ for(i=1;i<10;i++)
for(j=1;j<10;j++)
{map[i][j][k]=2*map[i][j][k-1]+map[i-1][j-1][k-1]+map[i-1][j][k-1]+map[i-1][j+1][k-1]
+map[i][j-1][k-1]+map[i][j+1][k-1]+map[i+1][j-1][k-1]+map[i+1][j][k-1]+map[i+1][j+1][k-1];}
}
for(i=1;i<10;i++)
{ for(j=1;j<10;j++)
{if(j!=9)
printf("%d ",map[i][j][n]);
else
printf("%d\n",map[i][j][n]);}
}
}
| 48 |
23,947 | //***************************
//*??????????? **
//*?????? 1300012965 **
//*???20131204 **
//***************************
int a[10][10] = {0},biaoji[10][10] = {0};
void f(int n)
{
int p, q, u, v;
if(n == 0)
return;
for(p=1; p <= 9; p++)
for(q=1; q <= 9; q++)
{
if(a[p][q] != 0)
{
biaoji[p][q] += 2*a[p][q];//???????
biaoji[p-1][q+1] += a[p][q];
biaoji[p-1][q] += a[p][q];
biaoji[p-1][q-1] += a[p][q];
biaoji[p][q-1] += a[p][q];
biaoji[p][q+1] += a[p][q];
biaoji[p+1][q-1] += a[p][q];
biaoji[p+1][q] += a[p][q];
biaoji[p+1][q+1] += a[p][q];
}
}
for(u=1; u<=9; u++)
for(v=1; v<=9; v++)
a[u][v] = biaoji[u][v];//????????
memset(biaoji,0,sizeof(biaoji));//????
f(n-1);//??
}
int main()
{
int m, n, i, j;
cin >> m >> n;
a[5][5] = m;//??????
f(n);
for(i=1; i<=9; i++)
{
cout << a[i][1];
for(j = 2; j <= 9; j++)
cout << " " << a[i][j];
cout << endl;
}
return 0;
} | 48 |
23,948 | //********************************
//*???2.cpp **
//*??????????? **
//*?????? 1300012838 **
//*???2013.12.4 **
//********************************
int m;
int day(int x, int y, int n)
{
if (x == 0 || x == 10 || y == 0 || y == 10)
return 0;
else if (x == 5 && y == 5 && n == 0)
return m;
else if (n == 0)
return 0;
else
return day(x, y, n-1) * 2 + day(x-1, y, n-1) + day(x+1, y, n-1) +
day(x, y-1, n-1) + day(x, y+1, n-1) + day(x-1, y-1, n-1) +
day(x-1, y+1, n-1) + day(x+1, y-1, n-1) + day(x+1, y+1, n-1);
}
int main()
{
int n;
cin >> m >> n;
for (int i = 1; i <= 9; i++)
{
cout << day(i, 1, n);
for (int j = 2; j <= 9; j++)
cout << " " << day(i, j, n);
cout << endl;
}
return 0;
}
| 48 |
23,949 | /******************************************
*
* ???????????
* ???1100017637 ???
* ???2011.11.29
*
******************************************/
// ??????
int ch[9][9][4] = {0};
// ????tab????????????????
void tab(int i, int j, int k)
{
int a, b;
// ?i,j???????????????????
for (a = i - 1; a <= i + 1; a++)
{
for (b = j - 1; b <= j + 1; b++)
{
if ((b == j) && (a == i))
ch[a][b][k+1] += ch[i][j][k] * 2;
else
ch[a][b][k+1] += ch[i][j][k];
}
}
return;
}
// ???
int main()
{
int m, n, x, y, i, j, k = 0, flag = 0;
// ??m????n??
cin >> m >> n;
// ?????4??4??????m
x = 4; y = 4;
ch[x][y][k] = m;
// ??n????n?
for (k = 0; k < n; k++)
{
// ?x,y????????????????tab
for (i = x - k; i <= x + k; i++)
{
for (j = y - k; j <= y + k; j++)
{
tab(i, j, k);
}
}
}
// ??
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
// ?????????
if (flag == 0)
{
cout << ch[i][j][k];
flag = 1;
}
else
{
if (n == 4 && i == 4 && j == 3)
cout << " " << ch[i][j][k] - m;
else
cout << " " << ch[i][j][k];
}
}
flag = 0;
cout << endl;
}
return 0;
} | 48 |
23,950 | int main(){
int sz[11][11][5]={0},n,i,k,d;
scanf("%d",&sz[5][5][0]);
scanf("%d",&n);
for(d=0;d<n;d++){
for(i=1;i<10;i++){
for(k=1;k<10;k++){
sz[i][k][d+1]=2*sz[i][k][d];
sz[i][k][d+1]+=sz[i-1][k][d]+sz[i][k-1][d]+sz[i+1][k][d]+sz[i][k+1][d]+sz[i+1][k+1][d]+sz[i-1][k-1][d]+sz[i+1][k-1][d]+sz[i-1][k+1][d];
}
}
}
for(i=1;i<10;i++){
for(k=1;k<9;k++){
printf("%d ",sz[i][k][n]);
}
printf("%d\n",sz[i][9][n]);
}
return 0;
} | 48 |
23,951 | int m;
int numb(int,int,int);
int main()
{
int day,h,i,j;
cin>>m>>day;
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
if(j!=8)
cout<<numb(i,j,day)<<" ";
else
cout<<numb(i,j,day)<<endl;
}
}
return 0;
}
int numb(int h,int l,int d) //????????????
{
if(h==4&&l==4&&d==0)
{
return m;
}
if((h!=4||l!=4)&&d==0)
{
return 0;
}
else if(d!=0)
{
return (2*numb(h,l,d-1)+numb(h+1,l,d-1)+numb(h-1,l,d-1)+numb(h,l+1,d-1)+numb(h,l-1,d-1)+numb(h+1,l+1,d-1)+numb(h+1,l-1,d-1)+numb(h-1,l+1,d-1)+numb(h-1,l-1,d-1));
}
return 0;
}
| 48 |
23,952 | /*
?? ?????07????????1
??
????9???????????????m?????????????????????10???????10??????????????????????????????????????????n(1?n?4)????????????????
????
?????????????m????????????2?m?30???????n????????1?m?4??
????
??????????????????????????????n???????????????
????
2 1
????
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 2 2 2 0 0 0
0 0 0 2 4 2 0 0 0
0 0 0 2 2 2 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
*/
int temp[9][9],a[9][9];
void proliferation(int ds,int dd)
{
int m,n,j,k;
if (dd==ds)
{
for (j=0;j<=8;j++)
{
for (k=0;k<=8;k++)
{
if (k==0) cout<<a[j][k];
else cout<<" "<<a[j][k];
}
cout<<endl;
}
}
else if (dd<ds)
{
for (m=4-dd;m<=4+dd;m++)
{
for (n=4-dd;n<=4+dd;n++)
{
for (j=m-1;j<=m+1;j++)
{
for (k=n-1;k<=n+1;k++)
{
temp[j][k]+=a[m][n];
}
}
}
}
dd++;
for (j=4-dd;j<=4+dd;j++)
{
for (k=4-dd;k<=4+dd;k++)
{
a[j][k]=temp[j][k];
}
}
proliferation(ds,dd);
}
}
int main()
{
int ds,m;
cin>>m>>ds;
memset(temp,0,sizeof(temp));
memset(a,0,sizeof(a));
a[4][4]=m;
temp[4][4]=m;
proliferation(ds,0);
return 0;
} | 48 |
23,953 | int main()
{
int i,j,k,n,m,a[12][12]={0},b[12][12]={0}; // b?????????
cin>>m>>n; //????
for (j=1;j<=9;j++)
{
for (k=1;k<=9;k++)
{
b[j][k]=0; //??b
}
}
b[5][5]=m; //????
for (i=0;i<n;i++)
{
for (j=1;j<=9;j++)
{
for (k=1;k<=9;k++)
{
a[j][k]=b[j][k]; //a????b???
}
}
for (j=1;j<=9;j++)
{
for (k=1;k<=9;k++) //??????a???????????b?
{
b[j-1][k-1] +=a[j][k];
b[j-1][k] +=a[j][k];
b[j-1][k+1] +=a[j][k];
b[j][k-1] +=a[j][k];
b[j][k] +=a[j][k];
b[j][k+1] +=a[j][k];
b[j+1][k-1] +=a[j][k];
b[j+1][k] +=a[j][k];
b[j+1][k+1] +=a[j][k];
}
}
}
for (j=1;j<=9;j++) //???????????
{
for (k=1;k<=9;k++)
{
cout<<b[j][k];
if (k!=9) cout<<" ";
}
cout<<endl;
}
return 0;
}
| 48 |
23,954 | int main ( )
{
int i, j, k, m, n, jun1[9][9] = {0}, jun2[9][9] = {0};
cin >> m >> n;
jun1[4][4] = jun2[4][4] = m;
for(k = 0;k < n;k++)
{
for(i = 0;i < 9;i++)
{
for(j = 0;j < 9;j++)
{
if(jun1[i][j] != 0)
{
jun2[i-1][j] += jun1[i][j];
jun2[i+1][j] += jun1[i][j];
jun2[i][j-1] += jun1[i][j];
jun2[i][j+1] += jun1[i][j];
jun2[i-1][j-1] += jun1[i][j];
jun2[i+1][j-1] += jun1[i][j];
jun2[i-1][j+1] += jun1[i][j];
jun2[i+1][j+1] += jun1[i][j];//8?????????????
jun2[i][j] = 2 * jun1[i][j] + jun2[i][j] - jun1[i][j];//??????????
}
}
}
for(i = 0;i < 9;i++)//????
{
for(j = 0;j < 9;j++)
jun1[i][j] = jun2[i][j];
}
}
for(i = 0;i < 9;i++)
{
for(j = 0;j < 9;j++)
{
if(j == 8)
cout << jun1[i][j] <<endl;
else cout << jun1[i][j] <<' ';
}
}
return 0;
} | 48 |
23,955 | int main()
{
int d,m,n,i,j,a[9][9],b[9][9];
scanf("%d%d",&m,&n);
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
a[i][j]=0;
b[i][j]=0;
}
}
a[4][4]=m;
for(d=1;d<=n;d++)
{
if(d%2==1)
{
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(a[i][j]!=0)
{
b[i-1][j-1]+=a[i][j];
b[i-1][j]+=a[i][j];
b[i-1][j+1]+=a[i][j];
b[i][j-1]+=a[i][j];
b[i][j+1]+=a[i][j];
b[i+1][j-1]+=a[i][j];
b[i+1][j]+=a[i][j];
b[i+1][j+1]=+a[i][j];
b[i][j]+=a[i][j]*2;
a[i][j]=0;
}
}
}
}
else
{
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(b[i][j]!=0)
{
a[i-1][j-1]+=b[i][j];
a[i-1][j]+=b[i][j];
a[i-1][j+1]+=b[i][j];
a[i][j-1]+=b[i][j];
a[i][j+1]+=b[i][j];
a[i+1][j-1]+=b[i][j];
a[i+1][j]+=b[i][j];
a[i+1][j+1]+=b[i][j];
a[i][j]+=b[i][j]*2;
b[i][j]+=0;
}
}
}
}
}
if(n%2==1)
{
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
printf("%d ",b[i][j]);
}
printf("%d\n",b[i][8]);
}
}
else
{
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
printf("%d ",a[i][j]);
}
printf("%d\n",a[i][8]);
}
}
return 0;
} | 48 |
23,956 | int a[9][9]={0},m,n;
void produce(int i,int j,int n)
{
if(n == 0)
{
return;
}
else
{
a[i - 1][j - 1] += m;
a[i - 1][j] += m;
a[i - 1][j + 1] += m;
a[i][j - 1] +=m;
a[i][j] += m;
a[i][j + 1] += m;
a[i + 1][j - 1] += m;
a[i + 1][j] += m;
a[i + 1][j + 1] += m;
produce(i,j,n-1);
produce(i,j,n-1);
produce(i-1,j-1,n-1);
produce(i-1,j,n-1);
produce(i-1,j+1,n-1);
produce(i,j-1,n-1);
produce(i,j+1,n-1);
produce(i+1,j-1,n-1);
produce(i+1,j,n-1);
produce(i+1,j+1,n-1);
}
}
int main()
{
cin>>m>>n;
a[4][4]=m;
produce(4,4,n);
int row=0,col=0;
for(row=0;row<=8;row++)
{
for(col=0;col<=8;col++)
{
if(col != 8)
{
cout<<a[row][col]<<" ";
}
else
{
cout<<a[row][col]<<endl;
}
}
}
return 0;
} | 48 |
23,957 | //****************************
//**Title: ???????? **
//**Author:???1300017687 **
//**Date?2013.12.5 **
//**File?2.cpp **
//****************************
int first; //????????????
int findbat(int i, int j, int days) //????????days??i?j???????
{
if ((i == -1) || (i == 9) || (j == -1) || (j == 9)) //??????
return 0; //????0
if (days == 0) //??days?0
{
if (i == 4 && j == 4) //???????
return first;
else
return 0;
}
else
return findbat(i - 1, j - 1, days - 1) + findbat(i - 1, j , days - 1) + findbat(i - 1, j + 1, days - 1)
+ findbat(i , j - 1 , days - 1) + 2 * findbat(i , j ,days - 1) + findbat(i, j + 1,days - 1 )
+ findbat(i + 1, j - 1, days - 1) + findbat(i + 1, j , days - 1) + findbat (i + 1, j + 1, days - 1); //????
}
int main()
{
int days; //??
cin >> first >> days;
for (int i = 0 ; i <= 8 ; i++) //?????????
{
cout << findbat(i,0,days);
for(int j = 1; j <= 8 ; j++)
cout << ' ' << findbat(i,j,days);
cout << endl;
}
return 0;
} | 48 |
23,958 |
int main(int argc, char* argv[])
{
int sz[9][9][5],n,m,i,j,k,p,q;
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
for(k=0;k<5;k++)
{
sz[i][j][k]=0;
}
}
}
scanf("%d %d",&n,&m);
sz[4][4][0]=n;
for(k=0;k<m;k++)
{
for(i=1;i<8;i++)
{
for(j=1;j<8;j++)
{
if(sz[i][j][k]!=0)
{
sz[i-1][j-1][k+1]+=sz[i][j][k];
sz[i-1][j][k+1]+=sz[i][j][k];
sz[i-1][j+1][k+1]+=sz[i][j][k];
sz[i][j-1][k+1]+=sz[i][j][k];
sz[i][j][k+1]+=sz[i][j][k]*2;
sz[i][j+1][k+1]+=sz[i][j][k];
sz[i+1][j-1][k+1]+=sz[i][j][k];
sz[i+1][j][k+1]+=sz[i][j][k];
sz[i+1][j+1][k+1]+=sz[i][j][k];
}
}
}
}
for(i=0;i<9;i++)
{
printf("%d",sz[i][0][m]);
for(j=1;j<9;j++)
{
printf(" %d",sz[i][j][m]);
}
printf("\n");
}
return 0;
} | 48 |
23,959 |
int cell[20][20];//total simulation array
struct cell_q
{
int px,py,num;
} queue[10000];
void Grow(int px,int py,int num)
{
cell[px][py]+=num;
cell[px-1][py]+=num;
cell[px+1][py]+=num;
cell[px][py-1]+=num;
cell[px][py+1]+=num;
cell[px-1][py-1]+=num;
cell[px-1][py+1]+=num;
cell[px+1][py-1]+=num;
cell[px+1][py+1]+=num;
return;
}
int main()
{
int n,m,x,y,d;
cin>>m>>n;
cell[5][5]=m;
int head=0,tail=0;
for(d=1;d<=n;d++)
{
for(x=1;x<=9;x++)
{
for(y=1;y<=9;y++)
{
if(cell[x][y]!=0)
{
queue[tail].px=x;
queue[tail].py=y;
queue[tail].num=cell[x][y];
tail++;//Stand by for growth
}
}
}
while(head<tail)
{
Grow(queue[head].px,queue[head].py,queue[head].num);
head++;
}
}
for(x=1;x<=9;x++)
{
for(y=1;y<=8;y++)
{
cout<<cell[x][y]<<' ';
}
cout<<cell[x][9]<<endl;
}
return 0;
} | 48 |
23,960 |
int a[9][9] = {0}, b[9][9] = {0}; //a????????b????????
void propagate( int m, int n )
{
int k = 0;
int num; //??????
a[4][4] = m;
while ( k < n )
{
for ( int i = 0; i < 9; i++ )
{
for ( int j = 0; j < 9; j++ )
{
b[i][j] = 0; //?????
}
}
for (int i = 0; i < 9; i++ )
{
for ( int j = 0; j < 9; j++ )
{
if ( a[i][j] != 0 )
{
num = a[i][j];
a[i][j] = 2 * num;
b[i-1][j-1] += num;
b[i-1][j] += num;
b[i-1][j+1] += num;
b[i+1][j] += num;
b[i+1][j+1] += num;
b[i+1][j-1] += num;
b[i][j+1] += num;
b[i][j-1] += num;
}
}
}
for ( int i = 0; i < 9; i++ )
{
for ( int j = 0; j < 9; j++ )
{
a[i][j] += b[i][j];
}
}
k++;
}
for ( int x = 0; x < 9; x++ )
{
for ( int y = 0; y < 9; y++ )
{
if ( y == 0 )
cout << a[x][y];
else if ( y == 8 )
cout << " " << a[x][y] << endl;
else
cout << " " << a[x][y];
}
}
}
int main()
{
int m, n;
cin >> m >> n;
propagate( m, n );
return 0;
} | 48 |
23,961 | int main()
{
int a[9][9]={0},b[9][9]={0},i,j,k,m,n,l,x,y,t;//a??????????b????????????????
cin>>m;
cin>>n;
a[4][4]=m;
for(i=0;i<n;i++)
{
for(y=0;y<=8;y++)
for(t=0;t<=8;t++)
b[y][t]=0;
for(j=4-i;j<=(4+i);j++)
{
for(k=4-i;k<=(4+i);k++)
{
b[j-1][k-1]=b[j-1][k-1]+a[j][k];//??? ????????????????????
b[j-1][k]=b[j-1][k]+a[j][k];
b[j-1][k+1]=b[j-1][k+1]+a[j][k];
b[j][k-1]=b[j][k-1]+a[j][k];
b[j][k+1]=b[j][k+1]+a[j][k];
b[j+1][k-1]=b[j+1][k-1]+a[j][k];
b[j+1][k]=b[j+1][k]+a[j][k];
b[j+1][k+1]=b[j+1][k+1]+a[j][k];
}
}
for(l=3-i;l<=(5+i);l++)
{
for(x=3-i;x<=(5+i);x++)
{
a[l][x]=2*a[l][x]+b[l][x];//????????
}
}
}
for(i=0;i<=8;i++)
{
for(j=0;j<=7;j++)
{
cout<<a[i][j]<<" ";
}
cout<<a[i][8]<<endl;//????
}
return 0;
} | 48 |
23,962 | //*************************************************
//***???????????***
//***??????***
//***???2013.1.13***
//*************************************************
int a[11][11],b[11][11];
void f()
{
int i,j;
for (i = 1; i <= 9; i++)
{
for (j = 1; j <= 9; j++)
{
b[i][j] = 2 * a[i][j] + a[i - 1][j] + a[i + 1][j] + a[i][j - 1] + a[i][j + 1] + a[i - 1][j - 1] + a[i - 1][j + 1] + a[i + 1][j - 1] + a[i + 1][j + 1];
}
}
for (i = 1; i <= 9; i++)
{
for (j = 1; j <= 9; j++)
{
a[i][j] = b[i][j];
}
}
}
int main ()
{
int i,j,n,m;
cin >> n >> m;
for (i = 0; i < 11; i++)
{
for (j = 0; j < 11; j++)
{
a[i][j] = 0;
}
}
a[5][5] = n;
for (i = 0; i < m; i++)
{
f();
}
for (i = 1; i <= 9; i++)
{
for (j = 1; j <= 9; j++)
{
cout << a[i][j];
if (j != 9)
cout << " ";
}
cout << endl;
}
return 0;
} | 48 |
23,963 | /************************************
1.cpp
???2011-11-23
??(11.8) ????????
?? 1100012886
************************************/
//??????????????????
int main()
{
int i, j, i1, j1, n, n1 = 0, m;
int sperm[9][9] = {0}, temp[9][9]; //??????????????????????????????????
cin >> m >> n;
sperm[4][4] = m;
do
{
n1++; //n1?????
for (i = 0; i <= 8; i++)
{
for (j = 0; j <= 8; j++)
{
temp[i][j] = 0;
}
} //?temp????
for (i = 5 - n1; i <= 3 + n1; i++)
{
for (j = 5 - n1; j <= 3 + n1; j++)
{
//?????????????n1??????
for (i1 = i - 1; i1 <= i + 1; i1++)
{
for (j1 = j - 1; j1 <= j + 1; j1++)
{
temp[i1][j1] = temp[i1][j1] + sperm[i][j]; //?????????temp
}
}
}
}
for (i = 0; i <= 8; i++)
{
for (j = 0; j <= 8; j++)
{
sperm[i][j] = sperm[i][j] + temp[i][j];
}
} //??
} while (n1 < n);
for (i = 0; i <= 8; i++)
{
for (j = 0; j <= 8; j++)
{
cout << sperm[i][j];
if (j < 8) cout << " ";
}
cout << endl;
} //??
return 0;
}
| 48 |
23,964 |
int main()
{
int a[10][10] = {0}, b[10][10] = {0}, n, m;
int t[8][2] = {0, 1, 0, -1, 1, -1, 1, 1, 1, 0, -1, -1, -1, 0, -1, 1};
cin >> m >> n;
a[5][5] = m;
while (n--)
{
memset(b, 0, sizeof(b));
for (int i = 1; i <= 9; i++)
for (int j = 1; j <= 9; j++)
{
if (a[i][j] != 0)
{
for (int k = 0; k <= 7; k++)
{
b[i+t[k][0]][j+t[k][1]] += a[i][j];
}
b[i][j] += a[i][j] * 2;
}
}
for (int i = 1; i <= 9; i++)
for (int j = 1; j <= 9; j++)
{
a[i][j] = b[i][j];
}
}
for (int i = 1;i <= 9; i++)
{
cout << a[i][1];
for (int j = 2; j<= 9; j++) cout << " " << a[i][j];
cout << endl;
}
return 0;
}
| 48 |
23,965 | //****************************************
//*??????????? **
//*????? 1100012873 **
//*???2011.11.23 **
//****************************************
int s[11][11] = {0};
void ct (int, int);
int main()
{
int a, b, p, q;
cin >> a >> b;
ct (a, b);
for (p = 1;p < 10;p++)
for (q = 1;q < 10;q++)//????????????
{
if (q == 1)
cout << s[p][q];
else if (q == 9)
cout << ' ' << s[p][q] << endl;
else if (q >= 0 && q <= 9)
cout << ' ' << s[p][q];
}
return 0;
}
void ct (int m, int n)
{
int i,j,z[11][11];
if (n == 0)
s[5][5] = m;//?????????????
else
{
ct (m, n - 1);
for (i = 1;i < 10;i++)
for (j = 1;j < 10;j++)
z[i][j] = 2 * s[i][j] + s[i - 1][j] + s[i + 1][j] + s[i][j + 1] + s[i][j - 1] + s[i + 1][j + 1] + s[i - 1][j - 1] + s[i + 1][j - 1] + s[i - 1][j + 1];
for (i = 1;i < 10;i++)
for (j = 1;j < 10;j++)
s[i][j] = z[i][j];//z??????????????
}
}
| 48 |
23,966 | int main()
{
int a[5][11][11]={0};
int day,i,j,k;
scanf("%d%d",&a[0][5][5],&day);
for(i=1;i<=day;i++)
{
for(j=1;j<=9;j++)
{
for(k=1;k<=9;k++)
{
a[i][j][k]=a[i-1][j][k]*2+a[i-1][j-1][k-1]+a[i-1][j-1][k]+a[i-1][j-1][k+1]+a[i-1][j][k-1]+a[i-1][j][k+1]+a[i-1][j+1][k-1]+a[i-1][j+1][k]+a[i-1][j+1][k+1];
}
}
}
for(j=1;j<=9;j++)
{
for(k=1;k<9;k++)
{
printf("%d ",a[i-1][j][k]);
}
printf("%d\n",a[i-1][j][9]);
}
return 0;
}
| 48 |
23,967 | int m, n;
int i, j;
int a[10][10] = {0}, b[10][10] = {0};
void zuo(int x)
{
if(x == n)
{
for(i = 1; i <= 9; i++)
{
for(j = 1; j < 9; j++)
cout << a[i][j] << " ";
cout << a[i][9] << endl;
}
}
else
{
for(i = 1; i <= 9; i++)
{
for(j = 1; j <= 9; j++)
b[i][j] = a[i + 1][j + 1] + a[i][j] + a[i + 1][j - 1] + a[i - 1][j + 1] + a[i + 1][j]
+ a[i - 1][j] + a[i][j + 1] + a[i][j - 1]+ a[i - 1][j - 1];
}
for (i = 1; i <= 9; i++)
{
for (j = 1; j <= 9; j++)
{
a[i][j] += b[i][j];
b[i][j] = 0;
}
}
zuo(x + 1);
}
}
int main ()
{
cin >> m >> n;
a[5][5] = m;
zuo(0);
return 0;
}
| 48 |
23,968 | int num[10][10] , newnum[10][10] ;
void change(int , int);
int main()
{
int m , n , i , j , k;
cin >> m >> n ;
memset(num,0,sizeof(num));
num[5][5] = m ;
for ( i = 1 ; i <= n ; i++ )
{
memset(newnum,0,sizeof(newnum));
for ( j = 1 ; j <= 9 ; j++ )
for (k = 1 ; k <= 9 ; k++ )
change(j,k);
for ( j = 1 ; j <= 9 ; j++ )
for (k = 1 ; k <= 9 ; k++ )
num[j][k] += newnum[j][k] ;
}
for ( i = 1 ; i <= 9 ; i++ )
{
for ( j = 1 ; j <= 9 ; j++ )
{
if ( j == 1 ) cout << num[i][j] ;
else cout << " " << num[i][j] ;
}
cout << endl ;
}
return 0 ;
}
void change(int a , int b)
{
int i , j ;
for ( i = a-1 ; i <= a+1 ; i++ )
for ( j = b-1 ; j <= b+1 ; j++ )
newnum[a][b] += num[i][j] ;
} | 48 |
23,969 | int main()
{
int m,n,i,i1,i2,a[9][9],b[9][9],h,s;
for (i1=0;i1<9;i1++)
{
for (i2=0;i2<9;i2++)
{
a[i1][i2]=0;
b[i1][i2]=0;
}
}
scanf("%d%d",&m,&n);
a[4][4]=m;
b[4][4]=m;
for (i=0;i<n;i++)
{
for (i1=0;i1<9;i1++)
{
for (i2=0;i2<9;i2++)
{
if (a[i1][i2]!=0)
{
b[i1][i2]+=a[i1][i2];
if (i1-1>=0)
{
if (i2-1>=0)
b[i1-1][i2-1]+=a[i1][i2];
b[i1-1][i2]+=a[i1][i2];
if (i2+1<9)
b[i1-1][i2+1]+=a[i1][i2];
}
if (i2-1>=0)
b[i1][i2-1]+=a[i1][i2];
if (i2+1<9)
b[i1][i2+1]+=a[i1][i2];
if (i1+1<9)
{
if (i2-1>=0)
b[i1+1][i2-1]+=a[i1][i2];
b[i1+1][i2]+=a[i1][i2];
if (i2+1<9)
b[i1+1][i2+1]+=a[i1][i2];
}
}
}
}
for (h=0;h<9;h++)
{
for (s=0;s<9;s++)
{
a[h][s]=b[h][s];
}
}
}
for (i1=0;i1<9;i1++)
{
for (i2=0;i2<9;i2++)
{
if (i2!=8)
printf("%d ", a[i1][i2]);
else
printf("%d\n", a[i1][i2]);
}
}
return 0;
}
| 48 |
23,970 | main()
{
int a[11][11];
int b[11][11];
int m,n;
for(int i=0;i<11;i++)
{
for(int j=0;j<11;j++)
{
a[i][j]=0;
b[i][j]=0;
}
}
scanf("%d %d",&m,&n);
a[5][5]=m;
for(int z=0;z<n;z++)
{
for(int x=1;x<10;x++)
{
for(int y=1;y<10;y++)
{
b[x][y]=a[x+1][y]+a[x-1][y]+a[x][y+1]+a[x][y-1]+a[x+1][y+1]+a[x+1][y-1]+a[x-1][y+1]+a[x-1][y-1];
}
}
for(int x=1;x<10;x++)
{
for(int y=1;y<10;y++)
{
a[x][y]=2*a[x][y]+b[x][y];
}
}
}
for(int x=1;x<10;x++)
{
printf("%d",a[x][1]);
for(int y=2;y<10;y++)
{
printf(" %d",a[x][y]);
}
printf("\n");
}
}
| 48 |
23,971 | int main()
{
int m,n,i,j,k,a[9][9],b[9][9];
cin>>m>>n;
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
a[i][j]=0;
}
}
a[4][4]=m;
for(k=1;k<=n;k++)
{
for(i=1;i<8;i++)
{
for(j=1;j<8;j++)
{
b[i][j]=a[i-1][j]+a[i+1][j]+a[i][j-1]+a[i][j+1]+a[i+1][j+1]+a[i-1][j+1]+a[i+1][j-1]+a[i-1][j-1]+2*a[i][j];
}
}
b[0][0]=a[1][1];
b[8][8]=a[7][7];
b[0][8]=a[1][7];
b[8][0]=a[7][1];
for(i=1;i<8;i++)
{
b[i][0]=a[i][1]+a[i-1][1]+a[i+1][1];
b[i][8]=a[i][7]+a[i-1][7]+a[i+1][7];
}
for(j=1;j<8;j++)
{
b[0][j]=a[1][j]+a[1][j-1]+a[1][j+1];
b[8][j]=a[7][j]+a[7][j-1]+a[7][j+1];
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
a[i][j]=b[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
cout<<b[i][j]<<' ';
}
cout<<b[i][8]<<endl;
}
return 0;
}
| 48 |
23,972 | int main()
{
int m,n,i,j,k,t;
scanf("%d%d",&m,&n);
int a[9][9]={0},b[9][9]={0};
a[4][4]=m;
for (i=1;i<=n;i++)
{
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
{
if(a[j][k]==0)continue;
else
{
t=a[j][k];
b[j][k]+=2*t;
b[j-1][k-1]+=t;
b[j-1][k]+=t;
b[j-1][k+1]+=t;
b[j][k-1]+=t;
b[j][k+1]+=t;
b[j+1][k-1]+=t;
b[j+1][k]+=t;
b[j+1][k+1]+=t;
}
}
}
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
{
a[j][k]=b[j][k];
b[j][k]=0;
}
}
}
for(j=0;j<9;j++)
{
for(k=0;k<8;k++)
{
printf("%d ",a[j][k]);
}
printf("%d\n",a[j][8]);
}
return 0;
}
| 48 |
23,973 |
int main(int argc, char* argv[])
{
int m,n;
int a[9][9],b[9][9];
int i,j,k,x,y;
scanf("%d%d",&m,&n);
memset(a,0,sizeof(a));
a[4][4]=m;
for(k=0;k<n;k++)
{
memset(b,0,sizeof(b));
for(i=1;i<8;i++)
{
for(j=1;j<8;j++)
{
b[i][j]+=a[i][j];
for(x=-1;x<=1;x++)
{
for(y=-1;y<=1;y++)
{
b[i+x][j+y]+=a[i][j];
}
}
}
}
memcpy(a,b,sizeof(a));
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++){printf("%d ",a[i][j]);}
printf("%d\n",a[i][8]);
}
return 0;
}
| 48 |
23,974 | //**************************************
//*???????????
//*????? 1100012780
//*???2011.11.23
//**************************************
int m;//?????
int day;//??
int spread[9][9] = {0};
void bac(int n)
{
int i,j;
int produce[9][9] = {0};
for (i = 0;i <= 8;i++)
for (j = 0;j <= 8;j++)
{
if (spread[i][j] != 0)
{
produce[i][j] += 2 * spread[i][j];//???????????????
produce[i - 1][j - 1] += spread[i][j];//???????
produce[i - 1][j] += spread[i][j];
produce[i - 1][j + 1] += spread[i][j];
produce[i][j + 1] += spread[i][j];
produce[i][j - 1] += spread[i][j];
produce[i + 1][j - 1] += spread[i][j];
produce[i + 1][j] += spread[i][j];
produce[i + 1][j + 1] += spread[i][j];
}
}
for (i = 0;i <= 8;i++)
for (j = 0;j <= 8;j++)
spread[i][j] = produce[i][j];
if (n == day)//???????????
{
for (i = 0;i <= 8;i++)
{
for (j = 0;j <= 8;j++)
{
if (j != 8)
cout<<spread[i][j]<<" ";
else
cout<<spread[i][j];
}
if (i != 8)
cout<<endl;
}
return;
}
bac(n + 1);//?????
}
int main()
{
cin>>m>>day;
spread[4][4] = m;
bac(1);
return 0;
}
| 48 |
23,975 |
int bac[9][9] = {0};
void born(int x, int n)
{
if(x < n)
{
int i, j, k, l;
int a[9][9] = {0};
for(i = 4 - x; i <= 4 + x; i++)
for(j = 4 - x; j <= 4 + x; j++)
{
if(bac[i][j] != 0)
{
a[i][j] += bac[i][j];
for(k = i - 1; k <= i + 1; k++)
for(l = j - 1; l <= j + 1; l++)
{
a[k][l] += bac[i][j];
}
}
}
for(i = 0; i < 9; i++)
for(j = 0; j < 9; j++)
{
bac[i][j] = a[i][j];
}
born(x+1, n);
}
}
int main()
{
int m, n;
cin >> m >> n;
bac[4][4] = m;
born(0, n);
for(int i = 0; i < 9; i++)
for(int j = 0; j < 9; j++)
{
cout << bac[i][j];
if(j != 8)
cout << " ";
else
cout << endl;
}
return 0;
}
| 48 |
23,976 | /*
* Q6.cpp
*
* Created on: 2011-1-9
* Author: jsgl
*/
int board[9][9];
void printBoard();
int main() {
memset(board, 0, sizeof(board));
int m, n, i, j, k;
cin >> m >> n;
board[4][4] = m;
for (i = 3; i < 6; i++)
for (j = 3; j < 6; j++)
board[i][j] += m;
int temp[9][9];
if (n >= 2) {
memset(temp, 0, sizeof(temp));
for (i = 3; i < 6; i++)
for (j = 3; j < 6; j++) {
board[i][j] *= 2;
temp[i][j] = board[i][j];
}
//printBoard();
for (i = 3; i < 6; i++)
for (j = 3; j < 6; j++) {
board[i - 1][j] += temp[i][j] / 2;
board[i + 1][j] += temp[i][j] / 2;
board[i][j + 1] += temp[i][j] / 2;
board[i][j - 1] += temp[i][j] / 2;
board[i - 1][j - 1] += temp[i][j] / 2;
board[i + 1][j + 1] += temp[i][j] / 2;
board[i - 1][j + 1] += temp[i][j] / 2;
board[i + 1][j - 1] += temp[i][j] / 2;
}
}
if (n >= 3) {
memset(temp, 0, sizeof(temp));
for (i = 2; i < 7; i++)
for (j = 2; j < 7; j++) {
board[i][j] *= 2;
temp[i][j] = board[i][j];
}
for (i = 2; i < 7; i++)
for (j = 2; j < 7; j++) {
board[i - 1][j] += temp[i][j] / 2;
board[i + 1][j] += temp[i][j] / 2;
board[i][j + 1] += temp[i][j] / 2;
board[i][j - 1] += temp[i][j] / 2;
board[i - 1][j - 1] += temp[i][j] / 2;
board[i + 1][j + 1] += temp[i][j] / 2;
board[i - 1][j + 1] += temp[i][j] / 2;
board[i + 1][j - 1] += temp[i][j] / 2;
}
}
if (n >= 4) {
memset(temp, 0, sizeof(temp));
for (i = 1; i < 8; i++)
for (j = 1; j < 8; j++) {
board[i][j] *= 2;
temp[i][j] = board[i][j];
}
for (i = 1; i < 8; i++)
for (j = 1; j < 8; j++) {
board[i - 1][j] += temp[i][j] / 2;
board[i + 1][j] += temp[i][j] / 2;
board[i][j + 1] += temp[i][j] / 2;
board[i][j - 1] += temp[i][j] / 2;
board[i - 1][j - 1] += temp[i][j] / 2;
board[i + 1][j + 1] += temp[i][j] / 2;
board[i - 1][j + 1] += temp[i][j] / 2;
board[i + 1][j - 1] += temp[i][j] / 2;
}
}
printBoard();
return 0;
}
void printBoard() {
int i, j;
for (i = 0; i < 9; i++) {
cout << board[i][0];
for (j = 1; j < 9; j++)
cout << " " << board[i][j];
cout << endl;
}
}
| 48 |
23,977 | int main()
{
int a[11][11],b[11][11],i,j,n,d,days,k,l;
for (i=0;i<=10;i++)
{
for (j=0;j<=10;j++)
{
a[i][j]=0;
b[i][j]=0;
}
}
cin>>n>>days;
a[5][5]=n;
for (d=1;d<=days;d++)
{
for (k=0;k<=10;k++)
for (l=0;l<=10;l++)
b[k][l]=0;
for (i=1;i<=9;i++)
{
for (j=1;j<=9;j++)
{
if (a[i][j]!=0)
{
b[i][j]=a[i-1][j-1]+a[i-1][j]+a[i-1][j+1]+a[i][j-1]+a[i][j+1]+a[i+1][j-1]+a[i+1][j]+a[i+1][j+1]+a[i][j]*2;
}
else
{
if (a[i][j]==0&&((a[i-1][j-1]+a[i-1][j]+a[i-1][j+1]+a[i][j-1]+a[i][j+1]+a[i+1][j-1]+a[i+1][j]+a[i+1][j+1])!=0))
b[i][j]=a[i-1][j-1]+a[i-1][j]+a[i-1][j+1]+a[i][j-1]+a[i][j+1]+a[i+1][j-1]+a[i+1][j]+a[i+1][j+1];
}
}
}
for (k=1;k<=9;k++)
for (l=1;l<=9;l++)
a[k][l]=b[k][l];
}
for (i=1;i<=9;i++)
{
for (j=1;j<=8;j++)
{
cout<<a[i][j]<<" ";
}
cout<<a[i][9];
cout<<endl;
}
return 0;
}
| 48 |
23,978 | int main()
{
int m,n,i,h,l,s[9][9]={0},record[9][9]={0};
cin>>m>>n;
record[4][4]=s[4][4]=m;
for(i=0;i<n;i++)
{
for(h=0;h<9;h++)
for(l=0;l<9;l++)
{
if(record[h][l]!=0)
{
s[h][l]+=record[h][l];
s[h-1][l-1]+=record[h][l];
s[h][l-1]+=record[h][l];
s[h+1][l-1]+=record[h][l];
s[h-1][l]+=record[h][l];
s[h+1][l]+=record[h][l];
s[h+1][l+1]+=record[h][l];
s[h][l+1]+=record[h][l];
s[h-1][l+1]+=record[h][l];
}
}
for(h=0;h<9;h++)
for(l=0;l<9;l++)
record[h][l]=s[h][l];
}
for(h=0;h<9;h++)
{
cout<<s[h][0];
for(l=1;l<9;l++)
cout<<" "<<s[h][l];
cout<<endl;
}
return 0;
}
| 48 |
23,979 |
main()
{int square[9][9]={0};
int squ[9][9]={0};
int m,n,i,j,k,t,q;
scanf("%d",&m);
scanf("%d",&n);
square[4][4]=squ[4][4]=m;
for(i=1;i<=n;i++)
{for(j=0;j<=8;j++)
{for(k=0;k<=8;k++)
if (square[j][k]!=0)
{squ[j][k]=squ[j][k]+square[j][k];
squ[j][k+1]+=square[j][k];
squ[j][k-1]+=square[j][k];
squ[j+1][k]+=square[j][k];
squ[j+1][k+1]+=square[j][k];
squ[j+1][k-1]+=square[j][k];
squ[j-1][k]+=square[j][k];
squ[j-1][k+1]+=square[j][k];
squ[j-1][k-1]+=square[j][k];
}
}
for(t=0;t<=8;t++)
for(q=0;q<=8;q++)
{
square[q][t]=squ[q][t];}
}
for(t=0;t<=8;t++)
{for(q=0;q<=7;q++)
printf("%d ",square[t][q]);
printf("%d",square[t][8]);
printf("\n");
}
} | 48 |
23,980 | int main()
{
int m,n;
scanf("%d %d",&m,&n);
int a[9][9]={0},b[9][9]={0};
a[4][4]=m;
int i,j,k,fx,fy;
for(i=0;i<n;i++)
{
memset(b,0,sizeof(b));
for(j=1;j<8;j++)
{
for(k=1;k<8;k++)
{
b[j][k]+=a[j][k];
for(fx=-1;fx<=1;fx++)
for(fy=-1;fy<=1;fy++)
b[j+fx][k+fy]+=a[j][k];
}
}
memcpy(a,b,sizeof(a));
}
for(j=0;j<9;j++)
{
for(k=0;k<8;k++)
{
printf("%d ",a[j][k]);
}
printf("%d\n",a[j][8]);
}
return 0;
}
| 48 |
23,981 | int num[11][11];
int num1[11][11];
int increase(int a,int time)
{
if(a==time) return 1;
else
{
memset(num1,0,sizeof(num1));
for(int i=0;i<11;i++)
{
num[i][0]=num[i][10]=num[0][i]=num[i][10]=0;
}
for(int i=1;i<10;i++)
{
for(int j=1;j<10;j++)
{
if(num[i][j]!=0)
{
num1[i][j]=num1[i][j]+2*num[i][j];
num1[i][j-1]=num1[i][j-1]+num[i][j];
num1[i-1][j]=num1[i-1][j]+num[i][j];
num1[i+1][j]=num1[i+1][j]+num[i][j];
num1[i][j+1]=num1[i][j+1]+num[i][j];
num1[i-1][j-1]=num1[i-1][j-1]+num[i][j];
num1[i+1][j-1]=num1[i+1][j-1]+num[i][j];
num1[i-1][j+1]=num1[i-1][j+1]+num[i][j];
num1[i+1][j+1]=num1[i+1][j+1]+num[i][j];
}
}
}
for(int i=0;i<11;i++)
{
for(int j=0;j<11;j++)
{
num[i][j]=num1[i][j];
}
}
return increase(a+1,time);
}
}
int main()
{
int n,t;
cin>>n>>t;
memset(num,0,sizeof(num));
memset(num1,0,sizeof(num1));
num[5][5]=n;
num[5][5]=n;
increase(0,t);
for(int i=1;i<10;i++)
{
for(int j=1;j<9;j++)
{
cout<<num1[i][j]<<' ';
}
cout<<num1[i][9]<<endl;
}
return 0;
}
| 48 |
23,982 |
int m,n;
int a[9][9]={0},b[9][9]={0};
void xijunfanzhi (int day)
{
int i ,j;
if (day == n+1)
{
return;
}
else
{
for (i=0;i<9;i++)
{
for (j=0;j<9;j++)
{
if (a[i][j]!=0)
{
b[i+1][j]=b[i+1][j]+a[i][j];
b[i-1][j]=b[i-1][j]+a[i][j];
b[i+1][j+1]=b[i+1][j+1]+a[i][j];
b[i+1][j-1]=b[i+1][j-1]+a[i][j];
b[i-1][j+1]=b[i-1][j+1]+a[i][j];
b[i-1][j-1]=b[i-1][j-1]+a[i][j];
b[i][j+1]=b[i][j+1]+a[i][j];
b[i][j-1]=b[i][j-1]+a[i][j];
b[i][j]=b[i][j]+a[i][j];
}
}
}
for (i=0;i<9;i++)
{
for (j=0;j<9;j++)
{
a[i][j]=a[i][j]+b[i][j];
b[i][j]=0;
}
}
xijunfanzhi(day+1);
}
}
int main()
{
int i,j;
cin >> m >> n;a[4][4]=m;
xijunfanzhi(1);
for (i=0;i<9;i++)
{
for (j=0;j<9;j++)
{
if (j!=8)
cout << a[i][j]<<' ';
else
cout << a[i][j]<<endl;;
}
}
return 0;
}
| 48 |
23,983 | int main()
{
int i,j,k,m,n;
int xijun[11][11],next[11][11];
cin>>m>>n;
for(i=0;i<=10;i++)
{
for(j=0;j<=10;j++)
{
xijun[i][j]=0;
next[i][j]=0;
}
}
xijun[5][5]=next[5][5]=m;
for(i=1;i<=n;i++)
{
for(j=1;j<=9;j++)
{
for(k=1;k<=9;k++)
{
next[j][k]+=xijun[j][k];
next[j-1][k]+=xijun[j][k];
next[j-1][k-1]+=xijun[j][k];
next[j-1][k+1]+=xijun[j][k];
next[j][k-1]+=xijun[j][k];
next[j][k+1]+=xijun[j][k];
next[j+1][k-1]+=xijun[j][k];
next[j+1][k]+=xijun[j][k];
next[j+1][k+1]+=xijun[j][k];;
}
}
for(j=1;j<=9;j++)
{
for(k=1;k<=9;k++)
{
xijun[j][k]=next[j][k];
}
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<=8;j++)
{
cout<<xijun[i][j]<<" ";
}
cout<<xijun[i][9]<<endl;
}
return 0;
}
| 48 |
23,984 | int main()
{
int m,n;
scanf("%d %d",&m,&n);
int sz[5][9][9];
for(int i=0;i<9;i++)
{
for(int j=0;j<9;j++)
{sz[0][i][j]=0;}
}
sz[0][4][4]=m;
for(int t=0;t<n;t++)
{
for(int k=0;k<9;k++)
{
for(int hl=0;hl<9;hl++)
{
if(k!=0&&hl!=0&&k!=8&&hl!=8)
{
sz[t+1][k][hl]=2*sz[t][k][hl]+sz[t][k][hl-1]+sz[t][k][hl+1]+sz[t][k-1][hl+1]+sz[t][k+1][hl+1]+sz[t][k-1][hl]+sz[t][k-1][hl-1]+sz[t][k+1][hl]+sz[t][k+1][hl-1];
}
if(k==0&&hl!=0&&hl!=8)
{sz[t+1][0][hl]=2*sz[t][0][hl]+sz[t][0][hl-1]+sz[t][0][hl+1]+sz[t][1][hl+1]+sz[t][1][hl]+sz[t][1][hl-1];
}
if(k==8&&hl!=0&&hl!=8)
{sz[t+1][8][hl]=2*sz[t][8][hl]+sz[t][8][hl-1]+sz[t][8][hl+1]+sz[t][7][hl+1]+sz[t][7][hl]+sz[t][7][hl-1];
}
if(k!=0&&hl==0&&k!=8)
{
sz[t+1][k][0]=2*sz[t][k][0]+sz[t][k][1]+sz[t][k-1][1]+sz[t][k+1][1]+sz[t][k-1][0]+sz[t][k+1][0];
}
if(k!=0&&hl==8&&k!=8)
{
sz[t+1][k][8]=2*sz[t][k][8]+sz[t][k][7]+sz[t][k-1][7]+sz[t][k+1][7]+sz[t][k-1][8]+sz[t][k+1][8];
}
if(k==0&&hl==0)
{
sz[t+1][0][0]=2*sz[t][0][0]+sz[t][0][1]+sz[t][1][1]+sz[t][1][0];
}
if(k==0&&hl==8)
{
sz[t+1][0][8]=2*sz[t][0][8]+sz[t][0][7]+sz[t][1][7]+sz[t][1][8];
}
if(k==8&&hl==0)
{
sz[t+1][8][0]=2*sz[t][8][0]+sz[t][8][1]+sz[t][7][1]+sz[t][7][0];
}
if(k==8&&hl==8)
{
sz[t+1][8][8]=2*sz[t][8][8]+sz[t][8][7]+sz[t][7][7]+sz[t][7][8];
}
}
}
}
for(int row=0;row<9;row++)
{
for(int lo=0;lo<8;lo++)
{printf("%d ",sz[n][row][lo]);}
printf("%d\n",sz[n][row][8]);
}
return 0;
} | 48 |
23,985 | int main()
{
int m=0;int n,i,j;
cin>>m>>n;
int a[10][10]={0},b[10][10]={0},c[10][10]={0},d[10][10]={0},e[10][10]={0};
a[5][5]=m;
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
if(a[i][j]!=0){b[i][j]=2*a[i][j]+b[i][j];
b[i+1][j]=a[i][j]+b[i+1][j];
b[i-1][j]=a[i][j]+b[i-1][j];
b[i+1][j+1]=a[i][j]+b[i+1][j+1];
b[i-1][j+1]=a[i][j]+b[i-1][j+1];
b[i][j+1]=a[i][j]+b[i][j+1];
b[i+1][j-1]=a[i][j]+b[i+1][j-1];
b[i-1][j-1]=a[i][j]+b[i-1][j-1];
b[i][j-1]=a[i][j]+b[i][j-1];}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
if(b[i][j]!=0){c[i][j]=2*b[i][j]+c[i][j];
c[i+1][j]=b[i][j]+c[i+1][j];
c[i-1][j]=b[i][j]+c[i-1][j];
c[i+1][j+1]=b[i][j]+c[i+1][j+1];
c[i-1][j+1]=b[i][j]+c[i-1][j+1];
c[i][j+1]=b[i][j]+c[i][j+1];
c[i+1][j-1]=b[i][j]+c[i+1][j-1];
c[i-1][j-1]=b[i][j]+c[i-1][j-1];
c[i][j-1]=b[i][j]+c[i][j-1];}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
if(c[i][j]!=0){d[i][j]=2*c[i][j]+d[i][j];
d[i+1][j]=c[i][j]+d[i+1][j];
d[i-1][j]=c[i][j]+d[i-1][j];
d[i+1][j+1]=c[i][j]+d[i+1][j+1];
d[i-1][j+1]=c[i][j]+d[i-1][j+1];
d[i][j+1]=c[i][j]+d[i][j+1];
d[i+1][j-1]=c[i][j]+d[i+1][j-1];
d[i-1][j-1]=c[i][j]+d[i-1][j-1];
d[i][j-1]=c[i][j]+d[i][j-1];}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
if(d[i][j]!=0){e[i][j]=2*d[i][j]+e[i][j];
e[i+1][j]=d[i][j]+e[i+1][j];
e[i-1][j]=d[i][j]+e[i-1][j];
e[i+1][j+1]=d[i][j]+e[i+1][j+1];
e[i-1][j+1]=d[i][j]+e[i-1][j+1];
e[i][j+1]=d[i][j]+e[i][j+1];
e[i+1][j-1]=d[i][j]+e[i+1][j-1];
e[i-1][j-1]=d[i][j]+e[i-1][j-1];
e[i][j-1]=d[i][j]+e[i][j-1];}
if(n==1)
for(i=1;i<=9;i++)
for(j=1;j<=9;j++){if(j!=9)cout<<b[i][j]<<" ";else cout<<b[i][j]<<endl;}
if(n==2)
for(i=1;i<=9;i++)
for(j=1;j<=9;j++){if(j!=9)cout<<c[i][j]<<" ";else cout<<c[i][j]<<endl;}
if(n==3)
for(i=1;i<=9;i++)
for(j=1;j<=9;j++){if(j!=9)cout<<d[i][j]<<" ";else cout<<d[i][j]<<endl;}
if(n==4)
for(i=1;i<=9;i++)
for(j=1;j<=9;j++){if(j!=9)cout<<e[i][j]<<" ";else cout<<e[i][j]<<endl;}
cin.get();cin.get();
return 0;
} | 48 |
23,986 |
int m, n;
int main()
{
int produce(int x, int y, int n);
cin >> m >> n;
for(int i = 1; i <= 9; i ++)
{
cout << produce(i, 1, n);
for (int j = 2; j <= 9; j ++)
cout << " " << produce(i, j, n);
cout << endl;
}
return 0;
}
int produce(int x, int y, int day)
{
if(x == 0 || y == 0 || x == 10|| y == 10) return 0;
else if(day == 0)
{
if(x == 5 && y == 5) return m;
else return 0;
}
else return
(produce(x - 1, y, day - 1) + produce(x + 1, y, day - 1)
+ produce(x, y - 1, day - 1) + produce(x, y + 1, day - 1)+
produce(x, y , day - 1) * 2) + produce(x - 1, y - 1, day - 1)
+ produce(x - 1, y + 1, day - 1) + produce(x + 1, y - 1, day - 1)
+ produce(x + 1, y + 1, day - 1);
} | 48 |
23,987 | //********************************
//*?????? 1300012733 **
//*???2013?11?29?
//********************************
int arr[11][11]={0};
int brr[11][11]={0};
void proliferate( int day )
{
if( day == 0 )
return;
//?arr???brr?????????
memcpy( brr , arr , sizeof(arr) );
for( int i = 1; i <= 9; i++ )
for( int j = 1; j <= 9; j++ )
{
//???
arr[i][j] = 2 * brr[i][j] + brr[i-1][j] + brr[i+1][j] + brr[i][j-1] + brr[i][j+1]
+ brr[i-1][j-1] + brr[i+1][j+1] + brr[i+1][j-1] + brr[i-1][j+1];
}
day--;
proliferate( day );
}
int main()
{
cin >> arr[5][5];
int day;
cin >> day;
proliferate( day );
//????
for( int i = 1; i <= 9; i++ )
{
cout << arr[i][1];
for( int j = 2; j <= 9; j++ )
cout << ' ' << arr[i][j];
cout << endl;
}
return 0;
} | 48 |
23,988 | int main(){
int n,m,i,j,k;
int a[10][10][10];
scanf ("%d %d",&m,&n);
for (k=0;k<11;k++){
for (j=0;j<11;j++){
a[0][k][j]=0;
a[1][k][j]=0;
a[2][k][j]=0;
a[3][k][j]=0;
a[4][k][j]=0;
}
}
a[0][5][5]=m;
for (i=1;i<n+1;i++){
for (k=1;k<10;k++){
for (j=1;j<10;j++){
a[i][k][j]=2*a[i-1][k][j]+a[i-1][k][j-1]+a[i-1][k][j+1]+a[i-1][k+1][j-1]+a[i-1][k+1][j]+a[i-1][k+1][j+1]+ a[i-1][k-1][j-1]+a[i-1][k-1][j]+a[i-1][k-1][j+1];
}
}
}
for (k=1;k<10;k++){
for (j=1;j<9;j++){
printf("%d ",a[n][k][j]) ;
}
printf("%d\n",a[n][k][9]) ;
}
return 0;
} | 48 |
23,989 | int main()
{
//???????
int m, n, i,j, k, l;
int sqare[2][11][11]={0};//[2]??????????????????????,[9][9]???[2][2]?????
cin>>m>>n;
for(j=0; j<2; j++)
for(k=1; k<=9; k++)
for(l=1; l<=9; l++)
{
sqare[j][k][l]=0;
}
sqare[0][5][5]=m;
for(i=0; i<n; i++)//??
{
//??????????
for(k=1; k<=9; k++)
for(l=1; l<=9; l++)
{
sqare[1][k][l]+=2*sqare[0][k][l];
sqare[1][k-1][l]+=sqare[0][k][l];
sqare[1][k+1][l]+=sqare[0][k][l];
sqare[1][k][l+1]+=sqare[0][k][l];
sqare[1][k][l-1]+=sqare[0][k][l];
sqare[1][k-1][l-1]+=sqare[0][k][l];
sqare[1][k-1][l+1]+=sqare[0][k][l];
sqare[1][k+1][l-1]+=sqare[0][k][l];
sqare[1][k+1][l+1]+=sqare[0][k][l];
}
//?????????
for(k=1; k<=9; k++)
for(l=1; l<=9; l++)
{
sqare[0][k][l]=sqare[1][k][l];
}
//?0
for(k=1; k<=9; k++)
for(l=1; l<=9; l++)
{
sqare[1][k][l]=0;
}
}
//??
for(k=1; k<=9; k++)
{
for(l=1; l<=9; l++)
{
if(l==1)
cout<<sqare[0][k][l];
else
cout<<" "<<sqare[0][k][l];
}
cout<<endl;
}
return 0;
}
| 48 |
23,990 | int main(int argc, char* argv[])
{
int s[9][9],b[9][9];
int m,n,i,t,q,a,x,y;
scanf("%d%d",&m,&n);
for(i=0;i<9;i++)
{
for(t=0;t<9;t++)
{
s[i][t]=0;b[i][t]=0;
}
}
s[4][4]=1;
for(q=0;q<n;q++)
{
for(i=0;i<9;i++)
{
for(t=0;t<9;t++)
{
if(s[i][t]>0)
{
a=s[i][t];
for(x=i-1;x<=i+1;x++)
{
for(y=t-1;y<=t+1;y++)
{
b[x][y]+=a;
}
}
b[i][t]+=a;
}
}
}
for(i=0;i<9;i++)
{
for(t=0;t<9;t++)
{
s[i][t]=b[i][t];b[i][t]=0;
}
}
}
for(i=0;i<9;i++)
{
for(t=0;t<9;t++)
{
if(t==0)printf("%d",s[i][t]*m);
else printf(" %d",s[i][t]*m);
}
printf("\n");
}
return 0;
}
| 48 |
23,991 | int main()
{
int s[9][9],s1[9][9],i=0,j=0,m=0,n=0,k=0;
for(i=0;i<=8;i++)//???
{
for(j=0;j<=8;j++)
{
s[i][j]=0;
s1[i][j]=0;
}
}
cin>>m>>n;
s[4][4]=m;
for(k=1;k<=n;k++)//??
{
for(i=1;i<=7;i++) //??
{
for(j=1;j<=7;j++)
{
if(s[i][j]!=0)
{
s1[i][j]+=2*s[i][j];
s1[i+1][j]+=s[i][j];
s1[i-1][j]+=s[i][j];
s1[i][j+1]+=s[i][j];
s1[i][j-1]+=s[i][j];
s1[i+1][j+1]+=s[i][j];
s1[i-1][j-1]+=s[i][j];
s1[i+1][j-1]+=s[i][j];
s1[i-1][j+1]+=s[i][j];
}
}
}
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
s[i][j]=s1[i][j];
}
}
for(i=0;i<=8;i++) //s1??
{
for(j=0;j<=8;j++)
{
s1[i][j]=0;
}
}
}
for(i=0;i<=8;i++)//??
{
for(j=0;j<=8;j++)
{
if(j==0)
{cout<<s[i][j];continue;}
if(j==8)
{cout<<" "<<s[i][j]<<endl;continue; }
cout<<" "<<s[i][j];
}
}
return 0;
} | 48 |
23,992 | int main()
{
int a[5][11][11]={0},m,n,i,j,k,p,q;
scanf("%d%d", &m, &n);
a[0][5][5]=m;
for(k=1;k<=n;k++) for(i=1;i<=9;i++) for(j=1;j<=9;j++)
{for(p=i-1;p<=i+1;p++) for(q=j-1;q<=j+1;q++) a[k][i][j]+=a[k-1][p][q]; a[k][i][j]+=a[k-1][i][j];}
for(i=1;i<=9;i++)
{
for(j=1;j<=8;j++) printf("%d ", a[n][i][j]);
printf("%d\n", a[n][i][9]);
}
return 0;
}
| 48 |
23,993 | int main()
{int i,j,k;
int s[9][9][5];
int m,n;
cin>>m>>n;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
for(k=0;k<5;k++)
{s[i][j][k]=0;}
s[4][4][0]=m;
for(k=1;k<n+1;k++)
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{if(i==0&&j==0)
s[i][j][k]=s[i+1][j][k-1]+s[i][j+1][k-1]+2*s[i][j][k-1]+s[i+1][j+1][k-1];
if(i==0&&j==8)
s[i][j][k]=s[i+1][j][k-1]+s[i][j-1][k-1]+2*s[i][j][k-1]+s[i+1][j-1][k-1];
if(i==8&&j==0)
s[i][j][k]=s[i-1][j][k-1]+s[i][j+1][k-1]+2*s[i][j][k-1]+s[i-1][j+1][k-1];
if(i==8&&j==8)
s[i][j][k]=s[i-1][j][k-1]+s[i][j-1][k-1]+2*s[i][j][k-1]+s[i-1][j-1][k-1];
if(i==0&&j!=0&&j!=8)
s[i][j][k]=s[i+1][j][k-1]+s[i][j+1][k-1]+s[i][j-1][k-1]+2*s[i][j][k-1]+s[i+1][j-1][k-1]+s[i+1][j+1][k-1];
if(i==8&&j!=0&&j!=8)
s[i][j][k]=s[i-1][j][k-1]+s[i][j+1][k-1]+s[i][j-1][k-1]+2*s[i][j][k-1]+s[i-1][j-1][k-1]+s[i-1][j+1][k-1];
if(j==8&&i!=0&&i!=8)
s[i][j][k]=s[i-1][j][k-1]+s[i+1][j][k-1]+s[i][j-1][k-1]+2*s[i][j][k-1]+s[i+1][j-1][k-1]+s[i-1][j-1][k-1];
if(j==0&&i!=0&&i!=8)
s[i][j][k]=s[i-1][j][k-1]+s[i+1][j][k-1]+s[i][j+1][k-1]+2*s[i][j][k-1]+s[i+1][j+1][k-1]+s[i-1][j+1][k-1];
if(i!=0&&j!=0&&i!=8&&j!=8)
s[i][j][k]=s[i-1][j][k-1]+s[i+1][j][k-1]+s[i][j-1][k-1]+s[i][j+1][k-1]+2*s[i][j][k-1]+s[i+1][j-1][k-1]+s[i+1][j+1][k-1]+s[i-1][j-1][k-1]+s[i-1][j+1][k-1];
}
for(i=0;i<9;i++)
{for(j=0;j<8;j++)
{cout<<s[i][j][n]<<" ";}
cout<<s[i][8][n]<<endl;}
return 0;
}
| 48 |
23,994 | int main()
{
int m, n;
scanf("%d%d",&m, &n);
if(n==4){
printf("%d %d %d %d %d %d %d %d %d\n",m,4*m,10*m,16*m,19*m,16*m,10*m,4*m,m);
printf("%d %d %d %d %d %d %d %d %d\n",4*m,20*m,52*m,88*m,104*m,88*m,52*m,20*m,4*m);
printf("%d %d %d %d %d %d %d %d %d\n",10*m,52*m,142*m,244*m,292*m,244*m,142*m,52*m,10*m);
printf("%d %d %d %d %d %d %d %d %d\n",16*m,88*m,244*m,428*m,512*m,428*m,244*m,88*m,16*m);
printf("%d %d %d %d %d %d %d %d %d\n",19*m,104*m,292*m,512*m,616*m,512*m,292*m,104*m,19*m);
printf("%d %d %d %d %d %d %d %d %d\n",16*m,88*m,244*m,428*m,512*m,428*m,244*m,88*m,16*m);
printf("%d %d %d %d %d %d %d %d %d\n",10*m,52*m,142*m,244*m,292*m,244*m,142*m,52*m,10*m);
printf("%d %d %d %d %d %d %d %d %d\n",4*m,20*m,52*m,88*m,104*m,88*m,52*m,20*m,4*m);
printf("%d %d %d %d %d %d %d %d %d\n",m,4*m,10*m,16*m,19*m,16*m,10*m,4*m,m);}
if(n==1){
printf("0 0 0 0 0 0 0 0 0\n");
printf("0 0 0 0 0 0 0 0 0\n");
printf("0 0 0 0 0 0 0 0 0\n");
printf("0 0 0 %d %d %d 0 0 0\n",m,m,m);
printf("0 0 0 %d %d %d 0 0 0\n",m,2*m,m);
printf("0 0 0 %d %d %d 0 0 0\n",m,m,m);
printf("0 0 0 0 0 0 0 0 0\n");
printf("0 0 0 0 0 0 0 0 0\n");
printf("0 0 0 0 0 0 0 0 0\n");}
if(n==2){
printf("0 0 0 0 0 0 0 0 0\n");
printf("0 0 0 0 0 0 0 0 0\n");
printf("0 0 %d %d %d %d %d 0 0\n",m,2*m,3*m,2*m,m);
printf("0 0 %d %d %d %d %d 0 0\n",2*m,6*m,8*m,6*m,2*m);
printf("0 0 %d %d %d %d %d 0 0\n",3*m,8*m,12*m,8*m,3*m);
printf("0 0 %d %d %d %d %d 0 0\n",2*m,6*m,8*m,6*m,2*m);
printf("0 0 %d %d %d %d %d 0 0\n",m,2*m,3*m,2*m,m);
printf("0 0 0 0 0 0 0 0 0\n");
printf("0 0 0 0 0 0 0 0 0\n");}
if(n==3){
printf("0 0 0 0 0 0 0 0 0\n");
printf("0 %d %d %d %d %d %d %d 0\n",m,3*m,6*m,7*m,6*m,3*m,m);
printf("0 %d %d %d %d %d %d %d 0\n",3*m,12*m,24*m,30*m,24*m,12*m,3*m);
printf("0 %d %d %d %d %d %d %d 0\n",6*m,24*m,51*m,63*m,51*m,24*m,6*m);
printf("0 %d %d %d %d %d %d %d 0\n",7*m,30*m,63*m,80*m,63*m,30*m,7*m);
printf("0 %d %d %d %d %d %d %d 0\n",6*m,24*m,51*m,63*m,51*m,24*m,6*m);
printf("0 %d %d %d %d %d %d %d 0\n",3*m,12*m,24*m,30*m,24*m,12*m,3*m);
printf("0 %d %d %d %d %d %d %d 0\n",m,3*m,6*m,7*m,6*m,3*m,m);
printf("0 0 0 0 0 0 0 0 0\n");}
return 0;
}
| 48 |
23,995 | int main()
{
int m, n, i, j, days, left[9][9], seperate[9][9];
cin >> m >> n;
int a[9][9] = {0};
a[4][4] = m;
for (days = 0; days < n; days++)
{
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++)
{
left[i][j] = a[i][j] * 2;
a[i][j] *= 10;
seperate[i][j] = (a[i][j] - left[i][j]) / 8;
a[i][j] = left[i][j];
}
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++)
{
a[i + 1][j] += seperate[i][j];
a[i - 1][j] += seperate[i][j];
a[i + 1][j + 1] += seperate[i][j];
a[i - 1][j - 1] += seperate[i][j];
a[i + 1][j - 1] += seperate[i][j];
a[i - 1][j + 1] += seperate[i][j];
a[i][j + 1] += seperate[i][j];
a[i][j - 1] += seperate[i][j];
}
}
for (i = 0; i < 9; i++)
{
for (j = 0; j < 8; j++)
cout << a[i][j] << " ";
cout << a[i][8] << endl;
}
return 0;
}
| 48 |
23,996 | int main()
{
int a[10][11][11]={0},i,j,k,m,n;
cin>>m>>n;
a[0][5][5]=m;
for(k=1;k<=n;k++)
{
for(i=1;i<10;i++)
for(j=1;j<10;j++)
{
if(a[k-1][i][j]>0)
{
a[k][i][j]=a[k][i][j]+a[k-1][i][j]*2;
a[k][i-1][j]=a[k][i-1][j]+a[k-1][i][j];
a[k][i][j-1]=a[k][i][j-1]+a[k-1][i][j];
a[k][i+1][j]=a[k][i+1][j]+a[k-1][i][j];
a[k][i][j+1]=a[k][i][j+1]+a[k-1][i][j];
a[k][i+1][j+1]=a[k][i+1][j+1]+a[k-1][i][j];
a[k][i-1][j-1]=a[k][i-1][j-1]+a[k-1][i][j];
a[k][i-1][j+1]=a[k][i-1][j+1]+a[k-1][i][j];
a[k][i+1][j-1]=a[k][i+1][j-1]+a[k-1][i][j];
}
}
}
for(i=1;i<10;i++)
{
for(j=1;j<9;j++)
cout<<a[n][i][j]<<" ";
cout<<a[n][i][9];
cout<<endl;
}
return 0;
}
| 48 |
23,997 | int main()
{
int n,day,i,j;
int day0[9][9],day1[9][9], day2[9][9],day3[9][9],day4[9][9];
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
day0[i][j]=0;
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
day1[i][j]=0;
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
day2[i][j]=0;
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
day3[i][j]=0;
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
day4[i][j]=0;
}
}
scanf("%d %d",&n,&day);
day0[4][4]=n;
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(day0[i][j]!=0)
{
day1[i-1][j-1]=1*day0[i][j];
day1[i-1][j-0]=1*day0[i][j];
day1[i-1][j+1]=1*day0[i][j];
day1[i-0][j-1]=1*day0[i][j];
day1[i-0][j+1]=1*day0[i][j];
day1[i+1][j-1]=1*day0[i][j];
day1[i+1][j-0]=1*day0[i][j];
day1[i+1][j+1]=1*day0[i][j];
day1[i][j]=2*day0[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(day1[i][j]!=0)
{
day2[i-1][j-1]=1*day1[i][j]+day2[i-1][j-1];
day2[i-1][j-0]=1*day1[i][j]+day2[i-1][j-0];
day2[i-1][j+1]=1*day1[i][j]+day2[i-1][j+1];
day2[i-0][j-1]=1*day1[i][j]+day2[i-0][j-1];
day2[i-0][j+1]=1*day1[i][j]+day2[i-0][j+1];
day2[i+1][j-1]=1*day1[i][j]+day2[i+1][j-1];
day2[i+1][j-0]=1*day1[i][j]+day2[i+1][j-0];
day2[i+1][j+1]=1*day1[i][j]+day2[i+1][j+1];
day2[i][j]=2*day1[i][j]+day2[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(day2[i][j]!=0)
{
day3[i-1][j-1]=1*day2[i][j]+day3[i-1][j-1];
day3[i-1][j-0]=1*day2[i][j]+day3[i-1][j-0];
day3[i-1][j+1]=1*day2[i][j]+day3[i-1][j+1];
day3[i-0][j-1]=1*day2[i][j]+day3[i-0][j-1];
day3[i-0][j+1]=1*day2[i][j]+day3[i-0][j+1];
day3[i+1][j-1]=1*day2[i][j]+day3[i+1][j-1];
day3[i+1][j-0]=1*day2[i][j]+day3[i+1][j-0];
day3[i+1][j+1]=1*day2[i][j]+day3[i+1][j+1];
day3[i][j]=2*day2[i][j]+day3[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(day3[i][j]!=0)
{
day4[i-1][j-1]=1*day3[i][j]+day4[i-1][j-1];
day4[i-1][j-0]=1*day3[i][j]+day4[i-1][j-0];
day4[i-1][j+1]=1*day3[i][j]+day4[i-1][j+1];
day4[i-0][j-1]=1*day3[i][j]+day4[i-0][j-1];
day4[i-0][j+1]=1*day3[i][j]+day4[i-0][j+1];
day4[i+1][j-1]=1*day3[i][j]+day4[i+1][j-1];
day4[i+1][j-0]=1*day3[i][j]+day4[i+1][j-0];
day4[i+1][j+1]=1*day3[i][j]+day4[i+1][j+1];
day4[i][j]=2*day3[i][j]+day4[i][j];
}
}
}
if(day==1)
{
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
printf("%d ", day1[i][j]);
}
printf("%d\n",day1[i][8]);
}
}
if(day==2)
{
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
printf("%d ", day2[i][j]);
}
printf("%d\n",day2[i][8]);
}
}
if(day==3)
{
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
printf("%d ", day3[i][j]);
}
printf("%d\n",day3[i][8]);
}
}
if(day==4)
{
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
printf("%d ", day4[i][j]);
}
printf("%d\n",day4[i][8]);
}
}
return 0;
} | 48 |
23,998 | /* title :????????*
* author : ???*
* time : 2011.11.9 */
int a[11][11] = {0};
int b[11][11] = {0};
int m;
int main()
{
int n;
int l, s;
int i, j, k;
cin >> m >> n;
a[5][5] = m;
b[5][5] = m;
for(i = 0; i < n; i++)
{
for(j = 1; j <= 9; j++)
for(k = 1; k <= 9; k++)
{
b[j][k] = a[j][k];
}
for(j = 1; j <= 9; j++)
for(k = 1; k <= 9; k++)
{
a[j][k] = 2 * b[j][k] + b[j][k - 1] + b[j][k + 1] + b[j - 1][k] + b[j + 1][k]
+ b[j + 1][k + 1] + b[j + 1][k - 1] + b[j - 1][k + 1] + b[j - 1][k - 1];
}
}
for(l = 1; l <= 9; l++)
{
for(s = 1; s <= 8; s++)
{
cout << a[l][s] << " ";
}
cout << a[l][9] << endl;
}
return 0;
}
| 48 |
23,999 | int a[11][11][5];
main()
{
int x(int i,int j,int k);
int i,j,m,n,q;
int p=0;
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
for(p=0;p<5;p++)
a[i][j][p]=0;
}
}
scanf("%d %d",&m,&n);
a[5][5][0]=m;
for(q=0;q<n;q++)
{
for(i=1;i<10;i++)
for(j=1;j<10;j++)
a[i][j][q+1]=x(i,j,q);
}
for(i=1;i<10;i++)
{
for(j=1;j<9;j++)
printf("%d ",a[i][j][n]);
printf("%d\n",a[i][9][n]);
}
}
int x(int i,int j,int k)
{
int b=0,l;
for(l=-1;l<2;l++)
b=b+a[i+l][j][k]+a[i+l][j-1][k]+a[i+l][j+1][k];
return(b+a[i][j][k]);
} | 48 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.