id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
23,700 | 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 |
23,701 | int main()
{
int num[5][11][11],day,pri;
for(int i=0;i<=10;i++)
{
for(int j=0;j<=10;j++)
{
for(int b=0;b<=4;b++)
{
num[b][i][j]=0;
}
}
}
cin>>pri>>day;
num[1][5][5]=pri;
for(int t=1;t<=day;t++)
{
for(int i=1;i<=9;i++)
{
for(int j=1;j<=9;j++)
{
num[t+1][i][j]=num[t][i][j]*2+num[t][i-1][j]+num[t][i-1][j-1]+num[t][i-1][j+1]+num[t][i][j-1]+num[t][i][j+1]+num[t][i+1][j]+num[t][i+1][j-1]+num[t][i+1][j+1];
}
}
}
for(int i=1;i<=9;i++)
{
for(int j=1;j<9;j++)
{
cout<<num[day+1][i][j]<<" ";
}
cout<<num[(day+1)][i][9]<<endl;
}
return 0;
} | 48 |
23,702 | //********************************
//*??????????? **
//*?????? 1300012861 **
//*???2013.12.04 **
//********************************
int a[12][12] = {0}, b[12][12] = {0}, m, n;
void result(int day, int a[][12])
{
int i, j;
if ( day == n ) //??????
{
for ( i = 1; i <= 9; i++) //?????
{
for ( j = 1; j < 9; j++)
cout << a[i][j] << " ";
cout << a[i][9] << endl;
cout << endl;
}
return;
}
for ( i = 1; i <= 9; i++)
{
for ( j = 1; j <= 9; j++)
{
if ( a[i][j] != 0 )
b[i][j] = a[i][j]; //???????? ????
}
}
for ( i = 1; i <= 9; i++ )
{
for ( j = 1; j <= 9; j++)
{
if ( b[i][j] != 0 ) //???????
{
a[i][j] += b[i][j]; //????2?
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];
}
}
}
result(day+1, a); //???????
return;
}
int main()
{
cin >> m >> n;
a[5][5] = m; //????????
result (0, a); //???????
return 0;
} | 48 |
23,703 | int main()
{
int m, n, a[10][10] = {0}, t[8][2] = {0,1,0,-1,1,1,1,-1,1,0,-1,1,-1,0,-1,-1};
cin >> m >> n;
a[5][5] = m;
while (n--)
{
int b[10][10] = {0};
for (int i = 1; i <= 9; i++)
for (int j = 1; j <= 9; j++)
{
if (a[i][j] != 0)
{
for (int k = 0; k < 8; k++)
b[i + t[k][0]][j + t[k][1]] += a[i][j];
b[i][j] += a[i][j] * 2;
}
}
for (int i = 1; i <= 9; i++)
for (int j = 1; j <= 9; j++) a[i][j] = b[i][j];
}
for (int i = 1; i <= 9 ; i++)
{
cout << a[i][1];
for (int j = 2; j <= 9; j ++)
{
cout << " " << a[i][j];
}
cout << endl;
}
return 0;
}
| 48 |
23,704 | int main()
{int a[11][11],b[11][11],m,n,i,j,k;
cin>>m>>n;
for(i=0;i<11;i++)
{for(j=0;j<11;j++)
{a[i][j]=0;
b[i][j]=0;}}
a[5][5]=m;
for(k=0;k<n;k++)
{for(i=1;i<10;i++)
{for(j=1;j<10;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]+a[i][j+1]+a[i+1][j-1]+a[i+1][j]+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++)
{cout<<a[i][j]<<" ";}
cout<<a[i][9]<<endl;}
return 0;} | 48 |
23,705 | 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 |
23,706 | int main()
{
int a[11][11],b[11][11];
int i,j,k,m,n;
cin>>m>>n;
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
a[i][j]=0;
}
}
a[5][5]=m;
for(k=0;k<n;k++)
{
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
b[i][j]=a[i][j];
}
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if(b[i][j]!=0)
{
a[i][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][j+1]+=b[i][j];
a[i][j-1]+=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];
}
}
}
}
k=0;
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
cout<<a[i][j];
k++;
if(k%9!=0)
cout<<" ";
else
cout<<endl;
}
}
return 0;
} | 48 |
23,707 | // ??????
// ??? 1100012820
// 20111123
//******************
int sqr[9][9] = {0};
void printsqr(int a[9][9])
{
int i, j;
for (i = 0; i <= 8; i++)
{
for (j = 0; j <= 7; j++)
cout << a[i][j] << " ";
cout << a[i][8] << endl;
}
}
void addv()
{
int adsqr[9][9] = {0};
int i, j, m, n;
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
for(m = i - 1; m <= i + 1; m++)
{
for(n = j - 1; n <= j + 1; n++)
{
if ((m >= 0) && (m <= 8) && (n >= 0) && (n <= 8))
adsqr[m][n] += sqr[i][j];
}
}
}
}
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
sqr[i][j] += adsqr[i][j];
}
}
return;
}
void grow(int days)
{
if (days)
{
addv();
grow(days - 1);
}
return;
}
int main()
{
int num, day;
cin >> num >> day;
sqr[4][4] += num;
grow(day);
printsqr(sqr);
return 0;
}
| 48 |
23,708 | int main()
{
int m,n,i,j,a[11][11],b[11][11],d;
cin >>m>>n;
for (i=0;i<=10;i++)
{
for (j=0;j<=10;j++)
{
a[i][j]=b[i][j]=0;
}
}
a[5][5]=m;
for (d=1;d<=n;d++)
{
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)
cout <<a[i][j]<<endl;
else cout <<a[i][j]<<' ';
}
}
return 0;
} | 48 |
23,709 |
int main()
{
int num[9][9];
int next[9][9];
int m,n,i,j,t;
int k,h;
cin>>m>>n;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{num[i][j]=0;
next[i][j]=0;}
num[4][4]=m;
for(t=n;t>=1;t--)
{for(i=0;i<9;i++)
for(j=0;j<9;j++)
if(num[i][j]!=0)
{next[i][j]+=2*num[i][j];
next[i-1][j]+=num[i][j];
next[i+1][j]+=num[i][j];
next[i][j-1]+=num[i][j];
next[i][j+1]+=num[i][j];
next[i-1][j-1]+=num[i][j];
next[i-1][j+1]+=num[i][j];
next[i+1][j-1]+=num[i][j];
next[i+1][j+1]+=num[i][j];
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{num[i][j]=next[i][j];
next[i][j]=0;}
}
for(i=0;i<9;i++)
{for(j=0;j<8;j++)
cout<<num[i][j]<<" ";
cout<<num[i][j]<<endl;}
return 0;
} | 48 |
23,710 |
void fz( int , int[11][11]);
int main()
{
int f ,d ;
int pym[11][11]={0};
cin >> f >> d;
pym[5][5] = f;
fz( d , pym );
for( int i = 1 ; i <= 9 ; i++)
{
for( int j = 1 ; j <= 9 ; j ++)
{
if( j < 9)
{
cout<<pym[i][j]<<" ";
}
else
{
cout<<pym[i][j];
}
}
cout<<endl;
}
return 0;
}
void fz( int day , int pym[11][11])
{
if( day == 0)
{
return ;
}
else
{
int temp[11][11] = {0};
for( int a = 1 ; a <=10 ; a++)
{
for( int b = 1 ; b <= 10 ; b ++)
{
if( pym[a][b] > 0)
{
temp[a][b] += 2 * pym[a][b];
temp[a - 1][b] += pym[a][b];
temp[a + 1][b] += pym[a][b];
temp[a ][b - 1] += pym[a][b];
temp[a ][b + 1] += pym[a][b];
temp[a + 1][b + 1] += pym[a][b];
temp[a + 1 ][b - 1] += pym[a][b];
temp[a - 1 ][b + 1] += pym[a][b];
temp[a - 1][b - 1] += pym[a][b];
}
else
{
continue;
}
}
}
for( int c = 1 ; c <=10 ; c++)
{
for( int d = 1 ; d <= 10 ; d ++)
{
pym[c][d] = temp[c][d];
}
}
fz( day - 1, pym);
}
}
| 48 |
23,711 | int main()
{
int m,n,i,j,k;
int a[11][11]={0},b[11][11]={0};
cin>>m>>n;
a[5][5]=m;
while(n--)
{
memset(b,0,sizeof(a));
for(i=1;i<=9;i++)
for(j=0;j<=9;j++)
{
k=a[i][j];
b[i][j]+=(2*k);
b[i-1][j]+=k;
b[i-1][j-1]+=k;
b[i-1][j+1]+=k;
b[i][j-1]+=k;
b[i][j+1]+=k;
b[i+1][j]+=k;b[i+1][j-1]+=k;b[i+1][j+1]+=k;
a[i][j]=0;
}
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++)
{
cout<<a[i][j];
if(j!=9)cout<<' ';
}
cout<<endl;
}
return 0;
} | 48 |
23,712 |
int main()
{
int m, n;
int a[9][9] = {0}, b[9][9] = {0};
cin >> m >> n;
a[4][4] = m;
for(int i = 1; i <= n; i++)
{
for(int j = 0; j < 9; j++)
{
for(int k = 0; k < 9; k++)
{
if(a[j][k])
{
b[j][k] += 2 * a[j][k];
b[j][k + 1] += a[j][k];
b[j][k - 1] += a[j][k];
b[j - 1][k] += a[j][k];
b[j + 1][k] += a[j][k];
b[j - 1][k - 1] += a[j][k];
b[j - 1][k + 1] += a[j][k];
b[j + 1][k - 1] += a[j][k];
b[j + 1][k + 1] += a[j][k];
}
}
}
for(int j = 0; j <= 8; j++)
{
for(int k = 0; k <= 8; k++)
{
a[j][k] = b[j][k];
}
}
memset(b, 0, sizeof(b));
}
for(int i = 0; i < 9; i++)
{
for(int j = 0; j < 8; j++)
{
cout << a[i][j] << " ";
}
cout << a[i][8] << "\n";
}
return 0;
} | 48 |
23,713 | main()
{
int a1[9][9],a2[9][9],m,n,i,j;
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
a1[i][j]=0;
a2[i][j]=0;
}
}
scanf("%d %d",&m,&n);
a1[4][4]=m;
a2[4][4]=m;
for(;n>0;n--)
{
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(a1[i][j]!=0)
{
a2[i][j]=a2[i][j]+a1[i][j];
a2[i-1][j-1]=a2[i-1][j-1]+a1[i][j];
a2[i-1][j]=a2[i-1][j]+a1[i][j];
a2[i-1][j+1]=a2[i-1][j+1]+a1[i][j];
a2[i][j-1]=a2[i][j-1]+a1[i][j];
a2[i][j+1]=a2[i][j+1]+a1[i][j];
a2[i+1][j-1]=a2[i+1][j-1]+a1[i][j];
a2[i+1][j]=a2[i+1][j]+a1[i][j];
a2[i+1][j+1]=a2[i+1][j+1]+a1[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
a1[i][j]=a2[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(j==0)
printf("%d",a2[i][j]);
else if(j==8)
printf(" %d\n",a2[i][j]);
else
printf(" %d",a2[i][j]);
}
}
} | 48 |
23,714 | int main()
{
int a[11][11],b[11][11];
int i,j,k,m,n;
cin>>m>>n;
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
a[i][j]=0;
b[i][j]=0;
}
}
a[5][5]=m;
for(k=0;k<n;k++)
{
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(b[i][j]!=0)
{
a[i][j]=a[i][j]+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];
}
}
}
}
k=0;
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
cout<<a[i][j];
k++;
if(k%9!=0)
cout<<" ";
else
cout<<endl;
}
}
return 0;
} | 48 |
23,715 | 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 |
23,716 | //****************************************
//*?????(11.8) ???????? **
//*?????? 1100012798 **
//*???2011.11.26 **
//****************************************
int a[9][9] = {0} , m;
void breed(int x,int y,int nf) //??????
{
int xx,yy;
if (nf != 0) //??????:??
{
breed(x,y,nf - 1); //??
for (xx = x - 1;xx <= x + 1;xx++)
{
for (yy = y - 1;yy <= y + 1;yy++)
{
a[xx][yy]+= m;
breed(xx,yy,nf - 1);
}
}
}
}
int main()
{
int n , i , j; //??????
cin >> m >> n; //????
a[4][4] = m;
breed(4,4,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,717 | int m, n;
int board[2][9][9] = {0};
void fanzhi(int k)
{
if(k == n)
{
return;
}
int s = k % 2;
int i, j;
for (i = 0; i < 9; i ++)
{
for (j = 0; j < 9; j ++)
{
board[1 - s][i - 1][j] += board[s][i][j];
board[1 - s][i + 1][j] += board[s][i][j];
board[1 - s][i][j - 1] += board[s][i][j];
board[1 - s][i][j + 1] += board[s][i][j];
board[1 - s][i + 1][j + 1] += board[s][i][j];
board[1 - s][i - 1][j + 1] += board[s][i][j];
board[1 - s][i + 1][j - 1] += board[s][i][j];
board[1 - s][i - 1][j - 1] += board[s][i][j];
board[1 - s][i][j] += board[s][i][j] * 2;
board[s][i][j] = 0;
}
}
fanzhi(k + 1);
return;
}
int main()
{
cin >> m;
cin >> n;
board[0][4][4] = m;
fanzhi(0);
int i, j;
int p = n % 2;
for (i = 0; i < 9; i ++)
{
int shou = 0;
for (j = 0; j < 9; j ++)
{
if(shou != 0)
{
cout << " ";
}
shou = 1;
cout << board[p][i][j];
}
cout << endl;
}
return 0;
} | 48 |
23,718 | int main()
{
int n, sz[number][number], sz1[number][number], k, i, l, a, b, j, mc;
scanf("%d%d", &n, &k);
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
sz[i][j]=0;
sz1[i][j]=0;
}
}
sz[4][4]=n;
for(l=1;l<=k;l++)
{
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
if(sz[i][j]!=0)
{
sz1[i-1][j-1]=sz1[i-1][j-1]+sz[i][j];
sz1[i-1][j]=sz1[i-1][j]+sz[i][j];
sz1[i-1][j+1]=sz1[i-1][j+1]+sz[i][j];
sz1[i][j-1]=sz1[i][j-1]+sz[i][j];
sz1[i][j]=sz1[i][j]+2*sz[i][j];
sz1[i][j+1]=sz1[i][j+1]+sz[i][j];
sz1[i+1][j-1]=sz1[i+1][j-1]+sz[i][j];
sz1[i+1][j]=sz1[i+1][j]+sz[i][j];
sz1[i+1][j+1]=sz1[i+1][j+1]+sz[i][j];
}
}
}
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
sz[i][j]=sz1[i][j];
sz1[i][j]=0;
}
}
}
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
if(j==8)
printf("%d\n", sz[i][j]);
else
printf("%d ", sz[i][j]);
}
}
return 0;
} | 48 |
23,719 |
int main()
{
int a[11][11]={0},b[11][11]={0};
int n,t;
int i,j;
scanf("%d%d",&t,&n);
a[5][5]=t;
while (n>0)
{
for (i=1;i<=9;i++) for (j=1;j<=9;j++)
{
b[i][j]=2*a[i][j]+a[i-1][j]+a[i-1][j-1]+a[i-1][j+1]+
a[i+1][j]+a[i+1][j+1]+a[i+1][j-1]+
a[i][j-1]+a[i][j+1];
}
for (i=1;i<=9;i++) for (j=1;j<=9;j++)
a[i][j]=b[i][j];
n--;
}
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 |
23,720 | 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 |
23,721 | 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 |
23,722 | main()
{
int n,m,i,j,l,k;
int s[10][10];
int a[10][10];
scanf("%d %d",&n,&k);
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
{
a[i][j]=0;
s[i][j]=0;
}
s[5][5]=n;a[5][5]=n;
for (l=1;l<=k;l++)
{
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
if (s[i][j]>0)
{
a[i][j]+=s[i][j];
a[i-1][j-1]+=s[i][j];
a[i][j-1]+=s[i][j];
a[i-1][j]+=s[i][j];
a[i+1][j-1]+=s[i][j];
a[i-1][j+1]+=s[i][j];
a[i+1][j]+=s[i][j];
a[i][j+1]+=s[i][j];
a[i+1][j+1]+=s[i][j];
}
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
s[i][j]=a[i][j];
}
for (i=1;i<=9;i++)
{
for (j=1;j<=8;j++)
printf("%d ",a[i][j]);
printf("%d\n",a[i][9]);
}
}
| 48 |
23,723 |
int main()
{
int a[5][11][11] = {0};
int m, n, i, j, k;
cin >> m >> n;
a[0][5][5] = m;
for(i = 1; i < n + 1; i++)
{
for(k = 1; k < 10; k++)
for(j = 1; j < 10; j++)
{
a[i][k][j] = a[i - 1][k][j] * 2 + a[i - 1][k - 1][j] + a[i - 1][k + 1][j] + a[i - 1][k][j + 1] + a[i - 1][k][j - 1] + a[i - 1][k + 1][j+1] + a[i - 1][k + 1][j -1] + a[i - 1][k - 1][j + 1] + a[i - 1][k - 1][j - 1];
}
}
for(i = 1; i < 10; i++)
{
cout << a[n][i][1];
for(j = 2; j < 10; j++)
cout << ' ' << a[n][i][j];
cout << endl;
}
return 0;
} | 48 |
23,724 | 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 |
23,725 | int main()
{
int a[9][9]={{0}};
int b[9][9];
int m,n,w,i,j,c;
scanf("%d %d",&m,&n);
a[4][4]=m;
for(w=1;w<=n;w++)
{
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
b[i-1][j-1]=0;
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{
c=a[i-1][j-1];
if(c!=0)
{
b[i-2][j-2]=b[i-2][j-2]+c;
b[i-2][j-1]=b[i-2][j-1]+c;
b[i-2][j]=b[i-2][j]+c;
b[i-1][j-2]=b[i-1][j-2]+c;
b[i-1][j]=b[i-1][j]+c;
b[i][j-2]=b[i][j-2]+c;
b[i][j-1]=b[i][j-1]+c;
b[i][j]=b[i][j]+c;
b[i-1][j-1]=b[i-1][j-1]+c;
}
}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
a[i-1][j-1]=a[i-1][j-1]+b[i-1][j-1];
}
for(i=1;i<=9;i++)
{
for(j=1;j<=8;j++)
printf("%d ",a[i-1][j-1]);
printf("%d\n",a[i-1][8]);
}
return 0;
} | 48 |
23,726 | main()
{
int i,j,k,l,m,n,x;
int b[11][11]={0};
int c[11][11]={0};
scanf("%d %d",&x,&m);
c[5][5]=x;
for(n=1;n<=m;n++)
{
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
b[i][j]=c[i][j];
}
for(i=5-n;i<=5+n;i++)
{
for(j=5-n;j<=5+n;j++)
{
for(k=-1;k<=1;k++)
{
for(l=-1;l<=1;l++)
{
c[i][j]=c[i][j]+b[i-l][j-k];
}
}
}
}
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if(j==1)
{printf("%d",c[i][j]);}
else
{printf(" %d",c[i][j]);}
}
printf("\n");
}
}
| 48 |
23,727 | int main(void)
{
int i,j,k;
int num,day;
scanf("%d%d",&num,&day);
int a[day+1][10][10];
for(i=0;i<=day;i++)
{
for(j=1;j<=9;j++)
{
for(k=1;k<=9;k++)
a[i][j][k]=0;
}
}
a[0][5][5]=num;
for(i=1;i<=day;i++)
{
for(j=1;j<=9;j++)
{
for(k=1;k<=9;k++)
{
if(a[i-1][j][k]!=0)
{
a[i][j-1][k-1]+=a[i-1][j][k];
a[i][j-1][k]+=a[i-1][j][k];
a[i][j-1][k+1]+=a[i-1][j][k];
a[i][j][k-1]+=a[i-1][j][k];
a[i][j][k+1]+=a[i-1][j][k];
a[i][j][k]+=2*a[i-1][j][k];
a[i][j+1][k-1]+=a[i-1][j][k];
a[i][j+1][k]+=a[i-1][j][k];
a[i][j+1][k+1]+=a[i-1][j][k];
}
}
}
}
for(j=1;j<=9;j++)
{
for(k=1;k<=8;k++)
{
printf("%d ",a[day][j][k]);
}
printf("%d\n",a[day][j][9]);
}
return 0;
} | 48 |
23,728 |
int main(){
int day,ma[11][11]={0},mb[11][11]={0};
cin>>ma[5][5]>>day;
for(int t=1;t<=day;t++){
if(t%2==1){
for(int i=1;i<10;i++){
for(int j=1;j<10;j++){
mb[i][j]=ma[i][j]*2
+ma[i+1][j]+ma[i+1][j+1]+ma[i+1][j-1]
+ma[i-1][j]+ma[i-1][j+1]+ma[i-1][j-1]
+ma[i][j+1]+ma[i][j-1];
}
}
}
else{
for(int i=1;i<=9;i++){
for(int j=1;j<=9;j++){
ma[i][j]=mb[i][j]*2
+mb[i+1][j]+mb[i+1][j+1]+mb[i+1][j-1]
+mb[i-1][j]+mb[i-1][j+1]+mb[i-1][j-1]
+mb[i][j+1]+mb[i][j-1];
}
}
}
}
if(day%2==1){
for(int i=1;i<=9;i++){
for(int j=1;j<9;j++){
cout<<mb[i][j]<<" ";
}
cout<<mb[i][9]<<endl;
}
}
else{
for(int i=1;i<=9;i++){
for(int j=1;j<9;j++){
cout<<ma[i][j]<<" ";
}
cout<<ma[i][9]<<endl;
}
}
}
| 48 |
23,729 | 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 |
23,730 |
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 |
23,731 | int main()
{
int a[9][9]={0},b[9][9]={0};
int i,j,k,m,n,fx,fy;
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++)
b[i][j]=0;
for(i=1;i<8;i++)
{
for(j=1;j<8;j++)
{
b[i][j]=b[i][j]+a[i][j];
for(fx=-1;fx<=1;fx++)
{
for(fy=-1;fy<=1;fy++)
{
b[i+fx][j+fy]=b[i+fx][j+fy]+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++)
{
printf("%d",a[i][0]);
for(j=1;j<9;j++)
printf(" %d",a[i][j]);
printf("\n");
}
}
| 48 |
23,732 | main()
{
int m,n,k,i,j,t,g,f;
int a[9][9]={0};
int b[9][9]={0};
scanf("%d %d",&n,&m);
a[4][4]=n;
b[4][4]=n;
for(k=0;k<m;k++)
{
for(i=4-k;i<=4+k;i++)
{
for(j=4-k;j<=4+k;j++)
{
for(t=i-1;t<=i+1;t++)
{
for(g=j-1;g<=j+1;g++)
{
a[t][g]+=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)printf(" ");
printf("%d",a[i][j]);
}
printf("\n");
}
getchar();
getchar();
getchar();
}
| 48 |
23,733 | 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 |
23,734 | int main()
{
int m,n,i,p,q;
int a[11][11]={0};
int b[11][11];
scanf("%d %d",&m,&n);
a[5][5]=m;
for (i=0;i<n;i++)
{
for (p=0;p<11;p++)
{
for (q=0;q<11;q++)
b[p][q]=a[p][q];
}
for (p=1;p<10;p++)
{
for (q=1;q<10;q++)
a[p][q]=2*b[p][q]+b[p-1][q]+b[p-1][q-1]+b[p][q-1]+b[p+1][q]+b[p][q+1]+b[p+1][q+1]+b[p+1][q-1]+b[p-1][q+1];
}
}
for (p=1;p<10;p++)
{
for (q=1;q<10;q++)
{
if (q<9)
printf ("%d ",a[p][q]);
if (q==9)
printf ("%d\n",a[p][q]);
}
}
}
| 48 |
23,735 | int a[9][9]={0},b[9][9]={0};
int s(int n)
{
memset(b,0,sizeof(b));
if(n==0)
{
for(int i=0;i<=8;i++)
{
for(int j=0;j<=8;j++)
{
cout<<a[i][j];
if(j!=8)
{
cout<<" ";
}
}
cout<<endl;
}
}
else
{
for(int i=0;i<=8;i++)
{
for(int j=0;j<=8;j++)
{
if(a[i][j]!=0)
{
b[i][j]=b[i][j]+2*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]=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]=b[i-1][j]+a[i][j];
b[i-1][j-1]=b[i-1][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];
}
}
return s(n-1);
}
}
int main()
{
int m, n;
cin >> m >> n;
a[4][4]=m;
s(n);
return 0;
} | 48 |
23,736 | //******************************
//???:2.cpp
//??: ??? 1300012754
//??:2013.12.06
//??:???????? (???????????????????
//******************************
int m, n; // m:?????????,n:?????
int map[10][10]; // ???
int Breed(int, int, int); // ????
int main()
{
memset(map, 0, sizeof(map)); // ?????
cin >> m >> n; // ??????????,?????
// ??1???9?
for (int i = 1; i <= 9; i++)
{
cout << Breed(i, 1, n); // ??n????i????????
for (int j = 2; j <= 9; j++)
{
cout << " " << Breed(i, j, n); // ???i???8?????,???????
}
cout << endl; // ?????
}
return 0;
}
// ????,x,y????,p??????
int Breed(int x, int y, int p)
{
if (p == 0) // ????????0?
{
if (x == 5 && y == 5) // ??????,????m
return m;
else
return 0; // ???????0
}
else
{
return Breed(x + 1, y, p - 1) + Breed(x + 1, y + 1, p - 1) +
Breed(x, y + 1, p - 1) + Breed(x - 1, y + 1, p - 1) +
Breed(x - 1, y, p - 1) + Breed(x - 1, y - 1, p - 1) +
Breed(x, y - 1, p - 1) + Breed(x + 1, y - 1, p - 1) +
2 * Breed(x, y, p - 1); // ???????, ???????????????????????????2???????????
}
}
| 48 |
23,737 |
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 |
23,738 |
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 |
23,739 | int main()
{
int a[9][9] ={0, 0};
int n, day;
cin >> n >> day;
a[4][4] = n;
for(int i = 1; i <= day; i ++)
{
int b[9][9] = {0, 0};
for(int j = 0; j < 9; j ++)
for(int k = 0; k < 9; k++)
{
if(a[j][k] != 0)
{
b[j][k] += 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 - 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];
}
}
for(int j = 0; j < 9; j ++)
for(int k = 0; k < 9; k ++)
a[j][k] += b[j][k];
}
for(int i = 0; i < 9; i ++)
{
cout << a[i][0];
for(int j = 1; j < 9; j ++)
cout << " " << a[i][j];
cout << endl;
}
return 0;
} | 48 |
23,740 | int a[9][9]={0},b[9][9];
void fanzhi(int i,int j)
{
int x,y;
for(x=i-1;x<=i+1;x++)
{
for(y=j-1;y<=j+1;y++)
{
b[x][y]=b[x][y]+a[i][j];
}
}
b[i][j]=b[i][j]+a[i][j];
}
main()
{
int m,n,k,i,j;
scanf("%d %d",&m,&n);
a[4][4]=m;
for(k=1;k<=n;k++) //???k?????
{
memset(b,0,sizeof(b));
for(i=4-k+1;i<=4+k-1;i++)
{
for(j=4-k+1;j<=4+k-1;j++)
{
fanzhi(i,j);
}
}
for(i=4-k;i<=4+k;i++)
{
for(j=4-k;j<=4+k;j++)
{
a[i][j]=b[i][j];
}
}
}
for(i=0;i<=8;i++)
{
for(j=0;j<=7;j++)
{
printf("%d ",a[i][j]);
}
printf("%d\n",a[i][8]);
}
} | 48 |
23,741 | int a[10][10],b[10][10];
void f(int x,int y)
{
int i,j;
for(i=x-1;i<=x+1;i++) for (j=y-1;j<=y+1;j++)
b[i][j]+=a[x][y];
}
int main()
{
int day,i,k,j;
for (i=1;i<=9;i++) for (j=1;j<=9;j++)
{
a[i][j]=0; b[i][j]=0;
}
cin>>a[5][5];
cin>>day;
for (k=1;k<=day;k++)
{
for (i=1;i<=9;i++) for (j=1;j<=9;j++) f(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++) cout<<a[i][j]<<" ";
cout <<a[i][9]<<endl;
}
return 0;
}
| 48 |
23,742 | 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 |
23,743 | int main()
{
int i,j,m,n,k;
scanf("%d%d",&m,&n);
int xj[50][9]={0};
xj[4][4]=m;
for(k=1;k<=n;k++)
{
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
xj[i+k*9][j]+=xj[i+(k-1)*9][j]*2;
xj[i-1+k*9][j-1]+=xj[i+(k-1)*9][j];
xj[i-1+k*9][j]+=xj[i+(k-1)*9][j];
xj[i-1+k*9][j+1]+=xj[i+(k-1)*9][j];
xj[i+k*9][j-1]+=xj[i+(k-1)*9][j];
xj[i+k*9][j+1]+=xj[i+(k-1)*9][j];
xj[i+1+k*9][j-1]+=xj[i+(k-1)*9][j];
xj[i+1+k*9][j]+=xj[i+(k-1)*9][j];
xj[i+1+k*9][j+1]+=xj[i+(k-1)*9][j];
}
}
}
for(i=0;i<9;i++)
{
printf("%d %d %d %d %d %d %d %d %d\n",xj[i+9*n][0],xj[i+9*n][1],xj[i+9*n][2],xj[i+9*n][3],xj[i+9*n][4],xj[i+9*n][5],xj[i+9*n][6],xj[i+9*n][7],xj[i+9*n][8]);
}
return 0;
}
| 48 |
23,744 | int main()
{
int i,j,m,n,k;
struct point
{
int now;
int answer;
}a[11][11];
scanf("%d",&m);
scanf("%d",&n);
for (i=0;i<11;i++)
for (j=0;j<11;j++)
a[i][j].now=0;
a[5][5].now=m;
for (k=0;k<n;k++)
{
for (i=1;i<10;i++)
for (j=1;j<10;j++)
a[i][j].answer=2*a[i][j].now+a[i-1][j-1].now+a[i-1][j].now+a[i-1][j+1].now+a[i][j-1].now+a[i][j+1].now+a[i+1][j-1].now+a[i+1][j].now+a[i+1][j+1].now;
for (i=1;i<10;i++)
for (j=1;j<10;j++)
a[i][j].now=a[i][j].answer;
}
for (i=1;i<10;i++)
{
for (j=1;j<9;j++)
printf("%d ",a[i][j].now);
printf("%d\n",a[i][9].now);
}
} | 48 |
23,745 |
int main()
{
int i, j, m, n;
int a[10][10], b[10][10];
cin >> m >> n;
for(i = 1; i <= 9; i++)
for(j = 1; j <= 9; j++)
a[i][j] = 0;
a[5][5] = m;
for (int k = 1; k <= n; k++)
{
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(b[i][j] != 0)
{
a[i][j] -= b[i][j];
if(i <= 8 && i >= 2 && j <= 8 && j >= 2)
{
for(int p = i - 1; p <= i + 1; p++)
for(int q = j - 1; q <= j + 1; q++ )
a[p][q] += b[i][j];
a[i][j] += b[i][j];
}
}
}
}
for(i = 1; i <= 9; i++)
{
for(j = 1; j <= 8; j++)
cout << a[i][j] << " ";
cout << a[i][9] << endl;
}
return 0;
}
| 48 |
23,746 | /**
* @file 1.cpp
* @author ??? 1100012944
* @date 2011-11-23
* @description
* ???????????????
*/
int day, num0;
int germf(int x, int y, int t)
{
if ( t == 0 && x == 5 && y == 5 )
return num0;
else if ( t == 0 && x >= 0 && x <= 10 && y >= 0 && y <= 10 )
return 0;
else if ( x >= 5 - day && x <= 5 + day && y >= 5 - day && y <= 5 + day )
return (germf(x - 1, y - 1, t - 1) +
germf(x - 1, y, t - 1) +
germf(x - 1, y + 1, t - 1) +
germf(x, y - 1, t - 1) +
germf(x, y + 1, t - 1) +
germf(x + 1, y - 1, t - 1) +
germf(x + 1, y, t - 1) +
germf(x + 1, y + 1, t - 1) +
2 * germf(x, y, t - 1));
else
return 0;
}
int main()
{
int i, j;
cin >> num0 >> day;
for ( i = 1; i <= 9; i++)
{
cout << germf(i, 1, day);
for ( j = 2; j <= 9; j ++)
cout <<" "<< germf(i,j, day);
cout << endl;
}
return 0;
}
| 48 |
23,747 | int a[20][20];
int b[20][20];
int n,m;
void day(int x)
{
if(x==n+1)
return;
for(int i=1;i<=9;i++)
{
for(int j=1;j<=9;j++)
{
b[i][j]=0;
}
}
for(int i=1;i<=9;i++)
{
for(int j=1;j<=9;j++)
{
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(int i=1;i<=9;i++)
{
for(int j=1;j<=9;j++)
{
a[i][j]+=b[i][j];
}
}
day(x+1);
}
int main()
{
cin>>m>>n;
a[5][5]=m;
day(1);
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;
}
| 48 |
23,748 | 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 |
23,749 | //****************************
//*???:2.cpp *
//*??:?? *
//*????:2013?12?6? *
//*????:???????? *
//****************************
int a[11][11] = {0}; //??????a[][]??????,???b????????????
void done ( int m, int n ) //???done????????a??
{
int b[11][11] = {0}, i, j; //??????b[][]???????????????????????
if ( n == 0 ) //?????????????
a[5][5] = m;
else
{
done ( m, n - 1 ); //??????
for ( i = 1; i <= 9; i ++ ) //??????a
for ( j = 1; j <= 9; j ++ )
{
if ( a[i][j] != 0 ) //??a[][]????????????????
{ //????????????????????????
for ( int k = i - 1; k <= i + 1; k ++ )
for ( int t = j - 1; t <= j + 1; t ++ )
b[k][t] = a[i][j] + b[k][t];
b[i][j] = b[i][j] + a[i][j]; //???????????????????????
}
}
for ( i = 1; i <= 9; i ++ ) //????????b???????a?????????????
for ( j = 1; j <= 9; j ++ )
a[i][j] = b[i][j];
}
}
int main() //???
{
int m, n, i, j; //??????m,????n
cin >> m >> n;
done ( m, n ); //????done???
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,750 | int a[10][10];
void does(int,int,int);
int main()
{
memset(a,0,sizeof(a) );
a[5][5]=1;
int n,m;
int i,j;
cin >> m >> n;
does(5,5,n);
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{
if(j<9)
cout << m*a[i][j] << ' ';
else
cout << m*a[i][j] << endl;
}
return 0;
}
void does (int i,int j,int n )
{
if( n>0 )
{
int b;
a[i][j]++;
a[i+1][j]++;
a[i-1][j]++;
a[i][j+1]++;
a[i][j-1]++;
a[i-1][j-1]++;
a[i-1][j+1]++;
a[i+1][j-1]++;
a[i+1][j+1]++;
does(i,j,n-1);
does(i,j,n-1);
does(i,j+1,n-1);
does(i,j-1,n-1);
does(i+1,j,n-1);
does(i-1,j,n-1);
does(i-1,j-1,n-1);
does(i-1,j+1,n-1);
does(i+1,j-1,n-1);
does(i+1,j+1,n-1);
}
} | 48 |
23,751 | 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 |
23,752 | void step(int a[N][N])
{
int b[N][N]={0};
int i,j,k,l;
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
{
b[i][j]=a[i][j];
a[i][j]=0;
}
}
for(i=1;i<N-1;i++)
{
for(j=1;j<N;j++)
{
if(b[i][j]>0)
{
for(k=i-1;k<=i+1;k++)
{
for(l=j-1;l<=j+1;l++)
{
a[k][l]+=b[i][j];
}
}
a[i][j]+=b[i][j];
}
}
}
}
int main()
{
int a[N][N]={0},m,n,t,p;
scanf("%d %d",&m,&n);
a[N/2][N/2]=m;
for(t=0;t<n;t++)
{
step(a);
}
for(t=0;t<N;t++)
{
printf("%d",a[t][0]);
for(p=1;p<N;p++)
{
printf(" %d",a[t][p]);
}
printf("\n");
}
return 0;
} | 48 |
23,753 | //************************************************************************
//????????
//??? ???
//??? 12-4
//************************************************************************
int a[9][9]; //?????????
void f(int); //???n????
int main()
{
int m, n; //????????????
int i, j;
cin >> m >> n;
a[4][4] = m;
f(n); //?????????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;
}
void f(int n)
{
int i, j, k, l;
while(n --) //???n???
{
int b[9][9] = {0}; //????????????????
for(i = 0; i < 9; i ++)
for(j = 0; j < 9; j ++)
{
if(a[i][j] != 0) //????????????????????????
{
for(k = i - 1; k <= i + 1; k ++)
for(l = j - 1; l <= j + 1; l ++)
b[k][l] += a[i][j];
b[i][j] += a[i][j];
}
}
for(i = 0; i < 9; i ++) //????????????a
for(j = 0; j < 9; j ++)
a[i][j] = b[i][j];
}
} | 48 |
23,754 | int main()
{
int m,n;
scanf("%d %d",&m,&n);
struct student
{
int nima[9][9];
};
struct student stu[4];
for(int i=1;i<=n;i++)
{
for(int x=0;x<9;x++)
{
for(int y=0;y<9;y++)
{
stu[i-1].nima[x][y]=0;
}
}
if(i==1)
{
stu[i-1].nima[4][4]=2;stu[i-1].nima[4][3]=1;stu[i-1].nima[3][4]=1;stu[i-1].nima[3][3]=1;
stu[i-1].nima[5][3]=1;stu[i-1].nima[3][5]=1;stu[i-1].nima[4][5]=1;stu[i-1].nima[5][5]=1;
stu[i-1].nima[5][4]=1;
}
else
for(int x=4-i;x<5+i;x++)
{
for(int y=4-i;y<5+i;y++)
{
stu[i-1].nima[x][y]=2*stu[i-2].nima[x][y]+stu[i-2].nima[x-1][y-1]+stu[i-2].nima[x-1][y]
+stu[i-2].nima[x-1][y+1]+stu[i-2].nima[x][y-1]+stu[i-2].nima[x][y+1]+stu[i-2].nima[x+1][y-1]
+stu[i-2].nima[x+1][y]+stu[i-2].nima[x+1][y+1];
}
}
}
for(int x=0;x<5;x++)
{
for(int y=0;y<9;y++)
{
if(y==8)printf("%d\n",m*stu[n-1].nima[x][y]);
else printf("%d ",m*stu[n-1].nima[x][y]);
}
}
for(int x=3;x>=0;x--)
{
for(int y=0;y<9;y++)
{
if(y==8)printf("%d\n",m*stu[n-1].nima[x][y]);
else printf("%d ",m*stu[n-1].nima[x][y]);
}
}
}
| 48 |
23,755 | int main()
{
int baci[5][9][9]={0};
int count,days,i,j,k;
cin>>count>>days;
baci[0][4][4]=count;
for(i=0;i<days;i++)
for(j=0;j<9;j++)
for(k=0;k<9;k++)
{
if(baci[i][j][k]!=0)
{
int n=baci[i][j][k];
baci[i+1][j][k]+=2*n;
baci[i+1][j-1][k]+=n;
baci[i+1][j+1][k]+=n;
baci[i+1][j][k-1]+=n;
baci[i+1][j][k+1]+=n;
baci[i+1][j-1][k-1]+=n;
baci[i+1][j-1][k+1]+=n;
baci[i+1][j+1][k-1]+=n;
baci[i+1][j+1][k+1]+=n;
}
}
for(j=0;j<9;j++)
{
cout<<baci[days][j][0];
for(k=1;k<9;k++)
cout<<' '<<baci[days][j][k];
cout<<endl;
}
return 0;
} | 48 |
23,756 | 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 |
23,757 |
struct bacteria
{
int have;
int add;
}a[11][11];
int main()
{
int m,n,i,j,l,k;
memset(a,0,sizeof(struct bacteria)*121);
scanf("%d%d",&a[5][5].have,&n);
for(m=1;m<=n;m++)
{
for(i=5-n;i<=5+n;i++)
{
for(j=5-n;j<=5+n;j++)
{
for(k=-1;k<=1;k++)
{
for(l=-1;l<=1;l++)
{
a[i][j].add+=a[i+l][j+k].have;
}
}
}
}
for(i=5-n;i<=5+n;i++)
{
for(j=5-n;j<=5+n;j++)
{
a[i][j].have+=a[i][j].add;
a[i][j].add=0;
}
}
}
for(i=1;i<10;i++)
{
printf("%d",a[i][1].have);
for(j=2;j<10;j++)
{
printf(" %d",a[i][j].have);
}
printf("\n");
}
return 0;
} | 48 |
23,758 | /*
* 2.Cap
*
* Created on: 2011-11-22
* Author: Administrator
*/
int a[10][10] = {0}, b[10][10] = {0};
void born( int i, int j )
{
int num = b[i][j];
if ( i > 1 )
a[i - 1][j] += num;
if ( i > 1 && j > 1 )
a[i - 1][j - 1] += num;
if ( j > 1 )
a[i][j - 1] += num;
if ( i < 9 && j > 1 )
a[i + 1][j - 1] += num;
if ( i < 9 )
a[i + 1][j] += num;
if ( i < 9 && j < 9 )
a[i + 1][j + 1] += num;
if ( j < 9 )
a[i][j + 1] += num;
if ( i > 1 && j < 9 )
a[i - 1][j + 1] += num;
a[i][j] += num;
}
int main()
{
int m, n, i, j, k;
cin >> 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] = a[i][j];
}
}
for ( i = 1; i <= 9; i++ )
{
for ( j = 1; j <= 9; j++ )
{
born( i, j );
}
}
memset( b, 0, sizeof(b));
}
for ( i = 1; i <= 9; i++ )
{
for ( j = 1; j <= 8; j++ )
{
cout << a[i][j] << " ";
}
cout << a[i][9];
cout << endl;
}
return 0;
}
| 48 |
23,759 | int main()
{
int a[11][11],b[11][11];
int m,n,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;
}
}
a[5][5]=m;
for(k=1;k<=n;k++)
{
for(i=1;i<10;i++)
{
for(j=1;j<10;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=0;i<11;i++)
{
for(j=0;j<11;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][9]);
}
return 0;
}
| 48 |
23,760 | 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 |
23,761 | int map[2][12][12];
void Make(int,int,int);
int main()
{
int i,j;
int m,n,turn=0;
memset(map,0,sizeof(map));
map[0][5][5]=1;
map[1][5][5]=1;
cin>>m>>n;
for(;n>0;--n)
{
turn=1-turn;
for(i=0;i<12;++i)
{
for(j=0;j<12;++j)
{
map[1-turn][i][j]=0;
}
}
for(i=1;i<=9;++i)
{
for(j=1;j<=9;++j)
{
Make(i,j,turn);
}
}
}
for(i=1;i<=9;++i)
{
cout<<map[1-turn][i][1]*m;
for(j=2;j<=9;++j)
{
cout<<" "<<map[1-turn][i][j]*m;
}
cout<<endl;
}
return 0;
}
void Make(int x,int y,int t)
{
int n=map[t][x][y];
map[1-t][x][y]+=n*2;
map[1-t][x-1][y]+=n;
map[1-t][x+1][y]+=n;
map[1-t][x][y-1]+=n;
map[1-t][x][y+1]+=n;
map[1-t][x-1][y-1]+=n;
map[1-t][x-1][y+1]+=n;
map[1-t][x+1][y-1]+=n;
map[1-t][x+1][y+1]+=n;
return;
}
| 48 |
23,762 | int main()
{
int a[9][9]={0},m,n,i,j,k,num[9][9];
cin>>m>>n;
a[4][4]=m;
for(i=0;i<n;i++)
{
for(j=0;j<9;j++)
for(k=0;k<9;k++)
num[j][k]=0;
for(j=0;j<9;j++)
for(k=0;k<9;k++)
if(a[j][k]!=0)//????????
{
num[j+1][k]=num[j+1][k]+a[j][k];
num[j-1][k]=num[j-1][k]+a[j][k];
num[j][k+1]=num[j][k+1]+a[j][k];
num[j][k-1]=num[j][k-1]+a[j][k];
num[j-1][k-1]=num[j-1][k-1]+a[j][k];
num[j-1][k+1]=num[j-1][k+1]+a[j][k];
num[j+1][k-1]=num[j+1][k-1]+a[j][k];
num[j+1][k+1]=num[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]*2;
}
for(j=0;j<9;j++)//????????
for(k=0;k<9;k++)
a[j][k]=a[j][k]+num[j][k];
}
for(j=0;j<9;j++)//????
{
for(k=0;k<9;k++)
{
if(k==0) cout<<a[j][k];
else cout<<' '<<a[j][k];
}
cout<<endl;
}
return 0;
} | 48 |
23,763 |
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 |
23,764 | int main()
{
int m,n,i,j,k;
scanf("%d %d",&m,&n);
int a[5][11][11]={{0},{0},{0}};
a[0][5][5]=m;
for (i=1;i<=n;i++)
{
for (j=1;j<10;j++)
{
for(k=1;k<10;k++)
{
a[i][j][k]=2*a[i-1][j][k]+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<10;j++)
{
for (k=1;k<10;k++)
{
printf("%d",a[n][j][k]);
if ((k==9)&&(j!=9)) {printf("\n");}
else if (k!=9) {printf(" ");}
}
}
getchar();
getchar();
getchar();
return 0;
} | 48 |
23,765 | 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];
}
}
for (i = 1; i < 10; i++)
{
for (j = 1; j < 10; j++)
{
board[i][j] = temp[i][j];
}
}
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,766 | main()
{
int a[10][10]={0},b[10][10]={0};
int i,j,k,m,n;
scanf("%d%d",&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)
{
int s=2*a[i][j];int t=a[i][j];
b[i][j]+=s;
b[i][j+1]+=t;b[i][j-1]+=t;b[i+1][j+1]+=t;b[i+1][j-1]+=t;b[i+1][j]+=t;b[i-1][j]+=t;b[i-1][j+1]+=t;b[i-1][j-1]+=t;
}
}
for(int p=1;p<=9;p++)
{
for(int q=1;q<=9;q++)
{
a[p][q]=b[p][q];
b[p][q]=0;
}
}
}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{printf("%d",a[i][j]);
if(j==9)
{printf("\n");}
else{printf(" ");}}
}
| 48 |
23,767 |
int main(int argc, char* argv[])
{
int i,j,k,l,n,m,num,day;
int a[9][9]={0},b[9][9]={0};
scanf("%d%d",&num,&day);
a[4][4]=num;
for(i=0;i<day;i++)
{
memset(b,0,sizeof(b));
for(j=1;j<8;j++)
for(k=1;k<8;k++)
{
b[j][k]+=a[j][k];
for(l=-1;l<=1;l++)
for(m=-1;m<=1;m++)
b[j+l][k+m]+=a[j][k];
}
memcpy(a,b,sizeof(a));
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
printf("%d ",a[i][j]);
printf("%d\n",a[i][8]);
}
return 0;
}
| 48 |
23,768 | int main()
{
int m,n,i,j,k,x,y;
scanf("%d %d",&m,&n);
int u[10][10]={0};
int q[10][10]={0};
u[4][4]=m;
q[4][4]=m;
for(k=1;k<=n;k++){
for(i=0;i<9;i++){
for(j=0;j<9;j++){
if(q[i][j]!=0)
{
u[i][j]+=q[i][j];
u[i-1][j-1]+=q[i][j];
u[i-1][j]+=q[i][j];
u[i-1][j+1]+=q[i][j];
u[i][j-1]+=q[i][j];
u[i][j+1]+=q[i][j];
u[i+1][j-1]+=q[i][j];
u[i+1][j]+=q[i][j];
u[i+1][j+1]+=q[i][j];
}
}
}
for(x=0;x<9;x++){
for(y=0;y<9;y++){
q[x][y]=u[x][y];
}
}
}
for(i=0;i<9;i++){
for(j=0;j<9;j++){
if(j==8)
{
printf("%d\n",u[i][j]);
}
else
{
printf("%d ",u[i][j]);
}
}
}
return 0;
} | 48 |
23,769 | main()
{int a[9][9]={0};
int b[9][9];
int p,q,i,j,k,m,n,e,f,l;
scanf("%d %d",&m,&n);
a[4][4]=m;
for(l=0;l<n;l++)
{ for(i=0;i<9;i++)
for(j=0;j<9;j++)
b[i][j]=0;
for(i=1;i<8;i++)
{for(j=1;j<8;j++)
{b[i][j]+=a[i][j];
for(p=-1;p<2;p++)
{for(q=-1;q<2;q++)
b[i+p][j+q]+=a[i][j];}
}
}
for(e=0;e<9;e++)
{for(f=0;f<9;f++)
a[e][f]=b[e][f];
}
}
for(i=0;i<9;i++)
{for(j=0;j<9;j++)
{if(j<8) {printf("%d",a[i][j]);printf(" ");}
else if(j==8) {printf("%d",a[i][j]);printf("\n");}
}
}
}
| 48 |
23,770 | int main()
{
int i=0,j=0,m=0,n=0,a[10][10]={0},p=0,k=0,l=0,t=0,q=0;
cin>>m>>n;
a[4][4]=m;
for(p=0;p<n;p++)
{
int b[10][10]={0};
for(i=1;i<8;i++)
for(j=1;j<8;j++)
{
b[i][j]=b[i][j]+a[i][j];
for(t=-1;t<=1;t++)
for(q=-1;q<=1;q++)
b[i+t][j+q]=b[i+t][j+q]+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++)
cout<<a[i][j]<<" ";
cout<<a[i][8]<<endl;
}
return 0;
}
| 48 |
23,771 | int main(){
static int a[10][20][20],n;
cin>>a[0][5][5]>>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+1][y+1]+=a[i-1][x][y];
a[i][x+1][y]+=a[i-1][x][y];
a[i][x+1][y-1]+=a[i-1][x][y];
a[i][x-1][y+1]+=a[i-1][x][y];
a[i][x-1][y]+=a[i-1][x][y];
a[i][x-1][y-1]+=a[i-1][x][y];
a[i][x][y+1]+=a[i-1][x][y];
a[i][x][y-1]+=a[i-1][x][y];
a[i][x][y]+=2*a[i-1][x][y];
}
}
//??
for(int x=1;x<=9;x++){
for(int y=1;y<=9;y++){
if(y>1)cout<<" ";
cout<<a[n][x][y];
}
cout<<endl;
}
//cin>>n;
return 0;
}
| 48 |
23,772 | int main()
{
int a[10][10],b[10][10];
int m,n;
int i,j,d;
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(d=0;d<n;d++)
{
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
b[i][j]=a[i][j];
}
for(i=5-d;i<=5+d;i++)
{
for(j=5-d;j<=5+d;j++)
{
a[i][j]=b[i][j]*2+a[i][j]-b[i][j];
a[i-1][j-1]=b[i][j]+a[i-1][j-1];
a[i-1][j]=b[i][j]+a[i-1][j];
a[i-1][j+1]=b[i][j]+a[i-1][j+1];
a[i][j-1]=b[i][j]+a[i][j-1];
a[i][j+1]=b[i][j]+a[i][j+1];
a[i+1][j-1]=b[i][j]+a[i+1][j-1];
a[i+1][j]=b[i][j]+a[i+1][j];
a[i+1][j+1]=b[i][j]+a[i+1][j+1];
}
}
}
for(i=1;i<10;i++)
{
for(j=1;j<9;j++)
printf("%d ",a[i][j]);
printf("%d\n",a[i][9]);
}
return 0;
}
| 48 |
23,773 | int a[9][9];
int b[9][9];
int main()
{
int m, n;
cin >> m >> n;
memset(a,0,sizeof(a));
a[4][4]=m;
int i, x, y;
for (i = 0; i !=n;i++)
{
memset(b,0,sizeof(b));
for (x=1;x!=8;x++)
for(y=1;y!=8;y++)
{
b[x][y]+=2*a[x][y];
b[x-1][y-1]+=a[x][y];b[x-1][y]+=a[x][y];b[x-1][y+1]+=a[x][y];b[x][y-1]+=a[x][y];b[x][y+1]+=a[x][y];b[x+1][y-1]+=a[x][y];b[x+1][y]+=a[x][y];b[x+1][y+1]+=a[x][y];
}
memcpy(a,b,sizeof(a));
}
for(x=0;x!=9;x++)
{
for(y=0;y!=9;y++)
{
if(y==0)
cout << a[x][y];
else
cout << ' ' << a[x][y];
}
cout << endl;
}
return 0;
}
| 48 |
23,774 | //********************************
//*??????????? **
//*?????? 1300012713 **
//*???2013.12.05 **
//********************************
int board[10][10] = {0}; //??????????
int board1[10][10] = {0}; //??????????
void day(int a, int b, int c) //?????????a??????b????c
{
if(a == c) //?????
{
for(int i = 1; i <= 9; i++)
{
for(int j = 1; j <= 9; j++)
{
cout << board[i][j];
if(j < 9)
cout << " ";
if(j == 9)
cout << "\n";
}
}
return;
}
for(int k = 1; k <= 9; k++) //??
{
for(int l = 1; l <= 9; l++)
{
if(board[k][l]!=0) //?????????????????????
{
if(k > 1)
board1[k-1][l] += board[k][l];
if(k < 9)
board1[k+1][l] += board[k][l];
if(l > 1)
board1[k][l-1] += board[k][l];
if(l < 9)
board1[k][l+1] += board[k][l];
if(k > 1 && l > 1)
board1[k-1][l-1] += board[k][l];
if(k > 1 && l < 9)
board1[k-1][l+1] += board[k][l];
if(k < 9 && l > 1)
board1[k+1][l-1] += board[k][l];
if(k < 9 && l < 9)
board1[k+1][l+1] += board[k][l];
board1[k][l] += board[k][l] * 2;
board[k][l] = 0;
}
}
}
for(int p = 1; p <= 9; p++) //????????????????
{
for(int q = 1; q <= 9; q++)
{
board[p][q] = board[p][q] + board1[p][q];
board1[p][q] = 0;
}
}
day(a+1, b, c); //?????
}
int main()
{
int m, n;
cin >> m >> n; //??
board[5][5] = m; //?????
day(0,m,n); //??
return 0;
}
| 48 |
23,775 | int map[10][10],add[10][10],m,n;
//????
void Generate(int x,int y){
int v = map[x][y];
for(int i = -1;i<=1;i++){
for(int j = -1;j<=1;j++){
if(i==0&&j==0) add[x+i][y+j]+=v*2;
else add[x+i][y+j]+=v;
}
}
return;
}
int main(){
cin>>m>>n;
memset(map,0,sizeof(map));
map[5][5] = m;
for(int k = 0;k<n;k++){
memset(add,0,sizeof(add));
for(int i = 1;i<10;i++){
for(int j = 1;j<10;j++){
if(map[i][j]!=0) Generate(i,j);
}
}
for(int i = 1;i<10;i++){
for(int j = 1;j<10;j++){
map[i][j]=add[i][j];
}
}
}
for(int i = 1;i<10;i++){
for(int j = 1;j<10;j++){
if(j!=1) cout<<" "<<map[i][j];
else cout<<map[i][j];
}
cout<<endl;
}
return 0;
}
| 48 |
23,776 | int main()
{
int a[9][9],b[9][9]; //?????????????
int i=0,j=0,m=0,n=0,k=0,l=0;
cin>>m>>n;
for ( i=0;i<9;i++ )
{
for ( j=0;j<9;j++ )
{
a[i][j]=b[i][j]=0;
}
}
b[4][4]=m;
while ( k<n )
{
for ( i=0;i<9;i++ ) //???a????????
{
for ( j=0;j<9;j++ )
{
if (b[i][j]!=0)
{
a[i-1][j-1]=a[i-1][j-1]+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][j-1]=a[i][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+1][j]=a[i+1][j]+b[i][j];
a[i+1][j+1]=a[i+1][j+1]+b[i][j];
}
}
}
for ( i=0;i<9;i++ ) //?b???????????
{
for ( j=0;j<9;j++ )
{
b[i][j]=2*b[i][j]+a[i][j];
a[i][j]=0; //???a????????
}
} //??b??????????????????
k++;
}
for ( i=0;i<9;i++ )
{
for ( j=0;j<9;j++ )
{
if ( j!=8 )
cout<<b[i][j]<<" ";
else if ( j==8 )
cout<<b[i][j]<<endl;
}
}
return 0;
} | 48 |
23,777 | int main()
{
int a[11][11]={0},b[11][11]={0},i=1,j=1,t=1,number,time;
cin>>number>>time;
a[5][5]=number;
for(i=1;i<=time;i++)
{
for(j=1;j<=9;j++)
{
for(t=1;t<=9;t++)
{
if(a[j][t]!=0)
{
b[j][t]+=2*a[j][t];
b[j+1][t]+=a[j][t];
b[j-1][t]+=a[j][t];
b[j+1][t+1]+=a[j][t];
b[j-1][t+1]+=a[j][t];
b[j+1][t-1]+=a[j][t];
b[j-1][t-1]+=a[j][t];
b[j][t+1]+=a[j][t];
b[j][t-1]+=a[j][t];
}
}
}
for(j=1;j<=9;j++)
{
for(t=1;t<=9;t++)
{
a[j][t]=b[j][t];
b[j][t]=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 |
23,778 |
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 |
23,779 | //***************************
//??????? *
//?????? 1100012895 *
//???2011-11-23 *
//***************************
int main()
{
int Ground[5][11][11] = {0}; // ??????????????????
cin >> Ground[0][5][5]; // ?????????????
int n; // n??????
cin >> n;
// ????????????????????????
int day, j, k;
for (day = 1; day <= n; day++)
for (j = 5 - day; j <= 5 + day; j++)
for (k = 5 - day; k <= 5 + day; k++)
// ?????????????????????????
Ground[day][j][k] = Ground[day - 1][j][k]*2 + Ground[day - 1][j - 1][k - 1]
+ Ground[day - 1][j - 1][k] + Ground[day - 1][j - 1][k + 1] + Ground[day - 1][j][k - 1] + Ground[day - 1][j][k + 1]
+ Ground[day - 1][j + 1][k - 1] + Ground[day - 1][j + 1][k] + Ground[day - 1][j + 1][k + 1];
for (j = 1; j <= 9; j++)
{
cout << Ground[n][j][1];
for (k = 2; k <= 9; k++)
cout << ' ' << Ground[n][j][k];
cout << endl;
}
return 0;
}
| 48 |
23,780 | /**
* @file homework.cpp
* @author ???
* @date 2010-11-24
* @description
* ??????: ????????
*/
int a[11][11] = {0}, k;
void f(int a[][11]);
int main()
{
int m, n;
cin >> m >> n;
k = n;
a[5][5] = m;
f(a);
return 0;
}
void f(int c[][11])
{
int s, t, b[11][11];
for(t = 0;t < 121;t++)
{
b[t / 11][t % 11] = *(*a + t);
}
for(s = 1;s < 10;s++)
{
for(t = 1;t < 10;t++)
{
a[s][t] = 2 * b[s][t] + b[s][t - 1] + b[s][t + 1] +
b[s - 1][t] + b[s - 1][t - 1] + b[s - 1][t + 1] +
b[s + 1][t] + b[s + 1][t - 1] + b[s + 1][t + 1];
}
}
cout << endl;
if(k > 1)
{
k--;
f(a);
}
if(k == 1)
{
for(s = 1;s < 10;s++)
{
for(t = 1;t < 9;t++)
{
cout << a[s][t] << " ";
}
cout << a[s][9] << endl;
}
k--;
}
}
| 48 |
23,781 | void fanzhi(int x,int y,int n);//??????????????
int a[9][9];
int add[9][9];
int main()
{
int i,j=0;
//???
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++)
add[i][j]=0;
int m=0,n=0;
cin>>m>>n;
a[4][4]=m;
int k=0;
for (k=1;k<=n;k++)
{
for (i=0;i<9;i++)
for (j=0;j<9;j++)
add[i][j]=0;
for (i=0;i<9;i++)
for (j=0;j<9;j++)
fanzhi(i,j,a[i][j]);//??????????
for (i=0;i<9;i++)
for (j=0;j<9;j++)
a[i][j]=add[i][j];
}
for (i=0;i<9;i++)
for (j=0;j<9;j++)
{
cout<<a[i][j];
if (j!=8)
cout<<" ";
else if (i!=8)
cout<<endl;
}
return 0;
}
void fanzhi(int x,int y,int n)
{
add[x-1][y]+=n;
add[x+1][y]+=n;
add[x][y-1]+=n;
add[x][y+1]+=n;
add[x][y]+=n*2;
add[x-1][y-1]+=n;
add[x-1][y+1]+=n;
add[x+1][y-1]+=n;
add[x+1][y+1]+=n;
} | 48 |
23,782 | int main()
{
int i,j,t,m,n,r,s,a[9][9],b[9][9];
scanf("%d %d",&m,&n);
for(j=0;j<9;j++)
{
for(i=0;i<9;i++)
{
a[j][i]=0;
b[j][i]=0;
}
}
a[4][4]=m;
b[4][4]=m;
for(t=1;t<=n;t++)
{
for(r=4-t;r<=2+t;r++)
{
for(s=4-t;s<=2+t;s++)
{
for(j=0;j<=2;j++)
{
for(i=0;i<=2;i++)
{
a[r+j][s+i]+=b[r+1][s+1];
}
}
}
}
for(j=0;j<9;j++)
{
for(i=0;i<9;i++)
{
b[j][i]=a[j][i];
//a[j][i]=0;
}
}
}
for(j=0;j<9;j++)
{
for(i=0;i<8;i++)
{
printf("%d ",b[j][i]);
}
printf("%d\n",b[j][8]);
}
return 0;
}
| 48 |
23,783 | 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 |
23,784 | //********************************
//*?? ??????? *****
//*????? 1300012753 *****
//*???2013.11.19 *****
//********************************
void cal(int a[][9][9], int step)
{
for(int i = 4 - step; i <= 4 + step; i++)
{
for(int j = 4 - step; j <= 4 + step; j++)
{
a[step+1][i-1][j-1] += a[step][i][j];
a[step+1][i-1][j] += a[step][i][j];
a[step+1][i-1][j+1] += a[step][i][j];
a[step+1][i][j-1] += a[step][i][j];
a[step+1][i][j+1] += a[step][i][j];
a[step+1][i+1][j-1] += a[step][i][j];
a[step+1][i+1][j] += a[step][i][j];
a[step+1][i+1][j+1] += a[step][i][j];
a[step+1][i][j] += 2 * a[step][i][j];
}
}
}
int main()
{
int m, n;
cin >> m >> n;
int a[5][9][9];
memset(a,0,sizeof(a));
a[0][4][4] = 1;
for(int i = 0; i < n; i++)
cal(a,i);
for(int i = 0; i < 9; i++)
{
for(int j = 0; j < 9; j++)
{
if(j == 0)
cout << a[n][i][j] * m;
else
cout << ' ' << a[n][i][j] * m;
}
cout << endl;
}
return 0;
} | 48 |
23,785 | int main()
{
int a[12][12]={0},b[12][12]={0};
int i,j,k,f,t,m,n;
scanf("%d %d",&m,&n);
a[5][5]=m;
for(k=0;k<n;k++)
{
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
b[i][j]=2*a[i][j]+a[i-1][j-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(t=1;t<=9;t++)
for(f=1;f<=9;f++)
a[t][f]=b[t][f];
}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{
if(j<=8)
printf("%d ",a[i][j]);
else
printf("%d\n",a[i][j]);
}
}
| 48 |
23,786 | int area[11][11]={0};
void grow(int day)
{
int temp[11][11]={0};
for(int i=1;i<10;i++)
{
for(int j=1;j<10;j++)
{
temp[i-1][j]+=area[i][j]*1;
temp[i+1][j]+=area[i][j]*1;
temp[i][j-1]+=area[i][j]*1;
temp[i][j+1]+=area[i][j]*1;
temp[i+1][j+1]+=area[i][j]*1;
temp[i-1][j+1]+=area[i][j]*1;
temp[i+1][j-1]+=area[i][j]*1;
temp[i-1][j-1]+=area[i][j]*1;
temp[i][j]+=area[i][j]*2;
}
}
for(int i=1;i<10;i++)
{
for(int j=1;j<10;j++)
{
area[i][j]=temp[i][j];
}
}
day-=1;
if(day>0)
{
grow(day);
}
}
void print()
{
for(int i=1;i<10;i++)
{
for(int j=1;j<9;j++)
{
cout<<area[i][j]<<" ";
}
cout<<area[i][9]<<endl;
}
}
int main()
{
int start=0,day=0;
cin>>start>>day;
area[5][5]=start;
grow(day);
print();
return 0;
} | 48 |
23,787 | int main()
{int a[11][11],b[11][11];
int i,j,k,n,m;
scanf("%d %d",&m,&n);
for(i=0;i<11;i++)
for(j=0;j<11;j++)
a[i][j]=0;
a[5][5]=1;
for(k=0;k<n;k++)
{
for(i=1;i<10;i++)
for(j=1;j<10;j++)
b[i][j]=a[i+1][j-1]+a[i+1][j+1]+a[i+1][j]+a[i][j+1]+a[i][j-1]+2*a[i][j]+a[i-1][j-1]+a[i-1][j+1]+a[i-1][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==1)&&(i!=0))
printf("\n");
printf("%d",a[i][j]*m);
if(j!=9)
printf(" ");
}
}
getchar();
getchar();
} | 48 |
23,788 | int main()
{
int m,n,a[82],b[82],i,j;
scanf("%d %d",&m,&n);
for(i=0;i<81;i++)
{
a[i]=0;
}
a[40]=m;
for(i=0;i<n;i++)
{
for(j=0;j<81;j++)
{
if(j==0)
b[j]=2*a[j]+a[j+1]+a[j+9]+a[j+10];
if(j==8)
b[j]=2*a[j]+a[j-1]+a[j+8]+a[j+9];
if(j==72)
b[j]=2*a[j]+a[j-9]+a[j-8]+a[j+1];
if(j==80)
b[j]=2*a[j]+a[j-10]+a[j-9]+a[j-1];
if((j<8)&&(j>0))
b[j]=2*a[j]+a[j-1]+a[j+1]+a[j+8]+a[j+9]+a[j+10];
if((j<80)&&(j>72))
b[j]=2*a[j]+a[j-10]+a[j-9]+a[j-8]+a[j-1]+a[j+1];
if((j%9==0)&&(j!=0)&&(j!=72))
b[j]=2*a[j]+a[j-9]+a[j-8]+a[j+1]+a[j+9]+a[j+10];
if((j%9==8)&&(j!=8)&&(j!=80))
b[j]=2*a[j]+a[j-10]+a[j-9]+a[j-1]+a[j+8]+a[j+9];
if((j>9)&&(j<71)&&(j%9!=0)&&(j%9!=8))
b[j]=2*a[j]+a[j-10]+a[j-9]+a[j-8]+a[j-1]+a[j+1]+a[j+8]+a[j+9]+a[j+10];
}
for(j=0;j<81;j++)
{
a[j]=b[j];
}
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
printf("%d ",a[9*i+j]);
}
printf("%d\n",a[9*i+8]);
}
//getchar();
//getchar();
return 0;
}
| 48 |
23,789 | int main()
{
int board[9][9],temp[9][9];
int n;
memset(board,0,81*sizeof(int));
cin>>board[4][4]>>n;
while(n--)
{
memset(temp,0,81*sizeof(int));
for(int i=1;i<8;i++)
{
for(int j=1;j<8;j++)
{
if(board[i][j]>0)
{
temp[i][j]+=(2*board[i][j]);
temp[i-1][j-1]+=board[i][j];
temp[i-1][j]+=board[i][j];
temp[i-1][j+1]+=board[i][j];
temp[i][j-1]+=board[i][j];
temp[i][j+1]+=board[i][j];
temp[i+1][j-1]+=board[i][j];
temp[i+1][j]+=board[i][j];
temp[i+1][j+1]+=board[i][j];
}
}
}
for(int i=0;i<9;i++)
{
for(int j=0;j<9;j++)
{
board[i][j]=temp[i][j];
}
}
}
for(int i=0;i<9;i++)
{
cout<<board[i][0];
for(int j=1;j<9;j++)
{
cout<<' '<<board[i][j];
}
cout<<endl;
}
return 0;
} | 48 |
23,790 | int main()
{
int a[5][11][11]={0};
int i,j,k;
int m,n;
scanf("%d %d",&m,&n);
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]=2*a[i][j][k]+a[i][j][k-1]+a[i][j][k+1]+a[i][j-1][k-1]+
a[i][j-1][k]+a[i][j-1][k+1]+a[i][j+1][k-1]+a[i][j+1][k]+a[i][j+1][k+1];
}
}
}
for(j=1;j<10;j++)
{
for(k=1;k<10;k++)
{
if(k==9)
printf("%d\n",a[i][j][k]);
else
printf("%d ",a[i][j][k]);
}
}
}
| 48 |
23,791 | main()
{
int a[11][11],b[11][11];
int i,j,k,l,m,n;
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(k=0;k<n;k++)
{
for(i=1;i<10;i++)
{
for(j=1;j<10;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-1]+a[i+1][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\n",a[i][9]);
else
printf("%d ",a[i][j]);
}
}
getchar();
getchar();
}
| 48 |
23,792 | int num[9][9]={0};
int t[9][9]={0};
int main()
{
int n,m;
cin>>m>>n;
num[4][4]+=m;
t[4][4]+=m;
do
{
for(int i=1;i<8;i++)
{
for(int j=1;j<8;j++)
{
int temp=t[i][j];
for(int k=i-1;k<i+2;k++)
{
for(int p=j-1;p<j+2;p++)
{
num[k][p]+=temp;
}
}
}
}
for(int i=1;i<8;i++)
{
for(int j=1;j<8;j++)
{
t[i][j]=num[i][j];
}
}
n--;
}while(n>0);
for(int i=0;i<9;i++)
{
for(int j=0;j<9;j++)
{
cout<<num[i][j];
if(j<8) cout<<" ";
else cout<<endl;
}
}
return 0;
}
| 48 |
23,793 |
int ch[9][9], ch2[9][9];
int main()
{
int m, day;
void d(int);
memset(ch, 0, sizeof ch);
cin >> m >> day;
ch[4][4] = m;
d(day);
return 0;
}
void d(int day)
{
int i, j;
memset(ch2, 0, sizeof ch2);
if(day == 0)
{
for(i = 0; i < 9; i++)
{
for(j = 0; j < 8; j++)
{
cout << ch[i][j] << " ";
}
cout << ch[i][j] << endl;
}
}
else
{
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
if(ch[i][j] != 0)
{
ch2[i][j] = ch[i][j];
ch[i][j] *= 2;
}
}
}
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
if(ch2[i][j])
{
if(i > 0) ch[i - 1][j] += ch2[i][j];
if(i < 8) ch[i + 1][j] += ch2[i][j];
if(j > 0) ch[i][j - 1] += ch2[i][j];
if(j < 8) ch[i][j + 1] += ch2[i][j];
if(i > 0 && j > 0) ch[i - 1][j - 1] += ch2[i][j];
if(i > 0 && j < 8) ch[i - 1][j + 1] += ch2[i][j];
if(i < 8 && j > 0) ch[i + 1][j - 1] += ch2[i][j];
if(i < 8 && j < 8) ch[i + 1][j + 1] += ch2[i][j];
}
}
}
d(day - 1);
}
}
| 48 |
23,794 | 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 |
23,795 | int main()
{
int a[5][9][9],i,j,k,l,m,n;
scanf("%d%d",&m,&n);
for(i=0;i<=n;i++)
{
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
a[i][j][k]=0;
}
}
a[0][4][4]=m;
for(i=0;i<n;i++)
{
for(j=4-i;j<=4+i;j++)
{
for(k=4-i;k<=4+i;k++)
{
l=a[i][j][k];
a[i+1][j-1][k-1]+=l;
a[i+1][j-1][k]+=l;
a[i+1][j-1][k+1]+=l;
a[i+1][j][k-1]+=l;
a[i+1][j][k]+=2*l;
a[i+1][j][k+1]+=l;
a[i+1][j+1][k-1]+=l;
a[i+1][j+1][k]+=l;
a[i+1][j+1][k+1]+=l;
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
printf("%d ",a[n][i][j]);
printf("%d\n",a[n][i][8]);
}
return 0;
}
| 48 |
23,796 | int a[9][9],b[9][9];
int main()
{
int m,n,i,j,k,x,y;
cin>>m>>n;
a[4][4]=m;
for(i=0;i<n;i++)
{
for(j=0;j<9;j++)
for(k=0;k<9;k++)
{
b[j][k]=0;
for( x=j-1;x<=j+1;x++)
for( y=k-1;y<=k+1;y++)
if(x>=0&&x<9&&y>=0&&y<9)
b[j][k]+=a[x][y];
b[j][k]+=a[j][k];
}
for(j=0;j<9;j++)
for(k=0;k<9;k++)
a[j][k]=b[j][k];
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
cout<<a[i][j]<<" ";
cout<<a[i][j]<<endl;
}
return 0;
}
| 48 |
23,797 | int a[9][9][2];
int temp;
void run()
{
for(int i=0;i<9;i++) for(int j=0;j<9;j++)
if(a[i][j][0]) {for(int p=i-1;p<=i+1;p++) for(int q=j-1;q<=j+1;q++) a[p][q][1]+=a[i][j][0];}
for(int i=0;i<9;i++) for(int j=0;j<9;j++) {a[i][j][0]+=a[i][j][1];a[i][j][1]=0;}
}
int main()
{
int m,n;
cin>>m>>n;
for(int i=0;i<9;i++) for(int j=0;j<9;j++) a[i][j][0]=a[i][j][1]=0;
a[4][4][0]=m;
for(int s=1;s<=n;s++) run();
for(int i=0;i<9;i++)
{
cout<<a[i][0][0];
for(int j=1;j<9;j++) cout<<" "<<a[i][j][0];
cout<<endl;
}
} | 48 |
23,798 |
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 a[11][11], 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,799 | 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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.