id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
23,500 | main()
{
int a[9][9];
int i,j;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
a[i][j]=0;
int b[9][9];
for(i=0;i<9;i++)
for(j=0;j<9;j++)
b[i][j]=0;
int m,n;
scanf("%d %d",&m,&n);
a[4][4]=m;
if(n==1)
{
for(i=3;i<6;i++)
for(j=3;j<6;j++)
b[i][j]=a[i][j]+a[4][4];
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
if(j!=8)
printf("%d ",b[i][j]);
else
{
printf("%d",b[i][j]);printf("\n");
}
}
}
else if(n==2)
{
for(i=3;i<6;i++)
for(j=3;j<6;j++)
b[i][j]=a[i][j]+a[4][4];
for(i=3;i<6;i++)
for(j=3;j<6;j++)
a[i][j]=b[i][j];
for(i=2;i<7;i++)
for(j=2;j<7;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<9;i++)
for(j=0;j<9;j++)
{
if(j!=8)
printf("%d ",b[i][j]);
else
{
printf("%d",b[i][j]);printf("\n");
}
}
}
else if(n==3)
{
for(i=3;i<6;i++)
for(j=3;j<6;j++)
b[i][j]=a[i][j]+a[4][4];
for(i=3;i<6;i++)
for(j=3;j<6;j++)
a[i][j]=b[i][j];
for(i=2;i<7;i++)
for(j=2;j<7;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=2;i<7;i++)
for(j=2;j<7;j++)
a[i][j]=b[i][j];
for(i=1;i<8;i++)
for(j=1;j<8;j++)
b[i][j]=2*a[i][j]+a[i-1][j-1]+a[i-1][j]+a[i-1][j+1]+a[i][j-1]+a[i][j+1]+a[i+1][j-1]+a[i+1][j]+a[i+1][j+1];
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
if(j!=8)
printf("%d ",b[i][j]);
else
{
printf("%d",b[i][j]);printf("\n");
}
}
}
else
{
for(i=3;i<6;i++)
for(j=3;j<6;j++)
b[i][j]=a[i][j]+a[4][4];
for(i=3;i<6;i++)
for(j=3;j<6;j++)
a[i][j]=b[i][j];
for(i=2;i<7;i++)
for(j=2;j<7;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=2;i<7;i++)
for(j=2;j<7;j++)
a[i][j]=b[i][j];
for(i=1;i<8;i++)
for(j=1;j<8;j++)
b[i][j]=2*a[i][j]+a[i-1][j-1]+a[i-1][j]+a[i-1][j+1]+a[i][j-1]+a[i][j+1]+a[i+1][j-1]+a[i+1][j]+a[i+1][j+1];
for(i=1;i<8;i++)
for(j=1;j<8;j++)
a[i][j]=b[i][j];
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
if(i==0&&j==0)
b[i][j]=2*a[i][j]+a[i][j+1]+a[i+1][j]+a[i+1][j+1];
else if(i==0&&j==8)
b[i][j]=2*a[i][j]+a[i][j-1]+a[i+1][j]+a[i+1][j-1];
else if(i==8&&j==0)
b[i][j]=2*a[i][j]+a[i][j+1]+a[i-1][j]+a[i-1][j+1];
else if(i==8&&j==8)
b[i][j]=2*a[i][j]+a[i][j-1]+a[i-1][j]+a[i-1][j-1];
else if(i==0)
b[i][j]=2*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];
else if(i==8)
b[i][j]=2*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];
else if(j==0)
b[i][j]=2*a[i][j]+a[i-1][j]+a[i+1][j]+a[i-1][j+1]+a[i][j+1]+a[i+1][j+1];
else if(j==8)
b[i][j]=2*a[i][j]+a[i-1][j]+a[i+1][j]+a[i-1][j-1]+a[i][j-1]+a[i+1][j-1];
else
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<9;i++)
for(j=0;j<9;j++)
{
if(j!=8)
printf("%d ",b[i][j]);
else
{
printf("%d",b[i][j]);printf("\n");
}
}
}
}
| 48 |
23,501 | //****************************************
//*??????????? **
//*?????? 1100012763 **
//*???2011.11.23 **
//****************************************
int zou[2][8]={{-1,-1,-1,0,1,1,1,0},
{-1,0,1,1,1,0,-1,-1}};
int day;
int flag[9][9] , map[9][9] , stack[9][9];
void flood(int count)
{
int i , j , k , x , y;
if (count <= day)
{
for (i = 0; i <= 8; i++)
{
for (j = 0; j <= 8; j++)
if (map[i][j] > 0)
{
flag[i][j] = 1;
stack[i][j] = map[i][j];
}
}
for (i = 0; i <= 8; i++)
{
for (j = 0; j <= 8; j++)
{
if (flag[i][j] > 0)
{
for (k = 0; k <= 7; k++)
{
x = i + zou[0][k];
y = j + zou[1][k];
if (x < 0 || y < 0 || x > 8 || y > 8)
continue;
map[x][y] = map[x][y] + stack[i][j];
}
map[i][j] = map[i][j] + 2 * stack[i][j];
map[i][j] = map[i][j] - stack[i][j];
}
}
}
flood(count + 1);
}
}
int main()
{
int i , j , num;
cin >> num >> day;
for (i = 0; i <= 8; i++)
for (j = 0; j <= 8; j++)
{
map[i][j] = 0;
flag[i][j] = 0;
stack[i][j] = 0;
}
map[4][4] = num;
flood(1);
for (i = 0; i <= 8; i++)
{
if (i > 0)
cout << endl;
for (j = 0; j <= 8; j++)
{
if (j > 0)
cout << ' ';
cout << map[i][j];
}
}
return 0;
}
| 48 |
23,502 | int main()
{
int m, n, i, j, a[10][10] = {0}, k, b[10][10] = {0};
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++)
{
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 = 1; i <= 9; i++)
for (j = 1; j <= 9; j++)
a[i][j] = b[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] << endl;
}
return 0;
}
| 48 |
23,503 |
int main ()
{
const int sz=9;
int a[sz][sz],b[sz][sz];
int i,j,k,m,n,fx,fy;
scanf("%d%d",&m,&n);
memset(a,0,sizeof(a));
a[sz/2][sz/2]=m;
for(k=0;k<n;k++)
{
memset(b,0,sizeof(b));
for(i=1;i<sz-1;i++)
{
for(j=1;j<sz-1;j++)
{
b[i][j]+=a[i][j];
for(fx=-1;fx<=1;fx++)
{
for(fy=-1;fy<=1;fy++)
b[i+fx][j+fy]+=a[i][j];
}
}
}
memcpy(a,b,sizeof(a));
}
for(i=0;i<sz;i++)
{
for(j=0;j<sz-1;j++)
printf("%d ",a[i][j]);
printf("%d\n",a[i][sz-1]);
}
return 0;
} | 48 |
23,504 | main()
{
int i,j,k,n,m,d;
int a[11][11]={0},b[11][11]={0};
scanf("%d %d",&m,&d);
a[5][5]=m;
for(k=1;k<=d;k++)
{
for(i=1;i<10;i++)
for(j=1;j<10;j++)
{
b[i][j]=2*a[i][j]+a[i-1][j]+a[i-1][j-1]+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<10;j++)
{
if(j==1)
printf("%d",a[i][j]);
else
printf(" %d",a[i][j]);
if(j==9)
printf("\n");
}
}
}
| 48 |
23,505 | //*************************
//*??:???????? **
//*??:??? 1300013007**
//*??:2013.12.6 **
//*************************
int bacteria[11][11] = {0}, flag[11][11] = {0}, add[11][11] = {0};
void reproduce(int x, int y)
{
if(x > 1) add[x-1][y] += (bacteria[x][y] / 2);
if(x < 9) add[x+1][y] += (bacteria[x][y] / 2);
if(y > 1) add[x][y-1] += (bacteria[x][y] / 2);
if(y < 9) add[x][y+1] += (bacteria[x][y] / 2);
if(x > 1 && y > 1) add[x-1][y-1] += (bacteria[x][y] / 2);
if(x < 9 && y < 9) add[x+1][y+1] += (bacteria[x][y] / 2);
if(x > 1 && y < 9) add[x-1][y+1] += (bacteria[x][y] / 2);
if(x < 9 && y > 1) add[x+1][y-1] += (bacteria[x][y] / 2);
}
int main()
{
int m, n;
int i, j, k;
cin >> m >> n; //m???????????,n???????
bacteria[5][5] = m;
for(i = 1; i <= n; i++)
{
for(j = 1; j <= 9; j++)
for(k = 1; k <= 9; k++)
if(bacteria[j][k] != 0)
{
flag[j][k] = 1;
bacteria[j][k] *= 2;
}
for(j = 1; j <= 9; j++)
for(k = 1; k <= 9; k++)
if(flag[j][k] != 0)
{
flag[j][k] = 0;
reproduce(j, k);
}
for(j = 1; j <= 9; j++)
for(k = 1; k <= 9; k++)
{
bacteria[j][k] += add[j][k];
add[j][k] = 0;
}
}
for(j = 1; j <= 9; j++)
for(k = 1; k <= 9; k++)
{
if(k == 1)
cout << bacteria[j][k];
else
{
cout << ' ' << bacteria[j][k];
if(k == 9)
cout << endl;
}
}
return 0;
} | 48 |
23,506 | int m,n;
int a[11][11];int b[11][11];
main ()
{
int i,j,h;
memset(a,0,sizeof(int));
memset(b,0,sizeof(int));
scanf("%d %d",&m,&n);
a[5][5]=m;
for (h=1;h<=n;)
{
for (i=0;i<=10;i++)
{
for (j=0;j<=10;j++)
{b[i][j]=a[i][j];}
}
for (i=5-h;i<=5+h;i++)
{
for (j=5-h;j<=5+h;j++)
{
a[i][j]=b[i-1][j-1]+b[i-1][j]+b[i-1][j+1]+b[i][j-1]+2*b[i][j]+b[i][j+1]+b[i+1][j-1]+b[i+1][j]+b[i+1][j+1];
}
}
h++;
}
for (i=1;i<=9;i++)
{
for (j=1;j<=8;j++)
{printf ("%d ",a[i][j]);}
for (j=9;j<=9;j++)
{printf ("%d\n",a[i][j]);}
}
} | 48 |
23,507 | main()
{
int num,day,a[9][9],b[9][9],i,j,k,h,s;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
a[i][j]=0;
scanf("%d%d",&num,&day);
a[4][4]=num;
for(i=0;i<day;i++)
{
for(k=0;k<2*i+3;k++)
for(j=0;j<2*i+3;j++)
b[3-i+k][3-i+j]=0;
for(k=0;k<2*i+1;k++)
for(j=0;j<2*i+1;j++)
for(h=-1;h<2;h++)
for(s=-1;s<2;s++)
b[4-i+k+h][4-i+j+s]= b[4-i+k+h][4-i+j+s]+a[4-i+k][4-i+j];
for(k=0;k<2*i+3;k++)
for(j=0;j<2*i+3;j++)
a[3-i+k][3-i+j]= b[3-i+k][3-i+j]+a[3-i+k][3-i+j];
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{if(j==8)
printf("%d\n",a[i][j]);
else
printf("%d ",a[i][j]);
}
}
| 48 |
23,508 |
int main()
{
int t,i,j,n,k,a[5][9][9];
scanf("%d%d",&n,&k);
for(t=0;t<k+1;t++)
{
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
a[t][i][j]=0;
}
}
}
a[0][4][4]=n;
for(t=0;t<k;t++)
{
for(i=1;i<8;i++)
{
for(j=1;j<8;j++)
{
a[t+1][i][j]+=a[t][i][j]*2;
a[t+1][i+1][j]+=a[t][i][j];
a[t+1][i-1][j]+=a[t][i][j];
a[t+1][i+1][j+1]+=a[t][i][j];
a[t+1][i-1][j-1]+=a[t][i][j];
a[t+1][i][j+1]+=a[t][i][j];
a[t+1][i][j-1]+=a[t][i][j];
a[t+1][i+1][j-1]+=a[t][i][j];
a[t+1][i-1][j+1]+=a[t][i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
printf("%d",a[k][i][j]);
if(j!=8)
{printf(" ");}
}
if(i!=8)
{
printf("\n");
}
}
return 0;
}
| 48 |
23,509 | int main(){
int m,n;
scanf("%d%d",&m,&n);
int a[11][11]={0};
a[5][5]=m;
int r,i,j,i1,j1;
for(r=0;r<n;r++){
int b[11][11]={0};
for(i=1;i<=9;i++){
for(j=1;j<=9;j++){
if(a[i][j]!=0){
for(i1=i-1;i1<=i+1;i1++){
for(j1=j-1;j1<=j+1;j1++){
b[i1][j1]+=a[i][j];
}
}
}
}
}
for(i1=1;i1<=9;i1++){
for(j1=1;j1<=9;j1++){
a[i1][j1]+=b[i1][j1];
}
}
}
for(i=1;i<=9;i++){
for(j=1;j<=9;j++){
printf("%d",a[i][j]);
if(j!=9)
printf(" ");
else
printf("\n");
}
}
}
| 48 |
23,510 |
main()
{
int a[9][9];
int b[9][9];
int m,n,i,j,k;
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
a[i][j]=0;
b[i][j]=0;
}
}
scanf("%d %d",&m,&n);
a[4][4]=m;
b[4][4]=m;
for(k=0;k<n;k++)
{
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
b[i][j]=a[i][j];}}
for(i=4-k;i<=4+k;i++)
{
for(j=4-k;j<=4+k;j++)
{
a[i-1][j]=b[i][j]+a[i-1][j];
a[i-1][j-1]=b[i][j]+a[i-1][j-1];
a[i-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+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][j]=a[i][j]+b[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(j<8)
printf("%d ",a[i][j]);
if(j==8)
printf("%d\n",a[i][j]);
}
}
}
| 48 |
23,511 | int main ( )
{
int m,n,tian,i,j;
int num[6][11][11];
cin>>m>>n;
for(tian=0;tian<=n+1;tian++)
{
for(i=0;i<=10;i++)
{
for(j=0;j<=10;j++)
{
num[tian][i][j]=0;
}
}
}
num[1][5][5]=m;
for(tian=1;tian<=n;tian++)
{
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
num[tian+1][i][j]=2*num[tian][i][j]+num[tian][i-1][j-1]+num[tian][i-1][j]+num[tian][i-1][j+1]+num[tian][i][j-1]+num[tian][i][j+1]+num[tian][i+1][j-1]+num[tian][i+1][j]+num[tian][i+1][j+1];
}
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
if(j!=9)cout<<num[n+1][i][j]<<" ";
else cout<<num[n+1][i][j];
}
cout<<endl;
}
return 0;
} | 48 |
23,512 | int m,n;
int num(int a,int b,int c)
{
int i,j;
if((a==0)||(a==10)||(b==0)||(b==10))
return 0;
else if(c==0)
{
if (a==5&&b==5)
return m;
else return 0;
}
else
{
int d=num(a,b,c-1);
for(i=a-1;i<=a+1;i++)
{
for(j=b-1;j<=b+1;j++)
d=d+num(i,j,c-1);
}
return d;
}
}
int main()
{
int i,j,s;
scanf("%d %d",&m,&n);
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
s=num(i,j,n);
if(j==9)
printf("%d\n",s);
else printf("%d ",s);
}
}
return 0;
}
| 48 |
23,513 | int main()
{
int i, d, n, a[5][9][9]={{0}}, j, k, p, q;
cin >> n >> d;
a[0][4][4]=n;
p=4;
q=4;
for (i=1; i <= d; i++)
{
for (j=p; j <= q; j++)
for (k=p; k <= q; k++)
a[i][j][k] += a[i-1][j][k];
for (j=p; j <= q; j++)
for (k=p; k <= q; k++)
{
a[i][j][k] += a[i-1][j][k];
a[i][j+1][k] += a[i-1][j][k];
a[i][j][k+1] += a[i-1][j][k];
a[i][j-1][k] += a[i-1][j][k];
a[i][j][k-1] += a[i-1][j][k];
a[i][j+1][k+1] += a[i-1][j][k];
a[i][j+1][k-1] += a[i-1][j][k];
a[i][j-1][k+1] += a[i-1][j][k];
a[i][j-1][k-1] += a[i-1][j][k];
}
p--;
q++;
}
for (j=0; j<9; j++)
{
for (k=0; k<8; k++)
cout << a[d][j][k] << ' ';
cout << a[d][j][8] << endl;
}
return 0;
}
| 48 |
23,514 | void birth(int day, int num);
int cnt = 0;
int a[10][10] = {0}, spread[10][10] = {0};
int main()
{
int m, n;
cin >> m >> n; //??
a[4][4] = m;
birth(n,m); //birth???????????
for ( int y = 0; y <= 8; y++ )
{
for ( int o = 0; o <= 7; o++ ) //????
cout << a[y][o] << " ";
cout << a[y][8] << endl;
}
return 0;
}
void birth(int day, int num)
{
cnt++;
if ( cnt > day ) //???????????
return;
for ( int i = 0; i <= 8; i++ ) //?????????????spread???????????
{
for ( int j = 0; j <= 8; j++ )
{
spread[i][j] = a[i][j];
a[i][j] = a[i][j] * 2;
}
}
for ( int k = 0; k <= 8; k++ )
{
for ( int l = 0; l <= 8; l++ )
{
a[k - 1][l] = a[k - 1][l] + spread[k][l]; //????8????
a[k + 1][l] = a[k + 1][l] + spread[k][l];
a[k][l - 1] = a[k][l - 1] + spread[k][l];
a[k][l + 1] = a[k][l + 1] + spread[k][l];
a[k - 1][l - 1] = a[k - 1][l - 1] + spread[k][l];
a[k - 1][l + 1] = a[k - 1][l + 1] + spread[k][l];
a[k + 1][l - 1] = a[k + 1][l - 1] + spread[k][l];
a[k + 1][l + 1] = a[k + 1][l + 1] + spread[k][l];
}
}
birth(day, num); //??
}
| 48 |
23,515 | int c[11][11]={0}; //???n?????
int temp[11][11]={0}; //????n-1?????
int n,m;
int deal(int num);
int main()
{
int i,j;
cin>>m>>n;
c[5][5]=m;
temp[5][5]=m;
deal(1);
for (i=1;i<=9;i++)
{
for (j=1;j<=8;j++)
cout<<c[i][j]<<' ';
cout<<c[i][9];
cout<<endl;
}
return 0;
}
int deal(int num)
{
int i,j;
if (num==n+1) //??????
return 0;
else
{
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
{
c[i][j]+=temp[i][j];
c[i+1][j]+=temp[i][j];
c[i-1][j]+=temp[i][j];
c[i][j+1]+=temp[i][j];
c[i][j-1]+=temp[i][j];
c[i+1][j+1]+=temp[i][j];
c[i+1][j-1]+=temp[i][j];
c[i-1][j+1]+=temp[i][j];
c[i-1][j-1]+=temp[i][j];
}
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
temp[i][j]=c[i][j];
deal(num+1);
}
} | 48 |
23,516 | int main()
{
int m,n,i,j,x,y,aaa,bbb;
int num[9][9][5]={{0}};
scanf("%d %d",&m,&n);
num[4][4][0]=m;
for (i=0;i<=n-1;i++)
{
aaa=0;
bbb=0;
for (x=0;x<=8;x++)
{
for (y=0;y<=8;y++)
{
if (num[y][x][i]!=0)
{
num[y-1][x-1][i+1]+=num[y][x][i];
num[y-1][x][i+1]+=num[y][x][i];
num[y-1][x+1][i+1]+=num[y][x][i];
num[y][x-1][i+1]+=num[y][x][i];
num[y][x+1][i+1]+=num[y][x][i];
num[y+1][x-1][i+1]+=num[y][x][i];
num[y+1][x][i+1]+=num[y][x][i];
num[y+1][x+1][i+1]+=num[y][x][i];
num[y][x][i+1]+=2*num[y][x][i];
aaa++;
}
if (aaa==(2*i+1)*(2*i+1))
{
bbb=1;
break;
}
}
if (bbb==1)break;
}
}
for (y=0;y<=8;y++)
{
for (x=0;x<=8;x++)
{
if (x==8)
{
printf("%d",num[y][x][n]);
}
else
printf("%d ",num[y][x][n]);
}
printf("\n");
}
return 0;
}
| 48 |
23,517 | int main()
{
int i, j, m, day, a[9][9] = {0};
cin >> m >> day;
a[4][4] = m;
while(day--)
{
int b[9][9] = {0};
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
if(a[i][j] > 0)
{
b[i - 1][j - 1] += a[i][j];
b[i - 1][j] += a[i][j];
b[i - 1][j + 1] += a[i][j];
b[i][j - 1] += a[i][j];
b[i][j + 1] += a[i][j];
b[i + 1][j - 1] += a[i][j];
b[i + 1][j] += a[i][j];
b[i + 1][j + 1] += a[i][j];
}
}
}
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
a[i][j] = 2 * a[i][j] + b[i][j];
}
}
}
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
if(j == 0)
{
cout << a[i][j];
}
else if(j == 8)
{
cout << " " << a[i][j] << endl;
}
else if(j > 0 && j < 8)
{
cout << " " << a[i][j];
}
}
}
return 0;
} | 48 |
23,518 |
const int N = 9;
int n,m;
int a[N+1][N+1];
void dfs(int x, int y, int s, int d)
{
if (x<1 || x>N || y<0 || y>N) return;
if (d==m)
{
a[x][y] += s;
return;
}
dfs(x,y,s*2,d+1);
for (int dx=-1;dx<=1;dx++)
for (int dy=-1;dy<=1;dy++)
if (dx!=0 || dy!=0)
dfs(x+dx,y+dy,s,d+1);
}
int main()
{
scanf("%d%d",&n,&m);
memset(a,0,sizeof a);
dfs(5,5,n,0);
for (int i=1;i<=N;i++)
{
for (int j=1;j<N;j++) printf("%d ",a[i][j]);
printf("%d\n",a[i][N]);
}
return 0;
}
| 48 |
23,519 | int n,m;
void num(int a[11][11],int b[11][11],int c)
{
int w;
for(w=0;w<11;w++)
{
a[0][w] = 0;
a[w][0] = 0;
b[0][w] = 0;
b[w][0] = 0;
a[10][w] = 0;
a[w][10] = 0;
b[10][w] = 0;
b[w][10] = 0;
}
int i,j,p,q;
if(c==n+1)
{
for(p = 1;p<=9;p++)
{
for(q=1;q<=8;q++)
{
cout << m*a[p][q]<<" " ;
}
cout << m*a[p][9]<< endl;
}
return;
}
else
{
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
b[i][j] = 2*a[i][j]+a[i-1][j-1]+a[i-1][j]+a[i-1][j+1]+a[i][j-1]+a[i][j+1]+a[i+1][j-1]+a[i+1][j]+a[i+1][j+1];
num(b,a,c+1);
}
}
int main()
{
int i,j;
int bac1[11][11]={0},bac2[11][11] = {0};
bac1[5][5] = 1;
cin >> m >> n;
num(bac1,bac2,1);
return 0;
}
| 48 |
23,520 | //****************************************
//*???????????
//*?????? 1100012789
//*???2011.11.25
//****************************************
int Multi(int x, int y, int day);
int n;
int main()
{
int day, i, j;
cin >> n >> day;
for (i = 1; i < 10; i++) // ?????
{
cout << Multi(i, 1, day);
for (j = 2; j < 10; j++)
cout << " " << Multi(i, j, day);
cout << endl;
}
return 0;
}
int Multi(int x, int y, int day)
{
if (day == 0)
if (x == 5 && y == 5)
return n;
else return 0;
return (Multi(x, y, day - 1) * 2 + Multi(x - 1, y - 1, day - 1) + Multi(x - 1, y, day - 1)
+ Multi(x - 1, y + 1, day - 1) + Multi(x, y - 1, day - 1) + Multi(x, y + 1, day - 1) +
Multi(x + 1, y - 1, day - 1) + Multi(x + 1, y, day - 1) + Multi(x + 1, y + 1, day - 1));
}
| 48 |
23,521 | int main()
{
int a[9][9],b[9][9],c[9][9];
int i,j,m,n,k,p,q;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
a[i][j]=0;
b[i][j]=0;
c[i][j]=0;
}
scanf("%d %d",&m,&n);
a[4][4]=m;
for(k=0;k<n;k++)
{
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
if(a[i][j]!=0)
{
b[i][j]=b[i][j]+3*a[i][j];
b[i][j-1]+=a[i][j];
b[i-1][j]+=a[i][j];
b[i-1][j-1]+=a[i][j];
b[i-1][j+1]+=a[i][j];
b[i][j+1]+=a[i][j];
b[i+1][j]+=a[i][j];
b[i+1][j+1]+=a[i][j];
b[i+1][j-1]+=a[i][j];
}
}
for(p=0;p<9;p++)
for(q=0;q<9;q++)
{
a[p][q]=b[p][q]-a[p][q];
b[p][q]=0;
}
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
if(j==8)
printf("%d\n",a[i][j]);
else printf("%d ",a[i][j]);
}
}
| 48 |
23,522 | int main()
{
int board[11][11][2]={0},i,j,k;
int m,n;//m???????????n???????
cin>>m>>n;
board[5][5][0]=m;
for(k=1;k<=n;k++){
for(i=1;i<=9;i++){
for(j=1;j<=9;j++)
{
board[i][j][1]=board[i][j][0]*2+board[i-1][j-1][0]+board[i-1][j][0]+board[i-1][j+1][0]+board[i][j-1][0]+board[i][j+1][0]+board[i+1][j-1][0]+board[i+1][j][0]+board[i+1][j+1][0];
}}
for(i=1;i<=9;i++){
for(j=1;j<=9;j++){
board[i][j][0]=board[i][j][1];
}}}
for(i=1;i<=9;i++)
{
cout<<board[i][1][1];
for(j=2;j<=9;j++)
{
cout<<' '<<board[i][j][1];
}
cout<<endl;
}
return 0;} | 48 |
23,523 | int j, k, bec[9][9] = {0}, tempbec[9][9] = {0};
void increase(int bec[][9])
{
bec[j - 1][k] += tempbec[j][k];
bec[j - 1][k - 1] += tempbec[j][k];
bec[j - 1][k + 1] += tempbec[j][k];
bec[j][k - 1] += tempbec[j][k];
bec[j][k + 1] += tempbec[j][k];
bec[j + 1][k - 1] += tempbec[j][k];
bec[j + 1][k] += tempbec[j][k];
bec[j + 1][k + 1] += tempbec[j][k];
}
int main()
{
int m, n, i = 0, num = 1;
cin >> m >> n;
bec[4][4] = m;
for (i = 0; i < n; i++)
{
for(j = 0; j < 9; j++)
for(k = 0; k < 9; k++)
{
tempbec[j][k] = bec[j][k];
bec[j][k] = bec[j][k] * 2;
}
for (j = 1; j < 8; j++)
for(k = 1; k < 8; k++)
increase (bec);
}
for (j = 0; j < 9; j++)
for (k = 0; k < 9; k++)
{
if(num % 9 == 1)
cout << bec[j][k];
if(num % 9 == 0)
cout << " " << bec[j][k] << "\n";
if(num % 9 != 0 && num % 9 != 1)
cout << " " << bec[j][k];
num++;
}
return 0;
}
| 48 |
23,524 | int main()
{
int m,n,i,j,k;
scanf("%d%d",&m,&n);
int a[5][11][11]={0};
a[0][5][5]=m;
for(i=0;i<n;i++)
{
for(j=1;j<10;j++)
{
for(k=1;k<10;k++)
{
a[i+1][j][k]=a[i][j][k]*2+a[i][j+1][k]
+a[i][j-1][k]+a[i][j][k+1]
+a[i][j][k-1]+a[i][j+1][k+1]
+a[i][j+1][k-1]+a[i][j-1][k+1]
+a[i][j-1][k-1];
}
}
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if(j==1)
{printf("%d",a[n][i][j]);}
if(j>1)
{printf(" %d",a[n][i][j]);}
}
if(i<9)
{printf("\n");}
}
}
| 48 |
23,525 | // lp.cpp : Defines the entry point for the console application.
//
// ??????.cpp : Defines the entry point for the console application.
//
int a[10][10],b[10][10]={0};
int n,m;
void f(int a[10][10])
{
int i,j;
while(n>0)
{
for(i=0;i<9;i++)
{
for(j=0;j<9;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-1][j]+=a[i][j];
b[i][j]+=a[i][j]*2;
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];
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
a[i][j]=b[i][j];
b[i][j]=0;
}
}
n--;
}
}
int main()
{
int i,j;
cin>>m>>n;
memset(a,0,100);
a[4][4]=m;
f(a);
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
if(j<8)
cout<<a[i][j]<<' ';
else
{
cout<<a[i][j]<<endl;
}
}
return 0;
} | 48 |
23,526 | int main()
{
int n,m,a[9][9]={0},temp[9][9]={0};
cin>>n>>m;
a[4][4]=n;
while(m)
{
m--;
for(int i=1;i<8;i++)
{
for(int j=1;j<8;j++)
{
if(a[i][j]!=0)
{
for(int p=i-1;p<=i+1;p++)
{
for(int q=j-1;q<=j+1;q++)
{
temp[p][q]+=a[i][j];
}
}
temp[i][j]+=a[i][j];
}
}
}
for(int i=0;i<9;i++)
{
for(int j=0;j<9;j++)
{
a[i][j]=temp[i][j];
temp[i][j]=0;
}
}
}
for(int i=0;i<9;i++)
{
for(int j=0;j<9;j++)
{
if(j==8)
cout<<a[i][j];
else
cout<<a[i][j]<<" ";
}
cout<<endl;
}
return 0;
} | 48 |
23,527 | main()
{
int i,j,m,n,k;
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;
}
scanf("%d %d",&m,&n);
a[4][4]=m;
b[4][4]=m;
for(k=0;k<n;k++)
{
for(i=1;i<8;i++)
for(j=1;j<8;j++)
a[i][j]=b[i-1][j-1]+b[i-1][j]+b[i-1][j+1]+b[i][j-1]+b[i][j+1]+b[i+1][j-1]+b[i+1][j]+b[i+1][j+1]+2*b[i][j];
for(i=1;i<8;i++)
{
a[i][0]=b[i-1][0]+b[i+1][0]+b[i-1][1]+b[i][1]+b[i+1][1]+2*b[i][0];
a[i][8]=a[i][0];
}
for(j=1;j<8;j++)
{
a[0][j]=a[j][0];
a[8][j]=a[0][j];
}
a[0][0]=b[0][1]+b[1][0]+b[1][1];
a[0][8]=a[0][0];
a[8][0]=a[0][0];
a[8][8]=a[0][0];
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<8;j++)
printf("%d ",a[i][j]);
printf("%d\n",a[i][8]);
}
getchar();getchar();getchar();getchar();
}
| 48 |
23,528 | /**
*@file 2.cpp
*@author ???
*@date 2013-12-03
*@description ????????
*/
int a[11][11]={0}, b[11][11]={0}, m, n;
void xi(int n)
{
int i, j, p;
if(n==0)
a[5][5]=m;
else
{
xi(n-1);
p=0;
for(i=1; i<=9; i++)
{
for(j=1; j<=9; j++)
{
if(a[i][j]!=0)
{
p++;
}
}
}
p= sqrt(p)/2;
for(i=5-p; i<=5+p; i++)
{
for(j=5-p; j<=5+p; j++)
{
b[i][j]=a[i][j];
a[i][j]=a[i][j] * 2;
}
}
for(i=5-p; i<=5+p; i++)
{
for(j=5-p; j<=5+p; 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];
}
}
}
}
int main()
{
int i, j;
cin >> m >> n;
xi(n);
for(i=1; i<=9; i++)
{
for(j=1; j<=9; j++)
{
cout << a[i][j];
if(j<=8)
cout << " ";
}
cout << endl;
}
return 0;
} | 48 |
23,529 |
int a[9][9],b[9][9];
int main ()
{void F(int x, int y);
int p,q,i,j,t,m,n;
for (i=0;i<9;i++)
for (j=0;j<9;j++)
{a[i][j]=0;b[i][j]=0;}
scanf("%d %d",&m,&n);
a[4][4]=m;
for (t=1;t<=n;t++)
{ for (p=0;p<9;p++)
for (q=0;q<9;q++)
b[p][q]=0;
for (i=0;i<9;i++)
for (j=0;j<9;j++)
F (i,j);
for (p=0;p<9;p++)
for (q=0;q<9;q++)
a[p][q]+=b[p][q];
}
for (i=0;i<9;i++)
{for (j=0;j<8;j++)
printf("%d ",a[i][j]);
printf("%d\n",a[i][8]);
}
}
void F(int x, int y)
{ int i,j,m;
if (a[x][y]>0)
{m=a[x][y];
for (i=-1;i<2;i++)
for (j=-1;j<2;j++)
b[x+i][y+j]+=m;}
}
| 48 |
23,530 | int a[10][10] = {0};
void bac(int n)
{
int i,j;
int b[10][10] = {0};
if (n == 0)
return;
for (i = 1; i <= 9; i++)
{
for (j = 1; j <= 9; j++)
{
if (a[i][j] != 0)
{
b[i - 1][j] += a[i][j];
b[i + 1][j] += a[i][j];
b[i - 1][j - 1]+= a[i][j];
b[i - 1][j + 1]+= a[i][j];
b[i+1][j-1]+=a[i][j];
b[i+1][j+1]+=a[i][j];
b[i][j-1]+=a[i][j];
b[i][j+1]+=a[i][j];
a[i][j] = a[i][j] * 2;
}
}
}
for (i = 1; i<= 9; i++)
for (j = 1; j <= 9; j++)
a[i][j]+=b[i][j];
bac(n - 1);
return;
}
int main()
{
int i,j;
int m, n;
cin >> m >> n;
a[5][5] = m;
bac(n);
for (i = 1; i <= 9; i++)
{
for (j = 1; j<= 8; j++)
cout << a[i][j] << " ";
cout << a[i][j] << endl;
}
return 0;
} | 48 |
23,531 | main()
{ int a[10][10],b[10][10];
int i,j,k,m,n,p,q;
scanf("%d%d",&m,&n);
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
a[i][j]=0;
a[5][5]=m;
/*for (j=1;j<=9;j++)
{
for (k=1;k<=9;k++) printf("%d ",a[j][k]);
printf("\n");}
printf("\n");*/
for (i=1;i<=n;i++)
{for (j=1;j<=9;j++)
for (k=1;k<=9;k++)
b[j][k]=0;
for (j=1;j<=9;j++)
for (k=1;k<=9;k++)
{ b[j][k]=b[j][k]+2*a[j][k];
for (p=-1;p<=1;p++)
for (q=-1;q<=1;q++)
if ((p!=0)||(q!=0)) b[j+p][k+q]=b[j+p][k+q]+a[j][k];
}
for (j=1;j<=9;j++)
for (k=1;k<=9;k++)
a[j][k]=b[j][k];
}
for (j=1;j<=9;j++)
{
for (k=1;k<=9;k++)
{printf("%d",a[j][k]); if (k<9) printf(" ");}
printf("\n");}
}
| 48 |
23,532 | //???1000010179
//????????
int x[9][9]={0};//???????
void peiyang()//????????
{
int temp[9][9]={0},i,j;//temp??????????????????ij?????
//???????temp[i][j]????x[i][j]????????x??
temp[0][0]=x[0][0]*2+x[0][1]+x[1][0]+x[1][1];
for (i=1;i<8;i++)
temp[0][i]=x[0][i]*2+x[0][i-1]+x[0][i+1]+x[1][i-1]+x[1][i]+x[1][i+1];
temp[0][8]=x[0][8]*2+x[0][7]+x[1][7]+x[1][8];
for (i=1;i<8;i++)
{
temp[i][0]=x[i][0]*2+x[i-1][0]+x[i-1][1]+x[i][1]+x[i+1][0]+x[i+1][1];
for (j=0;j<8;j++)
temp[i][j]=x[i][j]*2+x[i-1][j-1]+x[i-1][j]+x[i-1][j+1]+x[i][j-1]+x[i][j+1]+x[i+1][j-1]+x[i+1][j]+x[i+1][j+1];
temp[i][8]=x[i][8]*2+x[i-1][7]+x[i-1][8]+x[i][7]+x[i+1][7]+x[i+1][8];
}
temp[8][0]=x[8][0]*2+x[7][0]+x[7][1]+x[8][1];
for (i=1;i<8;i++)
temp[8][i]=x[8][i]*2+x[7][i-1]+x[7][i]+x[7][i+1]+x[8][i-1]+x[8][i+1];
temp[8][8]=x[8][8]*2+x[7][7]+x[7][8]+x[8][7];
for (i=0;i<9;i++)//?temp???x
for (j=0;j<9;j++)
x[i][j]=temp[i][j];
}
int main()
{
int m,n;//mn???
cin>>m>>n;
x[4][4]=m;//???????m
for (int k=0;k<n;k++)//??peiyang??n????n?????
peiyang();
for (int p=0;p<9;p++)//????
for (int q=0;q<9;q++)
{
if (q==8) cout<<x[p][q]<<endl;
else cout<<x[p][q]<<' ';
}
return 0;
} | 48 |
23,533 | //****************************************
//*??? ??????? **
//*????? 1100012996 **
//*???2011.11.23**
//****************************************
int main()
{
int a[9][9] = {0}, b[9][9];
int i , j , k , m , n , p , q ;
cin >> m >> n;
a[4][4] = m;
for (k = 0; k < n; k++)
{
memset(b , 0 , sizeof(b));
for (i = 1; i < 8; i++)
for (j = 1; j < 8; j++)
{
b[i][j] += a[i][j];
for ( p = -1; p <= 1 ; p++)
for (q = -1; q <= 1; q++)
{
b[i + p][j + q] += a[i][j];
}
}
memcpy(a , b ,sizeof(a));
}
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++)
{
if (j == 0)
{
cout << a[i][j];
}
else
{
cout << " " << a[i][j];
}
if (j == 8)
{
cout << endl;
}
}
return 0;
}
| 48 |
23,534 | void spread (int [9][9]);
int main()
{
int a[9][9];
int m,n;
int i,j;
cin>>m>>n;
for (i=0;i<9;i++)
for (j=0;j<9;j++)
a[i][j]=0;
a[4][4]=m;
for (i=0;i<n;i++)
spread(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;
}
void spread(int a[9][9])
{
int b[9][9];
int i,j;
int p,q;
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 (b[i][j]!=0)
{
for (p=i-1;p<=i+1;p++)
for (q=j-1;q<=j+1;q++)
a[p][q]+=b[i][j];
}
}
}
} | 48 |
23,535 | main()
{
int a[11][11]={0};
int b[11][11];
int m,n,k,i,j;
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]=a[i][j]*2+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<=8;j++)
{
printf("%d ",a[i][j]);
}
printf("%d\n",a[i][j]);
}
}
| 48 |
23,536 | int dx[8]={0,1,-1,0,1,1,-1,-1};
int dy[8]={1,0,-1,-1,1,-1,0,1};
int main() {
long long m,day,a[5][10][10];
cin>>m>>day;
for(int z=0;z<=day;z++)
for(int i=1;i<=9;i++)
for(int j=1;j<=9;j++)
a[z][i][j]=0;
a[0][5][5]=m;
for(int i=0;i<day;i++) {
for(int x=1;x<=9;x++) {
for(int y=1;y<=9;y++) {
for(int k=0;k<8;k++)
a[i+1][x+dx[k]][y+dy[k]]+=a[i][x][y];
a[i+1][x][y]+=a[i][x][y]*2;
}
}
}
for (int x=1;x<=9;x++) {
cout<<a[day][x][1];
for(int y=2;y<=9;y++)
cout<<" "<<a[day][x][y];
cout<<endl;
}
return 0;
} | 48 |
23,537 | int main ()
{ int m,n;
scanf ("%d %d",&m,&n);
int a[121][4];
for (int i=0;i<121;i++)
{ a[i][0]=0;
a[i][1]=0;
a[i][2]=0;
a[i][3]=0;
}
a[60][0]=m;
int k,i;
for (k=1;k<n+1;k++)
{
for ( i=1;i<10;i++)
{
for (int j=1;j<10;j++)
{ a[i*11+j][k]=a[(i-1)*11+j][k-1]+a[(i-1)*11+j-1][k-1]+a[(i-1)*11+j+1][k-1]+a[i*11+j-1][k-1]+a[i*11+j+1][k-1]+a[(i+1)*11+j+1][k-1]+a[(i+1)*11+j][k-1]+a[(i+1)*11+j-1][k-1]+2*a[i*11+j][k-1];
}
}
}
for (int i=1;i<10;i++)
{printf ("%d %d %d %d %d %d %d %d %d\n",a[i*11+1][n],a[i*11+2][n],a[i*11+3][n],a[i*11+4][n],a[i*11+5][n],a[i*11+6][n],a[i*11+7][n],a[i*11+8][n],a[i*11+9][n]);
}
} | 48 |
23,538 | //*******************************************
//** ???Dec 3, 2013 - ???????? **
//** ?????? 1300012719 **
//** ???2013.12.06 **
//*******************************************
int bacnum(int x, int y, int day, int bacteria[9][9]) //??????????????????,?????????=??????????*2+???????????
{
int temp = 0;
if (day == 0) //???0????????????,?????????
return bacteria[x][y];
temp = temp + 2 * bacnum(x,y,day-1,bacteria); //???????????????????+????(?????????)???????
if (x > 0 && y > 0)
temp = temp + bacnum(x-1,y-1,day-1,bacteria);
if (x > 0 && y < 8)
temp = temp + bacnum(x-1,y+1,day-1,bacteria);
if (x < 8 && y > 0)
temp = temp + bacnum(x+1,y-1,day-1,bacteria);
if (x < 8 && y < 8)
temp = temp + bacnum(x+1,y+1,day-1,bacteria);
if (x > 0)
temp = temp + bacnum(x-1,y,day-1,bacteria);
if (x < 8)
temp = temp + bacnum(x+1,y,day-1,bacteria);
if (y > 0)
temp = temp + bacnum(x,y-1,day-1,bacteria);
if (y < 8)
temp = temp + bacnum(x,y+1,day-1,bacteria);
return temp; //???????????
}
int main()
{
int bacteria[9][9], day, i, j; //bacteria????????????,day?????
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++)
bacteria[i][j] = 0;
cin >> bacteria[4][4] >> day; //???????,??????????????
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
cout << bacnum(i,j,day,bacteria); //???day?????????????
if (j < 8)
cout << " ";
else
cout << endl;
}
}
return 0;
}
| 48 |
23,539 | int pymbg[11][11]={0},pymed[11][11]={0};
void peiyang(int n)
{
int i,j;
if(n!=0)
{
for (i=1;i<10;i++)for(j=1;j<10;j++)
{
pymed[i][j]=pymed[i][j]+pymbg[i][j];
pymed[i][j-1]=pymed[i][j-1]+pymbg[i][j];
pymed[i][j+1]=pymed[i][j+1]+pymbg[i][j];
pymed[i+1][j]=pymed[i+1][j]+pymbg[i][j];
pymed[i+1][j-1]=pymed[i+1][j-1]+pymbg[i][j];
pymed[i+1][j+1]=pymed[i+1][j+1]+pymbg[i][j];
pymed[i-1][j]=pymed[i-1][j]+pymbg[i][j];
pymed[i-1][j-1]=pymed[i-1][j-1]+pymbg[i][j];
pymed[i-1][j+1]=pymed[i-1][j+1]+pymbg[i][j];
}
for (i=1;i<10;i++)for(j=1;j<10;j++) pymbg[i][j]=pymed[i][j];
n--;
peiyang(n);
}
}
int main( )
{
int m,n,i,j;
cin>>m>>n;
pymbg[5][5]=m;
pymed[5][5]=m;
peiyang(n);
for (i=1;i<10;i++)
{
for (j=1;j<9;j++) cout<<pymbg[i][j]<<' ';
cout<<pymbg[i][9];
cout<<'\n';
}
return 0;
} | 48 |
23,540 | int main()
{
int m=0,n=0; int i=0,j=0,k=0; //??????m,n???????????????????????i,j,k??????0?
int total[11][11]={{0}},born[11][11]={{0}}; //????total,born??????????????????
cin>>m>>n; //?????
total[5][5]=m;
for(k=0;k<n;k++) //??????
{
for(i=1;i<10;i++) //??????????????
{
for(j=1;j<10;j++)
born[i][j]=2*total[i][j]+total[i-1][j]+total[i-1][j-1]+total[i-1][j+1]+total[i][j-1]+total[i][j+1]+total[i+1][j-1]+total[i+1][j]+total[i+1][j+1];
}
for(i=1;i<10;i++) //???????
{
for(j=1;j<10;j++)
{
total[i][j]=born[i][j];
}
}
for(i=1;i<10;i++) //born?????
{
for(j=1;j<10;j++)
born[i][j]=0;
}
}
for(i=1;i<10;i++) //?????
{
for(j=1;j<10;j++)
{
cout<<total[i][j];
if(j==9)
cout<<endl;
else cout<<" ";
}
}
return 0;
} | 48 |
23,541 |
int vir[11][11] = {0}, m, n, b[11][11], i = 0, j = 0;
int num(int, int, int);
int main()
{
int t;
cin >> m >> n;
vir[5][5] = m;
for (i = 1; i < 10; i++)
{
for (j = 1; j < 10; j++)
{
b[i][j] = num(n, i ,j );
}
}
for (i = 1; i < 10; i++)
{
for (j = 1; j < 9; j++)
{
cout << b[i][j] << " ";
}
cout << b[i][9] << endl;
}
cin >> i;
return 0;
}
int num(int n, int i, int j)
{
if(i < 1 || j < 1 || n < 0 || i > 9 || j > 9)
return 0;
if(n == 0)
{
if (i == 5 && j == 5)
return m;
else
return 0;
}
return (num(n - 1, i - 1, j- 1) + num(n - 1, i - 1, j) + num(n - 1, i - 1, j + 1) + num(n - 1, i, j - 1) + num(n - 1, i, j) * 2 + num(n - 1, i, j + 1) + num(n - 1, i + 1, j - 1) + num(n - 1, i + 1, j) + num(n - 1, i + 1, j + 1));
}
| 48 |
23,542 | int main(){
int a[11][11],b[11][11];
int i,j,k,m,n,day;
for(i=0;i<=10;i++){
for(j=0;j<=10;j++){
a[i][j]=b[i][j]=0;
}
}
scanf("%d %d",&m,&n);
a[5][5]=m;
for(day=1;day<=n;day++){
for(i=1;i<=9;i++){
for(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(i=1;i<=9;i++){
for(j=1;j<=9;j++){
a[i][j] += b[i][j];
b[i][j] = 0;
}
}
}
for(i=1;i<=9;i++){
for(j=1;j<=8;j++){
printf("%d ",a[i][j]);
}
printf("%d\n",a[i][9]);
}
return 0;
}
| 48 |
23,543 | void main(){
long d,i,j,m,n,a[11][11][5]={0,0};
scanf("%d%d",&m,&n);
a[5][5][0]=m;
for(d=1;d<=n;d++)
for(i=1;i<10;i++)
for(j=1;j<10;j++)
a[i][j][d]=
a[i-1][j-1][d-1]
+a[i][j-1][d-1]
+a[i-1][j][d-1]
+a[i][j][d-1]*2
+a[i+1][j-1][d-1]
+a[i+1][j][d-1]
+a[i+1][j+1][d-1]
+a[i-1][j+1][d-1]
+a[i][j+1][d-1];
for(i=1;i<10;i++)printf("%ld %ld %ld %ld %ld %ld %ld %ld %ld\n",
a[i][1][n],
a[i][2][n],
a[i][3][n],
a[i][4][n],
a[i][5][n],
a[i][6][n],
a[i][7][n],
a[i][8][n],
a[i][9][n]);}
| 48 |
23,544 | int num[9][9][5];
int day;
int zz(int d)
{
int i,j;
if(d==day+1)
return 0;
if(d!=day+1)
{
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
num[i][j][d]+=2*num[i][j][d-1];
num[i-1][j-1][d]+=num[i][j][d-1];
num[i-1][j][d]+=num[i][j][d-1];
num[i-1][j+1][d]+=num[i][j][d-1];
num[i+1][j-1][d]+=num[i][j][d-1];
num[i+1][j][d]+=num[i][j][d-1];
num[i+1][j+1][d]+=num[i][j][d-1];
num[i][j+1][d]+=num[i][j][d-1];
num[i][j-1][d]+=num[i][j][d-1];
}
}
}
zz(d+1);
return 0;
}
int main()
{
int m;
int i,j,k;
cin>>m>>day;
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
for(k=0;k<day;k++)
num[i][j][k]=0;
}
}
num[4][4][0]=m;
zz(1);
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(j!=8)
cout<<num[i][j][day]<<" ";
if(j==8)
cout<<num[i][j][day]<<'\n';
}
}
return 0;
} | 48 |
23,545 | int main()
{
int i,j,k,a[5][11][11]={0},sum,days;
scanf("%d %d",&sum,&days);
a[0][5][5]=sum;
for(i=1;i<=days;i++)
{
for(j=1;j<11;j++)
{
for(k=1;k<11;k++)
{
a[i][j][k]=a[i-1][j][k]*2+a[i-1][j-1][k]+a[i-1][j+1][k]+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+1]+a[i-1][j+1][k-1]+a[i-1][j+1][k+1];
}
}
}
for(j=1;j<10;j++)
{
for(k=1;k<9;k++)
{
printf("%d ",a[days][j][k]);
}
printf("%d",a[days][j][k]);
printf("\n");
}
return 0;
}
| 48 |
23,546 | int main()
{
int m,n,i,j,k;
scanf("%d %d",&m,&n);
int a[9][9];
int b[9][9];
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
a[i][j]=0;
b[i][j]=0;
}
}
a[4][4]=m;
for(k=1;k<=n;k++)
{
for(i=5-k;i<=3+k;i++)
{
for(j=5-k;j<=3+k;j++)
{
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=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
a[i][j]=b[i][j];
b[i][j]=0;
}
}
}
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
printf("%d",a[i][j]);
if(j<8) printf(" ");
}
if(i<8) printf("\n");
}
return 0;
}
| 48 |
23,547 |
int main(int argc, char* argv[])
{
int m,n,a;
scanf("%d""%d",&m,&n);
int num[5][9][9];
int i,j,k;
for(i=0;i<5;i++)
{
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
{
num[i][j][k]=0;
}
}
}
num[0][4][4]=m;
for(i=0;i<n;i++)
{
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
{
if(num[i][j][k]!=0)
{
a=num[i][j][k];
num[i+1][j][k+1]=num[i+1][j][k+1]+a;
num[i+1][j][k-1]=num[i+1][j][k-1]+a;
num[i+1][j][k]=num[i+1][j][k]+2*a;
num[i+1][j+1][k-1]=num[i+1][j+1][k-1]+a;
num[i+1][j+1][k+1]=num[i+1][j+1][k+1]+a;
num[i+1][j+1][k]=num[i+1][j+1][k]+a;
num[i+1][j-1][k+1]=num[i+1][j-1][k+1]+a;
num[i+1][j-1][k-1]=num[i+1][j-1][k-1]+a;
num[i+1][j-1][k]=num[i+1][j-1][k]+a;
}
}
}
}
for(j=0;j<9;j++)
{
for(k=0;k<8;k++)
{
printf("%d ",num[n][j][k]);
}
printf("%d\n",num[n][j][8]);
}
return 0;
}
| 48 |
23,548 | int main()
{
int a[9][9]={0},b[9][9]={0};
int m,n,i,j,k;
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]+=2*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-1]+=a[i][j];
b[i+1][j+1]+=a[i][j];
b[i+1][j]+=a[i][j];
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
a[i][j]=b[i][j];
b[i][j]=0;
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(j==0)
printf("%d",a[i][j]);
else
printf(" %d",a[i][j]);
}
printf("\n");
}
return 0;
} | 48 |
23,549 | void f(int a[12][12],int m)
{ if(m==0) return ;
int i,j;
int b[12][12]={0};
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{ if(a[i][j]!=0)
{ b[i][j]=b[i][j]+2*a[i][j];
b[i+1][j]=b[i+1][j]+a[i][j];
b[i-1][j]=b[i-1][j]+a[i][j];
b[i+1][j+1]=b[i+1][j+1]+a[i][j];
b[i+1][j-1]=b[i+1][j-1]+a[i][j];
b[i-1][j-1]=b[i-1][j-1]+a[i][j];
b[i-1][j+1]=b[i-1][j+1]+a[i][j];
b[i][j+1]=b[i][j+1]+a[i][j];
b[i][j-1]=b[i][j-1]+a[i][j];
}
}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{ a[i][j]=b[i][j];
}
f(a,m-1);
}
int main()
{ int a[12][12]={0};
int n,m;
cin>>n>>m;
a[5][5]=n;
f(a,m);
int i,j;
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,550 | //**************************
//???????????
//?????
//???2011-11-30
//**************************
int main()
{
int i, j, m, n, a[9][9], b[9][9], x, y, d;
cin >> m >> n;
for(i = 0;i < 9;i++)
for(j = 0;j < 9;j++)
a[i][j] = 0; //????
a[4][4] = m;
for(d = 1;d <= n;d++)
{
for(x = 0;x < 9;x++)
for(y = 0;y < 9;y++)
b[x][y] = 0; //????
for(i = 1;i < 8;i++)
{
for(j = 1;j < 8;j++)
{
if(a[i][j] != 0) //????????????????b???
{
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][j + 1] = b[i][j + 1] + a[i][j];
b[i][j - 1] = b[i][j - 1] + a[i][j];
b[i + 1][j] = b[i + 1][j] + a[i][j];
b[i + 1][j - 1] = b[i + 1][j - 1] + a[i][j];
b[i + 1][j + 1] = b[i + 1][j + 1] + a[i][j];
b[i][j] = b[i][j] + 2 * a[i][j];
}
}
}
for(i = 0;i < 9;i++)
{
for(j = 0;j < 9;j++) //?????????????a??
{
a[i][j] = b[i][j];
}
}
}
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;
}
return 0;
} | 48 |
23,551 | int main ()
{
int a[10][11][11]={0};
int m,n,j=0,k=0,i=0;
cin>>m>>n;
a[0][5][5]=m;
for(j=1;j<n+1;j++)
for(k=1;k<10;k++)
for(i=1;i<10;i++)
{
a[j][k][i]=a[j-1][k-1][i-1]+a[j-1][k-1][i]+a[j-1][k-1][i+1]+a[j-1][k][i-1]+a[j-1][k][i+1]+a[j-1][k+1][i-1]+a[j-1][k+1][i]+a[j-1][k+1][i+1]+2*a[j-1][k][i];
}
for(j=1;j<10;j++)
for(k=1;k<10;k++)
{
if(k==9)
cout<<a[n][j][k]<<'\n';
else
cout<<a[n][j][k]<<' ';
}
return 0;
}
| 48 |
23,552 | //********************************
//*??:????**
//*????? 1300012839 **
//*???2013.12.6**
//******************************** //??????????
int main()
{
int bac[5][13][13] = {0},m ,n ,day ,i ,j ,k ,l; //????????????????????
cin >> m >> n; //m????5?5????????n???
bac[0][5][5] = m;
for(day = 1;day <= n;day++) //????
{
for(int i = 1;i <= 9;i++)
{
for(j = 1;j <= 9;j++)
{
bac[day][i][j] = 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]; //??????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,553 | void fanzhi(int a[][9], int b[][9], int n, int count);
int main()
{
int m, n;
int a[9][9] = {0}, b[9][9] = {0};
cin >> m >> n;
a[4][4] = m;
b[4][4] = m;
fanzhi(a, b, n, 0);
return 0;
}
void fanzhi(int a[][9], int b[][9], int n, int count)
{
int i, j;
if(count == n)
{
for(i = 0; i < 9; i++)
for(j = 0; j < 9; j++)
{
if(j == 8)
cout << a[i][j] << endl;
else
cout << a[i][j] << " ";
}
}
else
{
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
if(b[i][j] > 0)
{
a[i - 1][j] += b[i][j];
a[i - 1][j - 1] += b[i][j];
a[i - 1][j + 1] += b[i][j];
a[i][j - 1] += b[i][j];
a[i][j + 1] += b[i][j];
a[i + 1][j - 1] += b[i][j];
a[i + 1][j] += b[i][j];
a[i + 1][j + 1] += b[i][j];
a[i][j] += b[i][j];
}
}
}
for(i = 0; i < 9; i++)
for(j = 0; j < 9; j++)
b[i][j] = a[i][j];
count ++;
fanzhi(a, b, n, count);
}
} | 48 |
23,554 | int a[20][20],b[20][20];
void print()
{
int i,j;
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]);
}
main()
{ int m,n,i,j,d;
scanf("%d %d",&m,&n);
for (i=0;i<=10;i++)
for (j=0;j<=10;j++)
a[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]=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]*2;
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][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];
}
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
a[i][j]=b[i][j];
if (d==n)
print();
}
}
| 48 |
23,555 | int q[9][9]={0},mark[9][9]={0},a[9][9]={0};//????
int d[8][2]={{-1,0},{0,-1},{1,0},{0,1},{-1,-1},{-1,1},{1,-1},{1,1}};//??????
void kuosan(int i,int n)//????
{
if(i==n+1)//????n?
{
for(int k=0;k<9;k++)
{
for(int l=0;l<9;l++)
{
if(l==0)cout<<q[k][0];
else cout<<' '<<q[k][l];
}
cout<<endl;
}
}//????
else
{
for(int j=0;j<9;j++)
for(int k=0;k<9;k++)
a[j][k]=q[j][k];//???q?????a?
for(int j=0;j<9;j++)
for(int k=0;k<9;k++)
if(mark[j][k]>0&&mark[j][k]<=i)
{
a[j][k]=a[j][k]+2*q[j][k];
for(int p=0;p<8;p++)
{
a[j+d[p][0]][k+d[p][1]]=a[j+d[p][0]][k+d[p][1]]+q[j][k];
if(mark[j+d[p][0]][k+d[p][1]]==0)mark[j+d[p][0]][k+d[p][1]]=i+1;
}
}//????
for(int j=0;j<9;j++)
for(int k=0;k<9;k++)
q[j][k]=a[j][k]-q[j][k];//??????
kuosan(i+1,n);//??????
}
}
int main()
{
int m,n;
cin>>m>>n;//??m,n
q[4][4]=m;mark[4][4]=1;//???
kuosan(1,n);
return 0;
} | 48 |
23,556 | int main()
{
int n, m, i, j, a[9][9], b[9][9];
cin>>n>>m;
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
a[i][j] = 0;
}
}
int ave, k, x, y;
a[4][4] = n;
for(k = 0; k < m; k++)
{
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)
{
int num = a[i][j];
a[i][j] = 2 * num;
ave = num;
for(x = i - 1; x <= i + 1; x++)
{
for(y = j - 1; y <= j + 1; y++)
{
if(x == i && y == j)
continue;
b[x][y] = b[x][y] + ave;
}
}
}
}
}
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
a[i][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,557 | main()
{
int n,d;
int a[9][9],b[9][9];
scanf("%d %d",&n,&d);
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]=n;
b[4][4]=n;
for(int i=0;i<d;i++)
{
for(int k=0;k<9;k++)
for(int j=0;j<9;j++)
{
b[k][j]*=2;
if(k!=0)b[k][j]+=a[k-1][j];
if(k!=8)b[k][j]+=a[k+1][j];
if(j!=0)b[k][j]+=a[k][j-1];
if(j!=8)b[k][j]+=a[k][j+1];
if(k!=0&&j!=0)b[k][j]+=a[k-1][j-1];
if(k!=8&&j!=0)b[k][j]+=a[k+1][j-1];
if(k!=8&&j!=8)b[k][j]+=a[k+1][j+1];
if(k!=0&&j!=8)b[k][j]+=a[k-1][j+1];
}
for(int k=0;k<9;k++)
for(int j=0;j<9;j++)
a[k][j]=b[k][j];
}
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]);
}
} | 48 |
23,558 | int b[11][11],d[11][11];
void breed();
int main()
{
int days,i,j;
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
b[i][j]=d[i][j]=0;
}
}
cin>>b[5][5]>>days;
for(i=1;i<=days;i++)
{
breed();
}
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
if(j==9)
{
cout<<b[i][j]<<endl;
}
else
{
cout<<b[i][j]<<" ";
}
}
}
return 0;
}
void breed()
{
int i,j;
for(i=1;i<=9;i++)
{
for(j=0;j<=10;j++)
{
d[i][j]=b[i][j];
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
b[i][j]=d[i][j]*2+d[i-1][j-1]+d[i-1][j]+d[i-1][j+1]+d[i][j-1]+d[i][j+1]+d[i+1][j-1]+d[i+1][j]+d[i+1][j+1];
}
}
} | 48 |
23,559 | int main()
{
int m,n;
int a[11][11],add[11][11];
for (int i=0;i<11;i++)
{
for (int j=0;j<11;j++)
{
a[i][j]=0;
add[i][j]=0;
}
}
scanf ("%d %d",&m,&n);
a[5][5]=m;
for (int i=0;i<n;i++)
{
for (int x=1;x<10;x++)
{
for (int y=1;y<10;y++)
add[x][y]=a[x][y]+a[x-1][y]+a[x][y-1]+a[x-1][y-1]+a[x-1][y+1]+a[x][y+1]+a[x+1][y+1]+a[x+1][y]+a[x+1][y-1];
}
for (int x=1;x<10;x++)
{
for (int y=1;y<10;y++)
a[x][y]=a[x][y]+add[x][y];
}
}
for (int i=1;i<10;i++)
{
for (int j=1;j<10;j++)
{
if (j==1) printf ("%d",a[i][j]);
else printf (" %d",a[i][j]);
}
printf ("\n");
}
return 0;
} | 48 |
23,560 |
int main()
{
int a[5][11][11]={0};
int m,n,i,j,k;
cin>>m>>n;
a[0][5][5]=m;
for(i=0;i<n;i++)
for(j=1;j<=9;j++)
for(k=1;k<=9;k++)
{
a[i+1][j][k]=2*a[i][j][k]+a[i][j-1][k-1]+a[i][j-1][k+1]+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];
}
for(j=1;j<=9;j++)
{cout<<a[n][j][1];
for(k=2;k<=9;k++)
cout<<' '<<a[n][j][k];
cout<<endl;
}
return 0;
}
| 48 |
23,561 | main()
{
int m,n,i,j,k;
scanf("%d",&m);
scanf("%d",&n);
int a[11][11];
int b[9][9];
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
a[i][j]=0;
}
}
a[5][5]=m;
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
b[i][j]=0;
}
}
for(i=1;i<=n;i++)
{
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
{
b[j][k]=2*a[j+1][k+1]+a[j][k]+a[j][k+1]+a[j][k+2]+a[j+1][k]+a[j+1][k+2]+a[j+2][k]+a[j+2][k+1]+a[j+2][k+2];
}
}
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
{
a[j+1][k+1]=b[j][k];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
printf("%d ",b[i][j]);
}
printf("%d\n",b[i][8]);
}
}
| 48 |
23,562 | int main ()
{
int i, j, k, num, day;
int a[20][20] = {0};
int b[20][20] = {0};
int temp[20][20] = {0};
cin >> num >> day;
a[5][5] = num;
for ( k = 1; k <= day; k++ )
{
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++ )
b[i][j] = a[i][j];
}
for ( i = 1; i <= 9; i++ )
{
for ( j = 1; j <= 9; j++ )
if ( a[i][j] != 0 )
{
temp[i+1][j]+= a[i][j];
temp[i-1][j]+= a[i][j];
temp[i+1][j+1]+= a[i][j];
temp[i-1][j+1]+= a[i][j];
temp[i+1][j-1]+= a[i][j];
temp[i-1][j-1]+= a[i][j];
temp[i][j+1]+= a[i][j];
temp[i][j-1]+= a[i][j];
temp[i][j]+= 2 * a[i][j];
}
}
for ( i = 1; i <= 9; i++ )
{
for ( j = 1; j <= 9; j++ )
a[i][j]+=temp[i][j], temp[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 <= 8; j++ )
cout << a[i][j] << " ";
cout << a[i][9] << endl;
}
return 0;
} | 48 |
23,563 | int a[31][11][11]={0};
int m;
void f(int k)
{int i,j;
if(k<m+1){
for(i=1;i<=9;i++)
{for(j=1;j<=9;j++)
{a[k][i][j]=2*a[k-1][i][j]+a[k-1][i+1][j]+a[k-1][i-1][j]+a[k-1][i][j+1]+a[k-1][i][j-1]+a[k-1][i+1][j+1]+a[k-1][i-1][j+1]+a[k-1][i+1][j-1]+a[k-1][i-1][j-1];}}
f(k+1);}
else
{for(i=1;i<=9;i++)
{for(j=1;j<9;j++)
cout<<a[m][i][j]<<" ";
cout<<a[m][i][9];
cout<<endl;}}
}
int main()
{
int n;
cin>>n>>m;
a[0][5][5]=n;
f(1);
return 0;
}
| 48 |
23,564 | int main()
{
int i,j,k,n,m,a[11][11],b[11][11];
memset(a,0,sizeof(a));memset(b,0,sizeof(b));
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];
}
memset(a,0,sizeof(a));
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][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(i=1;i<=9;i++)
{
cout <<a[i][1];
for(j=2;j<=9;j++)
{
cout << " " << a[i][j];
if(j==9)
cout << endl;
}
}
return 0;
}
| 48 |
23,565 | int main(){
int a[11][11][5];
int m,n;
scanf("%d%d",&m,&n);
int i,j,k;
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=0;i<=10;i++){
for(j=0;j<=10;j++){
if(i>0&&i<10&&j>0&&j<10){
a[i][j][k]=2*a[i][j][k-1]+a[i-1][j-1][k-1]+a[i-1][j][k-1]+a[i-1][j+1][k-1]+a[i][j-1][k-1]+a[i][j+1][k-1]+a[i+1][j-1][k-1]+a[i+1][j][k-1]+a[i+1][j+1][k-1];
}
else{
a[i][j][k]=a[i][j][k-1];
}
}
}
}
for(i=1;i<=9;i++){
for(j=1;j<=9;j++){
if(j<9){
printf("%d ",a[i][j][n]);
}
if(j==9){
printf("%d\n",a[i][j][n]);
}
}
}
return 0;
}
| 48 |
23,566 | void main()
{
int i,j,k,m,n;
int p,q;
int a[5][9][9]={0};
scanf("%d%d",&m,&n);
a[0][4][4]=m;
for(i=1;i<=n;i++)
{
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
{
if(a[i-1][j][k]!=0)
{
a[i][j][k]+=a[i-1][j][k];
for(p=j-1;p<=j+1;p++)
{
for(q=k-1;q<=k+1;q++)
{
a[i][p][q]=a[i][p][q]+a[i-1][j][k];
}
}
}
}
}
}
for(j=0;j<9;j++)
{
printf("%d",a[n][j][0]);
for(k=1;k<9;k++)
{
printf(" %d",a[n][j][k]);
}
printf("\n");
}
} | 48 |
23,567 | //****************************************
//*?????????? **
//*?????? 1100012920 **
//*???2011.11.28 **
//****************************************
int num[11][11] = {0};
int f(int i, int j, int n);
int main()
{
int m, n, k, i, j;
cin >> m >> n;
num[5][5] = m;
{
for(i = 1; i <= 9; i++)
{
for (j = 1; j < 9; j++)
{
k = f(i, j, n);
cout << k << " ";
}
cout << f(i, 9, n) << endl;
}
}
return 0;
}
int f(int i, int j, int n)
{
if(i == 0 || i == 10 || j == 0 || j == 10)
return 0;
else if ( n == 0)
return num[i][j];
else
return f(i, j, n - 1) * 2
+ f(i + 1, j, n - 1) + f(i - 1, j, n - 1)
+ f(i, j + 1, n - 1) + f(i, j - 1, n - 1)
+ f(i + 1, j + 1, n - 1) + f(i + 1, j - 1, n - 1)
+ f(i - 1, j + 1, n - 1) + f(i - 1, j - 1, n - 1)
;
}
| 48 |
23,568 | int main()
{
int arr[9][9]={{0}},m,n;
cin>>m>>n;
arr[4][4]=m;
for(;n>0;n--)
{
int temp[9][9]={{0}};
for(int i=0;i<9;i++)
for(int j=0;j<9;j++)
{
if(arr[i][j]>0)
{
temp[i][j]+=2*arr[i][j];
temp[i-1][j-1]+=arr[i][j];
temp[i-1][j]+=arr[i][j];
temp[i-1][j+1]+=arr[i][j];
temp[i][j-1]+=arr[i][j];
temp[i][j+1]+=arr[i][j];
temp[i+1][j]+=arr[i][j];
temp[i+1][j-1]+=arr[i][j];
temp[i+1][j+1]+=arr[i][j];
}
}
for(int i=0;i<9;i++)
for(int j=0;j<9;j++)
arr[i][j]=temp[i][j];
}
for(int i=0;i<9;i++)
{
for(int j=0;j<8;j++)
cout<<arr[i][j]<<' ';
cout<<arr[i][8]<<endl;
}
return 0;
} | 48 |
23,569 | int germ[10][10]={0}; //???????????
int m=0,n=0;
void work();
int main()
{
cin>>m>>n;
work();
for(int i=1;i<10;i++) //??
{
for(int j=1;j<9;j++)
cout<<germ[i][j]<<' ';
cout<<germ[i][9]<<endl;
}
return 0;
}
void work()
{
germ[5][5]=m;
int ngerm[10][10]={0}; //????????????
for(int i=0;i<n;i++)
{
int j,k,p,q;
for(j=1;j<=9;j++)
for(k=1;k<=9;k++) // ?????????
{ // ????????
if(germ[j][k]!=0)
{
for(p=j-1;p<=j+1;p++)
for(q=k-1;q<=k+1;q++)
ngerm[p][q]+=germ[j][k];
ngerm[j][k]+=germ[j][k];
}
}
for(j=1;j<=9;j++) //????????????
for(k=1;k<=9;k++)//??????
{
germ[j][k]=ngerm[j][k];
ngerm[j][k]=0;
}
}
}
| 48 |
23,570 | int main()
{
int n,m,i,j,k,l,p,q,a[9][9],b[9][9],d;
scanf("%d %d",&n,&d);
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
a[i][j]=0;
b[i][j]=0;
}
}
a[4][4]=n;
for( ;d>0;d--)
{
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(a[i][j]!=0)
{
b[i][j]+=a[i][j];
for(p=i-1;p<=i+1;p++)
{
for(q=j-1;q<=j+1;q++)
{
b[p][q]+=a[i][j];
}
}
a[i][j]=0;
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
a[i][j]=b[i][j];
b[i][j]=0;
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(j!=8)
{
printf("%d ",a[i][j]);
}
else
{
printf("%d\n",a[i][j]);
}
}
}
return 0;
} | 48 |
23,571 | //????????????????????????
int main()
{
int m,n;
int a[11][11];//a????????
int b[11][11];//b????????
int i,j,k,p,q;
for(i=0;i<11;i++)//???????
for(j=0;j<11;j++)
a[i][j]=0;
for(i=0;i<11;i++)
for(j=0;j<11;j++)
b[i][j]=0;
cin>>m>>n;
a[5][5]=m;//???????m
for(k=1;k<=n;k++)//???n?
{
for(i=1;i<=9;i++)//????????
for(j=1;j<=9;j++)
{
for(p=i-1;p<=i+1;p++)
for(q=j-1;q<=j+1;q++)
b[i][j]+=a[p][q];
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++)//??n??????
{
for(j=1;j<9;j++)
cout<<a[i][j]<<' ';
cout<<a[i][9]<<endl;
}
return 0;
}
| 48 |
23,572 | int b[15][15] = { 0 }, a[15][15] = { 0 }, n = 0;
void f(int t)
{
if (t == n+1)
{
for (int i = 1; i <= 9; i++)
{
for (int k = 1; k <= 8; k++)
{
cout << a[i][k] << " ";
}
cout << a[i][9] << endl;
}
}
else
{
memset(b, 0, sizeof(b));
for (int j = 1; j <= 9; j++)
{
for (int k = 1; k <= 9; k++)
{
if (a[j][k] != 0)
{
for (int p = j - 1; p <= j + 1; p++)
{
for (int q = k - 1; q <= k + 1; q++)
{
b[p][q] += a[j][k];
}
}
b[j][k] += a[j][k];
}
}
}
for (int j = 1; j <= 9; j++)
{
for (int k = 1; k <= 9; k++)
{
a[j][k] = b[j][k];
}
}
f(t + 1);
}
}
int main()
{
int m = 0;
cin >> m >> n;
a[5][5] = m;
f( 1 );
return 0;
} | 48 |
23,573 | int main()
{
int f(int a,int k);
int a[11][11]={0},b[11][11]={0};
int i,j,m,n,t;
scanf("%d %d",&m,&n);
a[5][5]=m;
for(t=1;t<=n;t++)
{
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++)
{
a[i][j]=2*b[i][j]+b[i-1][j-1]+b[i-1][j]+b[i-1][j+1]+b[i][j-1]+b[i][j+1]+b[i+1][j-1]+b[i+1][j]+b[i+1][j+1];
}
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<9;j++)
printf("%d ",a[i][j]);
if(j==9)
printf("%d\n",a[i][j]);
}
return 0;
}
| 48 |
23,574 |
int main()
{
const int n = 9;
int init, days, m[2][n+2][n+2] = {0};
cin >> init >> days;
m[0][5][5] = init;
for (int k = 0; k < days; k++) {
for (int i = 0; i <= n + 1; i++)
for (int j = 0; j <= n + 1; j++)
m[1-k%2][i][j] = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (m[k%2][i][j]) {
m[1-k%2][i+1][j+1] += m[k%2][i][j];
m[1-k%2][i+1][j] += m[k%2][i][j];
m[1-k%2][i+1][j-1] += m[k%2][i][j];
m[1-k%2][i][j+1] += m[k%2][i][j];
m[1-k%2][i][j-1] += m[k%2][i][j];
m[1-k%2][i-1][j+1] += m[k%2][i][j];
m[1-k%2][i-1][j] += m[k%2][i][j];
m[1-k%2][i-1][j-1] += m[k%2][i][j];
m[1-k%2][i][j] += m[k%2][i][j] * 2;
}
}
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
cout << m[days%2][i][j];
if (j == n) cout << endl;
else cout << ' ';
}
return 0;
}
| 48 |
23,575 | int num[9][9] = {0}; //????????
int m;
int f(int a, int b, int day)
{
if ((a == 4) && (b == 4) && (day == 0))
return m; //??????m?
else if ((day == 0) && (a >= 0) && (a <= 8) && (b >= 0) && (b <= 8))
return 0; //???????
else if ((a < 0) || (a > 8) || (b < 0) || (b > 8))
return 0; //??????
else
return f(a - 1, b, day - 1) + f(a + 1, b, day - 1) + f(a, b - 1, day - 1)
+ f(a, b + 1, day - 1) + f(a - 1, b - 1, day - 1) + f(a + 1, b - 1, day - 1)
+f(a - 1, b + 1, day - 1) + f(a + 1, b + 1, day - 1) + 2 * f(a, b, day - 1);
//??????!!????????????????????,??????????,?????????????????????
}
int main()
{
int day, i, j;
cin >> m >> day;
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
num[i][j] = f(i, j, day);
}
}
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
if (j == 8)
{
cout << num[i][j] << endl;
}
else
{
cout << num[i][j] << ' ';//????
}
}
}
return 0;
} | 48 |
23,576 | int m,n,i,j;//m???????????,n???????
int a[10][10]={0};
int pat(int a[][10],int n)
{
int b[10][10],x,y;
if(n==0)
{
for(i=1;i<=9;i++)
{
for(j=1;j<=8;j++)
cout<<a[i][j]<<" ";
cout<<a[i][9]<<endl;
}
return 0;
}
else
{
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
b[i][j]=a[i][j]*2+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(x=1;x<=9;x++)
for(y=1;y<=9;y++)
a[x][y]=b[x][y];
return pat(a,n-1);
}
}
int main()
{
cin>>m>>n;
a[5][5]=m;
pat(a,n);
return 0;
}
| 48 |
23,577 | int main()
{
int n,m;
cin>>n>>m;
int a[20][20]={0};
int x[8]={0,1,0,-1,1,1,-1,-1};
int y[8]={1,0,-1,0,1,-1,1,-1};
int taken[20][20]={0};
a[5][5]=n;
for ( int p=0;p<m;p++)
{
for ( int i=1;i<10;i++)
for ( int j=1;j<10;j++)
{
for( int i_=0;i_<8;i_++)
{
taken[i+x[i_]][j+y[i_]]=a[i][j]+taken[i+x[i_]][j+y[i_]];
}
taken[i][j]=taken[i][j]+a[i][j]*2;
}
for ( int i=1;i<10;i++)
for ( int j=1;j<10;j++)
{
a[i][j]=taken[i][j];
taken[i][j]=0;
}
}
for ( int i=1;i<10;i++)
{
for ( int j=1;j<9;j++)
cout<<a[i][j]<<' ';
cout<<a[i][9]<<endl;
}
return 0;
}
| 48 |
23,578 | //#include<stdlib.h>
//#include<math.h>
int main()
{
int n,m;
int i,j;
int a[11][11];
int 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;
while(n--){
for(i=1;i<10;i++){
for(j=1;j<10;j++){
b[i][j]=a[i][j]*2+a[i-1][j]+a[i+1][j]+a[i][j-1]+a[i][j+1]+a[i-1][j-1]+a[i-1][j+1]+a[i+1][j-1]+a[i+1][j+1];
}
}
for(i=1;i<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][9]);
}
return 0;
}
| 48 |
23,579 | int a[9][9] = {0};
void change(int a[9][9],int k);
int main()
{
int m,n,i,j;
cin >> m >> n;
a[4][4] = m;
change(a,n);
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
if(j != 8)
cout << a[i][j] << " ";
else
cout << a[i][j];
}
cout << endl;
}
return 0;
}
void change(int a[9][9],int k)
{
if(k == 0)
return;
int i,j,sign[9][9] = {0},b[9][9] = {0};
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
if((a[i][j] != 0)&&(sign[i][j] == 0))
{
sign[i][j]++;
b[i][j] = a[i][j];
}
}
}
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
if(sign[i][j] == 1)
{
a[i][j] += 2 * b[i][j];
a[i][j + 1] += b[i][j];
a[i][j - 1] += b[i][j];
a[i + 1][j] += b[i][j];
a[i - 1][j] += b[i][j];
a[i - 1][j - 1] += b[i][j];
a[i - 1][j + 1] += b[i][j];
a[i + 1][j - 1] += b[i][j];
a[i + 1][j + 1] += b[i][j];
}
}
}
for(i = 0; i < 9; i++)
for(j = 0; j < 9; j++)
{
a[i][j] = a[i][j] - b[i][j];
}
change(a,k - 1);
} | 48 |
23,580 | int main()
{
int m, n,b[9][9] = {0},c[9][9] ={0},i,j,k;
cin >> m >> n;
b[4][4] = m;
for (k = 1;k <=n;k++)
{
for (i = 0;i < 9;i++)
for (j = 0;j <9;j++)
{
if (b[i][j]!=0)
{
c[i][j]+=2*b[i][j];
c[i-1][j-1]+=b[i][j];
c[i-1][j]+=b[i][j];
c[i-1][j+1]+=b[i][j];
c[i][j-1]+=b[i][j];
c[i][j+1]+=b[i][j];
c[i+1][j-1]+=b[i][j];
c[i+1][j]+=b[i][j];
c[i+1][j+1]+=b[i][j];
b[i][j] += 0;
}
}
for (i = 0;i <9;i++)
for (j = 0;j <9;j++)
if (c[i][j] !=0)
{
b[i][j] = c[i][j];
c[i][j] = 0;
}
}
for (i = 0;i <9;i++)
{
cout << b[i][0];
for (j = 1;j <9;j++)
cout <<" " << b[i][j];
cout << endl;
}
return 0;
} | 48 |
23,581 | /************************????????*******************
??
????9???????????????m?????????????????????10???????10??????????????????????????????????????????n(1?n?4)????????????????
????
?????????????m????????????2?m?30???????n????????1?m?4??
????
??????????????????????????????n???????????????
????
2 1
????
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 2 2 2 0 0 0
0 0 0 2 4 2 0 0 0
0 0 0 2 2 2 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
**************************************************************
programmer Qiu Hezi
version 1.0
creat date 2013.1.10 21:27
************************************************************/
struct dir
{
int r;
int l;
}direct[8]=
{
{1 ,1}, {1,0} , {1,-1} , {0,1} , {0,-1} , {-1,1} , {-1,0} , {-1,-1}
};
int main ()
{
int m=0 , n=0 ;
cin>>m>>n;
int num[5][9][9]={0};
num[0][4][4]=m;
for (int day=1 ; day<=n ; day++)
{
for (int x=0 ; x<9 ; x++)
{
for (int y=0 ; y<9 ; y++)
{
if (num[day-1][x][y]>0)
{
for (int i=0 ; i<8 ; i++)
num[day][x+direct[i].r][y+direct[i].l]+=num[day-1][x][y];
num[day][x][y]+=num[day-1][x][y]*2;
}
}
}
}
for (int i=0 ; i<9 ; i++)
{
for (int j=0 ; j<9 ; j++)
{
cout<<num[n][i][j];
if (j<8)
cout<<" ";
}
cout<<endl;
}
return 0;
}
| 48 |
23,582 | int i, j, a[10][10] = {0}, b[10][10] = {0}, c, k, l;
void f(int n)
{
if (n == 0)
{
for (j = 1; j <= 9; j++)
{
cout << a[j][1];
for (l = 2; l <= 9; l++)
{
cout << " " << a[j][l];
}
cout << endl ;
}
return;
}
for (i = 0; i <= 80 ;i++)
{
if (b[i/9+1][i%9+1] != 0)
{
c = b[i/9+1][i%9+1];
a[i/9+2][i%9+2] += c;
a[i/9+2][i%9+1] += c;
a[i/9+1][i%9+2] += c;
a[i/9][i%9] += c;
a[i/9+2][i%9] += c;
a[i/9][i%9+2] += c;
a[i/9+1][i%9] += c;
a[i/9][i%9+1] += c;
a[i/9+1][i%9+1] += b[i/9+1][i%9+1];
}
}
for (k = 0; k <= 99; k++)
{
b[k/10][k%10] = a[k/10][k%10];
}
f(n-1);
}
int main()
{
int d;
cin >> a[5][5] >>d;
b[5][5] = a[5][5];
f(d);
return 0;
} | 48 |
23,583 | int main()
{
int i,j,k,a[11][11]={0},b[11][11]={0};
int m,n;
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]=a[i][j]*2+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<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)
printf("%d",b[i][j]);
else
printf(" %d",b[i][j]);
}
printf("\n");
}
return 0;
} | 48 |
23,584 | /*
* 321.cpp
*
* Created on: 2011-1-9
* Author: jsgl
*/
int a[9][9];
int b[9][9];
void fanzhi(int n)
{ if(n==0) return;
int i,j;
for(i=0;i<9;i++){
for(j=0;j<9;j++){
if(a[i][j]!=0){
b[i][j]=b[i][j]+a[i][j]*2;
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][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]=b[i+1][j]+a[i][j];
b[i-1][j]=b[i-1][j]+a[i][j];
}
}
}
for(i=0;i<9;i++){
for(j=0;j<9;j++){
a[i][j]=b[i][j];
b[i][j]=0;
}
}
fanzhi(n-1);
}
int main(){
int i,j;
int m,n;
cin>>m;
cin>>n;
for(i=0;i<9;i++){
for(j=0;j<9;j++){
a[i][j]=0;
if(i==4&&j==4) a[i][j]=m;
b[i][j]=0;
}
}
fanzhi(n);
for(i=0;i<9;i++){
for(j=0;j<9;j++){
if(j!=8)
cout<<a[i][j]<<" ";
else cout<<a[i][j];
}
cout<<endl;
}
}
| 48 |
23,585 |
int main()
{
int m,n;
scanf("%d %d",&m,&n);
int sz[6][9][9];
int day=1;
int i,j,e;
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
sz[0][i][j]=0;
}
}
sz[0][4][4]=m;
for(day=1;day<=n;day++)
{
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
sz[day][i][j]=0;
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(sz[day-1][i][j]!=0)
{
e=sz[day-1][i][j];
sz[day][i-1][j-1]+=e;
sz[day][i-1][j]+=e;
sz[day][i-1][j+1]+=e;
sz[day][i][j-1]+=e;
sz[day][i][j]+=e*2;
sz[day][i][j+1]+=e;
sz[day][i+1][j-1]+=e;
sz[day][i+1][j]+=e;
sz[day][i+1][j+1]+=e;
}
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(j==8)
{
printf("%d\n",sz[n][i][j]);
}
else
{
printf("%d ",sz[n][i][j]);
}
}
}
return 0;
}
| 48 |
23,586 | //????(???)
int chess[15][15][5];
int d;
int f(int i,int j,int k)
{
if(i<1||i>9||j<1||j>9) return 0;
if(chess[i][j][k]!=-1) return chess[i][j][k];
chess[i][j][k]=f(i,j,k-1)*2+f(i,j-1,k-1)+f(i,j+1,k-1)+f(i+1,j,k-1)+f(i-1,j,k-1)+f(i-1,j-1,k-1)+f(i-1,j+1,k-1)+f(i+1,j-1,k-1)+f(i+1,j+1,k-1);
return chess[i][j][k];
}
int main()
{
int i,j,k,s,t;
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
chess[i][j][0]=0;
for(t=1;t<=4;t++)
chess[i][j][t]=-1;
}
}
cin>>chess[5][5][0]>>d;
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,587 |
int main(int argc, char* argv[])
{
int m,n,p;
scanf ("%d%d",&m,&n);
int a[9][9][6],i,j;
for (p=0;p<n+1;p++)
{
for (i=0;i<9;i++)
{
for (j=0;j<9;j++)
{
a[i][j][p]=0;
}
}
}
a[4][4][0]=m;
for (p=1;p<n+1;p++)
{
for (i=1;i<8;i++)
{
for (j=1;j<8;j++)
{
a[i][j][p]=2*a[i][j][p-1]+a[i][j+1][p-1]+a[i][j-1][p-1]+a[i+1][j][p-1]+a[i-1][j][p-1]+a[i-1][j-1][p-1]+a[i-1][j+1][p-1]+a[i+1][j-1][p-1]+a[i+1][j+1][p-1];
}
}
}
if(n==4)
{
for (j=1;j<8;j++)
{
a[0][j][n]=a[1][j][n-1]+a[1][j-1][n-1]+a[1][j+1][n-1];
a[8][j][n]=a[7][j][n-1]+a[7][j-1][n-1]+a[7][j+1][n-1];
}
for (i=1;i<8;i++)
{
a[i][0][n]=a[i][1][n-1]+a[i-1][1][n-1]+a[i+1][1][n-1];
a[i][8][n]=a[i][7][n-1]+a[i-1][7][n-1]+a[i+1][7][n-1];
}
a[0][0][n]=a[0][8][n]=a[8][0][n]=a[8][8][n]=a[7][7][n-1];
}
for (i=0;i<9;i++)
{
for (j=0;j<9;j++)
{
if (j==0)
printf ("%d",a[i][j][n]);
else
printf (" %d",a[i][j][n]);
if (j==8)
printf ("\n");
}
}
scanf ("%d",&i);
return 0;
}
| 48 |
23,588 | int main()
{
int m,n,day,dish[11][11],left[11][11],add[11][11],i,j,k;
cin>>m>>day;
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
dish[i][j]=0;
}
}
dish[5][5]=m;
for(n=0;n<day;n++)
{
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
left[i][j]=2*dish[i][j];
add[i][j]=dish[i][j-1]+dish[i-1][j]+dish[i][j+1]+dish[i+1][j]+dish[i-1][j-1]+dish[i+1][j+1]+dish[i-1][j+1]+dish[i+1][j-1];
}
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
dish[i][j]=left[i][j]+add[i][j];
}
}
}
for(i=1;i<10;i++)
{
k=0;
for(j=1;j<10;j++)
{
if(k==0)
cout<<dish[i][j];
if(k>0)
cout<<" "<<dish[i][j];
k++;
}
cout<<endl;
}
return 0;
} | 48 |
23,589 | int main(){
int a[11][11],b[11][11];
int i,j;
int mushi,nichi,n;
scanf("%d%d",&mushi,&nichi);
for(i=0;i<11;i++){
for(j=0;j<11;j++){
a[i][j]=0;
b[i][j]=0;
}
}
a[5][5]=mushi;
b[5][5]=mushi;
for(n=0;n<nichi;n++){
for(i=0;i<10;i++){
for(j=0;j<10;j++){
b[i][j]+=a[i+1][j-1]+a[i+1][j]+a[i+1][j+1]+a[i][j-1]+a[i][j+1]+a[i-1][j-1]+a[i-1][j]+a[i-1][j+1]+a[i][j];
}
}
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,590 | void bat(int n,int (*p)[11],int (*q)[11],int t) ;
int main ( )
{
int m,n ; //m?????????n?????
int i,j ;
int a[11][11] = {0} ; //??????????????????
int b[11][11] ; //???????????????????
cin >> m >> n ;
a[5][5] = m ;
for( i = 0 ; i <= 10 ; i++ )
{
for( j = 0 ; j <= 10 ; j++ )
{
b[i][j] = a[i][j] ; //????????????????????????
}
}
bat(n,a,b,0) ; //??bat??????????0????0???
return 0 ;
}
void bat(int n,int (*p)[11],int (*q)[11],int t)
{
int i,j ;
if( t == n ) //????????????
{
for( i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
if(j!=9)
cout << *(*(p+i)+j) << " " ;
else
cout << *(*(p+i)+j) ;
//????????????????
}
cout << endl ;
}
return ;
}
//??????????????
for( i = 1 ; i <= 9 ; i++ )
{
for( j = 1 ; j <= 9 ; j++ )
{
(*(*(p+i)+j)) = (*(*(q+i)+j))*2 + (*(*(q+i+1)+j)) +
(*(*(q+i-1)+j)) + (*(*(q+i)+j+1)) +
(*(*(q+i)+j-1)) + (*(*(q+i+1)+j+1)) +
(*(*(q+i-1)+j-1)) + (*(*(q+i-1)+j+1)) +
(*(*(q+i+1)+j-1)) ;
//????????
//?????????????????2?
//???????????????????
}
}
for( i = 0 ; i <= 10 ; i++ )
{
for( j = 0 ; j <= 10 ; j++ )
{
(*(*(q+i)+j)) = (*(*(p+i)+j)) ;
}
} //??(*q)[]??b[][]????????????????????
t++ ; //???1
bat(n,p,q,t) ; //????bat??
} | 48 |
23,591 | int m, n;
int s[9][9];
struct NUM
{
int x;
int y;
int temp;
}ex[81];
void zhou(int,int,int);
int main()
{
cin >> m >> n;
for (int i = 0; i < 9; i++)
for (int j = 0; j < 9; j++)
s[i][j] = 0;
s[4][4] = m;
int p = 0;
for (int t = 1; t <= n; t++)
{
for (int i = 0; i < 9; i++)
for (int j = 0; j < 9 ;j++)
{
if (s[i][j] != 0)
{
int temp = s[i][j] * 8;
s[i][j] = 2 * s[i][j];
ex[p].x = i;
ex[p].y = j;
ex[p].temp = temp;
p++;
}
}
for (int i = 0 ; i < p; i++)
{
zhou(ex[i].x,ex[i].y,ex[i].temp);
}
p = 0;
}
for (int i =0; i < 9; i++)
{
for (int j = 0; j < 9 ; j++)
{
if (j == 0)
cout << s[i][j];
else
cout << " " << s[i][j];
}
cout << endl;
}
return 0;
}
void zhou(int x, int y,int num)
{
int xd[8] = {0,0,1,-1,-1,1,1,-1};
int yd[8] = {1,-1,0,0,-1,1,-1,1};
int sum = 0;
for (int i = 0; i < 8 ;i++)
{
int nx = x + xd[i];
int ny = y + yd[i];
if (nx >= 0 &&nx < 9 && ny >= 0 && ny < 9)
sum++;
}
for (int i = 0; i < 8 ;i++)
{
int nx = x + xd[i];
int ny = y + yd[i];
if (nx >= 0 &&nx < 9 && ny >= 0 && ny < 9)
s[nx][ny] += num / sum;
}
}
| 48 |
23,592 | int bottle[9][9]={0};
int totalday=0;
void mutiply(int day);
int main()
{
cin>>bottle[4][4];
int day;
cin>>totalday;
mutiply(1);
for(int i=0;i<=8;i++)
{ cout<<bottle[i][0];
for(int j=1;j<=8;j++)
{
cout<<' '<<bottle[i][j];
}
cout<<endl;
}
}
void mutiply(int day)
{
if(day==totalday+1)
return ;
int board[9][9]={0};
for(int i=1;i<=7;i++)
for(int j=1;j<=7;j++)
{
board[i][j]=board[i][j]+bottle[i][j]*2;
board[i-1][j]=board[i-1][j]+bottle[i][j];
board[i+1][j]=board[i+1][j]+bottle[i][j];
board[i][j-1]=board[i][j-1]+bottle[i][j];
board[i][j+1]=board[i][j+1]+bottle[i][j];
board[i-1][j-1]=board[i-1][j-1]+bottle[i][j];
board[i-1][j+1]=board[i-1][j+1]+bottle[i][j];
board[i+1][j-1]=board[i+1][j-1]+bottle[i][j];
board[i+1][j+1]=board[i+1][j+1]+bottle[i][j];
}
for(int i=0;i<=8;i++)
for(int j=0;j<=8;j++)
{
bottle[i][j]=board[i][j];
}
mutiply(day+1);
}
| 48 |
23,593 | int a[9][9] = {0}, b[9][9] = {0};
int f(int x,int y)
{
int v = a[x][y] * 2;
if (x > 0)
{
v += a[x - 1][y];
if (y > 0)
v += a[x - 1][y - 1];
}
if (y > 0)
{
v += a[x][y - 1];
if (x < 8)
v += a[x + 1][y - 1];
}
if (x < 8)
{
v += a[x + 1][y];
if (y < 8)
v += a[x + 1][y + 1];
}
if (y < 8)
{
v += a[x][y + 1];
if (x > 0)
v += a[x - 1][y + 1];
}
return v;
}
int main()
{
int m, n, i, j, k;
cin >> m >> n;
a[4][4] = m;
for (i = 1; i <= n; i++)
{
for (j = 0; j <= 8; j++)
{
for (k = 0; k <= 8; k++)
b[j][k] = f(j,k);
}
for (j = 0; j <= 8; j++)
{
for (k = 0; k <= 8; k++)
a[j][k] = b[j][k];
}
}
for (j = 0; j <= 8; j++)
{
for (k = 0; k < 8; k++)
cout << a[j][k] << " ";
cout << a[j][8] << endl;
}
return 0;
}
| 48 |
23,594 | int main()
{
int a[9][9]={{0}},b[9][9]={{0}};
int days,i,j,k,l,m;
cin>>a[4][4]>>days;
for(i=0;i<days;i++)
{for(l=0;l<9;l++)
for(m=0;m<9;m++)
b[l][m]=0;
for(j=1;j<8;j++)
for(k=1;k<8;k++)
{
if(a[j][k]==0)continue;
else
{
b[j][k]+=2*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];
b[j][k+1]+=a[j][k];
b[j-1][k]+=a[j][k];
b[j+1][k]+=a[j][k];
b[j][k-1]+=a[j][k];
a[j][k]=0;
}
}
for(j=0;j<9;j++)
for(k=0;k<9;k++)
a[j][k]=b[j][k];
}
for(j=0;j<9;j++)
{
cout<<a[j][0];
for(k=1;k<9;k++)
{cout<<" "<<a[j][k];}
cout<<endl;
}
cin>>days;
return 0;
}
| 48 |
23,595 | void zengjia();
int num[9][9] = {0};
int main()
{
int m, n, i, j;
cin >> m >> n;
num[4][4] = m;
for (i = 0; i < n; i++)
zengjia();
for (i = 0; i < 9; i++)
{
cout << num[i][0];
for (j = 1; j < 9; j++)
cout << " " << num[i][j];
cout << endl;
}
return 0;
}
void zengjia()
{
int num2[9][9] = {0};
int i, j;
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++)
{
if (num[i][j] > 0)
{
if (i > 0)
num2[i - 1][j] = num[i][j] + num2[i - 1][j];
if (i < 8)
num2[i + 1][j] = num[i][j] + num2[i+ 1][j];
if (j > 0)
num2[i][j - 1] = num[i][j] + num2[i][j - 1];
if (j < 8)
num2[i][j + 1] = num[i][j] + num2[i][j + 1];
if (i > 0 && j > 0)
num2[i - 1][j - 1] = num[i][j] + num2[i - 1][j - 1];
if (i < 8 && j > 0)
num2[i + 1][j - 1] = num[i][j] + num2[i + 1][j - 1];
if (i > 0 && j < 8)
num2[i - 1][j + 1] = num[i][j] + num2[i - 1][j + 1];
if (i < 8 && j < 8)
num2[i + 1][j + 1] = num[i][j] + num2[i + 1][j + 1];
num2[i][j] = num[i][j] * 2 + num2[i][j];
}
}
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++)
num[i][j] = num2[i][j];
return;
} | 48 |
23,596 | int a[11][11],b[11][11];
int k,i,j,t,s,m,n,p,q;
main()
{
cin>>m>>n;
a[5][5]=m;
for(k=0;k<n;k++)
{
t=n%2,s=1-t;
for(i=1;i<10;i++)
for(j=1;j<10;j++)
b[i][j]=0;
for(i=1;i<10;i++)
for(j=1;j<10;j++)
{
b[i][j]+=a[i][j];
for(p=-1;p<=1;p++)
for(q=-1;q<=1;q++)
b[i][j]+=a[i+p][j+q];
}
for(i=1;i<10;i++)
for(j=1;j<10;j++)
a[i][j]=b[i][j];
}
for(i=1;i<10;i++)
{
cout<<a[i][1];
for(j=2;j<10;j++)
cout<<' '<<a[i][j];
cout<<endl;
}
}
| 48 |
23,597 | int main(){
int d,n;
scanf("%d%d",&n,&d);
if(d==1){
int sz[9][9]= {{0,0,0,0,0,0,0,0,0},
{0,0,0,0,0,0,0,0,0},
{0,0,0,0,0,0,0,0,0},
{0,0,0,1*n,1*n,1*n,0,0,0},
{0,0,0,1*n,2*n,1*n,0,0,0},
{0,0,0,1*n,1*n,1*n,0,0,0},
{0,0,0,0,0,0,0,0,0},
{0,0,0,0,0,0,0,0,0},
{0,0,0,0,0,0,0,0,0}};
int i,j;
for(i=0;i<9;i++){
for(j=0;j<8;j++){
printf("%d ",sz[i][j]);
}
printf("%d\n",sz[i][8]);
}
}
if(d==2){
int sz[9][9]={{0,0,0,0,0,0,0,0,0},
{0,0,0,0,0,0,0,0,0},
{0,0,1*n,2*n,3*n,2*n,1*n,0,0},
{0,0,2*n,6*n,8*n,6*n,2*n,0,0},
{0,0,3*n,8*n,12*n,8*n,3*n,0,0},
{0,0,2*n,6*n,8*n,6*n,2*n,0,0},
{0,0,1*n,2*n,3*n,2*n,1*n,0,0},
{0,0,0,0,0,0,0,0,0},
{0,0,0,0,0,0,0,0,0}};
int i,j;
for(i=0;i<9;i++){
for(j=0;j<8;j++){
printf("%d ",sz[i][j]);
}
printf("%d\n",sz[i][8]);
}
}
if(d==3){
int sz[9][9]={{0,0,0,0,0,0,0,0,0},
{0,1*n,3*n,6*n,7*n,6*n,3*n,1*n,0},
{0,3*n,12*n,24*n,30*n,24*n,12*n,3*n,0},
{0,6*n,24*n,51*n,63*n,51*n,24*n,6*n,0},
{0,7*n,30*n,63*n,80*n,63*n,30*n,7*n,0},
{0,6*n,24*n,51*n,63*n,51*n,24*n,6*n,0},
{0,3*n,12*n,24*n,30*n,24*n,12*n,3*n,0},
{0,1*n,3*n,6*n,7*n,6*n,3*n,1*n,0},
{0,0,0,0,0,0,0,0,0}};
int i,j;
for(i=0;i<9;i++){
for(j=0;j<8;j++){
printf("%d ",sz[i][j]);
}
printf("%d\n",sz[i][8]);
}
}
if(d==4){
int sz[9][9]={{1*n,4*n,10*n,16*n,19*n,16*n,10*n,4*n,1*n},
{4*n,20*n,52*n,88*n,104*n,88*n,52*n,20*n,4*n},
{10*n,52*n,142*n,244*n,292*n,244*n,142*n,52*n,10*n},
{16*n,88*n,244*n,428*n,512*n,428*n,244*n,88*n,16*n},
{19*n,104*n,292*n,512*n,616*n,512*n,292*n,104*n,19*n},
{16*n,88*n,244*n,428*n,512*n,428*n,244*n,88*n,16*n},
{10*n,52*n,142*n,244*n,292*n,244*n,142*n,52*n,10*n},
{4*n,20*n,52*n,88*n,104*n,88*n,52*n,20*n,4*n},
{1*n,4*n,10*n,16*n,19*n,16*n,10*n,4*n,1*n}};
int i,j;
for(i=0;i<9;i++){
for(j=0;j<8;j++){
printf("%d ",sz[i][j]);
}
printf("%d\n",sz[i][8]);
}
}
return 0;
} | 48 |
23,598 | int main()
{
int m, n, a[9][9] = {0}, b[9][9] = {0}, d[8][2] = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}, {1, -1}, {-1, 1}, {-1, -1}, {1, 1}};
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] != 0)
{
for (int t = 0; t < 8; t ++)
{
int x = d[t][0];
int y = d[t][1];
b[j + x][k + y] = b[j + x][k + y] + a[j][k];
}
b[j][k] = b[j][k] + 2 * a[j][k];
}
}
for (int j = 0; j < 9; j ++)
for (int k = 0; k < 9; k ++)
{
a[j][k] = b[j][k];
b[j][k] = 0;
}
}
for (int j = 0; j < 9; j ++)
for (int k = 0; k < 9; k ++)
{
if (k < 8)
{
cout << a[j][k] << " ";
}
if (k == 8)
{
cout << a[j][k] << endl;
}
}
return 0;
} | 48 |
23,599 | main()
{
int a[11][11][5]={0},i,j,nd,k,ii,jj;
scanf("%d %d",&a[5][5][0],&nd);
for(k=1;k<=nd;k++)
{
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
a[i][j][k]+=a[i][j][k-1];
for(ii=-1;ii<=1;ii++)
{
for(jj=-1;jj<=1;jj++)
{a[i+ii][j+jj][k]+=a[i][j][k-1];}
}
}
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<=8;j++)
{printf("%d ",a[i][j][nd]);}
printf("%d\n",a[i][j][nd]);
}
}
| 48 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.