label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
48 | 23900 | int main()
{
const int x = 9;
int i, j, k, m, n, fx, fy;
int a[9][9], b[9][9];
scanf("%d%d", &m, &n);
memset(a, 0, sizeof(a));
a[x / 2][x / 2] = m;
for (k = 0; k < n; k++) {
memset(b, 0, sizeof(b));
for (i = 1; i < x - 1; i++) {
for (j = 1; j < x - 1; j++) {
b[i][j] += a[i][j];
for (fx = -1; fx <= 1; fx++) {
for (fy = -1; fy <= 1; fy++)
b[i + fx][j + fy] += a[i][j];
}
}
}
memcpy(a, b, sizeof(a));
}
for (i = 0; i < x; i++) {
for (j = 0; j < x - 1; j++)
printf("%d ", a[i][j]);
printf("%d\n", a[i][x - 1]);
}
return 0;
}
|
48 | 23901 |
int a[9][9] = {0};
int b[9][9] = {0};
int n, day = 0;
void feed()
{
if (day == n)
return;
for (int i = 0; i <= 8; i++)
for (int j = 0; j <= 8; j++)
{
b[i][j] += 2 * a[i][j];
if (i + 1 <= 8)
{
b[i + 1][j] += a[i][j];
if (j + 1 <= 8)
b[i + 1][j + 1] += a[i][j];
if (j - 1 >= 0)
b[i + 1][j - 1] += a[i][j];
}
if (i - 1 >= 0)
{
b[i - 1][j] += a[i][j];
if (j + 1 <= 8)
b[i - 1][j + 1] += a[i][j];
if (j - 1 >= 0)
b[i - 1][j - 1] += a[i][j];
}
if (j + 1 <= 8)
b[i][j + 1] += a[i][j];
if (j - 1 >= 0)
b[i][j - 1] += a[i][j];
}
for (int i = 0; i <= 8; i++)
for (int j = 0; j <= 8; j++)
{
a[i][j] = b[i][j];
b[i][j] = 0;
}
day++;
feed();
}
int main()
{
int m;
cin >> m >> n;
a[4][4] = m;
feed();
for (int i = 0; i <= 8; i++)
for (int j = 0; j <= 8; j++)
{
cout << a[i][j];
if (j < 8)
cout << " ";
if (j == 8)
cout << endl;
}
return 0;
} |
48 | 23902 | int main()
{
int i,j,m,n,t,a[11][11]={0},b[11][11]={0};
scanf("%d %d",&m,&n);
a[5][5]=m;
for (t=0;t<n;t++)
{
for (i=1;i<=9;i++)
{
for (j=1;j<=9;j++)
{
if (a[i][j]!=0)
{
b[i][j]=a[i][j]*2+b[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+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];
}
}
}
for (i=1;i<=9;i++)
{
for (j=1;j<=9;j++)
{
a[i][j]=b[i][j];
}
}
for (i=0;i<=9;i++)
{
for (j=0;j<=9;j++)
b[i][j]=0;
}
}
for (i=1;i<=9;i++)
{
for (j=1;j<=9;j++)
{
if (j==1)
printf("%d",a[i][j]);
if(j>1&&j<9)
printf(" %d",a[i][j]);
if (j==9)
printf(" %d\n",a[i][j]);
}
}
}
|
48 | 23903 |
int main()
{
int m,n,a[10][10],k,i,j,c[10][10];
cin>>m>>n;
memset(a,0,sizeof(a));
a[5][5]=m;
for (k=1;k<=n;k++)
{
memset(c,0,sizeof(c));
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
{
c[i][j]+=a[i][j];
c[i-1][j]+=a[i][j];
c[i+1][j]+=a[i][j];
c[i][j-1]+=a[i][j];
c[i][j+1]+=a[i][j];
c[i-1][j-1]+=a[i][j];
c[i-1][j+1]+=a[i][j];
c[i+1][j-1]+=a[i][j];
c[i+1][j+1]+=a[i][j];
}
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
a[i][j]+=c[i][j];
}
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
{
cout<<a[i][j];
if (j!=9) cout<<" ";
if ((i!=9)&&(j==9)) cout<<endl;
}
return 0;
}
|
48 | 23904 |
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 | 23905 | int maze[9][9];
int day = 0;
void search(int n)
{
while(day != n)
{
day++;
int add[9][9];
memset(add, 0, sizeof(add));
for (int i = 4 - day + 1; i <= 4 + day - 1; i++)
for (int j = 4 - day + 1; j <= 4 + day - 1; j++)
{
add[i+1][j] += maze[i][j];
add[i-1][j] += maze[i][j];
add[i+1][j+1] += maze[i][j];
add[i-1][j-1] += maze[i][j];
add[i+1][j-1] += maze[i][j];
add[i-1][j+1] += maze[i][j];
add[i][j+1] += maze[i][j];
add[i][j-1] += maze[i][j];
add[i][j] += maze[i][j];
}
for (int i = 4 - day; i <= 4 + day; i++)
for (int j = 4 - day; j <= 4 + day; j++)
{
maze[i][j] += add[i][j];
}
}
return;
}
int main()
{
int m, n;
cin >> m >> n;
maze[4][4] = m;
search(n);
for (int i = 0; i < 9; i++)
{
cout << maze[i][0];
for (int j = 1; j < 9; j++)
cout << " " << maze[i][j];
cout << endl;
}
return 0;
} |
48 | 23906 | //********************************
//*??????????? **
//*????? 1300012990 **
//*???2013.12.07 **
//********************************
int b[9][9], old[9][9];
void num( int a,int e);
void ab(int c,int d);
int main()
{
int m,n,i,j;
memset(b, 0, sizeof(b));
cin >> m >> n;
b[4][4]=m;
num(0,n);
for(i=0;i<=8;i++)
{
cout << b[i][0];
for(j=1;j<=8;j++)
cout << " " << b[i][j] ;
cout << endl;
}
return 0;
}
void num( int a,int e)
{
int i,j;
for(i=0;i<=8;i++)
for(j=0;j<=8;j++)
old[i][j]=b[i][j];
for(i = 4 - a; i <= 4 + a; i++)
for(j = 4 - a; j <= 4 + a; j++)
ab(i, j);
a++;
if(a==e)
return;
else
num(a,e);
}
void ab(int c,int d)
{
int i, j;
for(i = c - 1; i <= c + 1; i++)
for(j = d - 1; j <= d + 1; j++)
b[i][j] = b[i][j] + old[c][d];
return;
}
|
48 | 23907 | int main()
{
int i, j, m, n, k,a[9][9], b[9][9];
memset(a,0,9*9*sizeof(int));
memset(b,0,9*9*sizeof(int));
cin >> m >> n;
a[4][4] = m;
b[4][4] = m;
for (k = 0;k <= n;k++)
{
for (i = 4 - k;i < 4 + k;i++)
{
for (j = 4 - k;j < 4 + k;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];
}
}
}
for (i = 0;i < 9;i++) //????
{
for (j = 0;j < 9;j++)
{
if (i < 8)
{
if (j < 8)
cout << a[i][j] << " ";
else
cout << a[i][j] << endl;
}
else
{
if (j < 8)
cout << a[i][j] << " ";
else
cout << a[i][j];
}
}
}
return 0;
}
|
48 | 23908 | void change(int [][9]);
int main()
{
int m, n, i, j;
int matrix[9][9] = {0};
cin >> m >> n;
matrix[4][4] = m;
for (i = 0; i < n; i++)
{
change(matrix);
}
for (i = 0; i < 9; i++)
{
cout << matrix[i][0];
for (j = 1; j < 9; j++)
{
cout << ' ' << matrix[i][j];
}
cout << endl;
}
return 0;
}
void change(int matrix[9][9])
{
int i, j;
int plus[9][9] = {0};
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
if (matrix[i][j] > 0)
{
plus[i][j] += matrix[i][j];
plus[i - 1][j] += matrix[i][j];
plus[i][j - 1] += matrix[i][j];
plus[i + 1][j] += matrix[i][j];
plus[i][j + 1] += matrix[i][j];
plus[i - 1][j - 1] += matrix[i][j];
plus[i - 1][j + 1] += matrix[i][j];
plus[i + 1][j + 1] += matrix[i][j];
plus[i + 1][j - 1] += matrix[i][j];
}
}
}
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
matrix[i][j] += plus[i][j];
}
}
} |
48 | 23909 | int main()
{
int m,n,i,j;
int a[11][11],b[11][11];
cin>>m>>n;
for(i=0;i<11;i++)
for(j=0;j<11;j++){
a[i][j] = 0;
b[i][j] = 0;
if(i==5 && j==5){
a[i][j] = m;
}
}
while(n--){
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][j-1] += a[i][j];
b[i+1][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][j+1] += a[i][j];
b[i+1][j+1] += a[i][j];
b[i][j] += 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;
}
}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++){
if(j==9){
cout<<" "<<a[i][j]<<endl;;
}
else if(j==1){
cout<<a[i][j];
}
else cout<<" "<<a[i][j];
}
return 0;
} |
48 | 23910 | int main()
{
int num, d;
int a[11][11];
int b[11][11];
int i, j;
for(i=0;i<=10;i++)
{
for(j=0;j<=10;j++)
{
a[i][j]=0;
b[i][j]=0;
}
}
cin>>num>>d;
a[5][5]=num;
b[5][5]=num;
while(d--)
{
for(i=0;i<=10;i++)
for(j=0;j<=10;j++)
a[i][j]=0;
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{
if(b[i][j]!=0)
{
a[i][j]+=(2*b[i][j]);
a[i-1][j]+=b[i][j];
a[i+1][j]+=b[i][j];
a[i-1][j-1]+=b[i][j];
a[i+1][j-1]+=b[i][j];
a[i-1][j+1]+=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];
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
b[i][j]=a[i][j];
}
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
if(j!=1)
cout<<" ";
cout<<a[i][j];
}
cout<<endl;
}
return 0;
} |
48 | 23911 | int A[9][9][5];
int main()
{
int i,j,m,t,k;
int number1,number2;
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
for(k=0;k<=4;k++)
{
A[i][j][k]=0;
}
}
}
scanf("%d%d",&m,&t);
A[4][4][0]=m;
for(i=1;i<=t;i++)
{
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
{
A[j][k][i]=A[j][k][i-1]*2;
for(number1=-1;number1<2;number1++)
{
for(number2=-1;number2<2;number2++)
{
if(j+number1>=0&&j+number1<9&&k+number2>=0&&k+number2<9)
{
if(number1!=0||number2!=0)
A[j][k][i]=A[j][k][i]+A[j+number1][k+number2][i-1];
}
}
}
}
}
}
for(k=0;k<9;k++)
{
for(j=0;j<9;j++)
{
if(j==0)
printf("%d",A[k][j][i-1]);
else
printf(" %d",A[k][j][i-1]);
}
if(i<8)
printf("\n");
}
return 0;
} |
48 | 23912 | int main()
{
int a[11][11]={0},b[11][11]={0},m,n,i,j,k;
cin>>m>>n;
a[5][5]=m;
for(i=0;i<n;i++)
{
for(j=1;j<10;j++)
for(k=1;k<10;k++)
{
b[j][k+1]=a[j][k]+b[j][k+1];b[j][k-1]=a[j][k]+b[j][k-1];b[j-1][k+1]=a[j][k]+b[j-1][k+1];b[j+1][k+1]=a[j][k]+b[j+1][k+1];
b[j-1][k]=a[j][k]+b[j-1][k];b[j+1][k]=a[j][k]+b[j+1][k];b[j+1][k-1]=a[j][k]+b[j+1][k-1];b[j-1][k-1]=a[j][k]+b[j-1][k-1];
a[j][k]=2*a[j][k];
}
for(j=1;j<10;j++)
for(k=1;k<10;k++)
a[j][k]=a[j][k]+b[j][k];
for(j=0;j<11;j++)
for(k=0;k<11;k++)
b[j][k]=0;
}
for(i=1;i<10;i++)
for(j=1;j<10;j++)
{
if(j==1)
cout<<a[i][j];
else
cout<<' '<<a[i][j];
if(j==9)
cout<<endl;
}
return 0;
} |
48 | 23913 |
int a[9][9],b[9][9];
int main ()
{void F(int x, int y);
int p,q,i,j,t,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 (t=1;t<=n;t++)
{ for (p=0;p<9;p++)
for (q=0;q<9;q++)
b[p][q]=0;
for (i=0;i<9;i++)
for (j=0;j<9;j++)
F (i,j);
for (p=0;p<9;p++)
for (q=0;q<9;q++)
a[p][q]+=b[p][q];
}
for (i=0;i<9;i++)
{for (j=0;j<8;j++)
printf("%d ",a[i][j]);
printf("%d\n",a[i][8]);
}
}
void F(int x, int y)
{ int i,j,m;
if (a[x][y]>0)
{m=a[x][y];
for (i=-1;i<2;i++)
for (j=-1;j<2;j++)
b[x+i][y+j]+=m;}
}
|
48 | 23914 | 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 | 23915 | 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 | 23916 | main()
{
int a[11][11][5]={0},i,j,nd,k,ii,jj;
scanf("%d %d",&a[5][5][0],&nd);
for(k=1;k<=nd;k++)
{
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
a[i][j][k]+=a[i][j][k-1];
for(ii=-1;ii<=1;ii++)
{
for(jj=-1;jj<=1;jj++)
{a[i+ii][j+jj][k]+=a[i][j][k-1];}
}
}
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<=8;j++)
{printf("%d ",a[i][j][nd]);}
printf("%d\n",a[i][j][nd]);
}
}
|
48 | 23917 | int a[11][11];
int temp[11][11];
void f(int x,int y)
{
int v = a[x][y];
for(int i = -1;i<=1;i++){
for(int j = -1;j<=1;j++){
if(i==0&&j==0) temp[x+i][y+j]+=v*2;
else temp[x+i][y+j]+=v;
}
}
return;
}
int main()
{
int m,n;
cin>>m>>n;
memset(a,0,sizeof(a));
a[5][5]=m;
for(int k=0;k<n;k++)
{
memset(temp,0,sizeof(temp));
for(int i=1;i<=9;i++)
{
for(int j=1;j<=9;j++)
{
if(a[i][j]>0) f(i,j);
}
}
for(int i=1;i<=9;i++)
{
for(int j=1;j<=9;j++)
{
a[i][j]=temp[i][j];
}
}
}
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;
}
|
48 | 23918 | int b[11][11],d[11][11];
void breed();
int main()
{
int days,i,j;
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
b[i][j]=d[i][j]=0;
}
}
cin>>b[5][5]>>days;
for(i=1;i<=days;i++)
{
breed();
}
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
if(j==9)
{
cout<<b[i][j]<<endl;
}
else
{
cout<<b[i][j]<<" ";
}
}
}
return 0;
}
void breed()
{
int i,j;
for(i=1;i<=9;i++)
{
for(j=0;j<=10;j++)
{
d[i][j]=b[i][j];
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
b[i][j]=d[i][j]*2+d[i-1][j-1]+d[i-1][j]+d[i-1][j+1]+d[i][j-1]+d[i][j+1]+d[i+1][j-1]+d[i+1][j]+d[i+1][j+1];
}
}
} |
48 | 23919 | int main()
{
int m,n;
scanf("%d %d",&m,&n);
int sz[9][9];
for(int i=0;i<9;i++){
for(int j=0;j<9;j++){
sz[i][j]=0;
}
}
sz[4][4]=m;
int a[100],row[100],col[100],v=0;
for(int k=0;k<n;k++){
for(int l=0;l<9;l++){
for(int u=0;u<9;u++){
if(sz[l][u]!=0){
a[v]=sz[l][u];
row[v]=l;
col[v]=u;
v++;
}
}
}
for(int w=0;w<9;w++){
for(int m=0;m<9;m++){
sz[w][m]=0;
}
}
for(int c=0;c<v;c++){
sz[row[c]+1][col[c]+1]+=a[c];
sz[row[c]+1][col[c]]+=a[c];
sz[row[c]][col[c]+1]+=a[c];
sz[row[c]-1][col[c]-1]+=a[c];
sz[row[c]-1][col[c]]+=a[c];
sz[row[c]][col[c]-1]+=a[c];
sz[row[c]+1][col[c]-1]+=a[c];
sz[row[c]-1][col[c]+1]+=a[c];
sz[row[c]][col[c]]+=2*a[c];
}
int a[100]={0};
int row[100]={0};
int col[100]={0};
v=0;
}
for(int p=0;p<9;p++){
for(int q=0;q<8;q++){
printf("%d ",sz[p][q]);
}
printf("%d\n",sz[p][8]);
}
return 0;
} |
48 | 23920 | 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 | 23921 | //**************************
//*???2013?12?4? *
//*?????? *
//*??????????? *
//**************************
int board[11][11] = {0}, next[11][11] = {0};
int m, i, j, cnt = 0, days;
void spread(int days);
int main ()
{
cin >> m >> days;
board[5][5] = m;
spread(days);
for(i = 1; i <= 9; i++)
{
for(j = 1; j <= 9; j++)
{
if(j < 9)
cout << board[i][j] << " ";
else
cout << board[i][j];
}
cout << endl;
}
return 0;
}
void spread(int days)
{
if(cnt == days)
return;
cnt++;
for(i = 1; i <= 9; i++)
{
for(j = 1; j <= 9; j++)
{
next[i][j] = board[i-1][j] + board[i+1][j] + board[i][j-1] + board[i][j+1] +
board[i+1][j+1] + board[i-1][j-1] + board[i+1][j-1] + board[i-1][j+1] + board[i][j] * 2;
}
}
for(i = 1; i <= 9; i++)
{
for(j = 1; j <= 9; j++)
{
board[i][j] = next[i][j];
next[i][j] = 0;
}
}
spread(days);
}
|
48 | 23922 | 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 | 23923 | int main ()
{ int m,n;
scanf ("%d %d",&m,&n);
int a[121][4];
for (int i=0;i<121;i++)
{ a[i][0]=0;
a[i][1]=0;
a[i][2]=0;
a[i][3]=0;
}
a[60][0]=m;
int k,i;
for (k=1;k<n+1;k++)
{
for ( i=1;i<10;i++)
{
for (int j=1;j<10;j++)
{ a[i*11+j][k]=a[(i-1)*11+j][k-1]+a[(i-1)*11+j-1][k-1]+a[(i-1)*11+j+1][k-1]+a[i*11+j-1][k-1]+a[i*11+j+1][k-1]+a[(i+1)*11+j+1][k-1]+a[(i+1)*11+j][k-1]+a[(i+1)*11+j-1][k-1]+2*a[i*11+j][k-1];
}
}
}
for (int i=1;i<10;i++)
{printf ("%d %d %d %d %d %d %d %d %d\n",a[i*11+1][n],a[i*11+2][n],a[i*11+3][n],a[i*11+4][n],a[i*11+5][n],a[i*11+6][n],a[i*11+7][n],a[i*11+8][n],a[i*11+9][n]);
}
} |
48 | 23924 | int n,m;
void num(int a[11][11],int b[11][11],int c)
{
int w;
for(w=0;w<11;w++)
{
a[0][w] = 0;
a[w][0] = 0;
b[0][w] = 0;
b[w][0] = 0;
a[10][w] = 0;
a[w][10] = 0;
b[10][w] = 0;
b[w][10] = 0;
}
int i,j,p,q;
if(c==n+1)
{
for(p = 1;p<=9;p++)
{
for(q=1;q<=8;q++)
{
cout << m*a[p][q]<<" " ;
}
cout << m*a[p][9]<< endl;
}
return;
}
else
{
for(i=1;i<=9;i++)
for(j=1;j<=9;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];
num(b,a,c+1);
}
}
int main()
{
int i,j;
int bac1[11][11]={0},bac2[11][11] = {0};
bac1[5][5] = 1;
cin >> m >> n;
num(bac1,bac2,1);
return 0;
}
|
48 | 23925 | void main(){
int m,n,i,j,k,c;
int a[9][9]={0};
scanf("%d",&m);
scanf("%d",&n);
a[4][4]=m;
for(i=1;i<=n;i++){
int b[9][9]={0};
for(j=1;j<8;j++){
for(k=1;k<8;k++){
c=a[j][k];
b[j][k]+=2*c;
b[j-1][k-1]+=c;
b[j-1][k]+=c;
b[j-1][k+1]+=c;
b[j][k-1]+=c;
b[j][k+1]+=c;
b[j+1][k-1]+=c;
b[j+1][k]+=c;
b[j+1][k+1]+=c;}}
for(j=0;j<9;j++){
for(k=0;k<9;k++)
a[j][k]=b[j][k];}}
for(j=0;j<9;j++){
for(k=0;k<8;k++)
printf("%d ",a[j][k]);
printf("%d\n",a[j][8]);}
} |
48 | 23926 | int a[9][9]={0},b[9][9]={0};
void copy(int a[9][9],int b[9][9])
{
for (int i = 0;i<9;i++)
for(int j=0;j<9;j++)
a[i][j] = b[i][j];
}
int main()
{
int m,n,j,k;
cin >>m>>n;
a[4][4] = m;
b[4][4] = m;
for(int i =0;i<n;i++)
{
for( j=4-i;j<=4+i;j++)
for( k=4-i;k<=4+i;k++)
for(int l = j -1;l<=j+1;l++)
for(int m = k-1;m<=k+1;m++)
b[l][m] += a[j][k];
copy(a,b);
}
for(k = 0;k<9;k++)
for(j=0;j<9;j++)
{
cout <<a[k][j];
if(j<8)
cout<<' ';
else cout<<endl;
}
return 0;
} |
48 | 23927 | main()
{
int i,j,k,t,m,n,r,day,x;
int a[100][100],b[100][100];
scanf("%d%d",&r,&day);
m=9;n=9;
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{a[i][j]=0;b[i][j]=0;}
}
a[4][4]=r;
b[4][4]=r;
for(x=0;x<day;x++)
{
a[0][0]=b[0][1]+b[0][0]*2+b[1][0]+b[1][1];
for(i=1;i<n-1;i++)
{
a[0][i]=b[1][i]+b[0][i]*2+b[0][i+1]+b[0][i-1]+b[1][i+1]+b[1][i-1];
}
a[0][n-1]=b[0][n-2]+b[0][n-1]*2+b[1][n-1]+b[1][n-2];
for(i=1;i<m-1;i++)
{
for(j=0;j<n;j++)
{
if(j==0)
{
a[i][j]=b[i+1][j]+b[i][j]*2+b[i-1][j]+b[i][j+1]+b[i-1][j+1]+b[i+1][j+1];
}
if(j!=0&&j!=n-1)
a[i][j]=b[i][j+1]+b[i][j]*2+b[i][j-1]+b[i+1][j]+b[i-1][j]+b[i-1][j-1]+b[i-1][j+1]+b[i+1][j-1]+b[i+1][j+1];
if(j==n-1)
{
a[i][j]=b[i+1][j]+b[i][j]*2+b[i-1][j]+b[i][j-1]+b[i+1][n-2]+b[i-1][n-2];
}
}
}
a[m-1][0]=b[m-2][0]+b[m-1][0]*2+b[m-1][1]+b[m-2][1];
for(i=1;i<n-1;i++)
{
a[m-1][i]=b[m-1][i+1]+b[m-1][i]*2+b[m-1][i-1] +b[m-2][i]+b[m-2][i+1]+b[m-2][i-1];
}
a[m-1][n-1]=b[m-2][n-1]+b[m-1][n-1]*2+b[m-1][n-2]+b[m-2][n-2];
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
b[i][j]=a[i][j];
}
}
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
if(j==0)
printf("%d",a[i][j]);else printf(" %d",a[i][j]); }
printf("\n");
}
}
|
48 | 23928 | int main()
{
int a[9][9]={0},b[9][9]={0};
int i,j,k,m,n;
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(i!=0&&i!=8&&j!=0&&j!=8)
a[i][j]=2*b[i][j]+b[i][j-1]+b[i][j+1]+b[i-1][j]+b[i+1][j]+b[i-1][j-1]+b[i-1][j+1]+b[i+1][j-1]+b[i+1][j+1];
if(i==0&&j==0)
a[i][j]=2*b[i][j]+b[i][j+1]+b[i+1][j]+b[i+1][j+1];
if(i==8&&j==0)
a[i][j]=2*b[i][j]+b[i-1][j]+b[i][j+1]+b[i-1][j+1];
if(i==0&&j==8)
a[i][j]=2*b[i][j]+b[i-1][j]+b[i+1][j]+b[i+1][j-1];
if(i==8&&j==8)
a[i][j]=2*b[i][j]+b[i-1][j]+b[i][j-1]+b[i-1][j-1];
if(i==0&&j!=0&&j!=8)
a[i][j]=2*b[i][j]+b[i][j-1]+b[i][j+1]+b[i+1][j]+b[i+1][j-1]+b[i+1][j+1];
if(i==8&&j!=0&&j!=8)
a[i][j]=2*b[i][j]+b[i][j-1]+b[i][j+1]+b[i-1][j]+b[i-1][j-1]+b[i-1][j+1];
if(j==0&&i!=0&&i!=8)
a[i][j]=2*b[i][j]+b[i-1][j]+b[i+1][j]+b[i][j+1]+b[i-1][j+1]+b[i+1][j+1];
if(j==8&&i!=0&&i!=8)
a[i][j]=2*b[i][j]+b[i-1][j]+b[i+1][j]+b[i][j-1]+b[i-1][j-1]+b[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++)
{
if(j==0)
printf("%d",a[i][j]);
else if(j==8)
printf(" %d\n",a[i][j]);
else
printf(" %d",a[i][j]);
}
}
return 0;
}
|
48 | 23929 | int main()
{
int m,n;
int a[9][9],b[9][9];
scanf("%d %d",&m,&n);
for(int i=0;i<9;i++){
for(int j=0;j<9;j++){
a[i][j]=0;
b[i][j]=0;
}
}
a[4][4]=m;
for(int k=0;k<n;k++){ for(int i=0;i<9;i++){
for(int j=0;j<9;j++){
if(a[i][j]!=0){
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]+=2*a[i][j];
}
}
}
for(int i=0;i<9;i++){
for(int j=0;j<9;j++){
a[i][j]=b[i][j];
b[i][j]=0;
}
}
}
for(int i=0;i<9;i++){
for(int j=0;j<9;j++){
if(j!=8) {
printf("%d ",a[i][j]);
}
else{
printf("%d\n",a[i][j]);
}
}
}
int hou;
scanf("%d",&hou);
return 0;
}
|
48 | 23930 | //*************************************
//**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 | 23931 | int m,n;
int a[11][11];int b[11][11];
main ()
{
int i,j,h;
memset(a,0,sizeof(int));
memset(b,0,sizeof(int));
scanf("%d %d",&m,&n);
a[5][5]=m;
for (h=1;h<=n;)
{
for (i=0;i<=10;i++)
{
for (j=0;j<=10;j++)
{b[i][j]=a[i][j];}
}
for (i=5-h;i<=5+h;i++)
{
for (j=5-h;j<=5+h;j++)
{
a[i][j]=b[i-1][j-1]+b[i-1][j]+b[i-1][j+1]+b[i][j-1]+2*b[i][j]+b[i][j+1]+b[i+1][j-1]+b[i+1][j]+b[i+1][j+1];
}
}
h++;
}
for (i=1;i<=9;i++)
{
for (j=1;j<=8;j++)
{printf ("%d ",a[i][j]);}
for (j=9;j<=9;j++)
{printf ("%d\n",a[i][j]);}
}
} |
48 | 23932 | int main()
{
int m,n,s[A][A]={0},t[A][A]={0},i,a,b;
scanf ("%d%d",&m,&n);
s[4][4]=m;
t[4][4]=m;
for (i=0;i<n;i++)
{
for (a=0;a<9;a++)
{
for (b=0;b<9;b++)
{
if (s[a][b]!=0)
{
t[a-1][b]+=s[a][b];
t[a][b-1]+=s[a][b];
t[a+1][b]+=s[a][b];
t[a][b+1]+=s[a][b];
t[a+1][b-1]+=s[a][b];
t[a+1][b+1]+=s[a][b];
t[a-1][b+1]+=s[a][b];
t[a-1][b-1]+=s[a][b];
t[a][b]+=s[a][b];
}
}
}
for (a=0;a<9;a++)
{
for (b=0;b<9;b++)
{
s[a][b]=t[a][b];
}
}
}
for (a=0;a<9;a++)
{
for (b=0;b<8;b++)
{
printf ("%d ",s[a][b]);
}
printf("%d\n",s[a][8]);
}
return 0;
} |
48 | 23933 | int main()
{
int m=0,n=0; int i=0,j=0,k=0; //??????m,n???????????????????????i,j,k??????0?
int total[11][11]={{0}},born[11][11]={{0}}; //????total,born??????????????????
cin>>m>>n; //?????
total[5][5]=m;
for(k=0;k<n;k++) //??????
{
for(i=1;i<10;i++) //??????????????
{
for(j=1;j<10;j++)
born[i][j]=2*total[i][j]+total[i-1][j]+total[i-1][j-1]+total[i-1][j+1]+total[i][j-1]+total[i][j+1]+total[i+1][j-1]+total[i+1][j]+total[i+1][j+1];
}
for(i=1;i<10;i++) //???????
{
for(j=1;j<10;j++)
{
total[i][j]=born[i][j];
}
}
for(i=1;i<10;i++) //born?????
{
for(j=1;j<10;j++)
born[i][j]=0;
}
}
for(i=1;i<10;i++) //?????
{
for(j=1;j<10;j++)
{
cout<<total[i][j];
if(j==9)
cout<<endl;
else cout<<" ";
}
}
return 0;
} |
48 | 23934 | int a[31][11][11]={0};
int m;
void f(int k)
{int i,j;
if(k<m+1){
for(i=1;i<=9;i++)
{for(j=1;j<=9;j++)
{a[k][i][j]=2*a[k-1][i][j]+a[k-1][i+1][j]+a[k-1][i-1][j]+a[k-1][i][j+1]+a[k-1][i][j-1]+a[k-1][i+1][j+1]+a[k-1][i-1][j+1]+a[k-1][i+1][j-1]+a[k-1][i-1][j-1];}}
f(k+1);}
else
{for(i=1;i<=9;i++)
{for(j=1;j<9;j++)
cout<<a[m][i][j]<<" ";
cout<<a[m][i][9];
cout<<endl;}}
}
int main()
{
int n;
cin>>n>>m;
a[0][5][5]=n;
f(1);
return 0;
}
|
48 | 23935 | //********************************
//*?????? 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 | 23936 | main()
{
int m,n,i,j,k,l;
scanf("%d %d",&m,&n);
int a[5][11][11]={0};
a[0][5][5]=m;
for(i=0;i<n;i++)
{
for(j=1;j<=9;j++)
{
for(k=1;k<=9;k++)
{
a[i+1][j-1][k-1]+=a[i][j][k];
a[i+1][j-1][k]+=a[i][j][k];
a[i+1][j-1][k+1]+=a[i][j][k];
a[i+1][j][k-1]+=a[i][j][k];
a[i+1][j][k+1]+=a[i][j][k];
a[i+1][j+1][k-1]+=a[i][j][k];
a[i+1][j+1][k]+=a[i][j][k];
a[i+1][j+1][k+1]+=a[i][j][k];
a[i+1][j][k]+=(2*a[i][j][k]);
}
}
}
for(l=1;l<=9;l++)
{
printf("%d %d %d %d %d %d %d %d %d\n",a[i][l][1],a[i][l][2],a[i][l][3],a[i][l][4],a[i][l][5],a[i][l][6],a[i][l][7],a[i][l][8],a[i][l][9]);
}
}
|
48 | 23937 | int main()
{
int a[9][9]={0},b[9][9]={0},n,i,j;
cin>>a[4][4];
cin>>n;
while(n>0)
{
n--;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
if(a[i][j]!=0)
b[i][j]=a[i][j]*2;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
if(a[i][j]!=0)
{
b[i+1][j]=a[i][j]+b[i+1][j];
b[i-1][j]=a[i][j]+b[i-1][j];
b[i][j+1]=a[i][j]+b[i][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+1][j-1]=a[i][j]+b[i+1][j-1];
b[i-1][j+1]=a[i][j]+b[i-1][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<9;j++)
b[i][j]=0;
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
cout<<a[i][j]<<' ';
cout<<a[i][8];
cout<<endl;
}
return 0;
} |
48 | 23938 |
main()
{
int a[10][10],b[10][10];
int m,n;
scanf("%d %d",&m,&n);
for(int j=1;j<=9;j++)
{
for(int k=1;k<=9;k++)
{
a[j][k]=0;
b[j][k]=0;
}
}
a[5][5]=m;
b[5][5]=m;
for(int i=1;i<=n;i++)
{
for(int j=2;j<=8;j++)
{
for(int k=2;k<=8;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+1][k]= b[j+1][k]+a[j][k];
b[j][k]= b[j][k]+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];
b[j][k-1]= b[j][k-1]+a[j][k];
b[j-1][k-1]= b[j-1][k-1]+a[j][k];
}
}
for(int j=1;j<=9;j++)
{
for(int k=1;k<=9;k++)
{
a[j][k]=b[j][k];
}
}
}
for(int j=1;j<=9;j++)
{
for(int k=1;k<=8;k++)
{
printf("%d ",a[j][k]);
}
printf("%d\n",a[j][9]);
}
} |
48 | 23939 | int a[9][9],b[9][9],i,j,k,m,n;
int main()
{
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++)
{
if (a[j][k]>0)
{
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+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];
b[j][k]+=2*a[j][k];
}
}
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 | 23940 | 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 | 23941 | int main()
{
int m,n,i,j,d;
int a[10][10]={0};
int b[10][10]={0};
cin >>m>>n;//??
a[5][5]=m;//???
for (d=1;d<=n;d++)//????
{
memset(b,0,100*sizeof(int));//???
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
{
if (a[i][j]==0) continue;
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];
}//??????9??????
memset(a,0,100*sizeof(int));
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
a[i][j]=b[i][j];//?b??a?????????
}
for (i=1;i<=9;i++)
{
for (j=1;j<9;j++)
cout <<a[i][j]<<' ';
cout <<a[i][9]<<endl;
}//??
return 0;
} |
48 | 23942 | int main()
{
int m, n, pan[9][9] = {0}, i, j, k, t,pan1[9][9];
cin >> m >> n;
pan[4][4] = m;
for(i = 0; i < n; i++)
{
for(j = 0; j < 9; j++)
for(k = 0; k < 9; k++)
pan1[j][k] = 0;
for(j = 0; j < 9; j++)
for(k = 0; k < 9; k++)
if(pan[j][k] != 0)
{
t = pan[j][k] * 10;
pan1[j][k] += 2 * pan[j][k];
pan1[j-1][k-1] += (t-2 * pan[j][k]) / 8;
pan1[j-1][k] += (t-2 * pan[j][k]) / 8;
pan1[j-1][k+1] += (t-2 * pan[j][k]) / 8;
pan1[j][k-1] += (t-2 * pan[j][k]) / 8;
pan1[j][k+1] += (t-2 * pan[j][k]) / 8;
pan1[j+1][k-1] += (t-2 * pan[j][k]) / 8;
pan1[j+1][k] += (t-2 * pan[j][k]) / 8;
pan1[j+1][k+1] += (t-2 * pan[j][k]) / 8;
}
for(j = 0; j < 9; j++)
for(k = 0; k < 9; k++)
pan[j][k] = pan1[j][k];
}
for(j = 0; j < 9; j++)
{
for(k = 0; k < 8; k++)
cout << pan[j][k] << ' ';
cout << pan[j][k] << endl;
}
return 0;
} |
48 | 23943 |
void output(int a[9][9])
{
int x, y;
for(x = 0;x <= 8;x ++)
{
for(y = 0;y <= 8;y ++)
{
printf("%d", a[x][y]);
if(y != 8)printf(" ");
}
printf("\n");
}
}
int main()
{
int a[9][9] = {0};
int i, j, k;
int addup[9][9] = {0};
int m , day;
int x, y;
scanf("%d", &m);
scanf("%d", &day);
a[4][4] = m;
for(i = 1;i <= day;i ++)
{
for(x = 0;x <= 8; x++)
{
//printf("[%d]\n", a[0][0]);
for(y = 0;y <= 8;y ++)
{
// if(a[x][y] != 0)
{
addup[x - 1][y - 1] += a[x][y];
addup[x - 1][y] += a[x][y];
addup[x - 1][y + 1] += a[x][y];
addup[x][y - 1] += a[x][y];
addup[x][y] += 2 * a[x][y];
addup[x][y + 1] += a[x][y];
addup[x + 1][y - 1] += a[x][y];
addup[x + 1][y] += a[x][y];
addup[x + 1][y + 1] += a[x][y];
/*if((x == 4) && (y == 4))
{
for(k = x - 1;k <= x + 1;k ++)
{
for(j = y - 1;j <= y + 1;j ++)
{
printf("[%3d] ", addup[k][j]);
}
printf("\n");
}
printf("+_+_+_\n");
output(addup);
printf("+_+_+_\n");
}*/
}
}
}
//printf("[%d]\n", a[0][0]);
/*printf("-----add--------\n");
output(addup);
printf("-----add end--------\n");*/
for(x = 0;x <= 8;x ++)
{
for(y = 0;y <= 8;y ++)
{
a[x][y] = addup[x][y];
addup[x][y] = 0;
}
}
/*printf("--[][]--\n");
output(addup);
printf("--[][]--\n");*/
}
output(a);
} |
48 | 23944 | int a[10][10] = {0};
void bac(int n)
{
int i,j;
int b[10][10] = {0};
if (n == 0)
return;
for (i = 1; i <= 9; i++)
{
for (j = 1; j <= 9; j++)
{
if (a[i][j] != 0)
{
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];
b[i][j-1]+=a[i][j];
b[i][j+1]+=a[i][j];
a[i][j] = a[i][j] * 2;
}
}
}
for (i = 1; i<= 9; i++)
for (j = 1; j <= 9; j++)
a[i][j]+=b[i][j];
bac(n - 1);
return;
}
int main()
{
int i,j;
int m, n;
cin >> m >> n;
a[5][5] = m;
bac(n);
for (i = 1; i <= 9; i++)
{
for (j = 1; j<= 8; j++)
cout << a[i][j] << " ";
cout << a[i][j] << endl;
}
return 0;
} |
48 | 23945 | int a[9][9] = {0};
void change(int a[9][9],int k);
int main()
{
int m,n,i,j;
cin >> m >> n;
a[4][4] = m;
change(a,n);
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
if(j != 8)
cout << a[i][j] << " ";
else
cout << a[i][j];
}
cout << endl;
}
return 0;
}
void change(int a[9][9],int k)
{
if(k == 0)
return;
int i,j,sign[9][9] = {0},b[9][9] = {0};
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
if((a[i][j] != 0)&&(sign[i][j] == 0))
{
sign[i][j]++;
b[i][j] = a[i][j];
}
}
}
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
if(sign[i][j] == 1)
{
a[i][j] += 2 * b[i][j];
a[i][j + 1] += b[i][j];
a[i][j - 1] += b[i][j];
a[i + 1][j] += b[i][j];
a[i - 1][j] += b[i][j];
a[i - 1][j - 1] += b[i][j];
a[i - 1][j + 1] += b[i][j];
a[i + 1][j - 1] += b[i][j];
a[i + 1][j + 1] += b[i][j];
}
}
}
for(i = 0; i < 9; i++)
for(j = 0; j < 9; j++)
{
a[i][j] = a[i][j] - b[i][j];
}
change(a,k - 1);
} |
48 | 23946 | int m,n;
int num1[11][11]={0},num2[11][11]={0};
int i,j,t;
int num(int x,int y)
{
int N;
N=num1[x-1][y-1]+num1[x][y-1]+num1[x+1][y-1]+num1[x-1][y]+num1[x+1][y]+num1[x-1][y+1]+num1[x][y+1]+num1[x+1][y+1];
return N;
}
main()
{
scanf("%d %d",&m,&n);
num1[5][5]=num2[5][5]=m;
for(t=1;t<=n;t++)
{
for(i=5-t;i<=5+t;i++)
{
for(j=5-t;j<=5+t;j++)
{
num2[i][j]=2*num1[i][j]+num(i,j);
}
}
for(i=5-t;i<=5+t;i++)
{
for(j=5-t;j<=5+t;j++)
{
num1[i][j]=num2[i][j];
}
}
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if(j==1)printf("%d",num1[i][j]);
else printf(" %d",num1[i][j]);
}
printf("\n");
}
}
|
48 | 23947 | int main()
{
int n,m;
cin>>n>>m;
int a[20][20]={0};
int x[8]={0,1,0,-1,1,1,-1,-1};
int y[8]={1,0,-1,0,1,-1,1,-1};
int taken[20][20]={0};
a[5][5]=n;
for ( int p=0;p<m;p++)
{
for ( int i=1;i<10;i++)
for ( int j=1;j<10;j++)
{
for( int i_=0;i_<8;i_++)
{
taken[i+x[i_]][j+y[i_]]=a[i][j]+taken[i+x[i_]][j+y[i_]];
}
taken[i][j]=taken[i][j]+a[i][j]*2;
}
for ( int i=1;i<10;i++)
for ( int j=1;j<10;j++)
{
a[i][j]=taken[i][j];
taken[i][j]=0;
}
}
for ( int i=1;i<10;i++)
{
for ( int j=1;j<9;j++)
cout<<a[i][j]<<' ';
cout<<a[i][9]<<endl;
}
return 0;
}
|
48 | 23948 | int a[11][11]={0};
int b[11][11];
int sum(int x,int y)
{
b[x][y]=a[x-1][y-1]+a[x-1][y]+a[x-1][y+1]+a[x][y-1]+a[x][y+1]+a[x+1][y-1]+a[x+1][y]+a[x+1][y+1]+2*a[x][y];
return b[x][y];
}
main()
{
int m,n,i,j;
scanf("%d %d",&m,&n);
a[5][5]=m;
for(int k=1;k<=n;k++)
{
for(i=5-k;i<=5+k;i++)
{
for(j=5-k;j<=5+k;j++)
{
b[i][j]=sum(i,j);
}
}
for(int q=0;q<11;q++)
{
for(int p=0;p<11;p++)
a[q][p]=b[q][p];
}
}
for(i=1;i<10;i++)
{
for(j=1;j<9;j++)
printf("%d ",b[i][j]);
printf("%d\n",b[i][j]);
}
return 0;
}
|
48 | 23949 | //********************************
//*?????(11.8) ???????? **
//*?????? 1300012745 **
//*???2013.12.5 **
//*******************************
int germs[4][9][9]; //????????????????????
void reproduction (int i, int n) //i????
{
int j, k, x, y; //??????
if (i == n) //????n????
return;
for (x = 0; x <= 8; x++)
{
for (y = 0; y <= 8; y++)
{
for (j = -1; j <= 1; j++)
{
for (k = -1; k <= 1; k++)
{
germs[i + 1][x + j][y + k]+=germs[i][x][y]; //???????????????
}
}
germs[i + 1][x][y]+=germs[i][x][y]; //?????????????????
}
}
reproduction (i + 1, n); //??????
}
int main()
{
int n, m, i, j, k;
cin >> m >> n;
for (i = 0; i <= 4; i++)
{
for (j = 0; j <= 8; j++)
{
for (k = 0; k <= 8; k++)
{
germs[i][j][k] = 0; //??
}
}
}
germs[0][4][4] = m; //???
reproduction (0, n); //??????
for (i = 0; i <= 8; i++)
{
for (j = 0; j <= 8; j++)
{
if (j == 8)
cout << germs[n][i][j]; //???????
else
cout << germs[n][i][j] << " ";
}
cout << endl;
}
cin.get();cin.get();
return 0;
}
|
48 | 23950 |
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 | 23951 | //???1000010179
//????????
int x[9][9]={0};//???????
void peiyang()//????????
{
int temp[9][9]={0},i,j;//temp??????????????????ij?????
//???????temp[i][j]????x[i][j]????????x??
temp[0][0]=x[0][0]*2+x[0][1]+x[1][0]+x[1][1];
for (i=1;i<8;i++)
temp[0][i]=x[0][i]*2+x[0][i-1]+x[0][i+1]+x[1][i-1]+x[1][i]+x[1][i+1];
temp[0][8]=x[0][8]*2+x[0][7]+x[1][7]+x[1][8];
for (i=1;i<8;i++)
{
temp[i][0]=x[i][0]*2+x[i-1][0]+x[i-1][1]+x[i][1]+x[i+1][0]+x[i+1][1];
for (j=0;j<8;j++)
temp[i][j]=x[i][j]*2+x[i-1][j-1]+x[i-1][j]+x[i-1][j+1]+x[i][j-1]+x[i][j+1]+x[i+1][j-1]+x[i+1][j]+x[i+1][j+1];
temp[i][8]=x[i][8]*2+x[i-1][7]+x[i-1][8]+x[i][7]+x[i+1][7]+x[i+1][8];
}
temp[8][0]=x[8][0]*2+x[7][0]+x[7][1]+x[8][1];
for (i=1;i<8;i++)
temp[8][i]=x[8][i]*2+x[7][i-1]+x[7][i]+x[7][i+1]+x[8][i-1]+x[8][i+1];
temp[8][8]=x[8][8]*2+x[7][7]+x[7][8]+x[8][7];
for (i=0;i<9;i++)//?temp???x
for (j=0;j<9;j++)
x[i][j]=temp[i][j];
}
int main()
{
int m,n;//mn???
cin>>m>>n;
x[4][4]=m;//???????m
for (int k=0;k<n;k++)//??peiyang??n????n?????
peiyang();
for (int p=0;p<9;p++)//????
for (int q=0;q<9;q++)
{
if (q==8) cout<<x[p][q]<<endl;
else cout<<x[p][q]<<' ';
}
return 0;
} |
48 | 23952 | int main()
{
int m,n,i,j,k;
scanf("%d%d",&m,&n);
int a[5][11][11]={0};
a[0][5][5]=m;
for(i=0;i<n;i++)
{
for(j=1;j<10;j++)
{
for(k=1;k<10;k++)
{
a[i+1][j][k]=a[i][j][k]*2+a[i][j+1][k]
+a[i][j-1][k]+a[i][j][k+1]
+a[i][j][k-1]+a[i][j+1][k+1]
+a[i][j+1][k-1]+a[i][j-1][k+1]
+a[i][j-1][k-1];
}
}
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if(j==1)
{printf("%d",a[n][i][j]);}
if(j>1)
{printf(" %d",a[n][i][j]);}
}
if(i<9)
{printf("\n");}
}
}
|
48 | 23953 | int i,j,k,n;
int num[11][11]={0},num1[11][11]={0},t[11][11]={0};
void turn()
{
int i,j;
for(i=0;i<11;i++)
for(j=0;j<11;j++)
{
t[i][j]=num[i][j];
num[i][j]=num1[i][j];
num1[i][j]=t[i][j];
}
}
int main()
{
cin>>i;
num[5][5]=i;
cin>>n;
for(i=0;i<n;i++)
{
for(j=1;j<10;j++)
{
for(k=1;k<10;k++)
{
num1[j][k]=2*num[j][k]+(num[j][k+1]+num[j][k-1]+num[j+1][k]+num[j-1][k]+num[j+1][k+1]+num[j+1][k-1]+num[j-1][k+1]+num[j-1][k-1]);
}
}
turn();
}
for(i=1;i<10;i++)
{
for(j=1;j<9;j++)
{
cout<<num[i][j]<<' ';
}
cout<<num[i][9]<<endl;
}
return 0;
} |
48 | 23954 | 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 | 23955 | int num[9][9][5];
int day;
int zz(int d)
{
int i,j;
if(d==day+1)
return 0;
if(d!=day+1)
{
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
num[i][j][d]+=2*num[i][j][d-1];
num[i-1][j-1][d]+=num[i][j][d-1];
num[i-1][j][d]+=num[i][j][d-1];
num[i-1][j+1][d]+=num[i][j][d-1];
num[i+1][j-1][d]+=num[i][j][d-1];
num[i+1][j][d]+=num[i][j][d-1];
num[i+1][j+1][d]+=num[i][j][d-1];
num[i][j+1][d]+=num[i][j][d-1];
num[i][j-1][d]+=num[i][j][d-1];
}
}
}
zz(d+1);
return 0;
}
int main()
{
int m;
int i,j,k;
cin>>m>>day;
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
for(k=0;k<day;k++)
num[i][j][k]=0;
}
}
num[4][4][0]=m;
zz(1);
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(j!=8)
cout<<num[i][j][day]<<" ";
if(j==8)
cout<<num[i][j][day]<<'\n';
}
}
return 0;
} |
48 | 23956 | 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 | 23957 | int main()
{
int row,col,i,a[N][N],b[N][N],n,d;
for(row=0;row<N;row++)
for(col=0;col<N;col++)
a[row][col]=0;
scanf("%d %d",&a[4][4],&d);
for(i=0;i<d;i++)
{
for(row=0;row<N;row++)
for(col=0;col<N;col++)
b[row][col]=0;
for(row=0;row<N;row++)
{
for(col=0;col<N;col++)
{
if(a[row][col]!=0)
{
b[row-1][col-1]+=a[row][col];
b[row][col-1]+=a[row][col];
b[row+1][col-1]+=a[row][col];
b[row-1][col]+=a[row][col];
b[row+1][col]+=a[row][col];
b[row-1][col+1]+=a[row][col];
b[row][col+1]+=a[row][col];
b[row+1][col+1]+=a[row][col];
a[row][col]*=2;
}
}
}
for(row=0;row<N;row++)
{
for(col=0;col<N;col++)
{
a[row][col]=a[row][col]+b[row][col];
}
}
}
for(row=0;row<N;row++)
{
for(col=0;col<N-1;col++)
{
printf("%d ",a[row][col]);
}
printf("%d\n",a[row][N-1]);
}
return 0;
}
|
48 | 23958 | 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 | 23959 | 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 | 23960 | //***************************
//*??????????? **
//*?????? 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 | 23961 | int main(){
int m,n,i,j,r,k,h;
scanf("%d%d",&m,&n);
int a[11][11]={0};
a[5][5]=m;
for(h=0;h<n;h++){
int b[11][11]={0};
for(i=1;i<10;i++){
for(j=1;j<10;j++){
if(a[i][j]!=0){
for(r=i-1;r<=i+1;r++){
for(k=j-1;k<=j+1;k++){
b[r][k]+=a[i][j];
}
}
}
}
}
for(i=1;i<10;i++){
for(j=1;j<10;j++){
a[i][j]+=b[i][j];
}
}
}
for(i=1;i<10;i++){
for(j=1;j<10;j++){
if(j!=9)
printf("%d ",a[i][j]);
else
printf("%d\n",a[i][j]);
}
}
} |
48 | 23962 | //********************
//**????????**
//**?? 1100012915***
//********11.28*******
//********************
int m, n, i, j ;
int bac( int day, int i, int j )
{
if ( ( day == 0 ) && ( i == 5 ) && ( j == 5 ) ) //?0? ?????????m?
return m ;
else if ( ( i >= 5 - day ) && ( i <= 5 + day ) &&
( j >= 5 - day ) && ( j <= 5 + day ) ) //?day? ??????? ??????????????????????
return ( bac(day - 1, i - 1, j - 1) + bac(day - 1, i - 1, j)
+ bac(day - 1, i - 1, j + 1) + bac(day - 1, i, j - 1)
+ bac(day - 1, i, j + 1) + bac(day - 1, i + 1, j - 1)
+ bac(day - 1, i + 1, j) + bac(day - 1, i + 1, j + 1)
+ 2 * bac(day - 1, i, j) ) ;
else
return 0 ;
}
int main()
{
cin >> m >> n ;
for ( i = 1; i <= 9; i ++ )
{
for ( j = 1; j <= 8; j ++ )
cout << bac( n, i, j ) << " " ;
cout << bac( n, i, 9 ) << endl ;
}
return 0 ;
}
|
48 | 23963 | 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 | 23964 | int a[10][10];
int b[10][10];
int n;
void inf(int m)
{
int i,j;
for(i = 1;i <= 9;i++)
for(j = 1;j <= 9;j++)
{
b[i][j] = 2*a[i][j]+a[i][j+1]+a[i+1][j]+a[i][j-1]+a[i-1][j]+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];
if(m < n) inf(m+1);
}
int main()
{
int i,j;
scanf("%d%d",&a[5][5],&n);
inf(1);
for(i = 1;i <= 9;i++)
{
for(j = 1;j <= 8;j++)
printf("%d ",a[i][j]);
printf("%d\n",a[i][9]);
}
return 0;
}
|
48 | 23965 | int main()
{
int a[10][10],t[10][10];
int time=0,i=0,j=0,k=0;
for(i=1;i<10;i++)
for(j=1;j<10;j++)
a[i][j]=0;
cin>>a[5][5]>>time;
for(i=0;i<time;i++)
{
for(j=5-i;j<=5+i;j++)
for(k=5-i;k<=5+i;k++)
t[j][k]=a[j][k];
for(j=5-i;j<=5+i;j++)
for(k=5-i;k<=5+i;k++)
{
a[j-1][k-1]=a[j-1][k-1]+t[j][k];
a[j-1][k]=a[j-1][k]+t[j][k];
a[j-1][k+1]=a[j-1][k+1]+t[j][k];
a[j][k-1]=a[j][k-1]+t[j][k];
a[j][k]=a[j][k]+t[j][k];
a[j][k+1]=a[j][k+1]+t[j][k];
a[j+1][k-1]=a[j+1][k-1]+t[j][k];
a[j+1][k]=a[j+1][k]+t[j][k];
a[j+1][k+1]=a[j+1][k+1]+t[j][k];
}
}
for(i=1;i<10;i++)
{
for(j=1;j<=8;j++)
cout<<a[i][j]<<" ";
cout<<a[i][9]<<endl;
}
return 0;
}
|
48 | 23966 | int main()
{
int k,n;
scanf("%d%d",&k,&n);
int a[12][12][5];
int i,j,l,x;
for(i=1;i<=11;i++)
{
for(j=1;j<=11;j++)
{
for(l=0;l<=4;l++)
{
a[i][j][l]=0;
}
}
}
a[6][6][0]=k;
for(l=1;l<=n;l++)
{
for(i=2;i<=10;i++)
{
for(j=2;j<=10;j++)
{
a[i][j][l]=
a[i-1][j-1][l-1]
+a[i-1][j][l-1]
+a[i-1][j+1][l-1]
+a[i][j-1][l-1]
+a[i][j+1][l-1]
+a[i+1][j-1][l-1]
+a[i+1][j][l-1]
+a[i+1][j+1][l-1]
+2*a[i][j][l-1];
}
}
}
for(i=2;i<=9;i++)
{
for(j=2;j<=9;j++)
{
printf("%d ",a[i][j][n]);
}
printf("%d\n",a[i][10][n]);
}
for(j=2;j<=9;j++)
{
printf("%d ",a[10][j][n]);
}
printf("%d",a[10][10][n]);
//scanf("%d",&l);
return 0;
}
|
48 | 23967 | int main()
{
int zhen[11][11],zhen2[11][11],m,n,i,j,k,hang1,hang2;
for(i=0;i<=10;i++)
{
for(j=0;j<=10;j++)zhen[i][j]=0;
}
cin>>m>>n;
zhen[5][5]=m;//???????
hang1=5;
hang2=5;
for(k=1;k<=n;k++)
{
for(i=0;i<=10;i++)
{
for(j=0;j<=10;j++)zhen2[i][j]=zhen[i][j];//??????????????????????????
}
for(i=hang1-1;i<=hang2+1;i++)
{
for(j=hang1-1;j<=hang2+1;j++)zhen[i][j]=zhen2[i-1][j-1]+zhen2[i-1][j]+zhen2[i-1][j+1]+zhen2[i][j-1]+2*zhen[i][j]+zhen2[i][j+1]+zhen2[i+1][j-1]+zhen2[i+1][j]+zhen2[i+1][j+1];
}//??????????
hang1=hang1-1;
hang2=hang2+1;//???????
}
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{cout<<zhen[i][j];
if(j<9)cout<<" ";
}
cout<<endl;//??
}
cin.get();cin.get();cin.get();cin.get();cin.get();
return 0;
} |
48 | 23968 |
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 | 23969 | int germ[10][10]={0}; //???????????
int m=0,n=0;
void work();
int main()
{
cin>>m>>n;
work();
for(int i=1;i<10;i++) //??
{
for(int j=1;j<9;j++)
cout<<germ[i][j]<<' ';
cout<<germ[i][9]<<endl;
}
return 0;
}
void work()
{
germ[5][5]=m;
int ngerm[10][10]={0}; //????????????
for(int i=0;i<n;i++)
{
int j,k,p,q;
for(j=1;j<=9;j++)
for(k=1;k<=9;k++) // ?????????
{ // ????????
if(germ[j][k]!=0)
{
for(p=j-1;p<=j+1;p++)
for(q=k-1;q<=k+1;q++)
ngerm[p][q]+=germ[j][k];
ngerm[j][k]+=germ[j][k];
}
}
for(j=1;j<=9;j++) //????????????
for(k=1;k<=9;k++)//??????
{
germ[j][k]=ngerm[j][k];
ngerm[j][k]=0;
}
}
}
|
48 | 23970 |
const int dx[8] = {-1, -1, 0 , 1, 1, 1, 0, -1},
dy[8] = {0 , -1, -1, -1, 0, 1, 1, 1};
int a[9][9];
int number (int x, int y, int day)
{
if (day == 0) return a[x][y];
int v = 0;
for (int i = 0; i < 8; ++i)
if (x + dx[i] >=0 && x + dx[i] < 9 && y + dy[i] >= 0 && y + dy[i] < 9)
v += number(x + dx[i], y + dy[i], day - 1);
v += 2 * number(x, y, day - 1);
return v;
}
int main()
{
int m, n;
cin >> m >> n;
for (int j = 0; j < 9; ++j)
for (int k = 0; k < 9; ++k)
a[j][k] = 0;
a[4][4] = m;
for (int j = 0; j < 9; ++j)
{
for (int k = 0; k < 9; ++k)
{
if (k != 0) cout << " ";
cout << number(j, k, n);
}
cout << endl;
}
return 0;
}
|
48 | 23971 | 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 | 23972 | int main(){
static int n,a[10][100][100];
cin>>a[0][5][5];
cin>>n;
for(int i=1;i<=n;i++){
for(int x=1;x<=9;x++)
for(int y=1;y<=9;y++)
a[i][x][y]=a[i-1][x][y]*2+a[i-1][x-1][y]+a[i-1][x+1][y]+a[i-1][x][y-1]+a[i-1][x][y+1]+a[i-1][x-1][y-1]+a[i-1][x-1][y+1]+a[i-1][x+1][y-1]+a[i-1][x+1][y+1];
}
for(int i=1;i<=9;i++)
for(int j=1;j<=9;j++){
if(j-1)cout<<' ';
cout<<a[n][i][j];
if(j==9)cout<<endl;
}
//cin>>n;
return 0;
}
|
48 | 23973 | int main()
{
int m,n,i,j,a,b,sz[11][11],de[11][11];
scanf("%d%d",&m,&n);
for(i=0;i<11;i++){
for(j=0;j<11;j++){
sz[i][j]=0;
de[i][j]=0;
}
}
de[5][5]=m;
for(a=0;a<n;a++){
for(i=1;i<10;i++){
for(j=0;j<10;j++){
sz[i][j]=de[i][j];
}
}
for(i=1;i<10;i++){
for(j=1;j<10;j++){
if(sz[i][j]!=0){
b=sz[i][j];
de[i][j+1]=de[i][j+1]+b;
de[i][j-1]=de[i][j-1]+b;
de[i-1][j]=de[i-1][j]+b;
de[i+1][j]=de[i+1][j]+b;
de[i-1][j-1]=de[i-1][j-1]+b;
de[i-1][j+1]=de[i-1][j+1]+b;
de[i+1][j-1]=de[i+1][j-1]+b;
de[i+1][j+1]=de[i+1][j+1]+b;
de[i][j]=de[i][j]+b;
}
}
}
}
for(i=1;i<10;i++){
for(j=1;j<10;j++){
if(j<9)
printf("%d ",de[i][j]);
else
printf("%d\n",de[i][j]);
}
}
return 0;
}
|
48 | 23974 |
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 | 23975 |
int a[11][11] = {0};
int b[11][11] = {0};
void f()
{
int u, v;
for (u = 1; u <= 9; u++)
{
for (v = 1; v <= 9; v++)
{
b[u][v] = 2 * a[u][v] + a[u - 1][v] + a[u + 1][v] + a[u][v - 1] + a[u][v + 1] + a[u - 1][v - 1] + a[u - 1][v + 1] + a[u + 1][v - 1] + a[u + 1][v + 1];
}
}
for (u = 1; u <= 9; u++)
{
for (v = 1; v <= 9; v++)
{
a[u][v] = b[u][v];
}
}
}
void print()
{
int i, j;
for(i = 1; i <= 9; i++)
{
for (j = 1; j <= 8; j++)
{
cout << a[i][j] << " ";
}
cout << a[i][9] << endl;
}
return;
}
int main()
{
int n, m;
cin >> n >> m;
a[5][5] = n;
b[5][5] = n;
while (m > 0)
{
f();
m--;
}
print();
return 0;
}
|
48 | 23976 | int main()
{
int n,m,i,j,k,l,p,q,a[9][9],b[9][9],d;
scanf("%d %d",&n,&d);
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
a[i][j]=0;
b[i][j]=0;
}
}
a[4][4]=n;
for( ;d>0;d--)
{
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(a[i][j]!=0)
{
b[i][j]+=a[i][j];
for(p=i-1;p<=i+1;p++)
{
for(q=j-1;q<=j+1;q++)
{
b[p][q]+=a[i][j];
}
}
a[i][j]=0;
}
}
}
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<9;j++)
{
if(j!=8)
{
printf("%d ",a[i][j]);
}
else
{
printf("%d\n",a[i][j]);
}
}
}
return 0;
} |
48 | 23977 | void fanzhi(int a[][9], int b[][9], int n, int count);
int main()
{
int m, n;
int a[9][9] = {0}, b[9][9] = {0};
cin >> m >> n;
a[4][4] = m;
b[4][4] = m;
fanzhi(a, b, n, 0);
return 0;
}
void fanzhi(int a[][9], int b[][9], int n, int count)
{
int i, j;
if(count == n)
{
for(i = 0; i < 9; i++)
for(j = 0; j < 9; j++)
{
if(j == 8)
cout << a[i][j] << endl;
else
cout << a[i][j] << " ";
}
}
else
{
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
if(b[i][j] > 0)
{
a[i - 1][j] += b[i][j];
a[i - 1][j - 1] += 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];
}
}
}
for(i = 0; i < 9; i++)
for(j = 0; j < 9; j++)
b[i][j] = a[i][j];
count ++;
fanzhi(a, b, n, count);
}
} |
48 | 23978 | int b[15][15] = { 0 }, a[15][15] = { 0 }, n = 0;
void f(int t)
{
if (t == n+1)
{
for (int i = 1; i <= 9; i++)
{
for (int k = 1; k <= 8; k++)
{
cout << a[i][k] << " ";
}
cout << a[i][9] << endl;
}
}
else
{
memset(b, 0, sizeof(b));
for (int j = 1; j <= 9; j++)
{
for (int k = 1; k <= 9; k++)
{
if (a[j][k] != 0)
{
for (int p = j - 1; p <= j + 1; p++)
{
for (int q = k - 1; q <= k + 1; q++)
{
b[p][q] += a[j][k];
}
}
b[j][k] += a[j][k];
}
}
}
for (int j = 1; j <= 9; j++)
{
for (int k = 1; k <= 9; k++)
{
a[j][k] = b[j][k];
}
}
f(t + 1);
}
}
int main()
{
int m = 0;
cin >> m >> n;
a[5][5] = m;
f( 1 );
return 0;
} |
48 | 23979 | /*????9???????????????m?????????????????????10???????10??????????????????????????????????????????n(1?n?4)????????????????
????
?????????????m????????????2?m?30???????n????????1?m?4??
????
??????????????????????????????n???????????????
????
2 1*/
int main()
{
int a[10][10][5];
int m;
short int i,j,k,n,t=2;
for(k=0;k<=4;k++)
for(i=1;i<=9;i++)
for(j=1;j<=9;j++) a[i][j][k]=0;
cin>>a[5][5][0]>>n;
m=a[5][5][0];
a[5][5][1]=2*m;
a[4][4][1]=a[4][6][1]=a[6][4][1]=a[6][6][1]=a[4][5][1]=a[5][4][1]=a[6][5][1]=a[5][6][1]=m;
while(t<=n)
{
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{
if(a[i][j][t-1]!=0)
{
a[i-1][j][t]+=a[i][j][t-1];
a[i][j-1][t]+=a[i][j][t-1];
a[i+1][j][t]+=a[i][j][t-1];
a[i][j+1][t]+=a[i][j][t-1];
a[i][j][t]+=2*a[i][j][t-1];
a[i-1][j+1][t]+=a[i][j][t-1];
a[i+1][j-1][t]+=a[i][j][t-1];
a[i-1][j-1][t]+=a[i][j][t-1];
a[i+1][j+1][t]+=a[i][j][t-1];
}
}
t++;
}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{
cout<<a[i][j][n];
if(j==9) cout<<endl;
else cout<<' ';
}
return 0;
}
|
48 | 23980 | main()
{
int num,day,a[9][9],b[9][9],i,j,k,h,s;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
a[i][j]=0;
scanf("%d%d",&num,&day);
a[4][4]=num;
for(i=0;i<day;i++)
{
for(k=0;k<2*i+3;k++)
for(j=0;j<2*i+3;j++)
b[3-i+k][3-i+j]=0;
for(k=0;k<2*i+1;k++)
for(j=0;j<2*i+1;j++)
for(h=-1;h<2;h++)
for(s=-1;s<2;s++)
b[4-i+k+h][4-i+j+s]= b[4-i+k+h][4-i+j+s]+a[4-i+k][4-i+j];
for(k=0;k<2*i+3;k++)
for(j=0;j<2*i+3;j++)
a[3-i+k][3-i+j]= b[3-i+k][3-i+j]+a[3-i+k][3-i+j];
}
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 | 23981 | 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 | 23982 | int main()
{
int a[9][9],b[9][9],c[9][9];
int i,j,m,n,k,p,q;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
a[i][j]=0;
b[i][j]=0;
c[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]=b[i][j]+3*a[i][j];
b[i][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][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];
}
}
for(p=0;p<9;p++)
for(q=0;q<9;q++)
{
a[p][q]=b[p][q]-a[p][q];
b[p][q]=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 | 23983 |
void germ(int a[9][9],int b[9][9],int n)
{
int i,j;
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(j>=1)
b[i][j-1]+=a[i][j];
if(i>=1&&j>=1)
b[i-1][j-1]+=a[i][j];
if(i>=1)
b[i-1][j]+=a[i][j];
if(i<=7&&j>=1)
b[i+1][j-1]+=a[i][j];
if(i<=7&&j<=7)
b[i+1][j+1]+=a[i][j];
if(i>=1&&j<=7)
b[i-1][j+1]+=a[i][j];
if(j<=7)
b[i][j+1]+=a[i][j];
if(i<=7)
b[i+1][j]+=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];
}
}
n-=1;
if(n>0)
{
germ(a,b,n);
}
else if(n==0)
{
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
printf("%d ",b[i][j]);
}
printf("%d\n",b[i][j]);
}
}
}
main()
{
int n,m,a[9][9]={0},b[9][9]={0};
scanf("%d%d",&m,&n);
a[4][4]=m;
b[4][4]=m;
germ(a,b,n);
} |
48 | 23984 | int bottle[9][9]={0};
int totalday=0;
void mutiply(int day);
int main()
{
cin>>bottle[4][4];
int day;
cin>>totalday;
mutiply(1);
for(int i=0;i<=8;i++)
{ cout<<bottle[i][0];
for(int j=1;j<=8;j++)
{
cout<<' '<<bottle[i][j];
}
cout<<endl;
}
}
void mutiply(int day)
{
if(day==totalday+1)
return ;
int board[9][9]={0};
for(int i=1;i<=7;i++)
for(int j=1;j<=7;j++)
{
board[i][j]=board[i][j]+bottle[i][j]*2;
board[i-1][j]=board[i-1][j]+bottle[i][j];
board[i+1][j]=board[i+1][j]+bottle[i][j];
board[i][j-1]=board[i][j-1]+bottle[i][j];
board[i][j+1]=board[i][j+1]+bottle[i][j];
board[i-1][j-1]=board[i-1][j-1]+bottle[i][j];
board[i-1][j+1]=board[i-1][j+1]+bottle[i][j];
board[i+1][j-1]=board[i+1][j-1]+bottle[i][j];
board[i+1][j+1]=board[i+1][j+1]+bottle[i][j];
}
for(int i=0;i<=8;i++)
for(int j=0;j<=8;j++)
{
bottle[i][j]=board[i][j];
}
mutiply(day+1);
}
|
48 | 23985 | int a[10][10] = {0};
int b[10][10] = {0};
int i , j;
void f(int day);
int main()
{
int m , n ;
cin >> m >> n;
a[5][5] = m;
f(n);
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]);
}
return 0;
}
void f(int day)
{
int k,l;
for(i = 1 ; i <= 9 ; i ++)
for(j = 1 ; j <= 9 ; j++)
b[i][j] = a[i][j];
if(day > 0)
{
for(i = 1 ; i <= 9 ; i ++)
for(j = 1 ; j <= 9 ; j++)
if(a[i][j] != 0)
{
for(k = i - 1; k <= i + 1; k ++)
for(l = j - 1; l <= j + 1; l++)
a[k][l] = a[k][l] + b[i][j];
}
f(day - 1);
}
}
|
48 | 23986 | int vi[9][9] = {0}, cp[9][9], m, n, em[9][9] = {0};
void go_on(int day);
int main()
{
int i,j; // i??????m??????????n???
cin >> m >> n;
vi[4][4] = m;
memcpy(cp, vi, 9 * 9 * 4);
go_on(n);
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
if (j != 8)
{
cout << vi[i][j] << " ";
}
else
{
cout << vi[i][j] << endl;
}
}
}
return 0;
}
void go_on (int x)
{
int p, q, i, j;
if (x == 1)
{
for (i = -1; i <= 1; i++)
{
for (j = -1; j <= 1; j++)
{
if ((i != 0) || (j != 0))
{
em[4 + i][4 + j] += vi[4][4];
}
else
{
em[4 + i][4 + j] += vi[4][4] * 2;
}
}
} // ????????????em?????????
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
vi[i][j] = vi[i][j] + em[i][j] - cp[i][j];
}
}
memcpy(cp,vi,9 * 9 * 4);
for (i = 0; i <= 8; i++)
{
for (j = 0; j <= 8; j++)
{
em[i][j] = 0;
}
}
return;
}
if (x > 1) // ??x = 2
{
go_on (x - 1);
for (p = 5 - x; p <= x + 3; p++)
{
for (q = 5 - x; q <= x + 3; q++)
{
for (i = -1;i <= 1; i++)
{
for (j = -1; j <= 1; j++)
{
if ((i != 0) || (j != 0))
{
em[p + i][q + j] += vi[p][q];
}
else
{
em[p + i][q + j] += vi[p][q] * 2;
}
}
}
}
}
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
vi[i][j] = vi[i][j] + em[i][j] - cp[i][j];
}
}
memcpy(cp,vi, 9*9*4);
for (i = 0; i <= 8; i++)
{
for (j = 0; j <= 8; j++)
{
em[i][j] = 0;
}
}
}
}
|
48 | 23987 | int main()
{
int m,n,i,j;
cin>>m>>n;
int a[11][11]={0},save[11][11]={0};
a[5][5]=m;
while(n--)
{
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
if(a[i][j]!=0)
{
save[i-1][j]+=a[i][j];
save[i+1][j]+=a[i][j];
save[i][j-1]+=a[i][j];
save[i][j+1]+=a[i][j];
save[i-1][j-1]+=a[i][j];
save[i-1][j+1]+=a[i][j];
save[i+1][j-1]+=a[i][j];
save[i+1][j+1]+=a[i][j];
a[i][j]*=2;
}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
if(save[i][j]!=0)
{a[i][j]+=save[i][j];
save[i][j]=0;}
}
for(i=1;i<=9;i++)
{
for(j=1;j<=8;j++)
cout<<a[i][j]<<' ';
cout<<a[i][9]<<endl;
}
return 0;
} |
48 | 23988 | int main()
{
int arr[9][9]={{0}},m,n;
cin>>m>>n;
arr[4][4]=m;
for(;n>0;n--)
{
int temp[9][9]={{0}};
for(int i=0;i<9;i++)
for(int j=0;j<9;j++)
{
if(arr[i][j]>0)
{
temp[i][j]+=2*arr[i][j];
temp[i-1][j-1]+=arr[i][j];
temp[i-1][j]+=arr[i][j];
temp[i-1][j+1]+=arr[i][j];
temp[i][j-1]+=arr[i][j];
temp[i][j+1]+=arr[i][j];
temp[i+1][j]+=arr[i][j];
temp[i+1][j-1]+=arr[i][j];
temp[i+1][j+1]+=arr[i][j];
}
}
for(int i=0;i<9;i++)
for(int j=0;j<9;j++)
arr[i][j]=temp[i][j];
}
for(int i=0;i<9;i++)
{
for(int j=0;j<8;j++)
cout<<arr[i][j]<<' ';
cout<<arr[i][8]<<endl;
}
return 0;
} |
48 | 23989 | int main(int argc, char* argv[])
{
int m,day,i,j,k;
int a[9][9],b[9][9];
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{a[i][j]=0;
b[i][j]=0;
}
scanf("%d%d",&m,&day);
a[4][4]=m;
b[4][4]=m;
for(k=0;k<day;k++)
{for(i=0;i<9;i++)
{for(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(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 | 23990 | const int Length = 9;
int board[Length][Length] = {0};
void f(int m, int n)
{
int i,j;
int temp[Length][Length] = {0};
if(n == 0) board[4][4] = m;
else
{
f(m,n-1);
for(i=0;i<Length;i++)
{
for(j=0;j<Length;j++)
{
temp[i][j] = board[i][j];
board[i][j] = 0;
}
}
for(i = 0; i<Length ; i++)
{
for(j = 0; j<Length ;j++)
{
if(temp[i][j] != 0)
{
board[i][j] += temp[i][j] *2;
board[i+1][j]+= temp[i][j];
board[i-1][j]+= temp[i][j];
board[i][j+1]+= temp[i][j];
board[i][j-1]+= temp[i][j];
board[i-1][j-1]+= temp[i][j];
board[i+1][j+1]+= temp[i][j];
board[i-1][j+1]+= temp[i][j];
board[i+1][j-1]+= temp[i][j];
}
}
}
}
}
int main()
{
int m,n,i,j;
cin>>m>>n;
f(m,n);
for(i=0;i<Length;i++)
{
for(j=0;j<Length-1;j++)
{
cout<<board[i][j]<<" ";
}
cout<<board[i][Length-1]<<endl;
}
return 0;
} |
48 | 23991 | int a[10][10];
void function();
int main()
{
for(int i=1;i<=9;i++)
for(int j=1;j<=9;j++)
a[i][j]=0;
int n,d;
cin>>n>>d;
a[5][5]=n;
for(int i=1;i<=d;i++)
function();
for(int i=1;i<=9;i++){
for(int j=1;j<=8;j++)
cout<<a[i][j]<<" ";
cout<<a[i][9];
cout<<endl;
}
return 0;
}
void function()
{ int rem[10][10];
for(int i=1;i<=9;i++)
for(int j=1;j<=9;j++)
rem[i][j]=0;
for(int i=2;i<=8;i++)
for(int j=2;j<=8;j++)
if(a[i][j]!=0){
rem[i][j]=rem[i][j]+a[i][j]*2;
rem[i-1][j-1]+=a[i][j]; rem[i-1][j]+=a[i][j]; rem[i-1][j+1]+=a[i][j]; rem[i][j-1]+=a[i][j];
rem[i][j+1]+=a[i][j]; rem[i+1][j-1]+=a[i][j]; rem[i+1][j]+=a[i][j]; rem[i+1][j+1]+=a[i][j];
a[i][j]=0;
}
for(int i=2;i<=8;i++){
if(a[1][i]!=0){
rem[1][i]+=a[1][i]*2;
int x=a[1][i]*8/5;
rem[1][i+1]+=x;rem[1][i-1]+=x;rem[2][i+1]+=x;rem[2][i-1]+=x;rem[2][i]+=x;
a[1][i]=0;
}
if(a[9][i]!=0){
rem[9][i]+=a[9][i]*2;
int x=a[9][i]*8/5;
rem[9][i+1]+=x;rem[9][i-1]+=x;rem[8][i+1]+=x;rem[8][i-1]+=x;rem[8][i]+=x;
a[9][i]=0;
}
if(a[i][1]!=0){
rem[i][1]+=a[i][1]*2;
int x=a[i][1]*8/5;
rem[i+1][1]+=x;rem[i-1][1]+=x;rem[i+1][2]+=x;rem[i-1][2]+=x;rem[i][2]+=x;
a[i][1]=0;
}
if(a[i][9]!=0){
rem[i][9]+=a[i][9]*2;
int x=a[i][9]*8/5;
rem[i+1][9]+=x;rem[i-1][9]+=x;rem[i+1][8]+=x;rem[i-1][8]+=x;rem[i][8]+=x;
a[i][1]=0;
}
}
if(a[1][1]!=0){
rem[1][1]=a[1][1]*2;
int x=a[1][1]*8/3;
rem[1][2]+=x;rem[2][1]+=x;rem[2][2]+=x;
a[1][1]=0;
}
if(a[1][9]!=0){
rem[1][9]=a[1][9]*2;
int x=a[1][9]*8/3;
rem[1][8]+=x;rem[2][8]+=x;rem[2][9]+=x;
a[1][9]=0;
}
if(a[9][1]!=0){
rem[9][1]=a[9][1]*2;
int x=a[9][1]*8/3;
rem[9][2]+=x;rem[8][1]+=x;rem[8][2]+=x;
a[1][1]=0;
}
if(a[9][9]!=0){
rem[9][9]=a[9][9]*2;
int x=a[9][9]*8/3;
rem[9][8]+=x;rem[8][8]+=x;rem[8][9]+=x;
a[9][9]=0;
}
for(int i=1;i<=9;i++)
for(int j=1;j<=9;j++)
a[i][j]=a[i][j]+rem[i][j];
/*for(int i=1;i<=9;i++){
for(int j=1;j<=8;j++)
cout<<a[i][j]<<" ";
cout<<a[i][9];
cout<<endl;
}*/
}
|
48 | 23992 | int main()
{
int n,m,i,j,k;
scanf("%d %d",&m,&n);
int A[5][9][9];
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
{
A[0][j][k]=0;
}
A[0][4][4]=m;
}
for(i=0;i<n;i++)
{
for(k=1;k<8;k++)
{
A[i+1][0][k]=A[i][0][k-1]+A[i][0][k+1]+A[i][1][k]+A[i][1][k+1]+A[i][1][k-1];
}
for(k=1;k<8;k++)
{
A[i+1][8][k]=A[i][8][k-1]+A[i][8][k+1]+A[i][7][k]+A[i][7][k+1]+A[i][7][k-1];
}
for(j=1;j<8;j++)
{
A[i+1][j][0]=A[i][j+1][0]+A[i][j-1][0]+A[i][j+1][1]+A[i][j-1][1]+A[i][j][1];
}
for(j=1;j<8;j++)
{
A[i+1][j][8]=A[i][j+1][8]+A[i][j-1][8]+A[i][j+1][7]+A[i][j-1][7]+A[i][j][7];
}
A[i+1][0][0]=A[i][1][1]+A[i][1][0]+A[i][0][1];
A[i+1][8][0]=A[i][7][1]+A[i][7][0]+A[i][8][1];
A[i+1][8][8]=A[i][8][7]+A[i][7][8]+A[i][7][7];
A[i+1][0][8]=A[i][0][8]+A[i][1][8]+A[i][1][7];
for(j=1;j<8;j++)
{
for(k=1;k<8;k++)
{
A[i+1][j][k]=2*A[i][j][k]+A[i][j-1][k]+A[i][j+1][k]+A[i][j][k-1]+A[i][j][k+1]+A[i][j-1][k-1]+A[i][j+1][k-1]+A[i][j-1][k+1]+A[i][j+1][k+1];
}
}
}
for(j=0;j<9;j++)
{
for(k=0;k<8;k++)
{
printf("%d ",A[n][j][k]);
}
printf("%d\n",A[n][j][k]);
}
return 0;
} |
48 | 23993 | 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 | 23994 | main()
{
int m,n,a[11][11],b[11][11],i,j,k;
scanf("%d %d",&m,&n);
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
a[i][j]=0;
b[i][j]=0;
}
}
b[5][5]=m;
for(k=1;k<=n;k++)
{
for(i=5-n;i<=5+n;i++)
{
for(j=5-n;j<=5+n;j++)
{
a[i][j]=2*b[i][j]+b[i+1][j+1]+b[i][j+1]+b[i+1][j]+b[i-1][j-1]+b[i-1][j+1]+b[i+1][j-1]+b[i-1][j]+b[i][j-1];
}
}
for(i=5-n;i<=5+n;i++)
{
for(j=5-n;j<=5+n;j++)
{
b[i][j]=a[i][j];
}
}
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if(j==1)
printf("%d",a[i][j]);
else if(j!=1&&j!=9)
printf(" %d",a[i][j]);
else if(j==9)
printf(" %d\n",a[i][j]);
}
}
}
|
48 | 23995 |
int main()
{
int a[10][10] = {0}, b[10][10] = {0};
int i, j, m, n;
cin >> m >> n;
a[5][5] = m;
while (n--)
{
for (i = 1; i <= 9; i++)
{
for (j = 1; j <= 9; j++)
{
if (a[i][j] != 0)
{
b[i][j] = b[i][j] + 2 * a[i][j];
b[i + 1][j] = b[i + 1][j] + 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 - 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];
}
}
}
for (i = 1; i <= 9; i++)
{
for (j = 1; j <= 9; j++)
{
a[i][j] = b[i][j];
b[i][j] = 0;
}
}
}
for (i = 1; i <= 9; i++)
{
for (j = 1; j <= 8; j++)
cout << a[i][j] << ' ';
cout << a[i][9] << endl;
}
return 0;
} |
48 | 23996 | int main()
{const int d=10;
int a[d][d],b[d][d];
int i,j,k,m,n,fx,fy;
scanf("%d%d",&m,&n);
memset(a,0,sizeof(a));
a[5][5]=m;
for(i=0;i<n;i++)
{
memset(b,0,sizeof(b));
for(k=1;k<d-1;k++)
{ for(j=1;j<d-1;j++)
{ b[k][j]+=a[k][j];
for(fx=-1;fx<=1;fx++)
{for(fy=-1;fy<=1;fy++)
b[k+fx][j+fy]+=a[k][j];
}
}
}
memcpy(a,b,sizeof(a));}
for(i=1;i<d;i++)
{ for(j=1;j<d-1;j++)
printf("%d ",a[i][j]);
printf("%d\n",a[i][d-1]);
}
return 0;
}
|
48 | 23997 |
int main (){
int m,n,i,j,k,sz[5][20][20]={0};
scanf("%d %d",&m,&n);
n=n+1;
sz[0][5][5]=m;
for(k=0;k<n;k++){
for(i=1;i<10;i++){
for(j=1;j<10;j++){
sz[k+1][i][j]=(sz[k][i][j]*2+sz[k][i][j+1]+sz[k][i][j-1]+sz[k][i-1][j]+sz[k][i+1][j]+sz[k][i+1][j+1]+sz[k][i+1][j-1]+sz[k][i-1][j+1]+sz[k][i-1][j-1]);
}
}
}
for(i=1;i<9;i++){
for(j=1;j<9;j++){
printf("%d ",sz[n-1][i][j]);
}
printf("%d\n",sz[n-1][i][9]);
}
for(i=9,j=1;j<9;j++){
printf("%d ",sz[n-1][i][j]);
}
printf("%d",sz[n-1][9][9]);
return 0;
}
|
48 | 23998 | 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 | 23999 | int main(){
int a[5][10][10]={0},k,i,j,m,n;
scanf("%d%d",&m,&n);
for (i=0;i<=10;i++){
for (j=0;j<=10;j++){
a[0][i][j]=0;
}
}
a[0][5][5]=m;
for (k=1;k<=n;k++){
for (i=1;i<=9;i++){
for (j=1;j<=9;j++){
a[k][i][j]=a[k-1][i][j]*2+a[k-1][i-1][j-1]+a[k-1][i][j-1]+a[k-1][i-1][j]+a[k-1][i][j+1]+a[k-1][i+1][j]+a[k-1][i+1][j+1]+a[k-1][i+1][j-1]+a[k-1][i-1][j+1];
}
}
}
for (i=1;i<=9;i++){
for (j=1;j<=9;j++){
if ((abs(i-5)>n)||(abs(j-5)>n))
a[k][i][j]=0;
}
}
for (i=1;i<=9;i++){
for (j=1;j<=9;j++){
if (j!=9)
printf("%d ",a[n][i][j]);
else printf("%d",a[n][i][j]);
}
printf("\n");
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.