label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
48 | 23800 |
int s[6][11][11];
int m, n;
int main()
{
cin >> m >> n;
s[0][5][5] = m;
for (int day = 0; day < n; ++day)
for (int x = 1; x < 10; ++x)
for (int y = 1; y < 10; ++y)
{
s[day + 1][x][y] += 2 * s[day][x][y];
s[day + 1][x - 1][y] += s[day][x][y];
s[day + 1][x + 1][y] += s[day][x][y];
s[day + 1][x][y - 1] += s[day][x][y];
s[day + 1][x][y + 1] += s[day][x][y];
s[day + 1][x - 1][y - 1] += s[day][x][y];
s[day + 1][x + 1][y + 1] += s[day][x][y];
s[day + 1][x + 1][y - 1] += s[day][x][y];
s[day + 1][x - 1][y + 1] += s[day][x][y];
}
for (int x = 1; x < 10; ++x)
{
for (int y = 1; y < 9; ++y)
cout << s[n][x][y] << ' ';
cout << s[n][x][9] << endl;
}
} |
48 | 23801 |
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 | 23802 | int main()
{
int a[11][11];
int b[11][11];
int i,j,k;
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
a[i][j]=0;
b[i][j]=0;
}
}
int m, n;
scanf("%d %d",&m,&n);
a[5][5]=m;
b[5][5]=m;
for(k=0;k<n;k++)
{
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
a[i][j]=2*b[i][j]+b[i-1][j]+b[i+1][j]+b[i-1][j-1]+b[i+1][j-1]+b[i-1][j+1]+b[i+1][j+1]+b[i][j+1]+b[i][j-1];
}
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
b[i][j]=a[i][j];
}
}
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if(j==9)
printf("%d\n",a[i][j]);
else
printf("%d ",a[i][j]);
}
}
return 0;
}
|
48 | 23803 | //********************************
//*??????????? **
//*?????? 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 | 23804 | int main()
{
int m, n;
scanf("%d%d",&m, &n);
if(n==4){
printf("%d %d %d %d %d %d %d %d %d\n",m,4*m,10*m,16*m,19*m,16*m,10*m,4*m,m);
printf("%d %d %d %d %d %d %d %d %d\n",4*m,20*m,52*m,88*m,104*m,88*m,52*m,20*m,4*m);
printf("%d %d %d %d %d %d %d %d %d\n",10*m,52*m,142*m,244*m,292*m,244*m,142*m,52*m,10*m);
printf("%d %d %d %d %d %d %d %d %d\n",16*m,88*m,244*m,428*m,512*m,428*m,244*m,88*m,16*m);
printf("%d %d %d %d %d %d %d %d %d\n",19*m,104*m,292*m,512*m,616*m,512*m,292*m,104*m,19*m);
printf("%d %d %d %d %d %d %d %d %d\n",16*m,88*m,244*m,428*m,512*m,428*m,244*m,88*m,16*m);
printf("%d %d %d %d %d %d %d %d %d\n",10*m,52*m,142*m,244*m,292*m,244*m,142*m,52*m,10*m);
printf("%d %d %d %d %d %d %d %d %d\n",4*m,20*m,52*m,88*m,104*m,88*m,52*m,20*m,4*m);
printf("%d %d %d %d %d %d %d %d %d\n",m,4*m,10*m,16*m,19*m,16*m,10*m,4*m,m);}
if(n==1){
printf("0 0 0 0 0 0 0 0 0\n");
printf("0 0 0 0 0 0 0 0 0\n");
printf("0 0 0 0 0 0 0 0 0\n");
printf("0 0 0 %d %d %d 0 0 0\n",m,m,m);
printf("0 0 0 %d %d %d 0 0 0\n",m,2*m,m);
printf("0 0 0 %d %d %d 0 0 0\n",m,m,m);
printf("0 0 0 0 0 0 0 0 0\n");
printf("0 0 0 0 0 0 0 0 0\n");
printf("0 0 0 0 0 0 0 0 0\n");}
if(n==2){
printf("0 0 0 0 0 0 0 0 0\n");
printf("0 0 0 0 0 0 0 0 0\n");
printf("0 0 %d %d %d %d %d 0 0\n",m,2*m,3*m,2*m,m);
printf("0 0 %d %d %d %d %d 0 0\n",2*m,6*m,8*m,6*m,2*m);
printf("0 0 %d %d %d %d %d 0 0\n",3*m,8*m,12*m,8*m,3*m);
printf("0 0 %d %d %d %d %d 0 0\n",2*m,6*m,8*m,6*m,2*m);
printf("0 0 %d %d %d %d %d 0 0\n",m,2*m,3*m,2*m,m);
printf("0 0 0 0 0 0 0 0 0\n");
printf("0 0 0 0 0 0 0 0 0\n");}
if(n==3){
printf("0 0 0 0 0 0 0 0 0\n");
printf("0 %d %d %d %d %d %d %d 0\n",m,3*m,6*m,7*m,6*m,3*m,m);
printf("0 %d %d %d %d %d %d %d 0\n",3*m,12*m,24*m,30*m,24*m,12*m,3*m);
printf("0 %d %d %d %d %d %d %d 0\n",6*m,24*m,51*m,63*m,51*m,24*m,6*m);
printf("0 %d %d %d %d %d %d %d 0\n",7*m,30*m,63*m,80*m,63*m,30*m,7*m);
printf("0 %d %d %d %d %d %d %d 0\n",6*m,24*m,51*m,63*m,51*m,24*m,6*m);
printf("0 %d %d %d %d %d %d %d 0\n",3*m,12*m,24*m,30*m,24*m,12*m,3*m);
printf("0 %d %d %d %d %d %d %d 0\n",m,3*m,6*m,7*m,6*m,3*m,m);
printf("0 0 0 0 0 0 0 0 0\n");}
return 0;
}
|
48 | 23805 | 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 | 23806 |
int a[11][11] = {0};
int b[11][11] = {0};
void f(int d)
{
if (d == 0)
return;
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];
}
}
f(d - 1);
}
int main()
{
int n, d;
int u, v;
cin >> n >> d;
a[5][5] = n;
f(d);
for (u = 1; u <= 9; u++)
{
for (v = 1; v <= 8; v++)
{
cout << a[u][v] << " ";
}
cout << a[u][9] << endl;
}
return 0;
} |
48 | 23807 | 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 | 23808 | int main ( )
{
int i, j, k, m, n, jun1[9][9] = {0}, jun2[9][9] = {0};
cin >> m >> n;
jun1[4][4] = jun2[4][4] = m;
for(k = 0;k < n;k++)
{
for(i = 0;i < 9;i++)
{
for(j = 0;j < 9;j++)
{
if(jun1[i][j] != 0)
{
jun2[i-1][j] += jun1[i][j];
jun2[i+1][j] += jun1[i][j];
jun2[i][j-1] += jun1[i][j];
jun2[i][j+1] += jun1[i][j];
jun2[i-1][j-1] += jun1[i][j];
jun2[i+1][j-1] += jun1[i][j];
jun2[i-1][j+1] += jun1[i][j];
jun2[i+1][j+1] += jun1[i][j];//8?????????????
jun2[i][j] = 2 * jun1[i][j] + jun2[i][j] - jun1[i][j];//??????????
}
}
}
for(i = 0;i < 9;i++)//????
{
for(j = 0;j < 9;j++)
jun1[i][j] = jun2[i][j];
}
}
for(i = 0;i < 9;i++)
{
for(j = 0;j < 9;j++)
{
if(j == 8)
cout << jun1[i][j] <<endl;
else cout << jun1[i][j] <<' ';
}
}
return 0;
} |
48 | 23809 | 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 | 23810 | void Change(int b[11][11],int day)
{
int i,j,k,l;
int c[11][11]={0};
for(i=1;i<10;i++)
for(j=1;j<10;j++)
{
for(k=i-1;k<=i+1;k++)
for(l=j-1;l<=j+1;l++)
{c[i][j]=c[i][j]+b[k][l];}
c[i][j]=c[i][j]+b[i][j];
}
if(day==1)
for(int p=1;p<10;p++)
{
cout<<c[p][1];
for(int q=2;q<10;q++)
{cout<<" "<<c[p][q];}
cout<<endl;
}
else
Change(c,day-1);
}
int main()
{
int m,n;
cin>>m>>n;
int a[11][11]={0};
a[5][5]=m;
Change(a,n);
cin.get();
return 0;
} |
48 | 23811 | 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 | 23812 | 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 | 23813 |
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 | 23814 | main()
{
int m,n,i,j,k;
struct xijun
{
int a[9][9];
}s[5];
scanf("%d %d",&m,&n);
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(i==4&&j==4)
s[0].a[i][j]=m;
else
s[0].a[i][j]=0;
}
}
for(k=1;k<=n;k++)
{
for(i=1;i<8;i++)
{
for(j=1;j<8;j++)
{
s[k].a[i][j]=2*(s[k-1].a[i][j])+s[k-1].a[i-1][j-1]+s[k-1].a[i-1][j]+s[k-1].a[i-1][j+1]+s[k-1].a[i][j-1]+s[k-1].a[i][j+1]+s[k-1].a[i+1][j-1]+s[k-1].a[i+1][j]+s[k-1].a[i+1][j+1];
}
}
s[k].a[0][0]=s[k-1].a[0][1]+s[k-1].a[1][0]+s[k-1].a[1][1];
s[k].a[0][8]=s[k-1].a[0][7]+s[k-1].a[1][7]+s[k-1].a[1][8];
s[k].a[8][0]=s[k-1].a[8][1]+s[k-1].a[7][0]+s[k-1].a[7][1];
s[k].a[8][8]=s[k-1].a[8][7]+s[k-1].a[7][7]+s[k-1].a[7][8];
for(i=1;i<8;i++)
{
s[k].a[0][i]=s[k-1].a[0][i-1]+s[k-1].a[0][i+1]+s[k-1].a[1][i-1]+s[k-1].a[1][i]+s[k-1].a[1][i+1];
}
for(i=1;i<8;i++)
{
s[k].a[i][0]=s[k-1].a[i-1][0]+s[k-1].a[i+1][0]+s[k-1].a[i-1][1]+s[k-1].a[i][1]+s[k-1].a[i+1][1];
}
for(i=1;i<8;i++)
{
s[k].a[8][i]=s[k-1].a[8][i-1]+s[k-1].a[8][i+1]+s[k-1].a[7][i-1]+s[k-1].a[7][i]+s[k-1].a[7][i+1];
}
for(i=1;i<8;i++)
{
s[k].a[i][8]=s[k-1].a[i-1][8]+s[k-1].a[i+1][8]+s[k-1].a[i-1][7]+s[k-1].a[i][7]+s[k-1].a[i+1][7];
}
}
for(i=0;i<8;i++)
{
for(j=0;j<8;j++)
{
printf("%d ",s[n].a[i][j]);
}
printf("%d\n",s[n].a[i][8]);
}
for(i=0;i<8;i++)
{
printf("%d ",s[n].a[8][i]);
}
printf("%d",s[n].a[8][8]);
}
|
48 | 23815 | int f(int,int);
int main()
{
int m,n,i,j;
cin>>m>>n;
int a[9][9]={0,0};
if (n==1)
{a[4][4]=2*m;
a[4][3]=a[4][5]=m;
for (i=3;i<=5;i++)
a[3][i]=a[5][i]=m;}
if (n==2)
{ a[4][4]=12*m;
a[2][2]=a[2][6]=a[6][2]=a[6][6]=m;
a[2][3]=a[2][5]=a[3][2]=a[3][6]=a[5][2]=a[5][6]=a[6][3]=a[6][5]=2*m;
a[2][4]=a[4][2]=a[6][4]=a[4][6]=3*m;
a[3][3]=a[3][5]=a[5][3]=a[5][5]=6*m;
a[3][4]=a[5][4]=a[4][3]=a[4][5]=8*m;
a[4][4]=12*m;
}
if (n==3)
{ a[4][4]=80*m;
a[3][3]=a[3][5]=a[5][3]=a[5][5]=51*m;
a[4][3]=a[4][5]=a[3][4]=a[5][4]=63*m;
a[2][2]=a[2][6]=a[6][2]=a[6][6]=12*m;
a[3][2]=a[5][2]=a[2][3]=a[2][5]=a[3][6]=a[5][6]=a[6][3]=a[6][5]=24*m;
a[2][4]=a[6][4]=a[4][2]=a[4][6]=30*m;
a[1][1]=a[1][7]=a[7][1]=a[7][7]=m;
a[1][2]=a[1][6]=a[7][2]=a[7][6]=3*m;a[1][3]=a[1][5]=a[7][3]=a[7][5]=6*m;a[1][4]=a[7][4]=7*m;
a[2][1]=a[6][1]=a[2][7]=a[6][7]=3*m;
a[3][1]=a[5][1]=a[3][7]=a[5][7]=6*m;
a[4][1]=a[4][7]=7*m;
}
if (n==4)
{
a[4][4]=616*m;
a[4][3]=a[4][5]=a[3][4]=a[5][4]=512*m;
a[3][3]=a[3][5]=a[5][3]=a[5][5]=428*m;
a[2][2]=a[2][6]=a[6][2]=a[6][6]=142*m;
a[2][3]=a[2][5]=a[3][2]=a[3][6]=a[5][2]=a[5][6]=a[6][3]=a[6][5]=244*m;
a[4][2]=a[4][6]=a[2][4]=a[6][4]=292*m;
a[1][1]=a[1][7]=a[7][1]=a[7][7]=20*m;
a[1][2]=a[1][6]=a[2][1]=a[5][1]=a[2][7]=a[5][7]=52*m;
a[6][1]=a[6][7]=a[7][2]=a[7][6]=52*m;
a[1][3]=a[1][5]=a[3][1]=a[5][1]=a[7][3]=a[7][5]=a[3][7]=a[5][7]=88*m;
a[1][4]=a[7][4]=a[4][1]=a[4][7]=104*m;
a[0][0]=a[0][8]=a[8][0]=a[8][8]=m;
a[0][1]=a[0][7]=a[8][1]=a[8][7]=4*m;
a[0][2]=a[0][6]=a[8][2]=a[8][6]=10*m;
a[0][3]=a[0][5]=a[8][3]=a[8][5]=16*m;
a[0][4]=a[8][4]=a[4][0]=a[4][8]=19*m;
a[1][0]=a[1][8]=a[7][0]=a[7][8]=4*m;
a[2][0]=a[2][8]=a[6][0]=a[6][8]=10*m;
a[3][0]=a[5][0]=a[3][8]=a[5][8]=16*m;
}for (i=0;i<9;i++)
{for (j=0;j<8;j++)
cout<<a[i][j]<<" ";
cout<<a[i][8]<<endl;}
return 0;
}
|
48 | 23816 | //****************************
//**Title: ???????? **
//**Author:???1300017687 **
//**Date?2013.12.5 **
//**File?2.cpp **
//****************************
int first; //????????????
int findbat(int i, int j, int days) //????????days??i?j???????
{
if ((i == -1) || (i == 9) || (j == -1) || (j == 9)) //??????
return 0; //????0
if (days == 0) //??days?0
{
if (i == 4 && j == 4) //???????
return first;
else
return 0;
}
else
return findbat(i - 1, j - 1, days - 1) + findbat(i - 1, j , days - 1) + findbat(i - 1, j + 1, days - 1)
+ findbat(i , j - 1 , days - 1) + 2 * findbat(i , j ,days - 1) + findbat(i, j + 1,days - 1 )
+ findbat(i + 1, j - 1, days - 1) + findbat(i + 1, j , days - 1) + findbat (i + 1, j + 1, days - 1); //????
}
int main()
{
int days; //??
cin >> first >> days;
for (int i = 0 ; i <= 8 ; i++) //?????????
{
cout << findbat(i,0,days);
for(int j = 1; j <= 8 ; j++)
cout << ' ' << findbat(i,j,days);
cout << endl;
}
return 0;
} |
48 | 23817 |
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 | 23818 | void germs(int n,int a[11][11],int b[11][11]);
int main()
{
int i,j,m,n,a[11][11]={0},b[11][11]={0};
cin>>m>>n;
a[5][5]=m;
germs(n,a,b);
for(i=1;i<=9;i++)
{for(j=1;j<9;j++)
cout<<a[i][j]<<" ";
cout<<a[i][j]<<endl;
}
}
void germs(int n,int a[11][11],int b[11][11])
{
int i,j;
if(n>0)
{for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
b[i][j]=0;
for(i=1;i<=9;i++)
{for(j=1;j<=9;j++)
{ if(a[i][j]==0) continue;
else
{b[i][j]+=a[i][j]*2;
b[i+1][j]+=a[i][j];
b[i-1][j]+=a[i][j];
b[i][j+1]+=a[i][j];
b[i][j-1]+=a[i][j];
b[i+1][j+1]+=a[i][j];
b[i-1][j+1]+=a[i][j];
b[i+1][j-1]+=a[i][j];
b[i-1][j-1]+=a[i][j];
}
}
}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
a[i][j]=b[i][j];
germs(n-1,a,b);
}
} |
48 | 23819 | int m,n,a[11][11][5]={0};
main()
{
int xj(int i,int j,int k);
int i,j,k;
scanf("%d %d",&m,&n);
a[5][5][0]=m;
for (k=0;k<n;k++)
for (i=4-k;i<7+k;i++)
for(j=4-k;j<7+k;j++)
{
a[i][j][k+1]=xj(i,j,k);
}
for (i=1;i<10;i++)
{
for(j=1;j<9;j++)
printf("%d ",a[i][j][n]);
printf("%d",a[i][9][n]);
printf("\n");
}
}
int xj(int i,int j,int k)
{
int p=0,l;
for ( l=-1;l<2;l++)
p=p+a[i+l][j][k]+a[i+l][j-1][k]+a[i+l][j+1][k];
return p+a[i][j][k];
}
|
48 | 23820 |
void fanzhi(int day);
int n, a[10][10] = {0}, b[10][10] = {0};
int main()
{
int m;
cin >> m >> n;
b[5][5] = m;
fanzhi(1);
for (int i = 1; i < 10; i++)
{
cout << a[i][1];
for (int j = 2; j < 10; j++)
{
cout << ' ' << a[i][j];
}
cout << endl;
}
return 0;
}
void fanzhi(int day)
{
if (day == n + 1)
{
return;
}
else
{
int i, j;
memset(a, 0, sizeof(a));
for (i = 1; i < 10; i++)
{
for (j = 1; j < 10; j++)
{
if (b[i][j] != 0)
{
a[i][j] += 2 * b[i][j];
if(i > 1 && j > 1)
a[i - 1][j - 1] += b[i][j];
if(i > 1)
a[i - 1][j] += b[i][j];
if(i > 1 && j < 9)
a[i - 1][j + 1] += b[i][j];
if(j < 9)
a[i][j + 1] += b[i][j];
if(j < 9 && i < 9)
a[i + 1][j + 1] += b[i][j];
if(i < 9)
a[i + 1][j] += b[i][j];
if(i < 9 && j > 1)
a[i + 1][j - 1] += b[i][j];
if(j > 1)
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];
}
}
fanzhi(day + 1);
}
} |
48 | 23821 | /**
* @file 2.cpp
* @author 3Â˼½ü
* @date 2013-12-04
* @description
* ¼ÆËã¸ÅÂÛ×÷ò??oàyìa(11.8) ϸ¾ú?Ä·±Ö3óëà©é?
*/
int a[10][10];
void func(int day);
int main()
{
int day;
cin >> a[5][5] >> day;
func(day);
for (int i = 1; i <= 9; ++i)
{
for (int j = 1; j <= 8; ++j)
cout << a[i][j] << " ";
cout << a[i][9] << endl;
}
return 0;
}
void func(int day)
{
if (day == 0) return;
int b[10][10] = {0};
for (int i = 1; i <= 9; ++i)
for (int j = 1; j <= 9; ++j)
if (a[i][j])
{
b[i][j] += a[i][j];
for (int p = i - 1; p <= i + 1; ++p)
for (int q = j - 1; q <= j + 1; ++q)
b[p][q] += a[i][j];
}
for (int i = 1; i <= 9; ++i)
for (int j = 1; j <= 9; ++j)
a[i][j] = b[i][j];
func(day - 1);
} |
48 | 23822 | int pool[11][11][2]={0}; //?????????????????????
void breed(int j,int k) //?????????????
{pool[j][k][1]+=2*pool[j][k][0];
pool[j-1][k-1][1]+=pool[j][k][0];
pool[j+1][k][1]+=pool[j][k][0];
pool[j-1][k][1]+=pool[j][k][0];
pool[j][k+1][1]+=pool[j][k][0];
pool[j][k-1][1]+=pool[j][k][0];
pool[j+1][k+1][1]+=pool[j][k][0];
pool[j+1][k-1][1]+=pool[j][k][0];
pool[j-1][k+1][1]+=pool[j][k][0];
pool[j][k][0]=0;}
int main()
{
int m,n,i,j,k;
cin>>m>>n;
pool[5][5][0]=m;
for(i=0;i<n;i++)
{for(j=1;j<10;j++) for(k=1;k<10;k++) breed(j,k);
for(j=1;j<10;j++) for(k=1;k<10;k++) pool[j][k][0]=pool[j][k][1]; //????
for(j=1;j<10;j++) for(k=1;k<10;k++) pool[j][k][1]=0; //????
}
for(j=1;j<10;j++) {for(k=1;k<9;k++) cout<<pool[j][k][0]<<" "; cout<<pool[j][9][0]<<endl;}
return 0;
}
|
48 | 23823 | 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 | 23824 | 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 | 23825 | int main()
{
int m,n,i,j,k;
int now[11][11],pre[11][11];
for(i=0;i<=10;i++)
{
for(j=0;j<=10;j++)
{
now[i][j]=0;
}
}
cin>>m>>n;
now[5][5]=m;
for(i=1;i<=n;i++)
{
for(j=0;j<=10;j++)
{
for(k=0;k<=10;k++)
{
pre[j][k]=0;
}
}
for(j=1;j<=9;j++)
{
for(k=1;k<=9;k++)
{
pre[j-1][k-1]+=now[j][k];
pre[j][k-1]+=now[j][k];
pre[j+1][k-1]+=now[j][k];
pre[j-1][k]+=now[j][k];
pre[j+1][k]+=now[j][k];
pre[j-1][k+1]+=now[j][k];
pre[j][k+1]+=now[j][k];
pre[j+1][k+1]+=now[j][k];
pre[j][k]+=2*now[j][k];
}
}
for(j=1;j<=9;j++)
{
for(k=1;k<=9;k++)
{
now[j][k]=pre[j][k];
}
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<=8;j++)
{
cout<<now[i][j]<<" ";
}
cout<<now[i][9]<<endl;
}
return 0;
} |
48 | 23826 | 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 | 23827 | 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 | 23828 | 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 | 23829 | 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 | 23830 | 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 | 23831 | 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 | 23832 | int a[10][10][5];
int k,i,j,l,n;
int main(){
for(i=0;i<5;i++)
for(j=1;j<10;j++)
for(k=1;k<10;k++)
a[j][k][i]=0;
scanf("%d%d",&n,&k);
a[5][5][0]=n;
for(l=0;l<k;l++)
for(i=1;i<10;i++)
for(j=1;j<10;j++){
if(a[i][j][l]!=0){
a[i][j][l+1]+=2*a[i][j][l];
a[i-1][j-1][l+1]+=a[i][j][l];
a[i-1][j][l+1]+=a[i][j][l];
a[i-1][j+1][l+1]+=a[i][j][l];
a[i][j-1][l+1]+=a[i][j][l];
a[i][j+1][l+1]+=a[i][j][l];
a[i+1][j-1][l+1]+=a[i][j][l];
a[i+1][j][l+1]+=a[i][j][l];
a[i+1][j+1][l+1]+=a[i][j][l];
}
}
for(i=1;i<=9;i++){
for(j=1;j<9;j++){
printf("%d ",a[i][j][k]);
}
printf("%d\n",a[i][9][k]);
}
scanf("%d",&n);
return 0;
}
|
48 | 23833 | main()
{
int num,day,i,j,k,p,q;
scanf("%d %d",&num,&day);
int min[11][11];
int temp[11][11];
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
min[i][j]=0;
}
min[5][5]=num;
for(k=1;k<=day;k++)
{
for(p=0;p<11;p++)
{
for(q=0;q<11;q++)
temp[p][q]=min[p][q];
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
min[i][j]=2*temp[i][j]+temp[i+1][j]+temp[i][j+1]+temp[i-1][j]+temp[i][j-1]+temp[i+1][j+1]+temp[i-1][j+1]+temp[i-1][j-1]+temp[i+1][j-1];
}
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if(j!=9)
printf("%d ",min[i][j]);
else printf("%d",min[i][j]);
}
printf("\n");
}
}
|
48 | 23834 | /**
* @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 | 23835 | 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 | 23836 | 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 | 23837 |
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 | 23838 | main ()
{
int m,n;
int a[10][10]={0};
int b[10][10]={0};
scanf ("%d%d",&m,&n);
a[4][4]=m;
int i=0,j=0,k ;
int x,y;
for (k=0;k<n;k++)
{
for (i=0;i<9;i++)
{
for (j=0;j<9;j++)
{
b[i][j]=a[i][j]+a[i-1][j-1]+a[i-1][j]+a[i-1][j+1]+a[i][j-1]+a[i][j+1]+a[i+1][j-1]+a[i+1][j]+a[i+1][j+1];
}
}
for (i=0;i<9;i++)
{
for (j=0;j<9;j++)
{
a[i][j]=a[i][j]+b[i][j];
}
}
}
for (x=0;x<9;x++)
{
for (y=0;y<9;y++)
{
if (a[x][y]>0)
{
if (y<8)
printf ("%d ",a[x][y]);
else
printf ("%d",a[x][y]);
}
else
if (y<8)
printf ("0 ",a[x][y]);
else
printf ("0",a[x][y]);
}
printf ("\n");
}
getchar ();getchar ();
}
|
48 | 23839 | int cell[15][15][2]={0};
const int dx[8]={1,0,-1,0,1,1,-1,-1};
const int dy[8]={0,1,0,-1,1,-1,1,-1};
int sur(int x,int y){
if (x==1 && y==1 || x==1 && y==9 || x==9 && y==1 || x==9 && y==9)
return cell[x][y][0]*8/3;
else if (x==1 || y==1 || x==9 || y==9)
return cell[x][y][0]*8/5;
else return cell[x][y][0];
}
void fer (int day){
for (int d=1;d<=day;d++){
for (int i=1;i<=9;i++)
for (int j=1;j<=9;j++){
if (cell[i][j][0] != 0){
cell[i][j][1] += cell[i][j][0];
for (int k=0;k<8;k++){
int x = i + dx[k], y = j + dy[k];
if (x>=1 && x<=9 && y>=1 && y<=9)
cell[x][y][1] += sur(i,j);
}
}
}
for (int i=1;i<=9;i++)
for (int j=1;j<=9;j++)
cell[i][j][0] = cell[i][j][1];
}
}
void draw(){
for (int i=1;i<=9;i++){
for (int j=1;j<=8;j++)
cout<<cell[i][j][0]<<" ";
cout<<cell[i][9][0]<<endl;
}
}
int main ()
{
int num,day;
cin>>num>>day;
cell[5][5][0] = num;
cell[5][5][1] = num;
fer(day);
draw();
return 0;
} |
48 | 23840 | 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 | 23841 | int main()
{
int a[10][10],t[10][10];
int time=0,i=0,j=0,k=0;
for(i=1;i<10;i++)
for(j=1;j<10;j++)
a[i][j]=0;
cin>>a[5][5]>>time;
for(i=0;i<time;i++)
{
for(j=5-i;j<=5+i;j++)
for(k=5-i;k<=5+i;k++)
t[j][k]=a[j][k];
for(j=5-i;j<=5+i;j++)
for(k=5-i;k<=5+i;k++)
{
a[j-1][k-1]=a[j-1][k-1]+t[j][k];
a[j-1][k]=a[j-1][k]+t[j][k];
a[j-1][k+1]=a[j-1][k+1]+t[j][k];
a[j][k-1]=a[j][k-1]+t[j][k];
a[j][k]=a[j][k]+t[j][k];
a[j][k+1]=a[j][k+1]+t[j][k];
a[j+1][k-1]=a[j+1][k-1]+t[j][k];
a[j+1][k]=a[j+1][k]+t[j][k];
a[j+1][k+1]=a[j+1][k+1]+t[j][k];
}
}
for(i=1;i<10;i++)
{
for(j=1;j<=8;j++)
cout<<a[i][j]<<" ";
cout<<a[i][9]<<endl;
}
cin.get();cin.get();cin.get();cin.get();
return 0;
}
|
48 | 23842 | 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 | 23843 |
int A[11][11], tmp[11][11];
int N;
int main()
{
scanf ("%d %d", &A[5][5], &N);
for (int i = 0; i < N; i ++)
{
memset(tmp, 0, sizeof(tmp));
for (int l = 1; l <= 9; l ++)
for (int r = 1; r <= 9; r ++)
{
tmp[l][r] += 2 * A[l][r];
tmp[l - 1][r] += A[l][r];
tmp[l + 1][r] += A[l][r];
tmp[l][r - 1] += A[l][r];
tmp[l][r + 1] += A[l][r];
tmp[l - 1][r - 1] += A[l][r];
tmp[l - 1][r + 1] += A[l][r];
tmp[l + 1][r - 1] += A[l][r];
tmp[l + 1][r + 1] += A[l][r];
}
memcpy(A, tmp, sizeof(tmp));
}
for (int i = 1; i < 10; i ++)
{
for (int j = 1; j < 9; j ++)
printf ("%d ", A[i][j]);
printf ("%d\n", A[i][9]);
}
return 0;
}
|
48 | 23844 | //****************************************
//*??????????? **
//*????? 1100012873 **
//*???2011.11.23 **
//****************************************
int s[11][11] = {0};
void ct (int, int);
int main()
{
int a, b, p, q;
cin >> a >> b;
ct (a, b);
for (p = 1;p < 10;p++)
for (q = 1;q < 10;q++)//????????????
{
if (q == 1)
cout << s[p][q];
else if (q == 9)
cout << ' ' << s[p][q] << endl;
else if (q >= 0 && q <= 9)
cout << ' ' << s[p][q];
}
return 0;
}
void ct (int m, int n)
{
int i,j,z[11][11];
if (n == 0)
s[5][5] = m;//?????????????
else
{
ct (m, n - 1);
for (i = 1;i < 10;i++)
for (j = 1;j < 10;j++)
z[i][j] = 2 * s[i][j] + s[i - 1][j] + s[i + 1][j] + s[i][j + 1] + s[i][j - 1] + s[i + 1][j + 1] + s[i - 1][j - 1] + s[i + 1][j - 1] + s[i - 1][j + 1];
for (i = 1;i < 10;i++)
for (j = 1;j < 10;j++)
s[i][j] = z[i][j];//z??????????????
}
}
|
48 | 23845 | /*
?? ?????07????????1
??
????9???????????????m?????????????????????10???????10??????????????????????????????????????????n(1?n?4)????????????????
????
?????????????m????????????2?m?30???????n????????1?m?4??
????
??????????????????????????????n???????????????
????
2 1
????
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 2 2 2 0 0 0
0 0 0 2 4 2 0 0 0
0 0 0 2 2 2 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
*/
int temp[9][9],a[9][9];
void proliferation(int ds,int dd)
{
int m,n,j,k;
if (dd==ds)
{
for (j=0;j<=8;j++)
{
for (k=0;k<=8;k++)
{
if (k==0) cout<<a[j][k];
else cout<<" "<<a[j][k];
}
cout<<endl;
}
}
else if (dd<ds)
{
for (m=4-dd;m<=4+dd;m++)
{
for (n=4-dd;n<=4+dd;n++)
{
for (j=m-1;j<=m+1;j++)
{
for (k=n-1;k<=n+1;k++)
{
temp[j][k]+=a[m][n];
}
}
}
}
dd++;
for (j=4-dd;j<=4+dd;j++)
{
for (k=4-dd;k<=4+dd;k++)
{
a[j][k]=temp[j][k];
}
}
proliferation(ds,dd);
}
}
int main()
{
int ds,m;
cin>>m>>ds;
memset(temp,0,sizeof(temp));
memset(a,0,sizeof(a));
a[4][4]=m;
temp[4][4]=m;
proliferation(ds,0);
return 0;
} |
48 | 23846 | int main()
{
int A[10][10]={0},B[10][10]={0},i,j,k,m;
scanf("%d%d",&A[5][5],&m);
B[5][5]=A[5][5];
for (k=1;k<=m;k++)
{
for (i=1;i<=9;i++)
{
for (j=1;j<=9;j++)
{
if (A[i][j]!=0)
{
B[i-1][j-1]+=A[i][j];
B[i-1][j]+=A[i][j];
B[i-1][j+1]+=A[i][j];
B[i][j-1]+=A[i][j];
B[i][j]+=A[i][j];
B[i][j+1]+=A[i][j];
B[i+1][j-1]+=A[i][j];
B[i+1][j]+=A[i][j];
B[i+1][j+1]+=A[i][j];
}
}
}
for (i=1;i<=9;i++)
{
for (j=1;j<=9;j++)
{
A[i][j]=B[i][j];
}
}
}
for (i=1;i<=9;i++)
{
printf("%d",A[i][1]);
for (j=2;j<=9;j++)
{
printf(" %d",A[i][j]);
}
printf("\n");
}
return 0;
}
|
48 | 23847 | 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 | 23848 | int main()
{
int a[10][11][11]={0},i,j,k,m,n;
cin>>m>>n;
a[0][5][5]=m;
for(k=1;k<=n;k++)
{
for(i=1;i<10;i++)
for(j=1;j<10;j++)
{
if(a[k-1][i][j]>0)
{
a[k][i][j]=a[k][i][j]+a[k-1][i][j]*2;
a[k][i-1][j]=a[k][i-1][j]+a[k-1][i][j];
a[k][i][j-1]=a[k][i][j-1]+a[k-1][i][j];
a[k][i+1][j]=a[k][i+1][j]+a[k-1][i][j];
a[k][i][j+1]=a[k][i][j+1]+a[k-1][i][j];
a[k][i+1][j+1]=a[k][i+1][j+1]+a[k-1][i][j];
a[k][i-1][j-1]=a[k][i-1][j-1]+a[k-1][i][j];
a[k][i-1][j+1]=a[k][i-1][j+1]+a[k-1][i][j];
a[k][i+1][j-1]=a[k][i+1][j-1]+a[k-1][i][j];
}
}
}
for(i=1;i<10;i++)
{
for(j=1;j<9;j++)
cout<<a[n][i][j]<<" ";
cout<<a[n][i][9];
cout<<endl;
}
return 0;
}
|
48 | 23849 | //****************************************
//*???cell birth **
//*????? 1100013004 **
//*???2010.11.28 **
//****************************************
int a[9][9];
void birth(int i,int j,int m,int n)
{
if (n==0)
{
a[i][j]+=m;
return;
}
else
{
int k,l;
for (k = i - 1;k < i + 2;k++)
for(l = j - 1;l < j + 2;l++)
if (k>=0 && k<9 && l>=0 && l<9) //????????
{
if (k==i && l==j)
birth(k,l,2*m,n-1);
else
birth(k,l,m,n-1);
}
}
}
int main()
{
int m,n,i,j;
cin>>m>>n;
for (i = 0;i < 9; i++)
for(j = 0;j < 9; j++)
a[i][j]=0;
birth(4,4,m,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]<<' ';
}
return 0;
} |
48 | 23850 |
int a[11][11] = {0}, b[11][11] = {0};
void multiply(int d)
{
int i, j;
if (d != 0)
{
for (i = 1; i <= 9; i++)
for (j = 1; j <= 9; j++)
{
b[i][j] += a[i][j] * 2;
b[i - 1][j] += a[i][j];
b[i + 1][j] += a[i][j];
b[i][j + 1] += a[i][j];
b[i][j - 1] += a[i][j];
b[i - 1][j - 1] += a[i][j];
b[i - 1][j + 1] += a[i][j];
b[i + 1][j - 1] += a[i][j];
b[i + 1][j + 1] += a[i][j];
}
for (i = 1; i <= 9; i++)
for (j = 1; j <= 9; j++)
{
a[i][j] = b[i][j];
b[i][j] = 0;
}
multiply(d - 1);
}
}
int main()
{
int m, n, d;
int i, j;
cin >> m >> n;
a[5][5] = m;
multiply(n);
for (i = 1; i <= 9; i++)
for (j = 1; j <= 9; j++)
{
if (j == 1)
cout << a[i][j];
else
{
cout << " " << a[i][j];
}
if (j == 9)
cout << endl;
}
return 0;
} |
48 | 23851 | //********************************
//*??:????**
//*????? 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 | 23852 | 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 | 23853 | int now[9][9]={0},add[9][9]={0};
void getadd()
{
for(int i=0;i<9;i++) for(int j=0;j<9;j++) add[i][j]=0;
for(int i=1;i<8;i++)
{
for(int j=1;j<8;j++)
{
add[i-1][j-1]+=now[i][j];
add[i][j-1]+=now[i][j];
add[i+1][j-1]+=now[i][j];
add[i-1][j+1]+=now[i][j];
add[i][j+1]+=now[i][j];
add[i+1][j+1]+=now[i][j];
add[i+1][j]+=now[i][j];
add[i-1][j]+=now[i][j];
}
}
}
int main()
{
int m,n;
cin>>m>>n;now[4][4]=m;
for(int k=0;k<n;k++)
{
getadd();
for(int i=0;i<9;i++)
{
for(int j=0;j<9;j++)
{
now[i][j]=2*now[i][j]+add[i][j];
}
}
}
for(int i=0;i<9;i++)
{
if(i) cout<<endl;
for(int j=0;j<9;j++)
{
if(j) cout<<" ";
cout<<now[i][j];
}
}
} |
48 | 23854 | int main()
{
int m,n,i,h,l,s[9][9]={0},record[9][9]={0};
cin>>m>>n;
record[4][4]=s[4][4]=m;
for(i=0;i<n;i++)
{
for(h=0;h<9;h++)
for(l=0;l<9;l++)
{
if(record[h][l]!=0)
{
s[h][l]+=record[h][l];
s[h-1][l-1]+=record[h][l];
s[h][l-1]+=record[h][l];
s[h+1][l-1]+=record[h][l];
s[h-1][l]+=record[h][l];
s[h+1][l]+=record[h][l];
s[h+1][l+1]+=record[h][l];
s[h][l+1]+=record[h][l];
s[h-1][l+1]+=record[h][l];
}
}
for(h=0;h<9;h++)
for(l=0;l<9;l++)
record[h][l]=s[h][l];
}
for(h=0;h<9;h++)
{
cout<<s[h][0];
for(l=1;l<9;l++)
cout<<" "<<s[h][l];
cout<<endl;
}
return 0;
}
|
48 | 23855 | void main()
{
int m,n,a[11][11]={0},b[10][10]={0},i,j,k;
scanf("%d%d",&m,&n);
a[5][5]=m;
for(k=1;k<=n;k++)
{
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
b[i][j]=2*a[i][j]+a[i-1][j-1]+a[i-1][j]+a[i-1][j+1]+a[i][j-1]+a[i][j+1]+a[i+1][j-1]+a[i+1][j]+a[i+1][j+1];
}
}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
a[i][j]=b[i][j];
}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{
if(j<9)
{
printf("%d ",a[i][j]);
}
else if(i!=9) printf("%d\n",a[i][j]);
else printf("%d",a[i][j]);
}
}
|
48 | 23856 |
int main()
{
int a[100][11][11]={0};
int n,t;
int i,j,k;
for(i=0;i<100;i++)
for(j=0;j<=10;j++)
for(k=0;k<=10;k++)
a[i][j][k]=0;
cin>>n>>t;
for(i=0;i<t;i++)
{
a[0][5][5]=n;
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]+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<=9;i++)
{
for(j=1;j<=9;j++)
{
if(j==1)
cout<<a[t][i][j];
else if(j>0&&j<9)
cout<<' '<<a[t][i][j];
else if(j==9)
cout<<' '<<a[t][i][j]<<endl;
}
}
return 0;
}
|
48 | 23857 | int a[9][9]={0},b[9][9]={0};
void copy()
{
for(int i=0;i<9;i++)
for(int j=0;j<9;j++)
a[i][j]=b[i][j];
}
void guil()
{
for(int i=0;i<9;i++)
for(int j=0;j<9;j++)
b[i][j]=0;
}
int main()
{
int m,n;
cin>>m>>n;
a[4][4]=m;
for(int k=1;k<=n;k++)
{
guil();
for(int i=0;i<9;i++)
{
for(int j=0;j<9;j++)
{
if(a[i][j]!=0)
{
b[i][j]+=2*a[i][j];
b[i][j-1]+=a[i][j];
b[i][j+1]+=a[i][j];
b[i-1][j-1]+=a[i][j];
b[i-1][j]+=a[i][j];
b[i-1][j+1]+=a[i][j];
b[i+1][j-1]+=a[i][j];
b[i+1][j]+=a[i][j];
b[i+1][j+1]+=a[i][j];
}
}
}
copy();
}
for(int i=0;i<9;i++)
{
for(int j=0;j<8;j++)
cout<<b[i][j]<<" ";
cout<<a[i][8]<<endl;
}
return 0;
} |
48 | 23858 |
main()
{
int m,n,i,j,k,s[11][11]={0},s1[11][11]={0};
scanf("%d %d",&m,&n);
s1[5][5]=s[5][5]=m;
for(k=1;k<=n;k++)
{
for(i=5-k;i<=5+k;i++)
{
for(j=5-k;j<=5+k;j++)
{
s[i][j]=2*s1[i][j]+s1[i-1][j-1]+s1[i-1][j]+s1[i-1][j+1]+s1[i][j-1]+s1[i][j+1]+s1[i+1][j-1]+s1[i+1][j]+s1[i+1][j+1];
}
}
if(k!=n)
{
for(i=5-k;i<=5+k;i++)
{
for(j=5-k;j<=5+k;j++)
{
s1[i][j]=s[i][j];
}
}
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
if(j==1)printf("%d",s[i][j]);
else printf(" %d",s[i][j]);
}
printf("\n");
}
}
|
48 | 23859 | 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 | 23860 |
int main()
{
int m,n,a[12][12],b[12][12],i,j,k;
scanf("%d %d",&m,&n);
for(j=0;j<=10;j++){
for(k=0;k<=10;k++){
b[j][k]=0;
a[j][k]=0;
}
}
b[5][5]=m;
for(i=0;i<n-1;i++){
for(j=1;j<=9;j++){
for(k=1;k<=9;k++){
a[j][k]+=2*b[j][k]+b[j-1][k]+b[j][k-1]+b[j+1][k]+b[j][k+1]+b[j-1][k-1]+b[j+1][k+1]+b[j+1][k-1]+b[j-1][k+1];
}
}
for(j=1;j<=9;j++){
for(k=1;k<=9;k++){
b[j][k]=a[j][k];
a[j][k]=0;
}
}
}
for(j=1;j<=9;j++){
for(k=1;k<=9;k++){
a[j][k]+=2*b[j][k]+b[j-1][k]+b[j][k-1]+b[j+1][k]+b[j][k+1]+b[j-1][k-1]+b[j+1][k+1]+b[j+1][k-1]+b[j-1][k+1];
}
}
for(j=1;j<=9;j++){
for(k=1;k<9;k++){
printf("%d ",a[j][k]);
}
printf("%d\n",a[j][9]);
}
return 0;
} |
48 | 23861 | //????(???)
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 | 23862 | int main()
{
int sum=0,day=0,a[11][11],b[11][11],i=0,j=0,p=0; //???????sum,????day,?????a[11][11],??????b[11][11],??????i,j
cin>>sum>>day;
for(i=0;i<11;i++) //?????
{
for(j=0;j<11;j++)
{
a[i][j]=0;
}
}
a[5][5]=sum; //????????????????
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
b[i][j]=a[i][j];
}
}
for(p=0;p<day;p++)
{
for(i=0;i<11;i++)
{
for(j=0;j<11;j++) //???????a[i][j]?????b[i][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++)
{
cout<<a[i][j]<<" "; //????????
}
cout<<a[i][9]<<endl;
}
return 0;
}
|
48 | 23863 | 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 | 23864 | int main()
{
int m, n;
int bac[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,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,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0}};
scanf("%d %d",&m,&n);
int i = 1;
bac[4][4] = m;
int p = 0,q = 0;
while(i<=n)
{
q = 0;
int a[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,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,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0}};
while(q<9)
{
p = 0;
while(p<9)
{
if(bac[p][q]!=0)
{
a[p][q] = a[p][q] + 2 * bac[p][q];
a[p-1][q] += bac[p][q];
a[p+1][q] += bac[p][q];
a[p][q-1] += bac[p][q];
a[p][q+1] += bac[p][q];
a[p-1][q-1] += bac[p][q];
a[p-1][q+1] += bac[p][q];
a[p+1][q-1] += bac[p][q];
a[p+1][q+1] += bac[p][q];
}
p++;
}
q++;
}
p = 0;
q = 0;
while(q<9)
{
p = 0;
while(p<9)
{
bac[p][q] = a[p][q];
p++;
}
q++;
}
i++;
}
p = 0;
q = 0;
while(q<9)
{
p = 0;
while(p<8)
{
printf("%d ",bac[p][q]);
p++;
}
printf("%d\n",bac[p][q]);
q++;
}
return 0;
} |
48 | 23865 |
int main(int argc, char* argv[])
{
int sz[9][9][5],n,m,i,j,k,p,q;
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
for(k=0;k<5;k++)
{
sz[i][j][k]=0;
}
}
}
scanf("%d %d",&n,&m);
sz[4][4][0]=n;
for(k=0;k<m;k++)
{
for(i=1;i<8;i++)
{
for(j=1;j<8;j++)
{
if(sz[i][j][k]!=0)
{
sz[i-1][j-1][k+1]+=sz[i][j][k];
sz[i-1][j][k+1]+=sz[i][j][k];
sz[i-1][j+1][k+1]+=sz[i][j][k];
sz[i][j-1][k+1]+=sz[i][j][k];
sz[i][j][k+1]+=sz[i][j][k]*2;
sz[i][j+1][k+1]+=sz[i][j][k];
sz[i+1][j-1][k+1]+=sz[i][j][k];
sz[i+1][j][k+1]+=sz[i][j][k];
sz[i+1][j+1][k+1]+=sz[i][j][k];
}
}
}
}
for(i=0;i<9;i++)
{
printf("%d",sz[i][0][m]);
for(j=1;j<9;j++)
{
printf(" %d",sz[i][j][m]);
}
printf("\n");
}
return 0;
} |
48 | 23866 | int main()
{
int m,n;
int a[9][9]={0},t[9][9];
int i,j,k;
scanf("%d %d",&m,&n);
a[4][4]=1;
for(i=1;i<=n;i++)
{
for(j=0;j<=8;j++)
for(k=0;k<=8;k++)
t[j][k]=a[j][k];
for(j=5-i;j<=3+i;j++)
for(k=5-i;k<=3+i;k++)
a[j][k]=a[j][k]+t[j][k];
for(j=5-i;j<=3+i;j++)
for(k=5-i;k<=3+i;k++)
{
a[j-1][k-1]+=t[j][k];
a[j-1][k]+=t[j][k];
a[j-1][k+1]+=t[j][k];
a[j][k-1]+=t[j][k];
a[j][k+1]+=t[j][k];
a[j+1][k-1]+=t[j][k];
a[j+1][k]+=t[j][k];
a[j+1][k+1]+=t[j][k];
}
}
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
if(j==0)
printf("%d",m*a[i][j]);
else
printf(" %d",m*a[i][j]);
}
printf("\n");
}
return 0;
} |
48 | 23867 | //****************************************
//*???????????
//*?????? 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 | 23868 | int a[10][10],b[10][10];
int dx[]={1,1,1,0,0,0,-1,-1,-1};
int dy[]={-1,0,1,-1,0,1,-1,0,1};
void change()
{
for(int i=1;i<=9;++i)
for(int j=1;j<=9;++j)
b[i][j]=a[i][j];
for(int i=1;i<=9;++i)
for(int j=1;j<=9;++j)
{
if(b[i][j]!=0)
{
for(int k=0;k<9;++k)
{
a[i+dx[k]][j+dy[k]]+=b[i][j];
}
}
}
}
int main()
{
int m,n;
cin>>m>>n;
a[5][5]=m;
for(int i=0;i<n;++i)
{change();}
for(int i=1;i<=9;++i)
{
for(int j=1;j<=9;++j)
{
if(j!=9)cout<<a[i][j]<<" ";
else cout<<a[i][j]<<endl;
}
}
} |
48 | 23869 | 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 | 23870 | 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 | 23871 | int main()
{
int m,n;
int a[11][11]={0},add[11][11]={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 | 23872 |
int a[11][11][5] ; //??????????????????? a[i][j][d]??i?j??d??????
int f(int x , int y , int d) //??f?????x?y?d?????????-1??????????????0
{
int s ; //?????s????????
if ((a[x][y][d] > 0) || (d == 0)) //?????????????d = 0??????????
return a[x][y][d] ;
if (a[x][y][d] == -1) //????????????-1????0
return 0 ;
s = f(x , y , d - 1) * 2 ; //??????????????
if (x > 1) //????????????????????????
{
s += f(x - 1 , y , d - 1) ;
if (y > 1) //??????????????????????????
s += f(x - 1 , y - 1 , d - 1 ) ;
if (y < 9) //????????????????
s += f(x - 1 , y + 1 , d - 1 ) ;
}
if (x < 9) //??????????
{
s += f(x + 1 , y , d - 1) ;
if (y > 1)
s += f(x + 1 , y - 1 , d - 1 ) ;
if (y < 9)
s += f(x + 1 , y + 1 , d - 1 ) ;
}
if (y > 1) //????????????????
s += f(x , y - 1 , d - 1) ;
if (y < 9)
s += f(x , y + 1 , d - 1) ;
if (s != 0) //????????0??????????
{
a[x][y][d] = s ;
return s ;
}
else //?????0??a???-1???0
{
a[x][y][d] = -1 ;
return 0 ;
}
}
int main()
{
int m , i , j ; //????m?????i,j
memset(a , 0 , sizeof(a)) ; //??a??
cin >> a[5][5][0] >> m ; //?????????????
for (i = 1 ; i <= 9 ; i ++ ) //?????????
{
cout << f(i , 1 , m) ;
for (j = 2 ; j <= 9 ; j ++ )
cout << ' ' << f(i , j , m) ;
cout << endl ;
}
return 0 ;
}
|
48 | 23873 | 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 | 23874 | 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 | 23875 | int main()
{
int k,n;
scanf("%d%d",&k,&n);
int a[12][12][5];
int i,j,l,x;
for(i=1;i<=11;i++)
{
for(j=1;j<=11;j++)
{
for(l=0;l<=4;l++)
{
a[i][j][l]=0;
}
}
}
a[6][6][0]=k;
for(l=1;l<=n;l++)
{
for(i=2;i<=10;i++)
{
for(j=2;j<=10;j++)
{
a[i][j][l]=
a[i-1][j-1][l-1]
+a[i-1][j][l-1]
+a[i-1][j+1][l-1]
+a[i][j-1][l-1]
+a[i][j+1][l-1]
+a[i+1][j-1][l-1]
+a[i+1][j][l-1]
+a[i+1][j+1][l-1]
+2*a[i][j][l-1];
}
}
}
for(i=2;i<=9;i++)
{
for(j=2;j<=9;j++)
{
printf("%d ",a[i][j][n]);
}
printf("%d\n",a[i][10][n]);
}
for(j=2;j<=9;j++)
{
printf("%d ",a[10][j][n]);
}
printf("%d",a[10][10][n]);
//scanf("%d",&l);
getchar();getchar();
return 0;
}
|
48 | 23876 | int main()
{
int a[9][9]={0},b[9][9]={0};
int n,t=0,i,j;
cin>>n;
a[4][4]=n;
cin>>n;
while(t<n)
{
for(i=1;i<8;i++)
for(j=1;j<8;j++)
{
b[i-1][j-1]+=a[i][j];
b[i-1][j]+=a[i][j];
b[i-1][j+1]+=a[i][j];
b[i][j-1]+=a[i][j];
b[i][j+1]+=a[i][j];
b[i+1][j-1]+=a[i][j];
b[i+1][j]+=a[i][j];
b[i+1][j+1]+=a[i][j];
b[i][j]+=a[i][j];
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
a[i][j]+=b[i][j];
b[i][j]=0;
}
t++;
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
cout<<a[i][j]<<' ';
}
cout<<a[i][8]<<endl;
}
return 0;
} |
48 | 23877 | /************************????????*******************
??
????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 | 23878 |
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 | 23879 | int xi[11][11]={0} , jun[11][11] ={0} ;
int i , j ;
void fanzhi(int t)
{
if(t == 0)
return ;
int jun[11][11] = {0} ;
for (i = 1 ; i <= 9 ; i ++)
{
for (j = 1 ; j <= 9 ; j ++)
{
jun[i-1][j-1] += xi[i][j] ;
jun[i-1][j] += xi[i][j] ;
jun[i-1][j+1] += xi[i][j] ;
jun[i][j-1] += xi[i][j] ;
jun[i][j+1] += xi[i][j] ;
jun[i+1][j-1] += xi[i][j] ;
jun[i+1][j] += xi[i][j] ;
jun[i+1][j+1] += xi[i][j] ;
}
}
for (i = 1 ; i <= 9 ; i ++)
{
for (j = 1 ; j <= 9 ; j ++)
xi[i][j] = 2 * xi[i][j] +jun[i][j] ;
}
fanzhi(t-1) ;
}
int main ()
{
int m , n ;
cin >> m >> n ;
xi[5][5] = m ;
fanzhi(n) ;
for (i = 1 ; i <= 9 ; i ++)
{
for (j = 1 ; j <= 9 ; j ++)
{
if(j>=2)
cout <<' ' ;
cout <<xi[i][j] ;
}
cout <<endl ;
}
return 0 ;
}
|
48 | 23880 | /*
*??? 1200012851
*???????
*2013.1.4
**/
int main()
{
int a[2][11][11] = {0};
int t, i, k, j, n, days, flag = 0;
cin >> n >> days;
a[0][5][5] = n;
for (t = 1; t <= days; t++)
{
i = t % 2;
for (k = 0; k < 11; k++)
for (j = 0; j < 11; j++)
a[i][k][j] = 0;
for (k = 1; k <= 9; k++)
for (j = 1; j <= 9; j++)
{
a[i][k][j] += 2 * a[1 - i][k][j];
a[i][k + 1][j] += a[1 - i][k][j];
a[i][k - 1][j] += a[1 - i][k][j];
a[i][k][j + 1] += a[1 - i][k][j];
a[i][k][j - 1] += a[1 - i][k][j];
a[i][k + 1][j + 1] += a[1 - i][k][j];
a[i][k - 1][j - 1] += a[1 - i][k][j];
a[i][k - 1][j + 1] += a[1 - i][k][j];
a[i][k + 1][j - 1] += a[1 - i][k][j];
}
}
for (k = 1; k <= 9; k++)
{
for (j = 1; j <= 9; j++)
{
if (flag)
cout << " ";
cout << a[i][k][j];
flag = 1;
}
flag = 0;
cout << endl;
}
return 0;
}
|
48 | 23881 | 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 | 23882 | int main()
{
int n,m,i;
int num[11][11],tem[11][11];
int j,k;
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
num[i][j]=0;
tem[i][j]=0;
}
}
scanf("%d %d",&m,&n);
num[5][5]=m;
tem[5][5]=m;
for(i=1;i<=n;i++)//i????
{
for(j=5-i;j<=5+i;j++)
{
for(k=5-i;k<=5+i;k++)
{
num[j][k]=tem[j-1][k-1]+tem[j][k-1]+tem[j+1][k-1]+tem[j-1][k]+tem[j+1][k]+tem[j+1][k+1]+tem[j][k+1]+tem[j-1][k+1]+2*tem[j][k];
}
}
for(j=5-i;j<=5+i;j++)
{
for(k=5-i;k<=5+i;k++)
{
tem[j][k]=num[j][k];
}
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<9;j++)
{
printf("%d ",num[j][i]);
}
printf("%d\n",num[9][i]);
}
return 0;
}
|
48 | 23883 | int main()
{
int zz[11][11][5];
int i,j,k;
int m,n;
for ( i = 0 ; i < 11 ; i ++ )
for ( j = 0 ; j < 11 ; j ++ )
for ( k = 0 ; k < 5 ; k ++ )
zz[i][j][k]=0;
cin>>m>>n;
zz[5][5][n]=m;
while ( n != 0 )
{
for ( i = 1 ; i < 10 ; i ++ )
{
for ( j = 1 ; j < 10 ; j ++ )
{
if ( zz[i][j][n] > 0 )
{
zz[i][j][n-1] += 2 * zz[i][j][n];
zz[i-1][j-1][n-1] += zz[i][j][n];
zz[i-1][j][n-1] += zz[i][j][n];
zz[i-1][j+1][n-1] += zz[i][j][n];
zz[i][j-1][n-1] += zz[i][j][n];
zz[i][j+1][n-1] += zz[i][j][n];
zz[i+1][j-1][n-1] += zz[i][j][n];
zz[i+1][j][n-1] += zz[i][j][n];
zz[i+1][j+1][n-1] += zz[i][j][n];
}
}
}
for ( i = 0 ; i < 11 ; i ++ )
{
for ( j = 0 ; j < 11 ; j ++ )
{
if ( i == 0 || j == 0 || i == 10 || j == 10 )
zz[i][j][n-1]=0;
}
}
n--;
}
for ( i = 1 ; i < 10 ; i ++ )
{
for ( j = 1 ; j < 10 ; j ++ )
{
if ( j != 9 )
cout<<zz[i][j][0]<<' ';
else
cout<<zz[i][j][0];
}
cout<<endl;
}
} |
48 | 23884 | int main()
{
int i,j,m,n,a[9][9]={0},b[9][9]={0};
cin>>m>>n;
a[4][4]=m;
while(n--)
{
for(i=0;i<9;i++)
for(j=0;j<9;j++)
if(a[i][j]!=0)
{
b[i][j]+=2*a[i][j];
b[i-1][j]+=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=0;i<9;i++)
for(j=0;j<9;j++)
a[i][j]=b[i][j];
memset(b,0,sizeof(b));
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
cout<<a[i][j]<<' ';
cout<<a[i][8]<<endl;
}
return 0;
}
|
48 | 23885 | int main()
{
int a[9][9]={0};
int b[9][9]={0};
int m,t;
cin>>m>>t;
a[4][4]=m;
int i;int k,l;
for(i=0;i<t;i++)
{
for(k=0;k<9;k++)
{
for(l=0;l<9;l++)
{
if(a[k][l]!=0)
{
b[k][l]=b[k][l]+a[k][l]*2;
if(k>0)b[k-1][l]=b[k-1][l]+a[k][l];
if(k<8)b[k+1][l]=b[k+1][l]+a[k][l];
if(l>0)b[k][l-1]=b[k][l-1]+a[k][l];
if(l<8)b[k][l+1]=b[k][l+1]+a[k][l];
if(k>0 && l>0)b[k-1][l-1]=b[k-1][l-1]+a[k][l];
if(k>0 && l<8)b[k-1][l+1]=b[k-1][l+1]+a[k][l];
if(k<8 && l>0)b[k+1][l-1]=b[k+1][l-1]+a[k][l];
if(k<8 && l<8)b[k+1][l+1]=b[k+1][l+1]+a[k][l];
}
}
}
for(k=0;k<9;k++)
{
for(l=0;l<9;l++)
{
a[k][l]=b[k][l];b[k][l]=0;
}
}
}
for(k=0;k<9;k++)
{
for(l=0;l<9;l++)
{
cout<<a[k][l];
if(l!=8)cout<<" ";
}
cout<<endl;
}
return 0;
} |
48 | 23886 |
main()
{int square[9][9]={0};
int squ[9][9]={0};
int m,n,i,j,k,t,q;
scanf("%d",&m);
scanf("%d",&n);
square[4][4]=squ[4][4]=m;
for(i=1;i<=n;i++)
{for(j=0;j<=8;j++)
{for(k=0;k<=8;k++)
if (square[j][k]!=0)
{squ[j][k]=squ[j][k]+square[j][k];
squ[j][k+1]+=square[j][k];
squ[j][k-1]+=square[j][k];
squ[j+1][k]+=square[j][k];
squ[j+1][k+1]+=square[j][k];
squ[j+1][k-1]+=square[j][k];
squ[j-1][k]+=square[j][k];
squ[j-1][k+1]+=square[j][k];
squ[j-1][k-1]+=square[j][k];
}
}
for(t=0;t<=8;t++)
for(q=0;q<=8;q++)
{
square[q][t]=squ[q][t];}
}
for(t=0;t<=8;t++)
{for(q=0;q<=7;q++)
printf("%d ",square[t][q]);
printf("%d",square[t][8]);
printf("\n");
}
} |
48 | 23887 | int main()
{
int dish[9][9]={0},temp[9][9]={0},i=0,j=0,n=0,m=0;
cin>>m>>n;
dish[4][4]=m;
int *p=dish[0],*q=temp[0];
for(i=0;i<n;i++)
{
for(j=0;j<81;j++,p++,q++)
{
if(*p!=0)
{
*q+=2**p;
*(q-1)+=*p;*(q+1)+=*p;
*(q-9)+=*p;*(q+9)+=*p;
*(q-10)+=*p;*(q+10)+=*p;
*(q-8)+=*p;*(q+8)+=*p;
}
}
p=dish[0];q=temp[0];
for(j=0;j<81;j++,p++,q++)
{
*p=*q;
*q=0;
}
p=dish[0];q=temp[0];
}
for(i=0;i<81;i++)
{
if((i+1)%9==0)cout<<*(p+i)<<endl;
else cout<<*(p+i)<<" ";
}
return 0;
} |
48 | 23888 | //************************************************************************
//????????
//??? ???
//??? 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 | 23889 | 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 | 23890 | 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 | 23891 | int a[9][9];
int b[9][9];
int main()
{
void sc(int i,int j);
int n,m,k,i,j;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{a[i][j]=0;b[i][j]=0;}
scanf("%d %d",&m,&n);
a[4][4]=m;
for(k=0;k<n;k++)
{
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
if(a[i][j]!=0) sc(i,j);
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
a[i][j]=b[i][j];b[i][j]=0;
}
}
for(i=0;i<9;i++)
{for(j=0;j<8;j++)
{printf("%d ",a[i][j]);}
printf("%d\n",a[i][8]);}
}
void sc(int i,int j)
{
b[i-1][j]+=a[i][j];
b[i+1][j]+=a[i][j];
b[i][j+1]+=a[i][j];
b[i][j-1]+=a[i][j];
b[i-1][j-1]+=a[i][j];
b[i-1][j+1]+=a[i][j];
b[i+1][j-1]+=a[i][j];
b[i+1][j+1]+=a[i][j];
b[i][j]=b[i][j]+a[i][j]*2;
}
|
48 | 23892 | //********************************
//*??????????? **
//*?????? 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 | 23893 | 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 | 23894 | int main()
{
int a[9][9]={0},b[9][9]={0},i,j,k,m,n,l,x,y,t;//a??????????b????????????????
cin>>m;
cin>>n;
a[4][4]=m;
for(i=0;i<n;i++)
{
for(y=0;y<=8;y++)
for(t=0;t<=8;t++)
b[y][t]=0;
for(j=4-i;j<=(4+i);j++)
{
for(k=4-i;k<=(4+i);k++)
{
b[j-1][k-1]=b[j-1][k-1]+a[j][k];//??? ????????????????????
b[j-1][k]=b[j-1][k]+a[j][k];
b[j-1][k+1]=b[j-1][k+1]+a[j][k];
b[j][k-1]=b[j][k-1]+a[j][k];
b[j][k+1]=b[j][k+1]+a[j][k];
b[j+1][k-1]=b[j+1][k-1]+a[j][k];
b[j+1][k]=b[j+1][k]+a[j][k];
b[j+1][k+1]=b[j+1][k+1]+a[j][k];
}
}
for(l=3-i;l<=(5+i);l++)
{
for(x=3-i;x<=(5+i);x++)
{
a[l][x]=2*a[l][x]+b[l][x];//????????
}
}
}
for(i=0;i<=8;i++)
{
for(j=0;j<=7;j++)
{
cout<<a[i][j]<<" ";
}
cout<<a[i][8]<<endl;//????
}
return 0;
} |
48 | 23895 |
int main()
{
int f[2][15][15];
int i, j, k, m, n, p, q, t;
scanf("%d %d", &m, &n);
memset(f, 0, sizeof(f));
f[0][5][5] = m;
p = 0;
q = 1;
for(k=1; k<=n; k++)
{
for(i=1; i<=9; i++)
for(j=1; j<=9; j++)
f[q][i][j] = 0;
for(i=1; i<=9; i++)
for(j=1; j<=9; j++)
if(f[p][i][j]!=0)
{
f[q][i][j] += f[p][i][j]*2;
f[q][i-1][j-1] += f[p][i][j];
f[q][i-1][j] += f[p][i][j];
f[q][i-1][j+1] += f[p][i][j];
f[q][i][j-1] += f[p][i][j];
f[q][i][j+1] += f[p][i][j];
f[q][i+1][j-1] += f[p][i][j];
f[q][i+1][j] += f[p][i][j];
f[q][i+1][j+1] += f[p][i][j];
}
t = p; p = q; q = t;
}
for(i=1; i<=9; i++)
{
for(j=1; j<9; j++)
printf("%d ", f[p][i][j]);
printf("%d\n", f[p][i][9]);
}
return 0;
}
|
48 | 23896 | 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 | 23897 | //****************************************
//*??????????? **
//*?????? 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 | 23898 | int main()
{
int juzhen[11][11],zhi[11][11];//???
int chu,day,i,j,n;//chu?????day?????
cin>>chu>>day;
for(i=0;i<11;i++)
for(j=0;j<11;j++) juzhen[i][j]=0;
juzhen[5][5]=chu;//??????????
for(n=0;n<day;n++)
{
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
zhi[i][j]=2*juzhen[i][j]+juzhen[i][j-1]+juzhen[i][j+1]+
juzhen[i-1][j-1]+juzhen[i-1][j]+juzhen[i-1][j+1]+juzhen[i+1][j-1]+
juzhen[i+1][j]+juzhen[i+1][j+1];//?????
}
}
for(i=1;i<10;i++)
for(j=1;j<10;j++) juzhen[i][j]=zhi[i][j];
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if (j==9) cout<<juzhen[i][j]<<endl;//????
else cout<<juzhen[i][j]<<" ";
}
}
return 0;
}
|
48 | 23899 | int main()
{
int m,n;
scanf("%d %d",&m,&n);
int sz[5][9][9];
for(int i=0;i<9;i++)
{
for(int j=0;j<9;j++)
{sz[0][i][j]=0;}
}
sz[0][4][4]=m;
for(int t=0;t<n;t++)
{
for(int k=0;k<9;k++)
{
for(int hl=0;hl<9;hl++)
{
if(k!=0&&hl!=0&&k!=8&&hl!=8)
{
sz[t+1][k][hl]=2*sz[t][k][hl]+sz[t][k][hl-1]+sz[t][k][hl+1]+sz[t][k-1][hl+1]+sz[t][k+1][hl+1]+sz[t][k-1][hl]+sz[t][k-1][hl-1]+sz[t][k+1][hl]+sz[t][k+1][hl-1];
}
if(k==0&&hl!=0&&hl!=8)
{sz[t+1][0][hl]=2*sz[t][0][hl]+sz[t][0][hl-1]+sz[t][0][hl+1]+sz[t][1][hl+1]+sz[t][1][hl]+sz[t][1][hl-1];
}
if(k==8&&hl!=0&&hl!=8)
{sz[t+1][8][hl]=2*sz[t][8][hl]+sz[t][8][hl-1]+sz[t][8][hl+1]+sz[t][7][hl+1]+sz[t][7][hl]+sz[t][7][hl-1];
}
if(k!=0&&hl==0&&k!=8)
{
sz[t+1][k][0]=2*sz[t][k][0]+sz[t][k][1]+sz[t][k-1][1]+sz[t][k+1][1]+sz[t][k-1][0]+sz[t][k+1][0];
}
if(k!=0&&hl==8&&k!=8)
{
sz[t+1][k][8]=2*sz[t][k][8]+sz[t][k][7]+sz[t][k-1][7]+sz[t][k+1][7]+sz[t][k-1][8]+sz[t][k+1][8];
}
if(k==0&&hl==0)
{
sz[t+1][0][0]=2*sz[t][0][0]+sz[t][0][1]+sz[t][1][1]+sz[t][1][0];
}
if(k==0&&hl==8)
{
sz[t+1][0][8]=2*sz[t][0][8]+sz[t][0][7]+sz[t][1][7]+sz[t][1][8];
}
if(k==8&&hl==0)
{
sz[t+1][8][0]=2*sz[t][8][0]+sz[t][8][1]+sz[t][7][1]+sz[t][7][0];
}
if(k==8&&hl==8)
{
sz[t+1][8][8]=2*sz[t][8][8]+sz[t][8][7]+sz[t][7][7]+sz[t][7][8];
}
}
}
}
for(int row=0;row<9;row++)
{
for(int lo=0;lo<8;lo++)
{printf("%d ",sz[n][row][lo]);}
printf("%d\n",sz[n][row][8]);
}
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.