id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
23,600 |
int plate1[9][9] = {0}; // ??????
int plate[9][9] = {0};
void count(int k);
int main ()
{
int m, n;
cin >> m >> n;
plate[4][4] = m;
count(n);
return 0;
}
void count(int k)
{
int i, j;
if (k == 0)
{
for (i = 0; i < 9; i++)
{
for (j = 0; j < 8; j++)
{
cout << plate[i][j] << " ";
}
cout << plate[i][j] << endl;
}
return;
}
else
{
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
if (plate[i][j] != 0)
{
if (i > 0 && j > 0)
{
plate1[i - 1][j - 1] = plate1[i - 1][j - 1] + plate[i][j];
}
if (j > 0)
{
plate1[i][j - 1] = plate1[i][j - 1] + plate[i][j];
}
if (i > 0 && j < 8)
{
plate1[i - 1][j + 1] = plate1[i - 1][j + 1] + plate[i][j];
}
if (j < 8)
{
plate1[i][j + 1] = plate1[i][j + 1] + plate[i][j];
}
if (i < 8 && j < 8)
{
plate1[i + 1][j + 1] = plate1[i + 1][j + 1] + plate[i][j];
}
if (i < 8)
{
plate1[i + 1][j] = plate1[i + 1][j] + plate[i][j];
}
if (i < 8 && j > 0)
{
plate1[i + 1][j - 1] = plate1[i + 1][j - 1] + plate[i][j];
}
if (i > 0)
{
plate1[i - 1][j] = plate1[i - 1][j] + plate[i][j];
}
}
}
}
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
plate[i][j] = plate[i][j] * 2 + plate1[i][j];
plate1[i][j] = 0;
}
}
count(k - 1);
}
} | 48 |
23,601 |
int main()
{
int grids[9][9] = {0}, daysLeft, history[81][3], historyCount = 0, x, y;
cin >> grids[4][4];
for (cin >> daysLeft; daysLeft > 0; daysLeft--)
{
historyCount = 0;
for (y = 0; y < 9; y++)
for (x = 0; x < 9; x++)
if (grids[x][y])
{
history[historyCount][0] = x;
history[historyCount][1] = y;
history[historyCount][2] = grids[x][y];
historyCount++;
};
for (int i = 0; i < historyCount; i++)
{
x = history[i][0];
y = history[i][1];
int val = history[i][2];
if (x > 0)
{
grids[x - 1][y] += val;
if (y > 0)
grids[x - 1][y - 1] += val;
if (y < 8)
grids[x - 1][y + 1] += val;
}
if (x < 8)
{
grids[x + 1][y] += val;
if (y > 0)
grids[x + 1][y - 1] += val;
if (y < 8)
grids[x + 1][y + 1] += val;
}
if (y > 0)
grids[x][y - 1] += val;
if (y < 8)
grids[x][y + 1] += val;
grids[x][y] += val;
}
}
for (y = 0; y < 9; y++)
{
cout << grids[0][y];
for (x = 1; x < 9; x++)
cout << ' ' << grids[x][y];
cout << endl;
}
return 0;
} | 48 |
23,602 |
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 |
23,603 | int main()
{
int zz[11][11][5];
int i,j,k;
int m,n;
for ( i = 0 ; i < 11 ; i ++ )
for ( j = 0 ; j < 11 ; j ++ )
for ( k = 0 ; k < 5 ; k ++ )
zz[i][j][k]=0;
cin>>m>>n;
zz[5][5][n]=m;
while ( n != 0 )
{
for ( i = 1 ; i < 10 ; i ++ )
{
for ( j = 1 ; j < 10 ; j ++ )
{
if ( zz[i][j][n] > 0 )
{
zz[i][j][n-1] += 2 * zz[i][j][n];
zz[i-1][j-1][n-1] += zz[i][j][n];
zz[i-1][j][n-1] += zz[i][j][n];
zz[i-1][j+1][n-1] += zz[i][j][n];
zz[i][j-1][n-1] += zz[i][j][n];
zz[i][j+1][n-1] += zz[i][j][n];
zz[i+1][j-1][n-1] += zz[i][j][n];
zz[i+1][j][n-1] += zz[i][j][n];
zz[i+1][j+1][n-1] += zz[i][j][n];
}
}
}
for ( i = 0 ; i < 11 ; i ++ )
{
for ( j = 0 ; j < 11 ; j ++ )
{
if ( i == 0 || j == 0 || i == 10 || j == 10 )
zz[i][j][n-1]=0;
}
}
n--;
}
for ( i = 1 ; i < 10 ; i ++ )
{
for ( j = 1 ; j < 10 ; j ++ )
{
if ( j != 9 )
cout<<zz[i][j][0]<<' ';
else
cout<<zz[i][j][0];
}
cout<<endl;
}
} | 48 |
23,604 | int main()
{
int i, j, a[9][9], m, n, p, q, u, t[9][9];
for(i=0; i<9; i++)
{
for(j=0; j<9; j++)
a[i][j]=0;
}
scanf("%d %d", &m, &n);
a[4][4]=m;
for(u=0; u<n; u++)
{
for(i=4-u; i<=4+u; i++)
{
for(j=4-u; j<=4+u; j++)
{
t[i][j]=a[i][j];
}
}
for(i=4-u; i<=4+u; i++)
{
for(j=4-u; j<=4+u; j++)
{
for(p=i-1; p<=i+1; p++)
{
for(q=j-1;q<=j+1; q++)
a[p][q]=a[p][q]+t[i][j];
}
}
}
}
for(i=0; i<9; i++)
{
for(j=0; j<8; j++)
printf("%d ", a[i][j]);
if(j=8)
printf("%d\n", a[i][j]);
}
return 0;
}
| 48 |
23,605 | main ()
{
int m,n;
int a[10][10]={0};
int b[10][10]={0};
scanf ("%d%d",&m,&n);
a[4][4]=m;
int i=0,j=0,k ;
int x,y;
for (k=0;k<n;k++)
{
for (i=0;i<9;i++)
{
for (j=0;j<9;j++)
{
b[i][j]=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 (i=0;i<9;i++)
{
for (j=0;j<9;j++)
{
a[i][j]=a[i][j]+b[i][j];
}
}
}
for (x=0;x<9;x++)
{
for (y=0;y<9;y++)
{
if (a[x][y]>0)
{
if (y<8)
printf ("%d ",a[x][y]);
else
printf ("%d",a[x][y]);
}
else
if (y<8)
printf ("0 ",a[x][y]);
else
printf ("0",a[x][y]);
}
printf ("\n");
}
getchar ();getchar ();
}
| 48 |
23,606 | //********************************
//* ??? ????????
//* ????? *
//********************************
int a[9][9]={0};//??????????
int b[9][9]={0};//??????????
void f(int n)
{
int i,j;
if(n>0)
{
for(i=1;i<=7;i++)
for(j=1;j<=7;j++)
{
if(a[i][j]>0)
{
b[i][j]+=2*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];
b[i][j]=0;
}
f(n-1);
}
else 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;
}
}
}
int main()
{
int m,day;
cin>>m>>day;
a[4][4]=m;
f(day);
return 0;
} | 48 |
23,607 |
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 |
23,608 |
int cell[15][15] = {0};
void change()
{
int cell2[15][15] = {0};
for(int i = 1; i <= 9; i++)
for(int j = 1; j<= 9; j++)
{
if(cell[i][j] != 0)
{
int k = cell[i][j] * 2;
cell2[i][j] += k;
cell2[i - 1][j] += cell[i][j];
cell2[i + 1][j] += cell[i][j];
cell2[i][j + 1] += cell[i][j];
cell2[i][j - 1] += cell[i][j];
cell2[i - 1][j - 1] += cell[i][j];
cell2[i + 1][j - 1] += cell[i][j];
cell2[i - 1][j + 1] += cell[i][j];
cell2[i + 1][j + 1] += cell[i][j];
}
}
for(int i = 1; i <= 9; i++)
for(int j = 1; j <= 9; j++)
cell[i][j] = cell2[i][j];
}
int main() {
int m = 0, n = 0;
cin >> m >> n;
cell[5][5] = m;
for(int i = 0; i < n; i++)
change();
for(int i = 1; i <= 9; i++){
for(int j = 1; j < 9; j++)
cout << cell[i][j] << ' ';
cout << cell[i][9] << endl;
}
return 0;
} | 48 |
23,609 | int m=0,n=0,a[9][9]={0},b[9][9]={0};
void f(int day)
{
if(day>n)
{
}
else
{
for(int i=1;i<=7;i++)
{
for(int j=1;j<=7;j++)
{
a[i][j]+=b[i][j];
a[i-1][j]+=b[i][j];
a[i+1][j]+=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+1]+=b[i][j];
a[i-1][j+1]+=b[i][j];
a[i+1][j-1]+=b[i][j];
}
}
for(int x=0;x<=8;x++)
{
for(int y=0;y<=8;y++)
{
b[x][y]=a[x][y];
}
}
f(day+1);
}
}
int main()
{
cin>>m>>n;
a[4][4]=m;
b[4][4]=m;
f(1);
for(int p=0;p<=8;p++)
{
cout<<a[p][0];
for(int q=1;q<=8;q++)
{
cout<<" "<<a[p][q];
}
cout<<endl;
}
return 0;
} | 48 |
23,610 | int main()
{
int a[11][11];
int b[11][11];
int i,j,k;
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
a[i][j]=0;
b[i][j]=0;
}
}
int m, n;
scanf("%d %d",&m,&n);
a[5][5]=m;
b[5][5]=m;
for(k=0;k<n;k++)
{
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
a[i][j]=2*b[i][j]+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]+b[i][j+1]+b[i][j-1];
}
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
b[i][j]=a[i][j];
}
}
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if(j==9)
printf("%d\n",a[i][j]);
else
printf("%d ",a[i][j]);
}
}
return 0;
}
| 48 |
23,611 |
int A[11][11], tmp[11][11];
int N;
int main()
{
scanf ("%d %d", &A[5][5], &N);
for (int i = 0; i < N; i ++)
{
memset(tmp, 0, sizeof(tmp));
for (int l = 1; l <= 9; l ++)
for (int r = 1; r <= 9; r ++)
{
tmp[l][r] += 2 * A[l][r];
tmp[l - 1][r] += A[l][r];
tmp[l + 1][r] += A[l][r];
tmp[l][r - 1] += A[l][r];
tmp[l][r + 1] += A[l][r];
tmp[l - 1][r - 1] += A[l][r];
tmp[l - 1][r + 1] += A[l][r];
tmp[l + 1][r - 1] += A[l][r];
tmp[l + 1][r + 1] += A[l][r];
}
memcpy(A, tmp, sizeof(tmp));
}
for (int i = 1; i < 10; i ++)
{
for (int j = 1; j < 9; j ++)
printf ("%d ", A[i][j]);
printf ("%d\n", A[i][9]);
}
return 0;
}
| 48 |
23,612 | int num[9][9] = {0}, flag[9][9] = {0};
int m;
int main()
{
int n;
cin >> m >> n;
void fun ( int );
num[4][4] = m;
fun ( n );
return 0;
}
void fun ( int n )
{
if ( n == 0 )
{
int i, j;
for ( i = 0; i < 9; i++ )
{
cout << num[i][0];
for ( j = 1; j < 9; j++ )
{
cout << " " << num[i][j];
}
cout << endl;
}
}
else
{
int i, j;
for ( i = 0; i < 9; i++ )
{
for ( j = 0; j < 9; j++ )
{
if ( num[i][j] != 0 )
{
flag[i][j - 1] += num[i][j];
flag[i][j + 1] += num[i][j];
flag[i + 1][j] += num[i][j];
flag[i - 1][j] += num[i][j];
flag[i + 1][j - 1] += num[i][j];
flag[i - 1][j - 1] += num[i][j];
flag[i + 1][j + 1] += num[i][j];
flag[i - 1][j + 1] += num[i][j];
flag[i][j] += num[i][j];
}
}
}
for ( i = 0; i < 9; i++ )
{
for ( j = 0; j < 9; j++ )
{
num[i][j] += flag[i][j];
}
}
for ( i = 0; i < 9; i++ )
{
for ( j = 0; j < 9; j++ )
{
flag[i][j] = 0;
}
}
fun ( n - 1 );
}
} | 48 |
23,613 | //????A????006
//????????????2010? ???
int main()
{int a[11][11][5];
int m,n,i,j,k,x,y,flag=0;
cin>>m>>n;
for(j=0;j<11;j++)
{
for(k=0;k<11;k++)
a[j][k][0]=0;
}
for(x=0;x<4;x++)
{for(y=0;y<11;y++)
{a[0][y][x]=0;
a[y][0][x]=0;
a[10][y][x]=0;
a[y][10][x]=0;}
}
a[5][5][0]=m;
for(i=1;i<=n;i++)
{
for(j=1;j<10;j++)
{
for(k=1;k<10;k++)
a[j][k][i]=a[j][k][i-1]*2+a[j][k-1][i-1]+a[j][k+1][i-1]+a[j+1][k][i-1]+a[j+1][k+1][i-1]+a[j+1][k-1][i-1]+a[j-1][k-1][i-1]+a[j-1][k][i-1]+a[j-1][k+1][i-1];
}}
for(j=1;j<10;j++)
{
for(k=1;k<10;k++)
{cout<<a[j][k][n];
flag=flag+1;
if(flag!=9) cout<<" ";
else if(flag==9)
{cout<<endl;
flag=0;}
}
}
return 0;
} | 48 |
23,614 |
int main()
{
int num, d, a[9][9] = {0}, tmp[9][9] = {0};
cin >> num >> d;
a[4][4] = num;
for (int i = 0; i < d; i++)
{
for (int x = 0; x < 9; x++)
for (int y = 0; y < 9; y++)
tmp[x][y] = 0;
for (int x = 0; x < 9; x++)
for (int y = 0; y < 9; y++)
{
if(x > 0)
{
tmp[x - 1][y] += a[x][y];
if (y > 0)
{
tmp[x - 1][y - 1] += a[x][y];
if (y < 9)
tmp[x - 1][y + 1] += a[x][y];
}
if (x < 9)
{
tmp[x + 1][y] += a[x][y];
if (y > 0)
{
tmp[x + 1][y - 1] += a[x][y];
if (y < 9)
tmp[x + 1][y + 1] += a[x][y];
}
}
}
if(y > 0)
tmp[x][y - 1] += a[x][y];
if (y < 9)
tmp[x][y + 1] += a[x][y];
tmp[x][y] += a[x][y] * 2;
}
for (int x = 0; x < 9; x++)
for (int y = 0; y < 9; y++)
a[x][y] = tmp[x][y];
}
for (int x = 0; x < 9; x++)
for (int y = 0; y < 9; y++)
{
cout << a[x][y];
if (y == 8)
cout << endl;
else
cout << " ";
}
return 0;
} | 48 |
23,615 | 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 |
23,616 | 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;
b[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]+=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 ",b[i][j]);
}
printf("%d",b[i][8]);
printf("\n");
}
return 0;
}
| 48 |
23,617 |
int main()
{
int m,n; //?? ???????? ??
int i,j,k,p,q; //????
int b[9][9][5]={0}; //?? ????0 b???? b[i][j][k]???i??j??k?
scanf("%d %d", &m, &n);
b[4][4][0]=m;
//printf("%d", b[8][8][3]);
for(i=1;i<=n;i++) //??????
{
for(j=1;j<8;j++)
{
for(k=1;k<8;k++)
{
while(b[j][k][i-1]!=0)
{
//printf("xunhuan");
b[j][k+1][i]+=b[j][k][i-1];
b[j][k-1][i]+=b[j][k][i-1];
b[j-1][k-1][i]+=b[j][k][i-1];
b[j-1][k][i]+=b[j][k][i-1];
b[j-1][k+1][i]+=b[j][k][i-1];
b[j+1][k-1][i]+=b[j][k][i-1];
b[j+1][k][i]+=b[j][k][i-1];
b[j+1][k+1][i]+=b[j][k][i-1];
b[j][k][i]+=2*b[j][k][i-1];
break;
}
}
}
}
for(p=0;p<=8;p++)
{
for(q=0;q<8;q++)
printf("%d ", b[p][q][n]);
printf("%d\n", b[p][8][n]);
}
return 0;
} | 48 |
23,618 | //****************************************
//*??????????? **
//*?????? 1100012760**
//*???2011.11.26 **
//****************************************
int main()
{
int mat[10][10] = {0} , New[10][10];
int i , j , l , m , n;
cin >> m >> n;
mat[5][5] = m;
for(i = 1 ; i <= n ; i++)
{
for (j = 1 ; j <= 9 ; j++)
{
for (l = 1 ; l <= 9 ; l++)
{
New[j][l] = 0;
}
}
for (j = 1 ; j <= 9 ; j++)
{
for (l = 1 ; l <= 9 ; l++)
{
New[j][l] += 2 * mat [j][l];
New[j - 1][l - 1] += mat [j][l];
New[j + 1][l - 1] += mat [j][l];
New[j - 1][l + 1] += mat [j][l];
New[j + 1][l + 1] += mat [j][l];
New[j][l - 1] += mat [j][l];
New[j - 1][l] += mat [j][l];
New[j + 1][l] += mat [j][l];
New[j][l + 1] += mat [j][l];
}
}
for (j = 1 ; j <= 9 ; j++)
{
for (l = 1 ; l <= 9 ; l++)
{
mat[j][l] = New[j][l];
}
}
}
for (j = 1 ; j <= 9 ; j++)
{
cout << mat[j][1];
for (l = 2 ; l <= 9 ; l++)
{
cout << ' ' << mat[j][l];
}
cout << endl;
}
return 0;
}
| 48 |
23,619 |
int main()
{
int a[11][11] = {0}, i, j, t[11][11] = {0}, m, n;
const int move[8][2]= {-1, 0, 1, 0, 0, 1, 0, -1, -1, -1, 1, -1, 1, 1, -1, 1};
cin >> m >> n;
a[5][5] = m;
while (n--)
{
memset(t, 0, sizeof(t));
for (i = 1; i < 10; i++)
{
for (j = 1; j < 10; j++)
{
for (int k = 0; k < 8; k++)
{
t[i + move[k][0]][j + move[k][1]] += a[i][j];
}
t[i][j] += a[i][j];
}
}
for (i = 1; i < 10; i++)
{
for (j = 1; j < 10; j++)
{
a[i][j] += t[i][j];
}
}
}
for (i = 1; i < 10; i++)
{
for (j = 1; j < 10; j++)
{
if (j > 1)
{
cout << " ";
}
cout << a[i][j];
}
cout << endl;
}
return 0;
} | 48 |
23,620 |
void prop(int num1[11][11],int num2[11][11],int n)
{
int i,j;
if(n)
{
for(i=1;i<10;i++)for(j=1;j<10;j++)
num2[i][j]= num1[i-1][j-1]+num1[i-1][j]+num1[i-1][j+1]
+num1[i][j-1]+num1[i][j]*2+num1[i][j+1]
+num1[i+1][j-1]+num1[i+1][j]+num1[i+1][j+1];
prop(num2,num1,n-1);
}
}
main()
{
int m,n,num1[11][11]={0},num2[11][11]={0};
int i,j;
scanf("%d %d",&m,&n);
num1[5][5]=m;
prop(num1,num2,n);
if(n%2==0)
for(i=1;i<10;i++)
{
for(j=1;j<9;j++) printf("%d ",num1[i][j]);
printf("%d\n",num1[i][9]);
}
else
for(i=1;i<10;i++)
{
for(j=1;j<9;j++) printf("%d ",num2[i][j]);
printf("%d\n",num2[i][9]);
}
}
| 48 |
23,621 | int a[11][11];
void day()
{
int i,j,b[11][11];
for(i=0;i<11;i++)for(j=0;j<11;j++)b[i][j]=a[i][j];
for(i=1;i<=9;i++)
for(j=1;j<=9;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]+=a[i][j];
}
for(i=0;i<11;i++)for(j=0;j<11;j++)a[i][j]=b[i][j];
}
int main()
{
int i,j,n,days;
for(i=0;i<11;i++)for(j=0;j<11;j++)a[i][j]=0;
cin>>n;cin>>days;
a[5][5]=n;
for(i=1;i<=days;i++)day();
for(i=1;i<10;i++)
{
cout<<a[i][1];for(j=2;j<10;j++)cout<<' '<<a[i][j];cout<<endl;
}
getchar();getchar();
return 0;
}
| 48 |
23,622 | int main ()
{
int day[5][9][9]={0};
int n;
cin>>day[0][4][4]>>n;
int a[3]={-1,0,1};
int b[3]={-1,0,1};
for (int d=1;d<=4;d++)
{
for (int i=0;i<9;i++)
for (int j=0;j<9;j++)
{
if (day[d-1][i][j]!=0)
{
for (int p=0;p<3;p++)
for (int q=0;q<3;q++)
day[d][i+a[p]][j+b[q]]+=day[d-1][i][j];
day[d][i][j]+=day[d-1][i][j];
}
}
}
for (int i=0;i<9;i++)
{
for (int j=0;j<9;j++)
{
if (j!=0) cout<<" ";
cout<<day[n][i][j];
}
cout<<endl;
}
return 0;
} | 48 |
23,623 | /*
* 1.cpp
*
* Created on: 2012-12-25
* Author: Administrator
*/
int main()
{
int a[10][10] = {0}, b[10][10] = {0};
int i, j, m, n, p = 0, k;
cin >> m >> n;
a[5][5] = m;
for(k = 0; k < n; k++)
{
for(i = 1; i <= 9; i++)
for(j = 1; j <= 9; j++)
{
if(a[i][j] != 0)
{
p = a[i][j];
b[i][j] = b[i][j] + 2 * p;
b[i - 1][j] = b[i - 1][j] + p;
b[i + 1][j] = b[i + 1][j] + p;
b[i - 1][j + 1] = b[i - 1][j + 1] + p;
b[i - 1][j - 1] = b[i - 1][j - 1] + p;
b[i][j + 1] = b[i][j + 1] + p;
b[i][j - 1] = b[i][j - 1] + p;
b[i + 1][j + 1] = b[i + 1][j + 1] + p;
b[i + 1][j - 1] = b[i + 1][j - 1] + p;
}
}
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++)
{
cout << a[i][j];
if(j != 9)
cout << ' ';
}
cout << endl;
}
return 0;
}
| 48 |
23,624 | /*
* ????main.cpp
* ??????
* ?????2013-01-11
* ???????9???????????????m?????????????????????10???????10??????????????????????????????????????????n(1?n?4)????????????????
*/
int main ()
{
int day,
d,i,j,k,di,dj,
a[9][9] = {0},aa[9][9],
direction[8][2] = {{1,0},{-1,0},{0,1},{0,-1},{-1,-1},{-1,1},{1,1},{1,-1}};
cin >> a[4][4] >> day;
for ( d = 0; d < day; d++ )
{
memset(aa,0,sizeof(aa));
for ( i = 0; i < 9; i++ )
for ( j = 0; j < 9; j++ )
{
if ( aa[i][j] == a[i][j] )
continue;
for ( k = 0; k < 8; k++ )
{
di = direction[k][0];
dj = direction[k][1];
if ( i + di < 9 && i + di >= 0 && j + dj < 9 && j + dj >= 0 )
{
a[i+di][j+dj] += (a[i][j] - aa[i][j]);
aa[i+di][j+dj] += (a[i][j] - aa[i][j]);
}
}
a[i][j] += (a[i][j] - aa[i][j]);
}
}
for ( i = 0; i < 9; i++ )
{
cout << a[i][0];
for ( j = 1; j < 9; j++ )
cout << ' ' << a[i][j];
cout << endl;
}
return 0;
} | 48 |
23,625 | int main()
{
int m,n,i,j,k;
int juzhen1[11][11];
int juzhen2[11][11];
scanf("%d %d",&m,&n);
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
juzhen1[i][j]=0;
juzhen2[i][j]=0;
}
}
juzhen1[5][5]=m;
for(k=1;k<n+1;k++)
{
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if(k%2!=0)
{
if(juzhen1[i][j]>0)
{
juzhen2[i][j]=juzhen2[i][j]+2*(juzhen1[i][j]);
juzhen2[i-1][j-1]=juzhen2[i-1][j-1]+juzhen1[i][j];
juzhen2[i-1][j]=juzhen2[i-1][j]+juzhen1[i][j];
juzhen2[i-1][j+1]=juzhen2[i-1][j+1]+juzhen1[i][j];
juzhen2[i][j-1]=juzhen2[i][j-1]+juzhen1[i][j];
juzhen2[i][j+1]=juzhen2[i][j+1]+juzhen1[i][j];
juzhen2[i+1][j-1]=juzhen2[i+1][j-1]+juzhen1[i][j];
juzhen2[i+1][j]=juzhen2[i+1][j]+juzhen1[i][j];
juzhen2[i+1][j+1]=juzhen2[i+1][j+1]+juzhen1[i][j];
//juzhen1[i][j]=0;
}
}
if(k%2==0)
{
if(juzhen2[i][j]>0)
{
juzhen1[i][j]=juzhen1[i][j]+2*(juzhen2[i][j]);
juzhen1[i-1][j-1]=juzhen1[i-1][j-1]+juzhen2[i][j];
juzhen1[i-1][j]=juzhen1[i-1][j]+juzhen2[i][j];
juzhen1[i-1][j+1]=juzhen1[i-1][j+1]+juzhen2[i][j];
juzhen1[i][j-1]=juzhen1[i][j-1]+juzhen2[i][j];
juzhen1[i][j+1]=juzhen1[i][j+1]+juzhen2[i][j];
juzhen1[i+1][j-1]=juzhen1[i+1][j-1]+juzhen2[i][j];
juzhen1[i+1][j]=juzhen1[i+1][j]+juzhen2[i][j];
juzhen1[i+1][j+1]=juzhen1[i+1][j+1]+juzhen2[i][j];
//juzhen2[i][j]=0;
}
}
}
}
if(k%2!=0)
{
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
juzhen1[i][j]=0;
}
}
}
if(k%2==0)
{
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
juzhen2[i][j]=0;
}
}
}
}
if(k%2==0)
{
for(i=1;i<10;i++)
{
printf("%d %d %d %d %d %d %d %d %d\n",juzhen2[i][1],juzhen2[i][2],juzhen2[i][3],juzhen2[i][4],juzhen2[i][5],juzhen2[i][6],juzhen2[i][7],juzhen2[i][8],juzhen2[i][9]);
}
}
if(k%2!=0)
{
for(i=1;i<10;i++)
{
printf("%d %d %d %d %d %d %d %d %d\n",juzhen1[i][1],juzhen1[i][2],juzhen1[i][3],juzhen1[i][4],juzhen1[i][5],juzhen1[i][6],juzhen1[i][7],juzhen1[i][8],juzhen1[i][9]);
}
}
return 0;
} | 48 |
23,626 | int a[9][9] , board[9][9] ;
void add( int i , int j )
{
if ( a[i][j] > 0 )
{
int m ;
m = a[i][j] ;
a[i][j] = 0 ;
board[i][j] = board[i][j] + m*2 ;
board[i+1][j] = board[i+1][j] + m ;
board[i-1][j] = board[i-1][j] + m ;
board[i][j+1] = board[i][j+1] + m ;
board[i][j-1] = board[i][j-1] + m ;
board[i+1][j+1] = board[i+1][j+1] + m ;
board[i+1][j-1] = board[i+1][j-1] + m ;
board[i-1][j+1] = board[i-1][j+1] + m ;
board[i-1][j-1] = board[i-1][j-1] + m ;
add( i+1 , j ) ;
add( i-1 , j ) ;
add( i , j+1 ) ;
add( i , j-1 ) ;
add( i+1 , j+1 ) ;
add( i-1 , j-1 ) ;
add( i+1 , j-1 ) ;
add( i-1 , j+1 ) ;
}
}
int main()
{
int i , j , m , d , sum = 0 , k ;
cin >> m >> d ;
for ( i = 0 ; i < 9 ; i++ )
for ( j = 0 ; j < 9 ; j++ )
a[i][j] = 0 ;
a[4][4] = m ;
for ( k = 0 ; k < d ; k++ )
{
for ( i = 0 ; i < 9 ; i++ )
for ( j = 0 ; j < 9 ; j++ )
board[i][j] = 0 ;
add ( 4 , 4 ) ;
for ( i = 0 ; i < 9 ; i++ )
for ( j = 0 ; j < 9 ; j++ )
a[i][j] = board[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,627 | int main()
{
int dish[9][9]={0},temp[9][9]={0},i=0,j=0,n=0,m=0;
cin>>m>>n;
dish[4][4]=m;
int *p=dish[0],*q=temp[0];
for(i=0;i<n;i++)
{
for(j=0;j<81;j++,p++,q++)
{
if(*p!=0)
{
*q+=2**p;
*(q-1)+=*p;*(q+1)+=*p;
*(q-9)+=*p;*(q+9)+=*p;
*(q-10)+=*p;*(q+10)+=*p;
*(q-8)+=*p;*(q+8)+=*p;
}
}
p=dish[0];q=temp[0];
for(j=0;j<81;j++,p++,q++)
{
*p=*q;
*q=0;
}
p=dish[0];q=temp[0];
}
for(i=0;i<81;i++)
{
if((i+1)%9==0)cout<<*(p+i)<<endl;
else cout<<*(p+i)<<" ";
}
return 0;
} | 48 |
23,628 | main()
{
int i,j,m,n,d;
scanf("%d %d",&m,&n);
int a[11][11][6];
for(d=0;d<=n;d++)
{
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
a[i][j][d]=0;
}
}
}
a[5][5][0]=m;
for(d=1;d<=n;d++)
{
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
a[i][j][d]=2*a[i][j][d-1]+
a[i-1][j-1][d-1]+a[i-1][j][d-1]+
a[i-1][j+1][d-1]+a[i][j-1][d-1]+
a[i][j+1][d-1]+a[i+1][j-1][d-1]+
a[i+1][j][d-1]+a[i+1][j+1][d-1];
}
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<9;j++)
printf("%d ",a[i][j][n]);
printf("%d\n",a[i][9][n]);
}
getchar();
getchar();
} | 48 |
23,629 | //????
int bac[5][11][11] = {0}; //bac???????n??i,j???????
void boom (int m,int n)
{
int i,j,d1,d2;
if (n == 0) //?n=0??????
bac[n][5][5] = m;
else //?n>1?????????
boom (m , n - 1);
if (n > 0)
for (i = 1; i <= 9; i++)
for (j = 1; j <= 9; j++)
{
bac[n][i][j] = bac[n - 1][i][j];
for (d1 = -1; d1 <= 1; d1++)
for (d2 = -1; d2 <= 1; d2++)
bac[n][i][j] += bac[n - 1][i + d1][j + d2]; //?n>1??????????
}
}
int main()
{
int m,n,i,j;
cin >> m >> n;
boom (m,n); //?????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 |
23,630 | 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 |
23,631 |
int board[11][11] = {0}, temp[11][11] = {0};
void increase(int day)
{
if (day == 0)
{
return;
}
int i, j;
for (i = 1; i < 10; i++)
{
for (j = 1; j < 10; j++)
{
temp[i + 1][j + 1] += board[i][j];
temp[i + 1][j - 1] += board[i][j];
temp[i - 1][j - 1] += board[i][j];
temp[i - 1][j + 1] += board[i][j];
temp[i - 1][j] += board[i][j];
temp[i + 1][j] += board[i][j];
temp[i][j - 1] += board[i][j];
temp[i][j + 1] += board[i][j];
temp[i][j] += board[i][j];
}
}
memcpy(board, temp, sizeof(int)*121);
return increase(day - 1);
}
int main()
{
int num, day,i,j;
cin >> num >> day;
board[5][5] = num;
temp[5][5] = num;
increase(day);
for (i = 1; i < 10; i++)
{
for (j = 1; j < 9; j++)
{
cout << temp[i][j] << " ";
}
cout << temp[i][j] << endl;
}
return 0;
} | 48 |
23,632 | //*************************************************
//*3ìDò?oàyìa(11.8) ϸ¾ú?Ä·±Ö3óëà©é? *
//*DÕÃû?ooÎÔÆÆe *
//*ѧoÅ?o1300012888 *
//*èÕÆú?o2013.12.9 *
//*************************************************
void change(int a,int area[][11],int area0[][11])
{
int i, j;
if(a == 0)
return;
else
{
for(i = 1;i <= 9;i ++)
{
for(j = 1;j <= 9;j ++)
area0[i][j] = area[i][j];
}
for(i = 1;i <= 9;i ++)
{
for(j = 1;j <= 9;j ++)
{
area0[i][j] += area[i][j];
area0[i - 1][j] += area[i][j];
area0[i + 1][j] += area[i][j];
area0[i][j - 1] += area[i][j];
area0[i][j + 1] += area[i][j];
area0[i + 1][j + 1] += area[i][j];
area0[i - 1][j - 1] += area[i][j];
area0[i + 1][j - 1] += area[i][j];
area0[i - 1][j + 1] += area[i][j];
}
}
for(i = 1;i <= 9;i ++)
{
for(j = 1;j <= 9;j ++)
area[i][j] = area0[i][j];
}
change(a - 1,area,area0);
}
}
int main()
{
int area[11][11], area0[11][11], i, j;
int num, day;
cin >> num >> day;
memset(area, 0, sizeof(area));
memset(area0, 0, sizeof(area0));
area[5][5] = num;
change(day, area, area0);
for(i = 1;i <= 9;i ++)
{
for(j = 1;j <= 9;j ++)
{
if(j == 1)
cout << area[i][j];
else
cout << " " << area[i][j];
}
cout << endl;
}
return 0;
} | 48 |
23,633 | void fanzhi(int a[11][11],int n)
{
int i,j;
int b[11][11]={0};
if(n==0)
return;
else
{
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-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];
}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{
a[i][j]=b[i][j];
b[i][j]=0;
}
fanzhi(a,n-1);
}
}
int main()
{
int m,n;
int a[11][11]={0};
cin>>m>>n;
a[5][5]=m;
fanzhi(a,n);
int 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 |
23,634 | int main()
{
int a[M][M]={0};
int m ,n;
scanf("%d%d",&m,&n);
a[M/2][M/2]=m;
for(int k=0;k<n;k++){
int b[M][M]={0};
for(int i=1;i<M-1;i++){
for(int j=1;j<M-1;j++){
b[i][j]+=a[i][j];
for(int I=-1;I<=1;I++){
for(int J=-1;J<=1;J++){
b[i+I][j+J]+=a[i][j];
}
}
}
}
for(int q=0;q<M;q++){
for(int p=0;p<M;p++)
a[q][p]=b[q][p];
}
}
for(int i=0;i<M;i++){
for(int j=0;j<M-1;j++)
printf("%d ",a[i][j]);
printf("%d\n",a[i][M-1]);
}
} | 48 |
23,635 | int main()
{
int m,n;
int a[9][9]={0},t[9][9];
int i,j,k;
scanf("%d %d",&m,&n);
a[4][4]=1;
for(i=1;i<=n;i++)
{
for(j=0;j<=8;j++)
for(k=0;k<=8;k++)
t[j][k]=a[j][k];
for(j=5-i;j<=3+i;j++)
for(k=5-i;k<=3+i;k++)
a[j][k]=a[j][k]+t[j][k];
for(j=5-i;j<=3+i;j++)
for(k=5-i;k<=3+i;k++)
{
a[j-1][k-1]+=t[j][k];
a[j-1][k]+=t[j][k];
a[j-1][k+1]+=t[j][k];
a[j][k-1]+=t[j][k];
a[j][k+1]+=t[j][k];
a[j+1][k-1]+=t[j][k];
a[j+1][k]+=t[j][k];
a[j+1][k+1]+=t[j][k];
}
}
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
if(j==0)
printf("%d",m*a[i][j]);
else
printf(" %d",m*a[i][j]);
}
printf("\n");
}
return 0;
} | 48 |
23,636 | int a[9][9]={0};
int b[9][9]={0};
void ganster()
{
int i,j,c;
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<9;j++)
{
if(a[i][j]!=0)
{c=a[i][j];
b[i][j]+=c;b[i][j-1]+=c;b[i][j+1]+=c;
b[i+1][j]+=c;b[i+1][j-1]+=c;b[i+1][j+1]+=c;
b[i-1][j]+=c;b[i-1][j-1]+=c;b[i-1][j+1]+=c;}
}
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
a[i][j]+=b[i][j];
}
int main(void)
{
int m,n,i,j;
scanf("%d%d",&m,&n);
a[4][4]=m;
for(i=0;i<n;i++)
{
ganster();
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
printf("%d ",a[i][j]);
}
printf("%d\n",a[i][j]);
}
}
| 48 |
23,637 | int a[10][10],b[10][10];
int dx[]={1,1,1,0,0,0,-1,-1,-1};
int dy[]={-1,0,1,-1,0,1,-1,0,1};
void change()
{
for(int i=1;i<=9;++i)
for(int j=1;j<=9;++j)
b[i][j]=a[i][j];
for(int i=1;i<=9;++i)
for(int j=1;j<=9;++j)
{
if(b[i][j]!=0)
{
for(int k=0;k<9;++k)
{
a[i+dx[k]][j+dy[k]]+=b[i][j];
}
}
}
}
int main()
{
int m,n;
cin>>m>>n;
a[5][5]=m;
for(int i=0;i<n;++i)
{change();}
for(int i=1;i<=9;++i)
{
for(int j=1;j<=9;++j)
{
if(j!=9)cout<<a[i][j]<<" ";
else cout<<a[i][j]<<endl;
}
}
} | 48 |
23,638 | 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 |
23,639 | void germs(int n,int a[11][11],int b[11][11]);
int main()
{
int i,j,m,n,a[11][11]={0},b[11][11]={0};
cin>>m>>n;
a[5][5]=m;
germs(n,a,b);
for(i=1;i<=9;i++)
{for(j=1;j<9;j++)
cout<<a[i][j]<<" ";
cout<<a[i][j]<<endl;
}
}
void germs(int n,int a[11][11],int b[11][11])
{
int i,j;
if(n>0)
{for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
b[i][j]=0;
for(i=1;i<=9;i++)
{for(j=1;j<=9;j++)
{ if(a[i][j]==0) continue;
else
{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];
germs(n-1,a,b);
}
} | 48 |
23,640 | int main()
{
int a[11][11]={0},b[11][11] ={0};
int m,n,i,j,k;
int(*p1)[11],(*p2)[11],(*pTemp)[11];
p1=a;
p2=b;
for (i=0;i<=10;i++)
{ for (j=0;j<=10;j++)
{
a[i][j]=0;
b[i][j]=0;
}
}
scanf("%d%d",&m,&n);
a[5][5]=m;
for (k=1;k<=n;k++)
{
for ( i=1;i<=9;i++)
{
for ( j=1;j<=9;j++)
{
int sum= + *(*(p1+i)+ j-1)+*(*(p1+i)+ j+1) +*(*(p1+i-1)+ j) +*(*(p1+i-1)+ j-1)+*(*(p1+i-1)+ j+1) +*(*(p1+i+1)+ j) +*(*(p1+i+1)+ j-1)+*(*(p1+i+1)+ j+1) ;
* (*(p2+i)+j ) = sum +( * ( * (p1+i) +j ) ) *2 ;
}
}
pTemp=p1;
p1=p2;
p2=pTemp;
}
for ( i=1;i<=9;i++)
{
for ( j=1;j<=9;j++)
{
if (j!=9)
printf("%d ",p1[i][j]);
else
printf( "%d\n",p1[i][j]);
}
}
}
| 48 |
23,641 | main()
{
int m,n;
int b[5][11][11]={0};
int i,j,k;
scanf("%d %d",&m,&n);
b[0][5][5]=m;
for(i=1;i<n+1;i++)
{
for(j=5-i;j<=5+i;j++)
{
for(k=5-i;k<=5+i;k++)
{
b[i][j][k]=2*b[i-1][j][k]+b[i-1][j][k-1]+b[i-1][j][k+1]+b[i-1][j-1][k-1]+b[i-1][j-1][k+1]+b[i-1][j-1][k]+b[i-1][j+1][k]+b[i-1][j+1][k-1]+b[i-1][j+1][k+1];
}
}
}
for(i=1;i<10;i++)
{
printf("%d",b[n][i][1]);
for(j=2;j<10;j++)
printf(" %d",b[n][i][j]);
printf("\n");
}
}
| 48 |
23,642 | int main(int argc, char* argv[])
{
int a[11][11],m,n,i,j,t,b[11][11];
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
a[i][j]=0;
b[i][j]=0;
}
}
scanf("%d %d",&m,&n);
a[5][5]=m;
for(t=0;t<n;t++)
{
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
b[i][j]=a[i][j]+(a[i][j-1]+a[i][j+1]+a[i-1][j-1]+a[i-1][j]+a[i+1][j+1]+a[i+1][j]+a[i+1][j-1]+a[i-1][j+1]);
}
}
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<9;j++)
{
printf("%d ",a[i][j]);
}
printf("%d\n",a[i][j]);
}
return 0;
} | 48 |
23,643 | int bac[11][11],tp[11][11],n,m;
void mul(int x)
{
if (x==n) return;
else{
for(int i=0;i<11;i++){
for(int j=0;j<11;j++){
tp[i][j]=0;}}
for(int i=1;i<=9;i++){
for(int j=1;j<=9;j++){
tp[i-1][j]+=bac[i][j];
tp[i+1][j]+=bac[i][j];
tp[i-1][j-1]+=bac[i][j];
tp[i+1][j-1]+=bac[i][j];
tp[i-1][j+1]+=bac[i][j];
tp[i+1][j+1]+=bac[i][j];
tp[i][j-1]+=bac[i][j];
tp[i][j+1]+=bac[i][j];
tp[i][j]+=2*bac[i][j];}}
for(int i=1;i<=9;i++){
for(int j=1;j<=9;j++){
bac[i][j]=tp[i][j];}}
mul(x+1);}
}
int main()
{
for(int i=0;i<11;i++){
for(int j=0;j<11;j++){
bac[i][j]=0;}}
cin>>m>>n;
bac[5][5]=m;
mul(0);
for(int i=1;i<=9;i++){
cout<<bac[i][1];
for(int j=2;j<=9;j++){
cout<<" "<<bac[i][j];}
cout<<endl;}
return 0;
}
| 48 |
23,644 | 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 |
23,645 | void change(int, int[][10]);
void print(int[][10]);
int m, n;
int main()
{
int i, j, fb[10][10];
cin >> m >> n;
for(i = 1; i <= 9; i++)
for(j = 1; j <= 9; j++)
fb[i][j] = 0;
fb[5][5] = m;
change(1, fb);
return 0;
}
void change(int day, int temp[][10])
{
int i, j, t[10][10];
if(day == n + 1)
{
print(temp);
return;
}
for(i = 1; i <= 9; i++)
for(j = 1; j <= 9; j++)
t[i][j] = 0;
for(i = 1; i <= 9; i++)
for(j = 1; j <= 9; j++)
if(temp[i][j] != 0)
{
t[i][j] = t[i][j] + temp[i][j];
t[i + 1][j] = t[i + 1][j] + temp[i][j];
t[i + 1][j + 1] = t[i + 1][j + 1] + temp[i][j];
t[i + 1][j - 1] = t[i + 1][j - 1] + temp[i][j];
t[i][j + 1] = t[i][j + 1] + temp[i][j];
t[i][j - 1] = t[i][j - 1] + temp[i][j];
t[i - 1][j] = t[i - 1][j] + temp[i][j];
t[i - 1][j + 1] = t[i - 1][j + 1] + temp[i][j];
t[i - 1][j - 1] = t[i - 1][j - 1] + temp[i][j];
}
for(i = 1; i <= 9; i++)
for(j = 1; j <= 9; j++)
temp[i][j] = temp[i][j] + t[i][j];
change(day + 1, temp);
}
void print(int array[][10])
{
int i = 1, j;
while(1)
{
for(j = 1; j <= 8; j++)
cout << array[i][j] << " ";
cout << array[i][9] << endl;
if(i == 9)
break;
i++;
}
} | 48 |
23,646 | main()
{
int m,n,i,j,k;
struct xijun
{
int a[9][9];
}s[5];
scanf("%d %d",&m,&n);
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(i==4&&j==4)
s[0].a[i][j]=m;
else
s[0].a[i][j]=0;
}
}
for(k=1;k<=n;k++)
{
for(i=1;i<8;i++)
{
for(j=1;j<8;j++)
{
s[k].a[i][j]=2*(s[k-1].a[i][j])+s[k-1].a[i-1][j-1]+s[k-1].a[i-1][j]+s[k-1].a[i-1][j+1]+s[k-1].a[i][j-1]+s[k-1].a[i][j+1]+s[k-1].a[i+1][j-1]+s[k-1].a[i+1][j]+s[k-1].a[i+1][j+1];
}
}
s[k].a[0][0]=s[k-1].a[0][1]+s[k-1].a[1][0]+s[k-1].a[1][1];
s[k].a[0][8]=s[k-1].a[0][7]+s[k-1].a[1][7]+s[k-1].a[1][8];
s[k].a[8][0]=s[k-1].a[8][1]+s[k-1].a[7][0]+s[k-1].a[7][1];
s[k].a[8][8]=s[k-1].a[8][7]+s[k-1].a[7][7]+s[k-1].a[7][8];
for(i=1;i<8;i++)
{
s[k].a[0][i]=s[k-1].a[0][i-1]+s[k-1].a[0][i+1]+s[k-1].a[1][i-1]+s[k-1].a[1][i]+s[k-1].a[1][i+1];
}
for(i=1;i<8;i++)
{
s[k].a[i][0]=s[k-1].a[i-1][0]+s[k-1].a[i+1][0]+s[k-1].a[i-1][1]+s[k-1].a[i][1]+s[k-1].a[i+1][1];
}
for(i=1;i<8;i++)
{
s[k].a[8][i]=s[k-1].a[8][i-1]+s[k-1].a[8][i+1]+s[k-1].a[7][i-1]+s[k-1].a[7][i]+s[k-1].a[7][i+1];
}
for(i=1;i<8;i++)
{
s[k].a[i][8]=s[k-1].a[i-1][8]+s[k-1].a[i+1][8]+s[k-1].a[i-1][7]+s[k-1].a[i][7]+s[k-1].a[i+1][7];
}
}
for(i=0;i<8;i++)
{
for(j=0;j<8;j++)
{
printf("%d ",s[n].a[i][j]);
}
printf("%d\n",s[n].a[i][8]);
}
for(i=0;i<8;i++)
{
printf("%d ",s[n].a[8][i]);
}
printf("%d",s[n].a[8][8]);
}
| 48 |
23,647 | int main()
{
long int a[11][11] = {0}, b[11][11] = {0};
int m, n, i, j, k, p, q;
cin >> m >> n;
a[5][5] = m;
for (k = 1; k <= n; k++)
{
for (i = 0; i <= 10; i++)
for (j = 0; j <= 10; j++)
b[i][j] = a[i][j];
for (i = 5 - k; i <= 5 + k; i++)
for (j = 5 - k; j <= 5 + k; j++)
for(p = i - 1; p <= i + 1; p++)
for(q = j - 1; q <= j + 1; q++)
a[i][j] = a[i][j] + b[p][q];
}
for (i = 1; i <= 9; i++)
for(j = 1; j <= 9; j++)
{
if (j == 9)
cout << a[i][j] << endl;
else
cout << a[i][j] << " ";
}
return 0;
}
| 48 |
23,648 | int main()
{
int m,n;
scanf("%d %d",&m,&n);
int germ[11][11]={0};
int a[11][11]={0};
int i,j,k,x;
germ[5][5]=m;
a[5][5]=m;
for(k=0;k<n;k++)
{
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if(a[i][j]!=0)
{
germ[i-1][j-1]+=a[i][j];
germ[i-1][j]+=a[i][j];
germ[i-1][j+1]+=a[i][j];
germ[i][j-1]+=a[i][j];
germ[i][j+1]+=a[i][j];
germ[i+1][j-1]+=a[i][j];
germ[i+1][j]+=a[i][j];
germ[i+1][j+1]+=a[i][j];
germ[i][j]+=a[i][j];
}
}
}
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
a[i][j]=germ[i][j];
}
}
}
for(i=1;i<10;i++)
{
for(j=1;j<9;j++)
{
printf("%d ",germ[i][j]);
}
printf("%d\n",germ[i][9]);
}
}
| 48 |
23,649 | //**************************
//*???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 |
23,650 | int a[9][9]={0},b[9][9]={0};
void copy()
{
for(int i=0;i<9;i++)
for(int j=0;j<9;j++)
a[i][j]=b[i][j];
}
void guil()
{
for(int i=0;i<9;i++)
for(int j=0;j<9;j++)
b[i][j]=0;
}
int main()
{
int m,n;
cin>>m>>n;
a[4][4]=m;
for(int k=1;k<=n;k++)
{
guil();
for(int i=0;i<9;i++)
{
for(int j=0;j<9;j++)
{
if(a[i][j]!=0)
{
b[i][j]+=2*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+1][j-1]+=a[i][j];
b[i+1][j]+=a[i][j];
b[i+1][j+1]+=a[i][j];
}
}
}
copy();
}
for(int i=0;i<9;i++)
{
for(int j=0;j<8;j++)
cout<<b[i][j]<<" ";
cout<<a[i][8]<<endl;
}
return 0;
} | 48 |
23,651 | //********************
//**????????**
//**?? 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 |
23,652 |
int s[6][11][11];
int m, n;
int main()
{
cin >> m >> n;
s[0][5][5] = m;
for (int day = 0; day < n; ++day)
for (int x = 1; x < 10; ++x)
for (int y = 1; y < 10; ++y)
{
s[day + 1][x][y] += 2 * s[day][x][y];
s[day + 1][x - 1][y] += s[day][x][y];
s[day + 1][x + 1][y] += s[day][x][y];
s[day + 1][x][y - 1] += s[day][x][y];
s[day + 1][x][y + 1] += s[day][x][y];
s[day + 1][x - 1][y - 1] += s[day][x][y];
s[day + 1][x + 1][y + 1] += s[day][x][y];
s[day + 1][x + 1][y - 1] += s[day][x][y];
s[day + 1][x - 1][y + 1] += s[day][x][y];
}
for (int x = 1; x < 10; ++x)
{
for (int y = 1; y < 9; ++y)
cout << s[n][x][y] << ' ';
cout << s[n][x][9] << endl;
}
} | 48 |
23,653 |
int main()
{
int num[11][11][11]={0};
int days,pi,pj,n,m,i,j,k,a,b;
scanf("%d%d",&m,&days);
num[5][5][1]=m;
for(n=2;n<=days+1;n++)
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
if(num[i][j][n-1]>0)
{b=num[i][j][n-1];
num[i][j][n]=num[i][j][n]+b;
for(pi=1;pi<=3;pi++)
for(pj=1;pj<=3;pj++)
num[i-2+pi][j-2+pj][n]=num[i-2+pi][j-2+pj][n]+b;
}
for(i=1;i<=9;i++)
{
for(j=1;j<=8;j++)
printf("%d ",num[i][j][days+1]);
printf("%d\n",num[i][9][days+1]);}
}
| 48 |
23,654 | //????
int chess[15][15]={0};
int d;
int f(int i,int j,int k)
{
if(i<1||i>9||j<1||j>9) return 0;
if(k==0) return chess[i][j];
return 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);
}
int main()
{
cin>>chess[5][5]>>d;
int 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,655 | 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 |
23,656 | //
// main.c
// aa
//
// Created by Duan on 12-11-27.
// Copyright (c) 2012? __MyCompanyName__. All rights reserved.
//
void nextday(int a[11][11],int b[11][11])
{
int i,j;
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
b[i][j]=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+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];
}
}
void printarray(int a[11][11])
{
int i,j;
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
{
printf("%d",a[i][j]);
if (j!=9) printf(" ");
else printf("\n");
}
}
int main()
{
int m,n,i;
scanf("%d %d",&m,&n);
int a[11][11]={0},b[11][11]={0};
a[5][5]=m;
for (i=0;i<=n;i++)
{
if (i%2==0) nextday(a, b);
else nextday(b, a);
}
if(i%2==0) printarray(b);
else printarray(a);
} | 48 |
23,657 | //
// main.cpp
// ????????
//
// Created by ?? on 12-12-15.
// Copyright (c) 2012? ??. All rights reserved.
//
int board[9][9] = {0};
void production(int days)
{
int separation[9][9], i, j;
if (days == 0)
return;
else
{
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++)
{
board[i][j] *= 10;
separation[i][j] = (board[i][j] - 2 * board[i][j] / 10) / 8;
board[i][j] = 2 * board[i][j] / 10;
}
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++)
{
board[i + 1][j] += separation[i][j];
board[i - 1][j] += separation[i][j];
board[i][j + 1] += separation[i][j];
board[i][j - 1] += separation[i][j];
board[i + 1][j + 1] += separation[i][j];
board[i - 1][j + 1] += separation[i][j];
board[i + 1][j - 1] += separation[i][j];
board[i - 1][j - 1] += separation[i][j];
}
production(days - 1);
}
}
int main()
{
int num, days, i, j;
cin >> num >> days;
board[4][4] = num;
production(days);
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++)
{ if (j == 8)
cout << board[i][j] <<endl;
else
cout << board[i][j] << " ";
}
return 0;
} | 48 |
23,658 | void Change(int b[11][11],int day)
{
int i,j,k,l;
int c[11][11]={0};
for(i=1;i<10;i++)
for(j=1;j<10;j++)
{
for(k=i-1;k<=i+1;k++)
for(l=j-1;l<=j+1;l++)
{c[i][j]=c[i][j]+b[k][l];}
c[i][j]=c[i][j]+b[i][j];
}
if(day==1)
for(int p=1;p<10;p++)
{
cout<<c[p][1];
for(int q=2;q<10;q++)
{cout<<" "<<c[p][q];}
cout<<endl;
}
else
Change(c,day-1);
}
int main()
{
int m,n;
cin>>m>>n;
int a[11][11]={0};
a[5][5]=m;
Change(a,n);
cin.get();
return 0;
} | 48 |
23,659 | void fanzhi();
int a[9][9]={0};
int zhen[9][9]={0};
int main()
{
int i,j,n,m;
cin>>m;
cin>>n;
a[4][4]=m;
for(i=1;i<=n;i++)
{
fanzhi();
}
for(i=0;i<=8;i++)
{
for(j=0;j<=7;j++)
cout<<a[i][j]<<" ";
cout<<a[i][8];
cout<<endl;
}
return 0;
}
void fanzhi()
{int i,j;
memset(zhen,0,sizeof(zhen));
for(i=0;i<=8;i++)
for(j=0;j<=8;j++)
{
zhen[i+1][j]+=a[i][j];
zhen[i][j]+=a[i][j]*2;
zhen[i-1][j]+=a[i][j];
zhen[i][j-1]+=a[i][j];
zhen[i][j+1]+=a[i][j];
zhen[i+1][j+1]+=a[i][j];
zhen[i-1][j+1]+=a[i][j];
zhen[i+1][j-1]+=a[i][j];
zhen[i-1][j-1]+=a[i][j];
}
for(i=0;i<=8;i++)
for(j=0;j<=8;j++)
{
a[i][j]=zhen[i][j];
}
} | 48 |
23,660 | int main()
{
int m,n,i,j;
scanf("%d %d",&m,&n);
int a[11][11]={0};
int b[11][11]={0};
a[5][5]=m;
b[5][5]=m;
while(n>0)
{
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++){
if(a[i][j]!=0)
{
b[i][j]=b[i][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][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(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
a[i][j]=b[i][j];
}
}
n--;
}
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
if(j!=9)
{ printf("%d ",a[i][j]);}
else
{printf("%d\n",a[i][j]); }
}
}
return 0;
}
| 48 |
23,661 | void main()
{
int m,n,a[11][11]={0},b[10][10]={0},i,j,k;
scanf("%d%d",&m,&n);
a[5][5]=m;
for(k=1;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-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(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 ",a[i][j]);
}
else if(i!=9) printf("%d\n",a[i][j]);
else printf("%d",a[i][j]);
}
}
| 48 |
23,662 | //*********************
// ????????
// ??? 1300062709
// 2013.12.09
//*********************
int shu[9][9] = {0};
int aa[9][9] = {0};
int x,y;
int n, m, i, j;
void grems(int x, int y)
{
if ( x+1<9&&y+1<9&&x-1>=0&&y-1>=0)
{
shu[x+1][y+1] += aa[x][y];
shu[x+1][y] += aa[x][y];
shu[x+1][y-1] += aa[x][y];
shu[x][y+1] += aa[x][y];
shu[x][y-1] += aa[x][y];
shu[x-1][y] += aa[x][y];
shu[x-1][y+1] += aa[x][y];
shu[x-1][y-1] += aa[x][y];
}
shu[x][y] += 2 * aa[x][y];
}
int main()
{
cin >> m >> n;
aa[4][4]=m;
while(n!=0)
{
for ( i = 0 ; i < 9 ; i++ )
{
for ( j = 0 ; j < 9; j++ )
{
if(aa[i][j]>0)
grems(i,j);
}
}
for ( i = 0 ; i < 9 ; i++ )
{
for ( j = 0 ; j < 9; j++ )
{
aa[i][j] = shu[i][j];
}
}
if ( n > 0)
{
for ( i = 0 ; i < 9 ; i++ )
{
for ( j = 0 ; j < 9; j++ )
{
shu[i][j]=0;
}
}
}
n--;
}
for ( i = 0 ; i < 9 ; i++ )
{
for ( j = 0 ; j < 8 ; j++ )
cout << aa[i][j] << ' ' ;
cout << aa[i][8] << endl;
}
return 0;
} | 48 |
23,663 | int b[9][9]; //????
int a[9][9]; //???
void f() //??
{
int i,j;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
if(a[i][j]!=0)
{
b[i][j]+=2*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-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];//??????
a[i][j]=0; //??????
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
a[i][j]+=b[i][j];
}
int main()
{
int m,n;
int i,j;
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
cin>>m>>n;
a[4][4]=m;
for(i=0;i<n;i++) //n???????
{
f();
memset(b,0,sizeof(b));
}
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,664 | int m;
int num(int, int, int);
int main(void)
{
int n, i, j;
cin >> m >> n;
for( i = 1 ; i < 10 ; i++ )
{
for( j = 1 ; j < 9 ; j++ )
cout << num(n, i, j) << " ";
cout << num(n, i, 9) << endl;
}
return 0;
}
int num(int a, int x, int y)
{
if( a == 0 )
{
if( x == 5 && y == 5 )
return m;
else
return 0;
}
else
return num(a - 1, x, y) * 2 + num(a - 1, x - 1, y - 1) + num(a - 1, x - 1, y) + num(a - 1, x - 1, y + 1) + num(a - 1, x, y - 1) + num(a - 1, x, y + 1) + num(a - 1, x + 1, y - 1) + num(a - 1, x + 1, y) + num(a - 1, x + 1, y + 1);
} | 48 |
23,665 | 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 |
23,666 |
int f(int x, int y, int n) //??????????
{
if(n==0)
{
if(x==5&&y==5) //?????
return 1;
else
return 0;
}
else //??????????
return f(x-1, y-1, n-1)+f(x-1, y, n-1)+f(x-1, y+1, n-1)+f(x, y-1, n-1)+
f(x, y+1, n-1)+f(x+1, y-1, n-1)+f(x+1, y, n-1)+f(x+1, y+1, n-1)+2*f(x, y, n-1);
};
int main()
{
int i, j, m, n;
cin >> m >> n;
for(i=1; i<10; i++) //??????
for(j=1; j<10; j++)
{
if(j==9)
cout << m*f(i, j, n) << endl;
else
cout << m*f(i, j, n) << " ";
}
return 0;
} | 48 |
23,667 |
int main()
{
int m=0,n=0;
int i=0,j=0;
int col_num=0,row_num;
int In[9][9]={{0}};
int Out[9][9]={{0}};
int Temp[9][9]={{0}};
int around[8][2]={{1,0},{-1,0},{0,1},{0,-1},{1,1},{1,-1},{-1,1},{-1,-1}};
scanf("%d %d",&m,&n);
In[4][4]=m;
for(i=0;i<n;i++)
{
if(i!=0)
{
memcpy(In,Out,81*sizeof(int));
memset(Out,0,81*sizeof(int));
}
for(row_num=4-i;row_num<=4+i;row_num++)
{
for(col_num=4-i;col_num<=4+i;col_num++)
{
Out[row_num][col_num]=Out[row_num][col_num]+2*In[row_num][col_num];
for(j=0;j<8;j++)
{
Out[row_num+around[j][0]][col_num+around[j][1]]=Out[row_num+around[j][0]][col_num+around[j][1]]+In[row_num][col_num];
}
}
}
}
for(row_num=0;row_num<9;row_num++)
{
for(col_num=0;col_num<9;col_num++)
{
if(col_num!=8)
{
printf("%d ",Out[row_num][col_num]);
}
else
{
printf("%d\n",Out[row_num][col_num]);
}
}
}
}
| 48 |
23,668 | int a[9][9] = {0}; //???????
void exp(int n)
{
int i = 0, j = 0, k = 0, b[9][9] = {0}, c[9][9] = {0};
for(i = 0; i < 9; i ++)
for(j = 0; j < 9; j ++)
if(a[i][j] != 0)
b[i][j] = 1; //??????
for(i = 0; i < 9; i ++)
{
for(j = 0; j < 9; j ++)
{
if((a[i][j] != 0) && (b[i][j] == 1))
{
if((i - 1 >= 0) && (j - 1 >= 0))
c[i - 1][j - 1] = c[i - 1][j - 1] + a[i][j];
if((i - 1 >= 0) && (j + 1 >= 0))
c[i - 1][j + 1] = c[i - 1][j + 1] + a[i][j];
if((i + 1 <= 8) && (j - 1 >= 0))
c[i + 1][j - 1] = c[i + 1][j - 1] + a[i][j];
if((i + 1 <= 8) && (j + 1 <= 8))
c[i + 1][j + 1] = c[i + 1][j + 1] + a[i][j];
if(i - 1 >= 0)
c[i - 1][j] = c[i - 1][j] + a[i][j];
if(i + 1 <= 8)
c[i + 1][j] = c[i + 1][j] + a[i][j];
if(j - 1 >= 0)
c[i][j - 1] = c[i][j - 1] + a[i][j];
if(j + 1 <= 8)
c[i][j + 1] = c[i][j + 1] + a[i][j];
c[i][j] = c[i][j] + a[i][j] * 2;
}
}
}
for(i = 0; i < 9; i ++)
{
for(j = 0; j < 9; j ++)
{
a[i][j] = c[i][j];
}
}
if(n > 1)
exp(n -1);
}
int main ()
{
int m = 0, n = 0, i = 0, j = 0; //m????????n???
cin >> m >> n;
a[4][4] = m; //?????
exp(n); //??????
for(i = 0; i < 9; i ++)
{
cout << a[i][0];
for(j = 1; j < 9; j ++)
cout << ' ' << a[i][j];
cout << endl;
}
return 0;
} | 48 |
23,669 | 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 |
23,670 | int main()
{
int field[11][11];
int field1[11][11];
memset(field,0,sizeof(field));
memset(field1,0,sizeof(field1));
int n=0,m=0,i=0,j=0,k=0,count=1;
cin>>m>>n;
field1[5][5]=m;
while(count<=n)
{
for(i=1;i<10;i++)
for(j=1;j<10;j++)
field[i][j]=2*field1[i][j]+field1[i-1][j]+field1[i+1][j]+field1[i][j+1]+field1[i][j-1]+field1[i-1][j-1]+field1[i-1][j+1]+field1[i+1][j+1]+field1[i+1][j-1];
for(i=1;i<10;i++)
for(j=1;j<10;j++)
field1[i][j]=field[i][j];
count++;
}
for(i=1;i<10;i++)
{
cout<<field[i][1];
for(j=2;j<10;j++)
cout<<" "<<field[i][j];
cout<<endl;
}
return 0;
} | 48 |
23,671 |
//****************************************
//*???????? **
//*??? 1100012927 **
//*2011.11.29 **
//****************************************
int num[9][9];
void f(int, int, int, int);
int main()
{
int m, n, i, j;
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++)
num[i][j] = 0;
cin >> m >> n;
f(4, 4, m, n);
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
if (j < 8)
cout << num[i][j]<<" ";
else
cout << num[i][j];
}
cout << endl;
}
return 0;
}
void f(int i, int j, int m, int n)
{
int h, k;
if (n == 0)
num[i][j] += m;
else
for (h = i - 1; h <= i + 1; h++)
for (k = j - 1; k <= j + 1; k++)
{
if (k >= 0 && k < 10 && h >= 0 && h < 10)
{
if (h == i && k == j ) //??????????????
{
f(h, k, 2 * m, n - 1);
}
else //???????????
{
f(h, k, m, n - 1);
}
}
}
}
| 48 |
23,672 | 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 |
23,673 | int main()
{
int m,n,i,j,k;
cin>>m>>n;
int a[11][11][2];
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
a[i][j][0]=0;
}
}
a[5][5][0]=m;
for(k=1;k<=n;k++)
{
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
a[i][j][1]=a[i][j][0]*2+a[i][j-1][0]+a[i][j+1][0]+a[i+1][j][0]+a[i-1][j][0]+a[i+1][j+1][0]+a[i-1][j-1][0]+a[i+1][j-1][0]+a[i-1][j+1][0];
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
a[i][j][0]=a[i][j][1];
}
}
}
for(i=1;i<=9;i++)
{
cout<<a[i][1][1];
for(j=2;j<=9;j++)
{
cout<<' '<<a[i][j][1];
}
cout<<endl;
}
return 0;
}
| 48 |
23,674 |
int main()
{
int result[SCALE][SCALE]={{0}}; //??
int temp[SCALE][SCALE]={{0}}; //??
int i,j;
int day;
int m,n;
int x,y;
scanf("%d %d",&m,&n); //??
result[SCALE/2][SCALE/2]=m; //????????
for(day=0;day<n;day++) //????????
{
memset(temp,0,sizeof(temp)); //??????????
for(i=0;i<SCALE;i++)
{
for(j=0;j<SCALE;j++)
{
temp[i][j]+=result[i][j];
//???????????
for(x=-1;x<=1;x++)
{
for(y=-1;y<=1;y++) //???+1????+1
{
if((i+x>=0)&&(i+x<SCALE)&&(j+y>=0)&&(j+y<SCALE))
temp[i+x][j+y]+=result[i][j];
}
}
}
}
memcpy(result,temp,sizeof(result));
}
for(i=0;i<SCALE;i++)
{
for(j=0;j<SCALE-1;j++)
{
printf("%d ",result[i][j]);
}
printf("%d\n",result[i][SCALE-1]);
}
return 0;
} | 48 |
23,675 | 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 |
23,676 | //**************************************
//* ???????????? **
//* ?????? 1300012948 **
//* ???2013.12.5 **
//**************************************
int a[11][11], b[11][11], day = 0;
int main()
{
int m, n;
cin >> m >> n; // ?????????????
void result(int p, int q); // ????
for(int i = 0; i <= 11; i++) // ????????????????????????0
{
for(int j = 0; j <= 11; j++)
{
a[i][j] = 0;
}
}
a[5][5] = m; // ?????????????????????
result(m, n); // ????
return 0;
}
void result(int p, int q)
{
if(day < q) // ???????????????
{
for(int r = 1; r<= 9; r++) // ?????????day???????????b??
{
for(int s = 1; s <= 9; s++)
{
b[r][s] = a[r][s]; // ??????r, s???a?????b?????
for(int temp1 = r - 1; temp1 <= r + 1; temp1++) // ?????r, s????????????????????????????????
{
for(int temp2 = s - 1; temp2 <= s + 1; temp2++)
{
b[r][s] += a[temp1][temp2];
}
}
}
}
day++; // ???1
for(int i = 1; i <= 9; i++) // ???b???????a
{
for(int j = 1; j <= 9; j++)
{
a[i][j] = b[i][j];
}
}
result(p, q); // ???????day + 1????????
}
else // ?????????????????????
{
for(int i = 1; i <= 9; i++)
{
for(int j = 1; j <= 9; j++)
{
if(j < 9)
{
cout << a[i][j] << " ";
}
else
{
cout << a[i][j] << endl;
}
}
}
}
} | 48 |
23,677 | int main()
{
int a[9][9]={0},b[9][9]={0};
int m,n;
cin>>m>>n;
int i,j,k,l;
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][k-1]=b[j][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+1][k]=b[j+1][k]+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+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+1]+a[j][k];
}
}
}
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
{
if(a[j][k]!=0)
a[j][k]=a[j][k]+a[j][k];
}
}
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
a[j][k]=a[j][k]+b[j][k];
}
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
b[j][k]=0;
}
}
for(i=0;i<9;i++)
{
cout<<a[i][0];
for(j=1;j<9;j++)
cout<<' '<<a[i][j];
cout<<endl;
}
return 0;
} | 48 |
23,678 | int a[11][11];
int backup_a[11][11];
int b[11][11];
void backup1()
{
for(int i=1;i<9;i++)
{
for(int j=0;j<9;j++)
{
backup_a[i][j]=a[i][j];
b[i][j]=a[i][j];
}
}
}
void cal1()
{
for(int i=1;i<10;i++)
{
for(int j=1;j<10;j++)
{
if(i>0&&i<10&&j<10&&j>0)
{
a[i][j]=b[i-1][j-1]+b[i-1][j+1]+b[i+1][j-1]+b[i+1][j+1]+b[i-1][j]+b[i+1][j]+b[i][j-1]+b[i][j+1]+2*b[i][j];
}
}
}
}
int main()
{
int n=0;
int d;
cin>>d;
cin>>n;
memset(a,0,sizeof(a));
a[5][5]=d;
backup1();
for(int i=0;i<n;i++)
{
cal1();
backup1();
}
for(int i=1;i<10;i++)
{
for(int j=1;j<10;j++)
{
if(i>0&&i<10&&j<10&&j>0)
{
if(j!=9) cout<<a[i][j]<<" ";
else if(j==9)cout<<a[i][j]<<endl;
}
}
}
return 0;
} | 48 |
23,679 | 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 |
23,680 | int main()
{
int n,q,i,j,a[9][9],m,c[9][9],k,b[9][9];
cin>>n>>m;
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
a[i][j]=0;
c[i][j]=0;
}
}
a[4][4]=n;
for(k=1;k<=m;k++)
{
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{ b[i][j]=0;
if(a[i][j]!=0)
{
c[i][j]=1;
}
}
}
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
if(a[i][j]!=0&&c[i][j]==1)
{
b[i-1][j]=b[i-1][j]+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+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]=b[i][j]+2*a[i][j];
a[i][j]=0;
c[i][j]=0;
}
}
}
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
a[i][j]=a[i][j]+b[i][j];
}
}
}
for(i=0;i<=8;i++)
{
for(j=0;j<=7;j++)
{
cout<<a[i][j]<<" ";
}
cout<<a[i][8];
cout<<endl;
}
cin>>q;
return 0;
}
| 48 |
23,681 | main()
{
int m,n,i,j,t;
scanf("%d %d",&m,&n);
int a[9][9];
int b[9][9];
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{a[i][j]=0;b[i][j]=0;}
a[4][4]=m;b[4][4]=m;
for(t=0;t<n;t++)
{
for(i=0;i<9;i++)
for(j=0;j<9;j++)
a[i][j]=0;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
if(b[i][j]!=0)
{ a[i][j]=a[i][j]+2*b[i][j];
a[i+1][j]=a[i+1][j]+b[i][j];
a[i-1][j]=a[i-1][j]+b[i][j];
a[i+1][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][j+1]=a[i][j+1]+b[i][j];
a[i-1][j-1]=a[i-1][j-1]+b[i][j];
a[i][j-1]=a[i][j-1]+b[i][j];
a[i+1][j-1]=a[i+1][j-1]+b[i][j];
}
}
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==8)
{ printf("%d",a[i][j]);
printf("\n");
}
else
printf("%d ",a[i][j]);
}
}
| 48 |
23,682 | 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 |
23,683 | 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 |
23,684 |
int main (){
int m,n;
int a[11][11]={0};
int b[11][11]={0};
int day,i,j;
scanf("%d%d",&m,&n);
a[5][5]=m;
for(day=0;day<n;day++){
for(i=1;i<10;i++){
for(j=1;j<10;j++){
if(a[i][j]!=0){
b[i][j]+=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(i=1;i<10;i++){
for(j=1;j<10;j++){
a[i][j]+=b[i][j];
b[i][j]=0;
}
}
}
for(i=1;i<10;i++){
for(j=1;j<10;j++){
if(j!=9){
printf("%d ",a[i][j]);
}
if(j==9){
printf("%d\n",a[i][j]);
}
}
}
return 0;
}
| 48 |
23,685 | int a[10][10][5];
int k,i,j,l,n;
int main(){
for(i=0;i<5;i++)
for(j=1;j<10;j++)
for(k=1;k<10;k++)
a[j][k][i]=0;
scanf("%d%d",&n,&k);
a[5][5][0]=n;
for(l=0;l<k;l++)
for(i=1;i<10;i++)
for(j=1;j<10;j++){
if(a[i][j][l]!=0){
a[i][j][l+1]+=2*a[i][j][l];
a[i-1][j-1][l+1]+=a[i][j][l];
a[i-1][j][l+1]+=a[i][j][l];
a[i-1][j+1][l+1]+=a[i][j][l];
a[i][j-1][l+1]+=a[i][j][l];
a[i][j+1][l+1]+=a[i][j][l];
a[i+1][j-1][l+1]+=a[i][j][l];
a[i+1][j][l+1]+=a[i][j][l];
a[i+1][j+1][l+1]+=a[i][j][l];
}
}
for(i=1;i<=9;i++){
for(j=1;j<9;j++){
printf("%d ",a[i][j][k]);
}
printf("%d\n",a[i][9][k]);
}
scanf("%d",&n);
return 0;
}
| 48 |
23,686 | int f(int,int);
int main()
{
int m,n,i,j;
cin>>m>>n;
int a[9][9]={0,0};
if (n==1)
{a[4][4]=2*m;
a[4][3]=a[4][5]=m;
for (i=3;i<=5;i++)
a[3][i]=a[5][i]=m;}
if (n==2)
{ a[4][4]=12*m;
a[2][2]=a[2][6]=a[6][2]=a[6][6]=m;
a[2][3]=a[2][5]=a[3][2]=a[3][6]=a[5][2]=a[5][6]=a[6][3]=a[6][5]=2*m;
a[2][4]=a[4][2]=a[6][4]=a[4][6]=3*m;
a[3][3]=a[3][5]=a[5][3]=a[5][5]=6*m;
a[3][4]=a[5][4]=a[4][3]=a[4][5]=8*m;
a[4][4]=12*m;
}
if (n==3)
{ a[4][4]=80*m;
a[3][3]=a[3][5]=a[5][3]=a[5][5]=51*m;
a[4][3]=a[4][5]=a[3][4]=a[5][4]=63*m;
a[2][2]=a[2][6]=a[6][2]=a[6][6]=12*m;
a[3][2]=a[5][2]=a[2][3]=a[2][5]=a[3][6]=a[5][6]=a[6][3]=a[6][5]=24*m;
a[2][4]=a[6][4]=a[4][2]=a[4][6]=30*m;
a[1][1]=a[1][7]=a[7][1]=a[7][7]=m;
a[1][2]=a[1][6]=a[7][2]=a[7][6]=3*m;a[1][3]=a[1][5]=a[7][3]=a[7][5]=6*m;a[1][4]=a[7][4]=7*m;
a[2][1]=a[6][1]=a[2][7]=a[6][7]=3*m;
a[3][1]=a[5][1]=a[3][7]=a[5][7]=6*m;
a[4][1]=a[4][7]=7*m;
}
if (n==4)
{
a[4][4]=616*m;
a[4][3]=a[4][5]=a[3][4]=a[5][4]=512*m;
a[3][3]=a[3][5]=a[5][3]=a[5][5]=428*m;
a[2][2]=a[2][6]=a[6][2]=a[6][6]=142*m;
a[2][3]=a[2][5]=a[3][2]=a[3][6]=a[5][2]=a[5][6]=a[6][3]=a[6][5]=244*m;
a[4][2]=a[4][6]=a[2][4]=a[6][4]=292*m;
a[1][1]=a[1][7]=a[7][1]=a[7][7]=20*m;
a[1][2]=a[1][6]=a[2][1]=a[5][1]=a[2][7]=a[5][7]=52*m;
a[6][1]=a[6][7]=a[7][2]=a[7][6]=52*m;
a[1][3]=a[1][5]=a[3][1]=a[5][1]=a[7][3]=a[7][5]=a[3][7]=a[5][7]=88*m;
a[1][4]=a[7][4]=a[4][1]=a[4][7]=104*m;
a[0][0]=a[0][8]=a[8][0]=a[8][8]=m;
a[0][1]=a[0][7]=a[8][1]=a[8][7]=4*m;
a[0][2]=a[0][6]=a[8][2]=a[8][6]=10*m;
a[0][3]=a[0][5]=a[8][3]=a[8][5]=16*m;
a[0][4]=a[8][4]=a[4][0]=a[4][8]=19*m;
a[1][0]=a[1][8]=a[7][0]=a[7][8]=4*m;
a[2][0]=a[2][8]=a[6][0]=a[6][8]=10*m;
a[3][0]=a[5][0]=a[3][8]=a[5][8]=16*m;
}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,687 | main()
{
int num,day,i,j,k,p,q;
scanf("%d %d",&num,&day);
int min[11][11];
int temp[11][11];
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
min[i][j]=0;
}
min[5][5]=num;
for(k=1;k<=day;k++)
{
for(p=0;p<11;p++)
{
for(q=0;q<11;q++)
temp[p][q]=min[p][q];
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
min[i][j]=2*temp[i][j]+temp[i+1][j]+temp[i][j+1]+temp[i-1][j]+temp[i][j-1]+temp[i+1][j+1]+temp[i-1][j+1]+temp[i-1][j-1]+temp[i+1][j-1];
}
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if(j!=9)
printf("%d ",min[i][j]);
else printf("%d",min[i][j]);
}
printf("\n");
}
}
| 48 |
23,688 |
int a[9][9], b[9][9];
int start, days;
void initial(){//make a and b all 0
int i, j;
for(i= 0; i< 9; i++){
for(j= 0; j< 9; j++){
a[i][j]= 0;
b[i][j]= 0;
}
}
}
void input(){//set the start germ number
cin>>start>>days;
a[4][4]= start;
}
void output(){//print a
int i= 0, j= 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;
}
}
void grow(int day){//germs grow one day
if(day> days)
return;
int i= 0, j= 0;
for(i= 0; i< 9; i++){
for(j= 0; j< 9; j++){
if(a[i][j]> 0){
b[i][j]+= a[i][j];
if((i- 1)>= 0 && (i- 1)<= 9) b[i- 1][j]+= a[i][j];
if((i+ 1)>= 0 && (i+ 1)<= 9) b[i+ 1][j]+= a[i][j];
if((j- 1)>= 0 && (j- 1)<= 9) b[i][j- 1]+= a[i][j];
if((j+ 1)>= 0 && (j+ 1)<= 9) b[i][j+ 1]+= a[i][j];
if((i- 1)>= 0 && (i- 1)<= 9 && (j- 1)>= 0 && (j- 1)<= 9) b[i- 1][j- 1]+= a[i][j];
if((i- 1)>= 0 && (i- 1)<= 9 && (j+ 1)>= 0 && (j+ 1)<= 9) b[i- 1][j+ 1]+= a[i][j];
if((i+ 1)>= 0 && (i+ 1)<= 9 && (j+ 1)>= 0 && (j+ 1)<= 9) b[i+ 1][j+ 1]+= a[i][j];
if((i+ 1)>= 0 && (i+ 1)<= 9 && (j- 1)>= 0 && (j- 1)<= 9) 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];
b[i][j]= 0;
}
}
grow(day+ 1);
}
int main(){
initial();
input();
grow(1);
output();
return 0;
}
| 48 |
23,689 | int bac0[10][10];
int bac1[10][10];
int m,n;
void init1(){
for(int i = 1;i<10;i++){
for(int j = 1;j<10;j++){
bac0[i][j]=0;
}
}
bac0[5][5]=m;
return;
}
void init2(){
for(int i = 1;i<10;i++){
for(int j = 1;j<10;j++){
bac1[i][j]=0;
}
}
return;
}
void born(int a,int b){
bac1[a][b]+=(bac0[a][b]*2);
if(a-1>=1){
bac1[a-1][b]+=bac0[a][b];
if(b-1>=1) bac1[a-1][b-1]+=bac0[a][b];
if(b+1<=9) bac1[a-1][b+1]+=bac0[a][b];
}
if(a+1<=9){
bac1[a+1][b]+=bac0[a][b];
if(b-1>=1) bac1[a+1][b-1]+=bac0[a][b];
if(b+1<=9) bac1[a+1][b+1]+=bac0[a][b];
}
if(b-1>=1) bac1[a][b-1]+=bac0[a][b];
if(b+1<=9) bac1[a][b+1]+=bac0[a][b];
return;
}
void update(){
for(int i=1;i<=9;i++){
for(int j=1;j<=9;j++){
bac0[i][j]=bac1[i][j];
}
}
return;
}
void day(){
init2();
for(int i=1;i<10;i++){
for(int j = 1;j<10;j++){
if(bac0[i][j]!=0){
born(i,j);
}
}
}
update();
return;
}
void Print(){
for(int i=1;i<=9;i++){
cout<<bac0[i][1];
for(int j=2;j<=9;j++){
cout<<" "<<bac0[i][j];
}
cout<<endl;
}
return;
}
int main(){
cin>>m>>n;
init1();
for(int i=0;i<n;i++){
day();
}
Print();
return 0;
}
| 48 |
23,690 | 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 |
23,691 |
int main()
{
int a[11][11]={0};
int b[11][11]={0};
int i,j,k,l,m,n,x,y;
scanf("%d %d",&m,&n);
a[5][5]=m;
b[5][5]=m;
for(i=1;i<=n;i++)
{
for(j=1;j<10;j++)
{
for(k=1;k<10;k++)
{
for(x=0-1;x<=1;x++)
{
for(y=0-1;y<=1;y++)
{
b[j][k]=b[j][k]+a[j+x][k+y];
}
}
}
}
for(j=1;j<10;j++)
{
for(k=1;k<10;k++)
{
a[j][k]=b[j][k];
}
}
}
for(j=1;j<10;j++)
{
for(k=1;k<9;k++)
{
printf("%d ",a[j][k]);
}
printf("%d\n",a[j][9]);
}
} | 48 |
23,692 | int main()
{
int i,j,k,m, n, count[9][9],temp[9][9];
memset(count,0,sizeof(count));
memset(temp,0,sizeof(count));
cin >> m >> n;
count[4][4] = m;
for ( i = 0; i < n; i++)
{
for ( j = 0; j <9; j++)
for ( k = 0; k < 9;k++)
{
if ( count[j][k] != 0 )
{
temp[j-1][k] +=count[j][k];
temp[j+1][k]+=count[j][k];
temp[j-1][k-1]+=count[j][k];
temp[j-1][k+1]+=count[j][k];
temp[j][k-1]+=count[j][k];
temp[j][k+1]+=count[j][k];
temp[j+1][k+1]+=count[j][k];
temp[j+1][k-1]+=count[j][k];
temp[j][k] += count[j][k]*2;
}
}
for ( j = 0; j <9; j++)
for ( k = 0; k < 9;k++)
count[j][k] = temp[j][k];
memset(temp,0,sizeof(temp));
}
for ( j = 0; j <9; j++)
{
for ( k = 0; k < 8;k++)
cout << count[j][k] <<' ';
cout << count[j][8] << endl;
}
return 0;
} | 48 |
23,693 |
main()
{
int m,n,i,j,k,s[11][11]={0},s1[11][11]={0};
scanf("%d %d",&m,&n);
s1[5][5]=s[5][5]=m;
for(k=1;k<=n;k++)
{
for(i=5-k;i<=5+k;i++)
{
for(j=5-k;j<=5+k;j++)
{
s[i][j]=2*s1[i][j]+s1[i-1][j-1]+s1[i-1][j]+s1[i-1][j+1]+s1[i][j-1]+s1[i][j+1]+s1[i+1][j-1]+s1[i+1][j]+s1[i+1][j+1];
}
}
if(k!=n)
{
for(i=5-k;i<=5+k;i++)
{
for(j=5-k;j<=5+k;j++)
{
s1[i][j]=s[i][j];
}
}
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
if(j==1)printf("%d",s[i][j]);
else printf(" %d",s[i][j]);
}
printf("\n");
}
}
| 48 |
23,694 | //??? ??? 1000010334
//????????????????????
//???????????
int main()
{
int end[11][11]; //???????
int start[11][11]; //????????
int b[5][11][11];
int m=0; //?????????
int n=0; //????
for(int i=0;i<11;i++)
{
for(int j=0;j<11;j++)
{
start[i][j]=0;
end[i][j]=0;
for(int k=0;k<5;k++)
{
b[k][i][j]=0;
}
}
}
cin>>m>>n;
start[5][5]=m;
b[0][5][5]=m;
for(int k=1;k<=n;k++)
{
for(int i=1;i<=9;i++)
{
for(int j=1;j<=9;j++)
{
for(int p=i-1;p<=i+1;p++)
{
for(int q=j-1;q<=j+1;q++)
{
if(p==i&&q==j)
{
b[k][p][q]=b[k][p][q]+b[k-1][p][q]*2;
}
else
{
b[k][i][j]=b[k][i][j]+b[k-1][p][q];
}
}
}
}
}
/*
for(int i=1;i<=9;i++)
{
for(int j=1;j<=9;j++)
{
if(j==1) cout<<b[k-1][i][j];
else cout<<" "<<b[k-1][i][j];
}
cout<<endl;
}
*/
}
for(int i=1;i<=9;i++)
{
for(int j=1;j<=9;j++)
{
end[i][j]=b[n][i][j];
}
}
for(int i=1;i<=9;i++)
{
for(int j=1;j<=9;j++)
{
if(j==1) cout<<end[i][j];
else cout<<" "<<end[i][j];
}
cout<<endl;
}
return 0;
}
| 48 |
23,695 | int cell[15][15][2]={0};
const int dx[8]={1,0,-1,0,1,1,-1,-1};
const int dy[8]={0,1,0,-1,1,-1,1,-1};
int sur(int x,int y){
if (x==1 && y==1 || x==1 && y==9 || x==9 && y==1 || x==9 && y==9)
return cell[x][y][0]*8/3;
else if (x==1 || y==1 || x==9 || y==9)
return cell[x][y][0]*8/5;
else return cell[x][y][0];
}
void fer (int day){
for (int d=1;d<=day;d++){
for (int i=1;i<=9;i++)
for (int j=1;j<=9;j++){
if (cell[i][j][0] != 0){
cell[i][j][1] += cell[i][j][0];
for (int k=0;k<8;k++){
int x = i + dx[k], y = j + dy[k];
if (x>=1 && x<=9 && y>=1 && y<=9)
cell[x][y][1] += sur(i,j);
}
}
}
for (int i=1;i<=9;i++)
for (int j=1;j<=9;j++)
cell[i][j][0] = cell[i][j][1];
}
}
void draw(){
for (int i=1;i<=9;i++){
for (int j=1;j<=8;j++)
cout<<cell[i][j][0]<<" ";
cout<<cell[i][9][0]<<endl;
}
}
int main ()
{
int num,day;
cin>>num>>day;
cell[5][5][0] = num;
cell[5][5][1] = num;
fer(day);
draw();
return 0;
} | 48 |
23,696 | 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 |
23,697 |
int main()
{
int a[9][9]={0},b[9][9]={0};
int m,n;
int i,j,k,fx,fy;
cin>>m>>n;
a[4][4]=m;
for(int 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(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<9;i++)
{
cout<<a[i][0];
for(j=1;j<9;j++)
{
cout<<' '<<a[i][j];
}
cout<<endl;
}
return 0;
} | 48 |
23,698 | //**************************
//**ày3ì?oϸ¾ú?Ä·±Ö3óëà©é?**
//**×÷Õß?ooÎ?¨ **
//**ê±¼ä?o2013.12.8 **
//**ÎļtÃû?o2.cpp **
//**************************
int main()
{
int m, n, i, j, g, cnt[9][9] = {0};
cin >> m >> n;
cnt[4][4] = m;
for (i = 0; i < n; i++)
{
int sq[9][9] = {0};
for (j = 0; j < 9; j++)
for (g = 0; g < 9; g++)
{
if (cnt[j][g] != 0)
{
sq[j][g] += cnt[j][g];
if (j + 1 < 9)
{
sq[j + 1][g] += cnt[j][g];
if (g + 1 < 9)
sq[j + 1][g + 1] += cnt[j][g];
if (g - 1 >= 0)
sq[j + 1][g - 1] += cnt[j][g];
}
if (j - 1 >= 0)
{
sq[j - 1][g] += cnt[j][g];
if (g + 1 < 9)
sq[j - 1][g + 1] += cnt[j][g];
if (g - 1 >= 0)
sq[j - 1][g - 1] += cnt[j][g];
}
if (g + 1 < 9)
sq[j][g + 1] += cnt[j][g];
if (g - 1 >= 0)
sq[j][g - 1] += cnt[j][g];
}
}
for (j = 0; j < 9; j++)
for (g = 0; g < 9; g++)
cnt[j][g] += sq[j][g];
}
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++)
{
if (j < 8)
cout << cnt[i][j] << ' ';
else
cout << cnt[i][j] << endl;
}
return 0;
} | 48 |
23,699 | int main(){
int A[5][12][12],i,j,k,m,n;
for(i=0;i<5;i++)
{
for(j=0;j<11;j++)
{
for(k=0;k<11;k++)
{
A[i][j][k]=0;
}
}
}
scanf("%d%d",&n,&m);
A[0][6][6]=n;
for(i=0;i<m;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+1][j+1][k]+=A[i][j][k];
A[i+1][j-1][k]+=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+1]+=A[i][j][k];
A[i+1][j+1][k-1]+=A[i][j][k];
A[i+1][j-1][k-1]+=A[i][j][k];
}
}
}
for(i=2;i<11;i++)
{
for(j=2;j<10;j++)
{
printf("%d ",A[m][i][j]);
}
printf("%d",A[m][i][10]);
printf("\n");
}
return 0;
}
| 48 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.