label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
48 | 23600 |
int main()
{
int a[11][11]={0},b[11][11]={0};
int n,t;
int i,j;
scanf("%d%d",&t,&n);
a[5][5]=t;
while (n>0)
{
for (i=1;i<=9;i++) for (j=1;j<=9;j++)
{
b[i][j]=2*a[i][j]+a[i-1][j]+a[i-1][j-1]+a[i-1][j+1]+
a[i+1][j]+a[i+1][j+1]+a[i+1][j-1]+
a[i][j-1]+a[i][j+1];
}
for (i=1;i<=9;i++) for (j=1;j<=9;j++)
a[i][j]=b[i][j];
n--;
}
for (i=1;i<=9;i++)
{
for (j=1;j<=8;j++) printf("%d ",a[i][j]);
printf("%d\n",a[i][9]);
}
return 0;
} |
48 | 23601 | int main()
{
int a[11][11]={0},b[11][11] ={0};
int m,n,i,j,k;
int(*p1)[11],(*p2)[11],(*pTemp)[11];
p1=a;
p2=b;
for (i=0;i<=10;i++)
{ for (j=0;j<=10;j++)
{
a[i][j]=0;
b[i][j]=0;
}
}
scanf("%d%d",&m,&n);
a[5][5]=m;
for (k=1;k<=n;k++)
{
for ( i=1;i<=9;i++)
{
for ( j=1;j<=9;j++)
{
int sum= + *(*(p1+i)+ j-1)+*(*(p1+i)+ j+1) +*(*(p1+i-1)+ j) +*(*(p1+i-1)+ j-1)+*(*(p1+i-1)+ j+1) +*(*(p1+i+1)+ j) +*(*(p1+i+1)+ j-1)+*(*(p1+i+1)+ j+1) ;
* (*(p2+i)+j ) = sum +( * ( * (p1+i) +j ) ) *2 ;
}
}
pTemp=p1;
p1=p2;
p2=pTemp;
}
for ( i=1;i<=9;i++)
{
for ( j=1;j<=9;j++)
{
if (j!=9)
printf("%d ",p1[i][j]);
else
printf( "%d\n",p1[i][j]);
}
}
}
|
48 | 23602 | void fanzhi();
int a[9][9]={0};
int zhen[9][9]={0};
int main()
{
int i,j,n,m;
cin>>m;
cin>>n;
a[4][4]=m;
for(i=1;i<=n;i++)
{
fanzhi();
}
for(i=0;i<=8;i++)
{
for(j=0;j<=7;j++)
cout<<a[i][j]<<" ";
cout<<a[i][8];
cout<<endl;
}
return 0;
}
void fanzhi()
{int i,j;
memset(zhen,0,sizeof(zhen));
for(i=0;i<=8;i++)
for(j=0;j<=8;j++)
{
zhen[i+1][j]+=a[i][j];
zhen[i][j]+=a[i][j]*2;
zhen[i-1][j]+=a[i][j];
zhen[i][j-1]+=a[i][j];
zhen[i][j+1]+=a[i][j];
zhen[i+1][j+1]+=a[i][j];
zhen[i-1][j+1]+=a[i][j];
zhen[i+1][j-1]+=a[i][j];
zhen[i-1][j-1]+=a[i][j];
}
for(i=0;i<=8;i++)
for(j=0;j<=8;j++)
{
a[i][j]=zhen[i][j];
}
} |
48 | 23603 | 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 | 23604 | //****************************************
//*??? ??????? **
//*????? 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 | 23605 | //****************************
//*???:2.cpp *
//*??:?? *
//*????:2013?12?6? *
//*????:???????? *
//****************************
int a[11][11] = {0}; //??????a[][]??????,???b????????????
void done ( int m, int n ) //???done????????a??
{
int b[11][11] = {0}, i, j; //??????b[][]???????????????????????
if ( n == 0 ) //?????????????
a[5][5] = m;
else
{
done ( m, n - 1 ); //??????
for ( i = 1; i <= 9; i ++ ) //??????a
for ( j = 1; j <= 9; j ++ )
{
if ( a[i][j] != 0 ) //??a[][]????????????????
{ //????????????????????????
for ( int k = i - 1; k <= i + 1; k ++ )
for ( int t = j - 1; t <= j + 1; t ++ )
b[k][t] = a[i][j] + b[k][t];
b[i][j] = b[i][j] + a[i][j]; //???????????????????????
}
}
for ( i = 1; i <= 9; i ++ ) //????????b???????a?????????????
for ( j = 1; j <= 9; j ++ )
a[i][j] = b[i][j];
}
}
int main() //???
{
int m, n, i, j; //??????m,????n
cin >> m >> n;
done ( m, n ); //????done???
for ( i = 1; i <= 9; i ++ ) //???????????????
for ( j = 1; j <= 9; j ++ )
{
if ( j == 9 )
cout << a[i][j] << endl;
else
cout << a[i][j] << " ";
}
return 0;
} |
48 | 23606 | int main()
{
int i,j,k,m, n, count[9][9],temp[9][9];
memset(count,0,sizeof(count));
memset(temp,0,sizeof(count));
cin >> m >> n;
count[4][4] = m;
for ( i = 0; i < n; i++)
{
for ( j = 0; j <9; j++)
for ( k = 0; k < 9;k++)
{
if ( count[j][k] != 0 )
{
temp[j-1][k] +=count[j][k];
temp[j+1][k]+=count[j][k];
temp[j-1][k-1]+=count[j][k];
temp[j-1][k+1]+=count[j][k];
temp[j][k-1]+=count[j][k];
temp[j][k+1]+=count[j][k];
temp[j+1][k+1]+=count[j][k];
temp[j+1][k-1]+=count[j][k];
temp[j][k] += count[j][k]*2;
}
}
for ( j = 0; j <9; j++)
for ( k = 0; k < 9;k++)
count[j][k] = temp[j][k];
memset(temp,0,sizeof(temp));
}
for ( j = 0; j <9; j++)
{
for ( k = 0; k < 8;k++)
cout << count[j][k] <<' ';
cout << count[j][8] << endl;
}
return 0;
} |
48 | 23607 |
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 | 23608 |
int main()
{
int a[9][9]={0},b[9][9]={0};
int m,n;
int i,j,k,fx,fy;
cin>>m>>n;
a[4][4]=m;
for(int k=0;k<n;k++)
{
memset(b,0,sizeof(b));
for(i=1;i<8;i++)
for(j=1;j<8;j++)
{
b[i][j]+=a[i][j];
for(fx=-1;fx<=1;fx++)
for(fy=-1;fy<=1;fy++)
b[i+fx][j+fy]+=a[i][j];
}
memcpy(a,b,sizeof(a));
}
for(i=0;i<9;i++)
{
cout<<a[i][0];
for(j=1;j<9;j++)
{
cout<<' '<<a[i][j];
}
cout<<endl;
}
return 0;
} |
48 | 23609 | /* title :????????*
* author : ???*
* time : 2011.11.9 */
int a[11][11] = {0};
int b[11][11] = {0};
int m;
int main()
{
int n;
int l, s;
int i, j, k;
cin >> m >> n;
a[5][5] = m;
b[5][5] = m;
for(i = 0; i < n; i++)
{
for(j = 1; j <= 9; j++)
for(k = 1; k <= 9; k++)
{
b[j][k] = a[j][k];
}
for(j = 1; j <= 9; j++)
for(k = 1; k <= 9; k++)
{
a[j][k] = 2 * b[j][k] + b[j][k - 1] + b[j][k + 1] + b[j - 1][k] + b[j + 1][k]
+ b[j + 1][k + 1] + b[j + 1][k - 1] + b[j - 1][k + 1] + b[j - 1][k - 1];
}
}
for(l = 1; l <= 9; l++)
{
for(s = 1; s <= 8; s++)
{
cout << a[l][s] << " ";
}
cout << a[l][9] << endl;
}
return 0;
}
|
48 | 23610 | int main(){
int a[9][9]={0},b[9][9]={0};
int m,n;
int i,j,l;
int x,y;
scanf("%d %d",&m,&n);
a[4][4]=m;
b[4][4]=m;
for(l=0;l<n;l++){
for(i=0;i<9;i++){
for(j=0;j<9;j++){
if(b[i][j]!=0){
for(x=i-1;x<=i+1;x++){
for(y=j-1;y<=j+1;y++){
a[x][y]+=b[i][j];
}
}
}
}
}
for(i=0;i<9;i++){
for(j=0;j<9;j++){
b[i][j]=a[i][j];
}
}
}
for(i=0;i<9;i++){
for(j=0;j<8;j++){
printf("%d ",a[i][j]);
}
printf("%d",a[i][8]);
printf("\n");
}
return 0;
} |
48 | 23611 | int a[11][11],b[11][11];
void fa(int i,int 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][j+1]+b[i][j-1]+b[i+1][j-1]+
b[i+1][j+1];
}
int main()
{
int m,n;
cin>>m>>n;
int i,j;
for(i=0;i<=10;i++)
for(j=0;j<=10;j++)
{
a[i][j]=0;
b[i][j]=0;
}
a[5][5]=m;
for(int z=1;z<=n;z++)
{
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++)
fa(i,j);
}
for(i=1;i<=9;i++)
{
for(j=1;j<=8;j++)
cout<<a[i][j]<<" ";
cout<<a[i][9]<<'\n';
}
return 0;
}
|
48 | 23612 | int main()
{
int m, n, a[10][10] = {0}, t[8][2] = {0,1,0,-1,1,1,1,-1,1,0,-1,1,-1,0,-1,-1};
cin >> m >> n;
a[5][5] = m;
while (n--)
{
int b[10][10] = {0};
for (int i = 1; i <= 9; i++)
for (int j = 1; j <= 9; j++)
{
if (a[i][j] != 0)
{
for (int k = 0; k < 8; k++)
b[i + t[k][0]][j + t[k][1]] += a[i][j];
b[i][j] += a[i][j] * 2;
}
}
for (int i = 1; i <= 9; i++)
for (int j = 1; j <= 9; j++) a[i][j] = b[i][j];
}
for (int i = 1; i <= 9 ; i++)
{
cout << a[i][1];
for (int j = 2; j <= 9; j ++)
{
cout << " " << a[i][j];
}
cout << endl;
}
return 0;
}
|
48 | 23613 | int main()
{
int m,n;
scanf("%d %d",&m,&n);
struct student
{
int nima[9][9];
};
struct student stu[4];
for(int i=1;i<=n;i++)
{
for(int x=0;x<9;x++)
{
for(int y=0;y<9;y++)
{
stu[i-1].nima[x][y]=0;
}
}
if(i==1)
{
stu[i-1].nima[4][4]=2;stu[i-1].nima[4][3]=1;stu[i-1].nima[3][4]=1;stu[i-1].nima[3][3]=1;
stu[i-1].nima[5][3]=1;stu[i-1].nima[3][5]=1;stu[i-1].nima[4][5]=1;stu[i-1].nima[5][5]=1;
stu[i-1].nima[5][4]=1;
}
else
for(int x=4-i;x<5+i;x++)
{
for(int y=4-i;y<5+i;y++)
{
stu[i-1].nima[x][y]=2*stu[i-2].nima[x][y]+stu[i-2].nima[x-1][y-1]+stu[i-2].nima[x-1][y]
+stu[i-2].nima[x-1][y+1]+stu[i-2].nima[x][y-1]+stu[i-2].nima[x][y+1]+stu[i-2].nima[x+1][y-1]
+stu[i-2].nima[x+1][y]+stu[i-2].nima[x+1][y+1];
}
}
}
for(int x=0;x<5;x++)
{
for(int y=0;y<9;y++)
{
if(y==8)printf("%d\n",m*stu[n-1].nima[x][y]);
else printf("%d ",m*stu[n-1].nima[x][y]);
}
}
for(int x=3;x>=0;x--)
{
for(int y=0;y<9;y++)
{
if(y==8)printf("%d\n",m*stu[n-1].nima[x][y]);
else printf("%d ",m*stu[n-1].nima[x][y]);
}
}
}
|
48 | 23614 | 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 | 23615 | //****************************************
//*?????????? **
//*?????? 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 | 23616 | 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 | 23617 | 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 | 23618 | int main()
{
int n, sz[number][number], sz1[number][number], k, i, l, a, b, j, mc;
scanf("%d%d", &n, &k);
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
sz[i][j]=0;
sz1[i][j]=0;
}
}
sz[4][4]=n;
for(l=1;l<=k;l++)
{
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
if(sz[i][j]!=0)
{
sz1[i-1][j-1]=sz1[i-1][j-1]+sz[i][j];
sz1[i-1][j]=sz1[i-1][j]+sz[i][j];
sz1[i-1][j+1]=sz1[i-1][j+1]+sz[i][j];
sz1[i][j-1]=sz1[i][j-1]+sz[i][j];
sz1[i][j]=sz1[i][j]+2*sz[i][j];
sz1[i][j+1]=sz1[i][j+1]+sz[i][j];
sz1[i+1][j-1]=sz1[i+1][j-1]+sz[i][j];
sz1[i+1][j]=sz1[i+1][j]+sz[i][j];
sz1[i+1][j+1]=sz1[i+1][j+1]+sz[i][j];
}
}
}
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
sz[i][j]=sz1[i][j];
sz1[i][j]=0;
}
}
}
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
if(j==8)
printf("%d\n", sz[i][j]);
else
printf("%d ", sz[i][j]);
}
}
return 0;
} |
48 | 23619 | main()
{
int a1[9][9],a2[9][9],m,n,i,j;
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
a1[i][j]=0;
a2[i][j]=0;
}
}
scanf("%d %d",&m,&n);
a1[4][4]=m;
a2[4][4]=m;
for(;n>0;n--)
{
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(a1[i][j]!=0)
{
a2[i][j]=a2[i][j]+a1[i][j];
a2[i-1][j-1]=a2[i-1][j-1]+a1[i][j];
a2[i-1][j]=a2[i-1][j]+a1[i][j];
a2[i-1][j+1]=a2[i-1][j+1]+a1[i][j];
a2[i][j-1]=a2[i][j-1]+a1[i][j];
a2[i][j+1]=a2[i][j+1]+a1[i][j];
a2[i+1][j-1]=a2[i+1][j-1]+a1[i][j];
a2[i+1][j]=a2[i+1][j]+a1[i][j];
a2[i+1][j+1]=a2[i+1][j+1]+a1[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
a1[i][j]=a2[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(j==0)
printf("%d",a2[i][j]);
else if(j==8)
printf(" %d\n",a2[i][j]);
else
printf(" %d",a2[i][j]);
}
}
} |
48 | 23620 | int main(int argc, char* argv[])
{
int s[9][9],b[9][9];
int m,n,i,t,q,a,x,y;
scanf("%d%d",&m,&n);
for(i=0;i<9;i++)
{
for(t=0;t<9;t++)
{
s[i][t]=0;b[i][t]=0;
}
}
s[4][4]=1;
for(q=0;q<n;q++)
{
for(i=0;i<9;i++)
{
for(t=0;t<9;t++)
{
if(s[i][t]>0)
{
a=s[i][t];
for(x=i-1;x<=i+1;x++)
{
for(y=t-1;y<=t+1;y++)
{
b[x][y]+=a;
}
}
b[i][t]+=a;
}
}
}
for(i=0;i<9;i++)
{
for(t=0;t<9;t++)
{
s[i][t]=b[i][t];b[i][t]=0;
}
}
}
for(i=0;i<9;i++)
{
for(t=0;t<9;t++)
{
if(t==0)printf("%d",s[i][t]*m);
else printf(" %d",s[i][t]*m);
}
printf("\n");
}
return 0;
}
|
48 | 23621 | int main(void)
{
int i,j,k;
int num,day;
scanf("%d%d",&num,&day);
int a[day+1][10][10];
for(i=0;i<=day;i++)
{
for(j=1;j<=9;j++)
{
for(k=1;k<=9;k++)
a[i][j][k]=0;
}
}
a[0][5][5]=num;
for(i=1;i<=day;i++)
{
for(j=1;j<=9;j++)
{
for(k=1;k<=9;k++)
{
if(a[i-1][j][k]!=0)
{
a[i][j-1][k-1]+=a[i-1][j][k];
a[i][j-1][k]+=a[i-1][j][k];
a[i][j-1][k+1]+=a[i-1][j][k];
a[i][j][k-1]+=a[i-1][j][k];
a[i][j][k+1]+=a[i-1][j][k];
a[i][j][k]+=2*a[i-1][j][k];
a[i][j+1][k-1]+=a[i-1][j][k];
a[i][j+1][k]+=a[i-1][j][k];
a[i][j+1][k+1]+=a[i-1][j][k];
}
}
}
}
for(j=1;j<=9;j++)
{
for(k=1;k<=8;k++)
{
printf("%d ",a[day][j][k]);
}
printf("%d\n",a[day][j][9]);
}
return 0;
} |
48 | 23622 | int a[9][9] , board[9][9] ;
void add( int i , int j )
{
if ( a[i][j] > 0 )
{
int m ;
m = a[i][j] ;
a[i][j] = 0 ;
board[i][j] = board[i][j] + m*2 ;
board[i+1][j] = board[i+1][j] + m ;
board[i-1][j] = board[i-1][j] + m ;
board[i][j+1] = board[i][j+1] + m ;
board[i][j-1] = board[i][j-1] + m ;
board[i+1][j+1] = board[i+1][j+1] + m ;
board[i+1][j-1] = board[i+1][j-1] + m ;
board[i-1][j+1] = board[i-1][j+1] + m ;
board[i-1][j-1] = board[i-1][j-1] + m ;
add( i+1 , j ) ;
add( i-1 , j ) ;
add( i , j+1 ) ;
add( i , j-1 ) ;
add( i+1 , j+1 ) ;
add( i-1 , j-1 ) ;
add( i+1 , j-1 ) ;
add( i-1 , j+1 ) ;
}
}
int main()
{
int i , j , m , d , sum = 0 , k ;
cin >> m >> d ;
for ( i = 0 ; i < 9 ; i++ )
for ( j = 0 ; j < 9 ; j++ )
a[i][j] = 0 ;
a[4][4] = m ;
for ( k = 0 ; k < d ; k++ )
{
for ( i = 0 ; i < 9 ; i++ )
for ( j = 0 ; j < 9 ; j++ )
board[i][j] = 0 ;
add ( 4 , 4 ) ;
for ( i = 0 ; i < 9 ; i++ )
for ( j = 0 ; j < 9 ; j++ )
a[i][j] = board[i][j] ;
}
for ( i = 0 ; i < 9 ; i++ )
{
for ( j = 0 ; j < 8 ; j++ )
cout << a[i][j] << " " ;
cout << a[i][8] << endl ;
}
return 0 ;
}
|
48 | 23623 | int main()
{
int a[5][9][9],i,j,k,l,m,n;
scanf("%d%d",&m,&n);
for(i=0;i<=n;i++)
{
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
a[i][j][k]=0;
}
}
a[0][4][4]=m;
for(i=0;i<n;i++)
{
for(j=4-i;j<=4+i;j++)
{
for(k=4-i;k<=4+i;k++)
{
l=a[i][j][k];
a[i+1][j-1][k-1]+=l;
a[i+1][j-1][k]+=l;
a[i+1][j-1][k+1]+=l;
a[i+1][j][k-1]+=l;
a[i+1][j][k]+=2*l;
a[i+1][j][k+1]+=l;
a[i+1][j+1][k-1]+=l;
a[i+1][j+1][k]+=l;
a[i+1][j+1][k+1]+=l;
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
printf("%d ",a[n][i][j]);
printf("%d\n",a[n][i][8]);
}
return 0;
}
|
48 | 23624 | //#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 | 23625 | //**************************************
//*???????????
//*????? 1100012780
//*???2011.11.23
//**************************************
int m;//?????
int day;//??
int spread[9][9] = {0};
void bac(int n)
{
int i,j;
int produce[9][9] = {0};
for (i = 0;i <= 8;i++)
for (j = 0;j <= 8;j++)
{
if (spread[i][j] != 0)
{
produce[i][j] += 2 * spread[i][j];//???????????????
produce[i - 1][j - 1] += spread[i][j];//???????
produce[i - 1][j] += spread[i][j];
produce[i - 1][j + 1] += spread[i][j];
produce[i][j + 1] += spread[i][j];
produce[i][j - 1] += spread[i][j];
produce[i + 1][j - 1] += spread[i][j];
produce[i + 1][j] += spread[i][j];
produce[i + 1][j + 1] += spread[i][j];
}
}
for (i = 0;i <= 8;i++)
for (j = 0;j <= 8;j++)
spread[i][j] = produce[i][j];
if (n == day)//???????????
{
for (i = 0;i <= 8;i++)
{
for (j = 0;j <= 8;j++)
{
if (j != 8)
cout<<spread[i][j]<<" ";
else
cout<<spread[i][j];
}
if (i != 8)
cout<<endl;
}
return;
}
bac(n + 1);//?????
}
int main()
{
cin>>m>>day;
spread[4][4] = m;
bac(1);
return 0;
}
|
48 | 23626 | int m, n, i, j;
int xijun[11][11] = {0};
int kuosan(int i, int j, int n);
int main()
{
cin >> m >> n;
for(i = 1; i <= 9; i++)
{
for(j = 1; j <= 9; j++)
{
xijun[i][j] = kuosan(i, j, n);
if(j == 1)
{
cout << xijun[i][j];
}
if(j >= 2 && j <= 9)
{
cout << ' ' << xijun[i][j];
}
}
if(j == 10)
{
cout << endl;
}
}
return 0;
}
int kuosan(int i, int j, int n)
{
if(i == 5 && j == 5 && n == 0)
{
return m;
}
if(i == 5 && j == 5 && n < 0)
{
return 0;
}
if(!(i == 5 && j == 5) && n <= 0)
{
return 0;
}
else
{
return (kuosan(i, j, n - 1) * 2 + kuosan(i - 1, j - 1, n - 1) + kuosan(i - 1, j, n - 1) + kuosan(i, j - 1, n - 1)
+ kuosan(i + 1, j, n - 1) + kuosan(i + 1, j + 1, n - 1) + kuosan(i, j + 1, n - 1) + kuosan(i + 1, j - 1, n - 1)
+ kuosan(i - 1, j + 1, n - 1));
}
} |
48 | 23627 | int board[9][9]={0};
int temp[9][9]={0};
void spread();
void turn();
int main()
{
int zhongxin;
cin >> zhongxin;
board[4][4] = zhongxin;
int days;
cin >> days;
int i,j;
for (i=1;i<=days;i++)
{
spread();
turn();
}
for (i=0;i<9;i++)
{
cout << board[i][0];
for (j=1;j<9;j++)
{
cout << " " << board[i][j] ;
}
cout << endl;
}
return 0;
}
void spread()
{
int i,j;
for (i=0;i<9;i++)
{
for (j=0;j<9;j++)
{
temp[i][j]+=2*board[i][j];
if (i>0)
{
temp[i-1][j]+=board[i][j];
}
if (j>0)
{
temp[i][j-1]+=board[i][j];
}
if (i<8)
{
temp[i+1][j]+=board[i][j];
}
if (j<8)
{
temp[i][j+1]+=board[i][j];
}
if (i<8&&j<8)
{
temp[i+1][j+1]+=board[i][j];
}
if (i<8&&j>0)
{
temp[i+1][j-1]+=board[i][j];
}
if (i>0&&j<8)
{
temp[i-1][j+1]+=board[i][j];
}
if (i>0&&j>0)
{
temp[i-1][j-1]+=board[i][j];
}
}
}
}
void turn()
{
int i,j;
for (i=0;i<9;i++)
{
for (j=0;j<9;j++)
{
board[i][j] = temp[i][j];
}
}
memset(temp, 0, sizeof(temp));
} |
48 | 23628 | main()
{
int *p[6];
int day0[81],day1[81],day2[81],day3[81],day4[81],day5[81];
p[0]=day0;
p[1]=day1;
p[2]=day2;
p[3]=day3;
p[4]=day4;
p[5]=day5;
int m,n;//m??????????? n???????
scanf("%d %d",&m,&n);
int i,j,k;//??????
for(i=0;i<=n;i++)
{
for(j=0;j<81;j++)
{
p[i][j]=0;
}
//??????????????
}
p[0][40]=m;//??????????????
int add;//??
for(k=0;k<n;k++)
{
for(i=0;i<81;i++)
{
add=p[k][i];
p[k+1][i]+=2*add;
p[k+1][i-1]+=add;
p[k+1][i+1]+=add;
p[k+1][i-8]+=add;
p[k+1][i-9]+=add;
p[k+1][i-10]+=add;
p[k+1][i+8]+=add;
p[k+1][i+9]+=add;
p[k+1][i+10]+=add;
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
printf("%d",p[n][i*9+j]);
if(j<8) printf(" ");
else printf("\n");
}
}
}
|
48 | 23629 | int main()
{
int i,j,n,m,a[11][11]={0},b[11][11]={0};
cin >> m >> n;
a[5][5]=m;b[5][5]=m;
while(n)
{
n--;
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if(a[i][j]>0)
{
b[i][j]+=a[i][j];
b[i+1][j]+=1*a[i][j];
b[i][j+1]+=1*a[i][j];
b[i-1][j]+=1*a[i][j];
b[i][j-1]+=1*a[i][j];
b[i+1][j+1]+=1*a[i][j];
b[i+1][j-1]+=1*a[i][j];
b[i-1][j+1]+=1*a[i][j];
b[i-1][j-1]+=1*a[i][j];
}
}
}
for(i=1;i<10;i++)
for(j=1;j<10;j++)
a[i][j]=b[i][j];
}
for(i=1;i<10;i++)
{
for(j=1;j<9;j++)
cout << a[i][j] << " ";
cout << a[i][9] << endl;
}
return 0;
} |
48 | 23630 | int main()
{
int m, n, i, j, k, a[11][11], b[11][11]; //??????????10?????
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] = b[5][5] = m;
for(i = 1;i <= n;i++)
{
for(j = 1;j <= 9;j++)
{
for(k = 1;k <= 9;k++)
{
a[j][k] = b[j][k] * 2 + b[j - 1][k - 1] + b[j - 1][k] + b[j - 1][k + 1] + b[j][k - 1] + b[j][k + 1] + b[j + 1][k - 1] + b[j + 1][k] + b[j + 1][k + 1];
}
}
for(j = 1;j <= 9;j++)
{
for(k = 1;k <= 9;k++)
{
b[j][k] = a[j][k];
}
}
}
for(i = 1;i <= 9;i++)
{
for(j = 1;j <= 8;j++)
{
cout << a[i][j] << " ";
}
cout << a[i][9] << endl;
}
return 0;
} |
48 | 23631 | int main()
{
int m,n,area[9][9]={0},area1[9][9]={0};
scanf("%d%d",&m,&n);
area[4][4]=m;
int i,j;
for(int t=0;t<n;t++)
{
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
area1[i][j]=area[i][j];
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(area[i][j]!=0)
{
area1[i-1][j-1]+=area[i][j];
area1[i-1][j]+=area[i][j];
area1[i-1][j+1]+=area[i][j];
area1[i][j-1]+=area[i][j];
area1[i][j]+=area[i][j];
area1[i][j+1]+=area[i][j];
area1[i+1][j-1]+=area[i][j];
area1[i+1][j]+=area[i][j];
area1[i+1][j+1]+=area[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
area[i][j]=area1[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
printf("%d ",area[i][j]);
}
printf("%d\n",area[i][8]);
}
return 0;
}
|
48 | 23632 | 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 | 23633 |
int main()
{
int num, d, a[9][9] = {0}, tmp[9][9] = {0};
cin >> num >> d;
a[4][4] = num;
for (int i = 0; i < d; i++)
{
for (int x = 0; x < 9; x++)
for (int y = 0; y < 9; y++)
tmp[x][y] = 0;
for (int x = 0; x < 9; x++)
for (int y = 0; y < 9; y++)
{
if(x > 0)
{
tmp[x - 1][y] += a[x][y];
if (y > 0)
{
tmp[x - 1][y - 1] += a[x][y];
if (y < 9)
tmp[x - 1][y + 1] += a[x][y];
}
if (x < 9)
{
tmp[x + 1][y] += a[x][y];
if (y > 0)
{
tmp[x + 1][y - 1] += a[x][y];
if (y < 9)
tmp[x + 1][y + 1] += a[x][y];
}
}
}
if(y > 0)
tmp[x][y - 1] += a[x][y];
if (y < 9)
tmp[x][y + 1] += a[x][y];
tmp[x][y] += a[x][y] * 2;
}
for (int x = 0; x < 9; x++)
for (int y = 0; y < 9; y++)
a[x][y] = tmp[x][y];
}
for (int x = 0; x < 9; x++)
for (int y = 0; y < 9; y++)
{
cout << a[x][y];
if (y == 8)
cout << endl;
else
cout << " ";
}
return 0;
} |
48 | 23634 |
int m, n;
int main()
{
int produce(int x, int y, int n);
cin >> m >> n;
for(int i = 1; i <= 9; i ++)
{
cout << produce(i, 1, n);
for (int j = 2; j <= 9; j ++)
cout << " " << produce(i, j, n);
cout << endl;
}
return 0;
}
int produce(int x, int y, int day)
{
if(x == 0 || y == 0 || x == 10|| y == 10) return 0;
else if(day == 0)
{
if(x == 5 && y == 5) return m;
else return 0;
}
else return
(produce(x - 1, y, day - 1) + produce(x + 1, y, day - 1)
+ produce(x, y - 1, day - 1) + produce(x, y + 1, day - 1)+
produce(x, y , day - 1) * 2) + produce(x - 1, y - 1, day - 1)
+ produce(x - 1, y + 1, day - 1) + produce(x + 1, y - 1, day - 1)
+ produce(x + 1, y + 1, day - 1);
} |
48 | 23635 | 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 | 23636 | int a[9][9][2];
int temp;
void run()
{
for(int i=0;i<9;i++) for(int j=0;j<9;j++)
if(a[i][j][0]) {for(int p=i-1;p<=i+1;p++) for(int q=j-1;q<=j+1;q++) a[p][q][1]+=a[i][j][0];}
for(int i=0;i<9;i++) for(int j=0;j<9;j++) {a[i][j][0]+=a[i][j][1];a[i][j][1]=0;}
}
int main()
{
int m,n;
cin>>m>>n;
for(int i=0;i<9;i++) for(int j=0;j<9;j++) a[i][j][0]=a[i][j][1]=0;
a[4][4][0]=m;
for(int s=1;s<=n;s++) run();
for(int i=0;i<9;i++)
{
cout<<a[i][0][0];
for(int j=1;j<9;j++) cout<<" "<<a[i][j][0];
cout<<endl;
}
} |
48 | 23637 |
int plate1[9][9] = {0}; // ??????
int plate[9][9] = {0};
void count(int k);
int main ()
{
int m, n;
cin >> m >> n;
plate[4][4] = m;
count(n);
return 0;
}
void count(int k)
{
int i, j;
if (k == 0)
{
for (i = 0; i < 9; i++)
{
for (j = 0; j < 8; j++)
{
cout << plate[i][j] << " ";
}
cout << plate[i][j] << endl;
}
return;
}
else
{
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
if (plate[i][j] != 0)
{
if (i > 0 && j > 0)
{
plate1[i - 1][j - 1] = plate1[i - 1][j - 1] + plate[i][j];
}
if (j > 0)
{
plate1[i][j - 1] = plate1[i][j - 1] + plate[i][j];
}
if (i > 0 && j < 8)
{
plate1[i - 1][j + 1] = plate1[i - 1][j + 1] + plate[i][j];
}
if (j < 8)
{
plate1[i][j + 1] = plate1[i][j + 1] + plate[i][j];
}
if (i < 8 && j < 8)
{
plate1[i + 1][j + 1] = plate1[i + 1][j + 1] + plate[i][j];
}
if (i < 8)
{
plate1[i + 1][j] = plate1[i + 1][j] + plate[i][j];
}
if (i < 8 && j > 0)
{
plate1[i + 1][j - 1] = plate1[i + 1][j - 1] + plate[i][j];
}
if (i > 0)
{
plate1[i - 1][j] = plate1[i - 1][j] + plate[i][j];
}
}
}
}
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
plate[i][j] = plate[i][j] * 2 + plate1[i][j];
plate1[i][j] = 0;
}
}
count(k - 1);
}
} |
48 | 23638 | int main()
{
int i=0,j=0,m=0,n=0,a[10][10]={0},p=0,k=0,l=0,t=0,q=0;
cin>>m>>n;
a[4][4]=m;
for(p=0;p<n;p++)
{
int b[10][10]={0};
for(i=1;i<8;i++)
for(j=1;j<8;j++)
{
b[i][j]=b[i][j]+a[i][j];
for(t=-1;t<=1;t++)
for(q=-1;q<=1;q++)
b[i+t][j+q]=b[i+t][j+q]+a[i][j];
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
a[i][j]=b[i][j];
}
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
cout<<a[i][j]<<" ";
cout<<a[i][8]<<endl;
}
return 0;
}
|
48 | 23639 | /******************************************
*
* ???????????
* ???1100017637 ???
* ???2011.11.29
*
******************************************/
// ??????
int ch[9][9][4] = {0};
// ????tab????????????????
void tab(int i, int j, int k)
{
int a, b;
// ?i,j???????????????????
for (a = i - 1; a <= i + 1; a++)
{
for (b = j - 1; b <= j + 1; b++)
{
if ((b == j) && (a == i))
ch[a][b][k+1] += ch[i][j][k] * 2;
else
ch[a][b][k+1] += ch[i][j][k];
}
}
return;
}
// ???
int main()
{
int m, n, x, y, i, j, k = 0, flag = 0;
// ??m????n??
cin >> m >> n;
// ?????4??4??????m
x = 4; y = 4;
ch[x][y][k] = m;
// ??n????n?
for (k = 0; k < n; k++)
{
// ?x,y????????????????tab
for (i = x - k; i <= x + k; i++)
{
for (j = y - k; j <= y + k; j++)
{
tab(i, j, k);
}
}
}
// ??
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
// ?????????
if (flag == 0)
{
cout << ch[i][j][k];
flag = 1;
}
else
{
if (n == 4 && i == 4 && j == 3)
cout << " " << ch[i][j][k] - m;
else
cout << " " << ch[i][j][k];
}
}
flag = 0;
cout << endl;
}
return 0;
} |
48 | 23640 | int main()
{
int m,n;
scanf("%d %d",&m,&n);
int a[9][9]={0};
a[4][4]=m;
int k,i,j;
int b[9][9]={0};
for(k=0;k<n;k++)
{
for(i=1;i<8;i++)
for(j=1;j<8;j++)
{
b[i][j]+=a[i][j]*2;
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]=b[i][j];
b[i][j]=0;
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
printf("%d",a[i][j]);
if(j!=8)
printf(" ");
}
if(i<8)
printf("\n");
}
}
|
48 | 23641 | int board[11][11] = {0}, temp[11][11] = {0};
void increase(int day)
{
if (day == 0)
{
return;
}
int i, j;
for (i = 1; i < 10; i++)
{
for (j = 1; j < 10; j++)
{
temp[i + 1][j + 1] += board[i][j];
temp[i + 1][j - 1] += board[i][j];
temp[i - 1][j - 1] += board[i][j];
temp[i - 1][j + 1] += board[i][j];
temp[i - 1][j] += board[i][j];
temp[i + 1][j] += board[i][j];
temp[i][j - 1] += board[i][j];
temp[i][j + 1] += board[i][j];
temp[i][j] += board[i][j];
}
}
for (i = 1; i < 10; i++)
{
for (j = 1; j < 10; j++)
{
board[i][j] = temp[i][j];
}
}
return increase(day - 1);
}
int main()
{
int num, day,i,j;
cin >> num >> day;
board[5][5] = num;
temp[5][5] = num;
increase(day);
for (i = 1; i < 10; i++)
{
for (j = 1; j < 9; j++)
{
cout << temp[i][j] << " ";
}
cout << temp[i][j] << endl;
}
return 0;
}
|
48 | 23642 |
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 | 23643 | //**************************
//???????????
//?????
//???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 | 23644 | int main()
{
int m, n, i, j, k;
int a[10][10]={0}, b[10][10]={0};
scanf("%d %d", &m, &n);
b[5][5] = m;
a[5][5] = m;
for(i=0;i<n;i++){
for(j=5-i;j<=5+i;j++){
for(k=5-i;k<=5+i;k++){
a[j-1][k-1]+=b[j][k];
a[j-1][k]+=b[j][k];
a[j-1][k+1]+=b[j][k];
a[j][k-1]+=b[j][k];
a[j][k+1]+=b[j][k];
a[j+1][k-1]+=b[j][k];
a[j+1][k]+=b[j][k];
a[j+1][k+1]+=b[j][k];
a[j][k]+=b[j][k];
}
}
for(j=5-i;j<=5+i;j++){
for(k=5-i;k<=5+i;k++){
b[j-1][k-1]=a[j-1][k-1];
b[j-1][k]=a[j-1][k];
b[j-1][k+1]=a[j-1][k+1];
b[j][k-1]=a[j][k-1];
b[j][k+1]=a[j][k+1];
b[j+1][k-1]=a[j+1][k-1];
b[j+1][k]=a[j+1][k];
b[j+1][k+1]=a[j+1][k+1];
b[j][k]=a[j][k];
}
}
}
for(j=1;j<10;j++){
for(k=1;k<10;k++){
if(k!=9)
printf("%d ", a[j][k]);
else
printf("%d\n", a[j][k]);
}
}
return 0;
}
|
48 | 23645 | //**************************
//**ày3ì?oϸ¾ú?Ä·±Ö3óëà©é?**
//**×÷Õß?ooÎ?¨ **
//**ê±¼ä?o2013.12.8 **
//**ÎļtÃû?o2.cpp **
//**************************
int main()
{
int m, n, i, j, g, cnt[9][9] = {0};
cin >> m >> n;
cnt[4][4] = m;
for (i = 0; i < n; i++)
{
int sq[9][9] = {0};
for (j = 0; j < 9; j++)
for (g = 0; g < 9; g++)
{
if (cnt[j][g] != 0)
{
sq[j][g] += cnt[j][g];
if (j + 1 < 9)
{
sq[j + 1][g] += cnt[j][g];
if (g + 1 < 9)
sq[j + 1][g + 1] += cnt[j][g];
if (g - 1 >= 0)
sq[j + 1][g - 1] += cnt[j][g];
}
if (j - 1 >= 0)
{
sq[j - 1][g] += cnt[j][g];
if (g + 1 < 9)
sq[j - 1][g + 1] += cnt[j][g];
if (g - 1 >= 0)
sq[j - 1][g - 1] += cnt[j][g];
}
if (g + 1 < 9)
sq[j][g + 1] += cnt[j][g];
if (g - 1 >= 0)
sq[j][g - 1] += cnt[j][g];
}
}
for (j = 0; j < 9; j++)
for (g = 0; g < 9; g++)
cnt[j][g] += sq[j][g];
}
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++)
{
if (j < 8)
cout << cnt[i][j] << ' ';
else
cout << cnt[i][j] << endl;
}
return 0;
} |
48 | 23646 | int main()
{
int a[M][M]={0};
int m ,n;
scanf("%d%d",&m,&n);
a[M/2][M/2]=m;
for(int k=0;k<n;k++){
int b[M][M]={0};
for(int i=1;i<M-1;i++){
for(int j=1;j<M-1;j++){
b[i][j]+=a[i][j];
for(int I=-1;I<=1;I++){
for(int J=-1;J<=1;J++){
b[i+I][j+J]+=a[i][j];
}
}
}
}
for(int q=0;q<M;q++){
for(int p=0;p<M;p++)
a[q][p]=b[q][p];
}
}
for(int i=0;i<M;i++){
for(int j=0;j<M-1;j++)
printf("%d ",a[i][j]);
printf("%d\n",a[i][M-1]);
}
} |
48 | 23647 | int m;
int numb(int,int,int);
int main()
{
int day,h,i,j;
cin>>m>>day;
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
if(j!=8)
cout<<numb(i,j,day)<<" ";
else
cout<<numb(i,j,day)<<endl;
}
}
return 0;
}
int numb(int h,int l,int d) //????????????
{
if(h==4&&l==4&&d==0)
{
return m;
}
if((h!=4||l!=4)&&d==0)
{
return 0;
}
else if(d!=0)
{
return (2*numb(h,l,d-1)+numb(h+1,l,d-1)+numb(h-1,l,d-1)+numb(h,l+1,d-1)+numb(h,l-1,d-1)+numb(h+1,l+1,d-1)+numb(h+1,l-1,d-1)+numb(h-1,l+1,d-1)+numb(h-1,l-1,d-1));
}
return 0;
}
|
48 | 23648 | int main()
{
int m=0;int n,i,j;
cin>>m>>n;
int a[10][10]={0},b[10][10]={0},c[10][10]={0},d[10][10]={0},e[10][10]={0};
a[5][5]=m;
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];
b[i+1][j]=a[i][j]+b[i+1][j];
b[i-1][j]=a[i][j]+b[i-1][j];
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][j+1]=a[i][j]+b[i][j+1];
b[i+1][j-1]=a[i][j]+b[i+1][j-1];
b[i-1][j-1]=a[i][j]+b[i-1][j-1];
b[i][j-1]=a[i][j]+b[i][j-1];}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
if(b[i][j]!=0){c[i][j]=2*b[i][j]+c[i][j];
c[i+1][j]=b[i][j]+c[i+1][j];
c[i-1][j]=b[i][j]+c[i-1][j];
c[i+1][j+1]=b[i][j]+c[i+1][j+1];
c[i-1][j+1]=b[i][j]+c[i-1][j+1];
c[i][j+1]=b[i][j]+c[i][j+1];
c[i+1][j-1]=b[i][j]+c[i+1][j-1];
c[i-1][j-1]=b[i][j]+c[i-1][j-1];
c[i][j-1]=b[i][j]+c[i][j-1];}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
if(c[i][j]!=0){d[i][j]=2*c[i][j]+d[i][j];
d[i+1][j]=c[i][j]+d[i+1][j];
d[i-1][j]=c[i][j]+d[i-1][j];
d[i+1][j+1]=c[i][j]+d[i+1][j+1];
d[i-1][j+1]=c[i][j]+d[i-1][j+1];
d[i][j+1]=c[i][j]+d[i][j+1];
d[i+1][j-1]=c[i][j]+d[i+1][j-1];
d[i-1][j-1]=c[i][j]+d[i-1][j-1];
d[i][j-1]=c[i][j]+d[i][j-1];}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
if(d[i][j]!=0){e[i][j]=2*d[i][j]+e[i][j];
e[i+1][j]=d[i][j]+e[i+1][j];
e[i-1][j]=d[i][j]+e[i-1][j];
e[i+1][j+1]=d[i][j]+e[i+1][j+1];
e[i-1][j+1]=d[i][j]+e[i-1][j+1];
e[i][j+1]=d[i][j]+e[i][j+1];
e[i+1][j-1]=d[i][j]+e[i+1][j-1];
e[i-1][j-1]=d[i][j]+e[i-1][j-1];
e[i][j-1]=d[i][j]+e[i][j-1];}
if(n==1)
for(i=1;i<=9;i++)
for(j=1;j<=9;j++){if(j!=9)cout<<b[i][j]<<" ";else cout<<b[i][j]<<endl;}
if(n==2)
for(i=1;i<=9;i++)
for(j=1;j<=9;j++){if(j!=9)cout<<c[i][j]<<" ";else cout<<c[i][j]<<endl;}
if(n==3)
for(i=1;i<=9;i++)
for(j=1;j<=9;j++){if(j!=9)cout<<d[i][j]<<" ";else cout<<d[i][j]<<endl;}
if(n==4)
for(i=1;i<=9;i++)
for(j=1;j<=9;j++){if(j!=9)cout<<e[i][j]<<" ";else cout<<e[i][j]<<endl;}
cin.get();cin.get();
return 0;
} |
48 | 23649 | int leap;
int direction[8][2]={{0,1},{0,-1},{1,0},{-1,0},{1,1},{-1,-1},{1,-1},{-1,1}} ;
int n;
void born (int a[9][9],int d)
{
int m=0,w,e,b[9][9]={0};
if (d==0)
{
return ;
}
for (int i=0;i<9;i++)
for (int j=0;j<9;j++)
b[i][j]=a[i][j];
for (int i=0;i<9;i++)
{
for (int j=0;j<9;j++)
{
if (b[i][j]!=0)
{
w=b[i][j];
a[i][j]+=2*w;
for (m=0;m<8;m++)
{
e=b[i+direction[m][0]][j+direction[m][1]];
a[i+direction[m][0]][j+direction[m][1]]+=w;
}
}
}
}
for (int i=0;i<9;i++)
for (int j=0;j<9;j++)
a[i][j]-=b[i][j];
born (a,d-1);
}
int main ()
{
int m,a[9][9]={0};
cin >>m>>n;
a[4][4]=m;
born (a,n);
for (int i=0;i<9;i++)
{
leap=0;
for (int j=0;j<9;j++)
{
if (leap==0)
{
leap=1;
cout <<a[i][j];
}
else cout <<" "<<a[i][j];
}
cout <<endl;
}
return 0;
} |
48 | 23650 | 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 | 23651 | int main(int argc, char* argv[])
{
int a[11][11],m,n,i,j,t,b[11][11];
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
a[i][j]=0;
b[i][j]=0;
}
}
scanf("%d %d",&m,&n);
a[5][5]=m;
for(t=0;t<n;t++)
{
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
b[i][j]=a[i][j]+(a[i][j-1]+a[i][j+1]+a[i-1][j-1]+a[i-1][j]+a[i+1][j+1]+a[i+1][j]+a[i+1][j-1]+a[i-1][j+1]);
}
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
a[i][j]+=b[i][j];
}
}
}
for(i=1;i<10;i++)
{
for(j=1;j<9;j++)
{
printf("%d ",a[i][j]);
}
printf("%d\n",a[i][j]);
}
return 0;
} |
48 | 23652 | /**********************
*file:2.cpp
*author:??
*time:2013-12-9
*description:?????????????
**********************/
int main()
{
int b[9][9];
int m, n;
cin >> m >> n;
for (int i = 0; i < 9; i++)
{
for (int j = 0; j < 9; j++)
{
b[i][j] = 0;
}
}
b[4][4] = m;//???
void f(int p[][9], int n);
f(b,n);//????
for (int i = 0; i < 9; i++)
{
for (int j = 0; j < 9; j++)
{
cout << b[i][j];
if (j < 8)
cout << ' ';
}
cout << endl;
}//??
return 0;
}
void f(int p[][9], int n)
{
if (n==0)
return;//??????
f(p,n - 1);//??
int w[9][9];
for (int i = 0; i < 9; i++)
{
for (int j = 0; j < 9; j++)
{
w[i][j] = p[i][j];
}
}
for (int i = 0; i < 9; i++)
{
for (int j = 0; j < 9; j++)
{
if (p[i][j] > 0)
for (int k = i - 1; k <= i + 1; k++)
for (int s = j - 1; s <= j + 1; s++)
w[k][s] = w[k][s] + p[i][j];
}
}//??????
for (int i = 0; i < 9; i++)
for (int j = 0; j < 9; j++)
p[i][j] = w[i][j];
} |
48 | 23653 | //
// main.cpp
// ????????
//
// Created by ?? on 12-12-15.
// Copyright (c) 2012? ??. All rights reserved.
//
int board[9][9] = {0};
void production(int days)
{
int separation[9][9], i, j;
if (days == 0)
return;
else
{
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++)
{
board[i][j] *= 10;
separation[i][j] = (board[i][j] - 2 * board[i][j] / 10) / 8;
board[i][j] = 2 * board[i][j] / 10;
}
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++)
{
board[i + 1][j] += separation[i][j];
board[i - 1][j] += separation[i][j];
board[i][j + 1] += separation[i][j];
board[i][j - 1] += separation[i][j];
board[i + 1][j + 1] += separation[i][j];
board[i - 1][j + 1] += separation[i][j];
board[i + 1][j - 1] += separation[i][j];
board[i - 1][j - 1] += separation[i][j];
}
production(days - 1);
}
}
int main()
{
int num, days, i, j;
cin >> num >> days;
board[4][4] = num;
production(days);
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++)
{ if (j == 8)
cout << board[i][j] <<endl;
else
cout << board[i][j] << " ";
}
return 0;
} |
48 | 23654 |
int f(int x, int y, int n)
{
if(n==0)
{
if(x==5&&y==5)
return 1;
else
return 0;
}
else
return f(x-1, y-1, n-1)+f(x-1, y, n-1)+f(x-1, y+1, n-1)+f(x, y-1, n-1)+
f(x, y+1, n-1)+f(x+1, y-1, n-1)+f(x+1, y, n-1)+f(x+1, y+1, n-1)+2*f(x, y, n-1);
};
int main()
{
int a[11][11], i, j, m, n;
cin >> m >> n;
for(i=1; i<10; i++)
for(j=1; j<10; j++)
{
if(j==9)
cout << m*f(i, j, n) << endl;
else
cout << m*f(i, j, n) << " ";
}
return 0;
} |
48 | 23655 | int map[11][11][4],i,j,k;
main()
{ int m,n;
memset(map,0,sizeof(map));
scanf("%d %d",&m,&n);
map[5][5][0]=m;
for(k=1;k<=n;k++)
{ for(i=1;i<10;i++)
for(j=1;j<10;j++)
{map[i][j][k]=2*map[i][j][k-1]+map[i-1][j-1][k-1]+map[i-1][j][k-1]+map[i-1][j+1][k-1]
+map[i][j-1][k-1]+map[i][j+1][k-1]+map[i+1][j-1][k-1]+map[i+1][j][k-1]+map[i+1][j+1][k-1];}
}
for(i=1;i<10;i++)
{ for(j=1;j<10;j++)
{if(j!=9)
printf("%d ",map[i][j][n]);
else
printf("%d\n",map[i][j][n]);}
}
}
|
48 | 23656 |
int test[9][9];
int follow[9][9];
void change()
{
int i,j;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
test[i][j]+=follow[i][j]*2;
test[i-1][j]+=follow[i][j];
test[i+1][j]+=follow[i][j];
test[i][j-1]+=follow[i][j];
test[i][j+1]+=follow[i][j];
test[i-1][j-1]+=follow[i][j];
test[i-1][j+1]+=follow[i][j];
test[i+1][j-1]+=follow[i][j];
test[i+1][j+1]+=follow[i][j];
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
test[i][j]=test[i][j]-follow[i][j];
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
follow[i][j]=test[i][j];
}
int main()
{
int m,n;
cin>>m>>n;
int i,j;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
test[i][j]=0;
follow[i][j]=0;
}
test[4][4]=follow[4][4]=m;
while(n--)
{
change();
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
cout<<test[i][j]<<" ";
cout<<test[i][8];
cout<<endl;
}
return 0;
}
|
48 | 23657 | //????
int chess[15][15]={0};
int d;
int f(int i,int j,int k)
{
if(i<1||i>9||j<1||j>9) return 0;
if(k==0) return chess[i][j];
return f(i,j,k-1)*2+f(i,j-1,k-1)+f(i,j+1,k-1)+f(i+1,j,k-1)+f(i-1,j,k-1)+f(i-1,j-1,k-1)+f(i-1,j+1,k-1)+f(i+1,j-1,k-1)+f(i+1,j+1,k-1);
}
int main()
{
cin>>chess[5][5]>>d;
int i,j;
for(i=1;i<=9;i++)
{
cout<<f(i,1,d);
for(j=2;j<=9;j++)
{
cout<<" "<<f(i,j,d);
}
cout<<endl;
}
return 0;
} |
48 | 23658 | int main()
{
int a[9][9], b[9][9];
int m, n;
int i, j, k;
cin>>m;
cin>>n;
for(j=0;j<9;j++)
{
for(i=0;i<9;i++)
{
a[j][i]=0;
}
}
for(j=0;j<9;j++)
{
for(i=0;i<9;i++)
{
b[j][i]=0;
}
}
for(k=0;k<n;k++)
{
if(k==0)
{
a[4][4]=2*m;
a[3][3]=m;
a[3][4]=m;
a[3][5]=m;
a[4][3]=m;
a[4][5]=m;
a[5][3]=m;
a[5][4]=m;
a[5][5]=m;
}
if(k==1)
{
for(j=1;j<8;j++)
{
for(i=1;i<8;i++)
{
b[j][i]=2*a[j][i]+a[j-1][i-1]+a[j-1][i]+a[j-1][i+1]+a[j][i-1]+a[j][i+1]+a[j+1][i-1]+a[j+1][i]+a[j+1][i+1];
}
}
for(j=0;j<9;j++)
{
for(i=0;i<9;i++)
{
a[j][i]=b[j][i];
}
}
}
if(k==2)
{
for(j=1;j<8;j++)
{
for(i=1;i<8;i++)
{
b[j][i]=2*a[j][i]+a[j-1][i-1]+a[j-1][i]+a[j-1][i+1]+a[j][i-1]+a[j][i+1]+a[j+1][i-1]+a[j+1][i]+a[j+1][i+1];
}
}
for(j=0;j<9;j++)
{
for(i=0;i<9;i++)
{
a[j][i]=b[j][i];
}
}
}
if(k==3)
{
for(j=1;j<8;j++)
{
for(i=1;i<8;i++)
{
b[j][i]=2*a[j][i]+a[j-1][i-1]+a[j-1][i]+a[j-1][i+1]+a[j][i-1]+a[j][i+1]+a[j+1][i-1]+a[j+1][i]+a[j+1][i+1];
}
}
for(i=1;i<8;i++)
{
b[0][i]=a[1][i-1]+a[1][i]+a[1][i+1];
}
for(i=1;i<8;i++)
{
b[8][i]=a[7][i-1]+a[7][i]+a[7][i+1];
}
for(j=1;j<8;j++)
{
b[j][0]=a[j-1][1]+a[j][1]+a[j+1][1];
}
for(j=1;j<8;j++)
{
b[j][8]=a[j-1][7]+a[j][7]+a[j+1][7];
}
b[0][8]=b[8][8]=b[8][0]=b[0][0]=a[1][1];
for(j=0;j<9;j++)
{
for(i=0;i<9;i++)
{
a[j][i]=b[j][i];
}
}
}
}
for(j=0;j<9;j++)
{
for(i=0;i<8;i++)
{
cout<<a[j][i]<<" ";
}
cout<<a[j][8]<<endl;
}
return 0;
}
|
48 | 23659 | main()
{
int m,n;
int b[5][11][11]={0};
int i,j,k;
scanf("%d %d",&m,&n);
b[0][5][5]=m;
for(i=1;i<n+1;i++)
{
for(j=5-i;j<=5+i;j++)
{
for(k=5-i;k<=5+i;k++)
{
b[i][j][k]=2*b[i-1][j][k]+b[i-1][j][k-1]+b[i-1][j][k+1]+b[i-1][j-1][k-1]+b[i-1][j-1][k+1]+b[i-1][j-1][k]+b[i-1][j+1][k]+b[i-1][j+1][k-1]+b[i-1][j+1][k+1];
}
}
}
for(i=1;i<10;i++)
{
printf("%d",b[n][i][1]);
for(j=2;j<10;j++)
printf(" %d",b[n][i][j]);
printf("\n");
}
}
|
48 | 23660 | 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 | 23661 | /**
* @file 1.cpp
* @author ??? 1100012944
* @date 2011-11-23
* @description
* ???????????????
*/
int day, num0;
int germf(int x, int y, int t)
{
if ( t == 0 && x == 5 && y == 5 )
return num0;
else if ( t == 0 && x >= 0 && x <= 10 && y >= 0 && y <= 10 )
return 0;
else if ( x >= 5 - day && x <= 5 + day && y >= 5 - day && y <= 5 + day )
return (germf(x - 1, y - 1, t - 1) +
germf(x - 1, y, t - 1) +
germf(x - 1, y + 1, t - 1) +
germf(x, y - 1, t - 1) +
germf(x, y + 1, t - 1) +
germf(x + 1, y - 1, t - 1) +
germf(x + 1, y, t - 1) +
germf(x + 1, y + 1, t - 1) +
2 * germf(x, y, t - 1));
else
return 0;
}
int main()
{
int i, j;
cin >> num0 >> day;
for ( i = 1; i <= 9; i++)
{
cout << germf(i, 1, day);
for ( j = 2; j <= 9; j ++)
cout <<" "<< germf(i,j, day);
cout << endl;
}
return 0;
}
|
48 | 23662 |
void fz( int , int[11][11]);
int main()
{
int f ,d ;
int pym[11][11]={0};
cin >> f >> d;
pym[5][5] = f;
fz( d , pym );
for( int i = 1 ; i <= 9 ; i++)
{
for( int j = 1 ; j <= 9 ; j ++)
{
if( j < 9)
{
cout<<pym[i][j]<<" ";
}
else
{
cout<<pym[i][j];
}
}
cout<<endl;
}
return 0;
}
void fz( int day , int pym[11][11])
{
if( day == 0)
{
return ;
}
else
{
int temp[11][11] = {0};
for( int a = 1 ; a <=10 ; a++)
{
for( int b = 1 ; b <= 10 ; b ++)
{
if( pym[a][b] > 0)
{
temp[a][b] += 2 * pym[a][b];
temp[a - 1][b] += pym[a][b];
temp[a + 1][b] += pym[a][b];
temp[a ][b - 1] += pym[a][b];
temp[a ][b + 1] += pym[a][b];
temp[a + 1][b + 1] += pym[a][b];
temp[a + 1 ][b - 1] += pym[a][b];
temp[a - 1 ][b + 1] += pym[a][b];
temp[a - 1][b - 1] += pym[a][b];
}
else
{
continue;
}
}
}
for( int c = 1 ; c <=10 ; c++)
{
for( int d = 1 ; d <= 10 ; d ++)
{
pym[c][d] = temp[c][d];
}
}
fz( day - 1, pym);
}
}
|
48 | 23663 | main()
{
int i,j,k,l,m,n,x;
int b[11][11]={0};
int c[11][11]={0};
scanf("%d %d",&x,&m);
c[5][5]=x;
for(n=1;n<=m;n++)
{
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
b[i][j]=c[i][j];
}
for(i=5-n;i<=5+n;i++)
{
for(j=5-n;j<=5+n;j++)
{
for(k=-1;k<=1;k++)
{
for(l=-1;l<=1;l++)
{
c[i][j]=c[i][j]+b[i-l][j-k];
}
}
}
}
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if(j==1)
{printf("%d",c[i][j]);}
else
{printf(" %d",c[i][j]);}
}
printf("\n");
}
}
|
48 | 23664 | 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 | 23665 |
int main()
{
int a[9][9],b[9][9];
int n,m,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++)
{
if(b[i][j]!=0)
{
a[i][j]=b[i][j]+a[i][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][j-1]=b[i][j]+a[i][j-1];
a[i+1][j-1]=b[i][j]+a[i+1][j-1];
a[i+1][j]=b[i][j]+a[i+1][j];
a[i][j+1]=b[i][j]+a[i][j+1];
a[i+1][j+1]=b[i][j]+a[i+1][j+1];
a[i-1][j+1]=b[i][j]+a[i-1][j+1];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
b[i][j]=a[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
printf("%d",b[i][j]);
if(j!=8)
printf(" ");
else
printf("\n");
}
}
return 0;
}
|
48 | 23666 | /*
* Q6.cpp
*
* Created on: 2011-1-9
* Author: jsgl
*/
int board[9][9];
void printBoard();
int main() {
memset(board, 0, sizeof(board));
int m, n, i, j, k;
cin >> m >> n;
board[4][4] = m;
for (i = 3; i < 6; i++)
for (j = 3; j < 6; j++)
board[i][j] += m;
int temp[9][9];
if (n >= 2) {
memset(temp, 0, sizeof(temp));
for (i = 3; i < 6; i++)
for (j = 3; j < 6; j++) {
board[i][j] *= 2;
temp[i][j] = board[i][j];
}
//printBoard();
for (i = 3; i < 6; i++)
for (j = 3; j < 6; j++) {
board[i - 1][j] += temp[i][j] / 2;
board[i + 1][j] += temp[i][j] / 2;
board[i][j + 1] += temp[i][j] / 2;
board[i][j - 1] += temp[i][j] / 2;
board[i - 1][j - 1] += temp[i][j] / 2;
board[i + 1][j + 1] += temp[i][j] / 2;
board[i - 1][j + 1] += temp[i][j] / 2;
board[i + 1][j - 1] += temp[i][j] / 2;
}
}
if (n >= 3) {
memset(temp, 0, sizeof(temp));
for (i = 2; i < 7; i++)
for (j = 2; j < 7; j++) {
board[i][j] *= 2;
temp[i][j] = board[i][j];
}
for (i = 2; i < 7; i++)
for (j = 2; j < 7; j++) {
board[i - 1][j] += temp[i][j] / 2;
board[i + 1][j] += temp[i][j] / 2;
board[i][j + 1] += temp[i][j] / 2;
board[i][j - 1] += temp[i][j] / 2;
board[i - 1][j - 1] += temp[i][j] / 2;
board[i + 1][j + 1] += temp[i][j] / 2;
board[i - 1][j + 1] += temp[i][j] / 2;
board[i + 1][j - 1] += temp[i][j] / 2;
}
}
if (n >= 4) {
memset(temp, 0, sizeof(temp));
for (i = 1; i < 8; i++)
for (j = 1; j < 8; j++) {
board[i][j] *= 2;
temp[i][j] = board[i][j];
}
for (i = 1; i < 8; i++)
for (j = 1; j < 8; j++) {
board[i - 1][j] += temp[i][j] / 2;
board[i + 1][j] += temp[i][j] / 2;
board[i][j + 1] += temp[i][j] / 2;
board[i][j - 1] += temp[i][j] / 2;
board[i - 1][j - 1] += temp[i][j] / 2;
board[i + 1][j + 1] += temp[i][j] / 2;
board[i - 1][j + 1] += temp[i][j] / 2;
board[i + 1][j - 1] += temp[i][j] / 2;
}
}
printBoard();
return 0;
}
void printBoard() {
int i, j;
for (i = 0; i < 9; i++) {
cout << board[i][0];
for (j = 1; j < 9; j++)
cout << " " << board[i][j];
cout << endl;
}
}
|
48 | 23667 |
int board[11][11] = {0}, temp[11][11] = {0};
void increase(int day)
{
if (day == 0)
{
return;
}
int i, j;
for (i = 1; i < 10; i++)
{
for (j = 1; j < 10; j++)
{
temp[i + 1][j + 1] += board[i][j];
temp[i + 1][j - 1] += board[i][j];
temp[i - 1][j - 1] += board[i][j];
temp[i - 1][j + 1] += board[i][j];
temp[i - 1][j] += board[i][j];
temp[i + 1][j] += board[i][j];
temp[i][j - 1] += board[i][j];
temp[i][j + 1] += board[i][j];
temp[i][j] += board[i][j];
}
}
memcpy(board, temp, sizeof(int)*121);
return increase(day - 1);
}
int main()
{
int num, day,i,j;
cin >> num >> day;
board[5][5] = num;
temp[5][5] = num;
increase(day);
for (i = 1; i < 10; i++)
{
for (j = 1; j < 9; j++)
{
cout << temp[i][j] << " ";
}
cout << temp[i][j] << endl;
}
return 0;
} |
48 | 23668 | //????A????006
//????????????2010? ???
int main()
{int a[11][11][5];
int m,n,i,j,k,x,y,flag=0;
cin>>m>>n;
for(j=0;j<11;j++)
{
for(k=0;k<11;k++)
a[j][k][0]=0;
}
for(x=0;x<4;x++)
{for(y=0;y<11;y++)
{a[0][y][x]=0;
a[y][0][x]=0;
a[10][y][x]=0;
a[y][10][x]=0;}
}
a[5][5][0]=m;
for(i=1;i<=n;i++)
{
for(j=1;j<10;j++)
{
for(k=1;k<10;k++)
a[j][k][i]=a[j][k][i-1]*2+a[j][k-1][i-1]+a[j][k+1][i-1]+a[j+1][k][i-1]+a[j+1][k+1][i-1]+a[j+1][k-1][i-1]+a[j-1][k-1][i-1]+a[j-1][k][i-1]+a[j-1][k+1][i-1];
}}
for(j=1;j<10;j++)
{
for(k=1;k<10;k++)
{cout<<a[j][k][n];
flag=flag+1;
if(flag!=9) cout<<" ";
else if(flag==9)
{cout<<endl;
flag=0;}
}
}
return 0;
} |
48 | 23669 | 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 | 23670 | 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 | 23671 |
int main()
{
int m=0,n=0;
int i=0,j=0;
int col_num=0,row_num;
int In[9][9]={{0}};
int Out[9][9]={{0}};
int Temp[9][9]={{0}};
int around[8][2]={{1,0},{-1,0},{0,1},{0,-1},{1,1},{1,-1},{-1,1},{-1,-1}};
scanf("%d %d",&m,&n);
In[4][4]=m;
for(i=0;i<n;i++)
{
if(i!=0)
{
memcpy(In,Out,81*sizeof(int));
memset(Out,0,81*sizeof(int));
}
for(row_num=4-i;row_num<=4+i;row_num++)
{
for(col_num=4-i;col_num<=4+i;col_num++)
{
Out[row_num][col_num]=Out[row_num][col_num]+2*In[row_num][col_num];
for(j=0;j<8;j++)
{
Out[row_num+around[j][0]][col_num+around[j][1]]=Out[row_num+around[j][0]][col_num+around[j][1]]+In[row_num][col_num];
}
}
}
}
for(row_num=0;row_num<9;row_num++)
{
for(col_num=0;col_num<9;col_num++)
{
if(col_num!=8)
{
printf("%d ",Out[row_num][col_num]);
}
else
{
printf("%d\n",Out[row_num][col_num]);
}
}
}
}
|
48 | 23672 | int main()
{
//???????
int m, n, i,j, k, l;
int sqare[2][11][11]={0};//[2]??????????????????????,[9][9]???[2][2]?????
cin>>m>>n;
for(j=0; j<2; j++)
for(k=1; k<=9; k++)
for(l=1; l<=9; l++)
{
sqare[j][k][l]=0;
}
sqare[0][5][5]=m;
for(i=0; i<n; i++)//??
{
//??????????
for(k=1; k<=9; k++)
for(l=1; l<=9; l++)
{
sqare[1][k][l]+=2*sqare[0][k][l];
sqare[1][k-1][l]+=sqare[0][k][l];
sqare[1][k+1][l]+=sqare[0][k][l];
sqare[1][k][l+1]+=sqare[0][k][l];
sqare[1][k][l-1]+=sqare[0][k][l];
sqare[1][k-1][l-1]+=sqare[0][k][l];
sqare[1][k-1][l+1]+=sqare[0][k][l];
sqare[1][k+1][l-1]+=sqare[0][k][l];
sqare[1][k+1][l+1]+=sqare[0][k][l];
}
//?????????
for(k=1; k<=9; k++)
for(l=1; l<=9; l++)
{
sqare[0][k][l]=sqare[1][k][l];
}
//?0
for(k=1; k<=9; k++)
for(l=1; l<=9; l++)
{
sqare[1][k][l]=0;
}
}
//??
for(k=1; k<=9; k++)
{
for(l=1; l<=9; l++)
{
if(l==1)
cout<<sqare[0][k][l];
else
cout<<" "<<sqare[0][k][l];
}
cout<<endl;
}
return 0;
}
|
48 | 23673 | 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 | 23674 |
int main (){
int m,n;
int a[11][11]={0};
int b[11][11]={0};
int day,i,j;
scanf("%d%d",&m,&n);
a[5][5]=m;
for(day=0;day<n;day++){
for(i=1;i<10;i++){
for(j=1;j<10;j++){
if(a[i][j]!=0){
b[i][j]+=a[i][j];
b[i-1][j]+=a[i][j];
b[i+1][j]+=a[i][j];
b[i][j+1]+=a[i][j];
b[i][j-1]+=a[i][j];
b[i-1][j-1]+=a[i][j];
b[i-1][j+1]+=a[i][j];
b[i+1][j+1]+=a[i][j];
b[i+1][j-1]+=a[i][j];
}
}
}
for(i=1;i<10;i++){
for(j=1;j<10;j++){
a[i][j]+=b[i][j];
b[i][j]=0;
}
}
}
for(i=1;i<10;i++){
for(j=1;j<10;j++){
if(j!=9){
printf("%d ",a[i][j]);
}
if(j==9){
printf("%d\n",a[i][j]);
}
}
}
return 0;
}
|
48 | 23675 |
int main()
{
int a[10][10] = {0}, b[10][10] = {0}, n, m;
int t[8][2] = {0, 1, 0, -1, 1, -1, 1, 1, 1, 0, -1, -1, -1, 0, -1, 1};
cin >> m >> n;
a[5][5] = m;
while (n--)
{
memset(b, 0, sizeof(b));
for (int i = 1; i <= 9; i++)
for (int j = 1; j <= 9; j++)
{
if (a[i][j] != 0)
{
for (int k = 0; k <= 7; k++)
{
b[i+t[k][0]][j+t[k][1]] += a[i][j];
}
b[i][j] += a[i][j] * 2;
}
}
for (int i = 1; i <= 9; i++)
for (int j = 1; j <= 9; j++)
{
a[i][j] = b[i][j];
}
}
for (int i = 1;i <= 9; i++)
{
cout << a[i][1];
for (int j = 2; j<= 9; j++) cout << " " << a[i][j];
cout << endl;
}
return 0;
}
|
48 | 23676 | main()
{
int **squre1;
int **squre2;
squre1=(int**)calloc(len,sizeof(int*));
squre2=(int**)calloc(len,sizeof(int*));
for(int i=0;i<9;i++)
{
squre1[i]=(int*)calloc(len,sizeof(int));
squre2[i]=(int*)calloc(len,sizeof(int));
}
int day;
scanf("%d%d",&squre1[4][4],&day);
for(int n=0;n<day;n++)
{
for(int i=4-n;i<=4+n;i++)
for(int j=4-n;j<=4+n;j++)
for(int x=i-1;x<=i+1;x++)
for(int y=j-1;y<=j+1;y++)
if(n%2==0)
squre2[x][y]=0;
else
squre1[x][y]=0;
for(int i=4-n;i<=4+n;i++)
for(int j=4-n;j<=4+n;j++)
for(int x=i-1;x<=i+1;x++)
for(int y=j-1;y<=j+1;y++)
{
if(x==i&&y==j)
{if(n%2==0)
squre2[x][y]+=2*squre1[i][j];
else
squre1[x][y]+=2*squre2[i][j];
}
else
if(n%2==0)
squre2[x][y]+=squre1[i][j];
else
squre1[x][y]+=squre2[i][j];
}
}
if(day%2==0)
for(int i=0;i<len;i++)
{
int count=0;
for(int j=0;j<len;j++)
{
if(count==0)
{printf("%d",squre1[i][j]);
count=1;}
else
printf(" %d",squre1[i][j]);
}
printf("\n");
}
else
for(int i=0;i<len;i++)
{
int count=0;
for(int j=0;j<len;j++)
{
if(count==0)
{printf("%d",squre2[i][j]);
count=1;}
else
printf(" %d",squre2[i][j]);
}
printf("\n");
}
} |
48 | 23677 | /*
* 1.cpp
*
* Created on: 2012-12-25
* Author: Administrator
*/
int main()
{
int a[10][10] = {0}, b[10][10] = {0};
int i, j, m, n, p = 0, k;
cin >> m >> n;
a[5][5] = m;
for(k = 0; k < n; k++)
{
for(i = 1; i <= 9; i++)
for(j = 1; j <= 9; j++)
{
if(a[i][j] != 0)
{
p = a[i][j];
b[i][j] = b[i][j] + 2 * p;
b[i - 1][j] = b[i - 1][j] + p;
b[i + 1][j] = b[i + 1][j] + p;
b[i - 1][j + 1] = b[i - 1][j + 1] + p;
b[i - 1][j - 1] = b[i - 1][j - 1] + p;
b[i][j + 1] = b[i][j + 1] + p;
b[i][j - 1] = b[i][j - 1] + p;
b[i + 1][j + 1] = b[i + 1][j + 1] + p;
b[i + 1][j - 1] = b[i + 1][j - 1] + p;
}
}
for(i = 1; i <= 9; i++)
for(j = 1; j <= 9; j++)
{
a[i][j] = b[i][j];
b[i][j] = 0;
}
}
for (i = 1; i <= 9; i++)
{
for(j = 1; j <= 9; j++)
{
cout << a[i][j];
if(j != 9)
cout << ' ';
}
cout << endl;
}
return 0;
}
|
48 | 23678 | int main(){
int A[5][12][12],i,j,k,m,n;
for(i=0;i<5;i++)
{
for(j=0;j<11;j++)
{
for(k=0;k<11;k++)
{
A[i][j][k]=0;
}
}
}
scanf("%d%d",&n,&m);
A[0][6][6]=n;
for(i=0;i<m;i++)
{
for(j=1;j<10;j++)
{
for(k=1;k<10;k++)
{
A[i+1][j][k]+=A[i][j][k]*2;
A[i+1][j+1][k]+=A[i][j][k];
A[i+1][j-1][k]+=A[i][j][k];
A[i+1][j][k+1]+=A[i][j][k];
A[i+1][j][k-1]+=A[i][j][k];
A[i+1][j+1][k+1]+=A[i][j][k];
A[i+1][j-1][k+1]+=A[i][j][k];
A[i+1][j+1][k-1]+=A[i][j][k];
A[i+1][j-1][k-1]+=A[i][j][k];
}
}
}
for(i=2;i<11;i++)
{
for(j=2;j<10;j++)
{
printf("%d ",A[m][i][j]);
}
printf("%d",A[m][i][10]);
printf("\n");
}
return 0;
}
|
48 | 23679 |
int a[9][9], b[9][9];
int start, days;
void initial(){//make a and b all 0
int i, j;
for(i= 0; i< 9; i++){
for(j= 0; j< 9; j++){
a[i][j]= 0;
b[i][j]= 0;
}
}
}
void input(){//set the start germ number
cin>>start>>days;
a[4][4]= start;
}
void output(){//print a
int i= 0, j= 0;
for(i= 0; i< 9; i++){
for(j= 0; j< 9; j++){
if(j== 0)
cout<<a[i][j];
else
cout<<' '<<a[i][j];
}
cout<<endl;
}
}
void grow(int day){//germs grow one day
if(day> days)
return;
int i= 0, j= 0;
for(i= 0; i< 9; i++){
for(j= 0; j< 9; j++){
if(a[i][j]> 0){
b[i][j]+= a[i][j];
if((i- 1)>= 0 && (i- 1)<= 9) b[i- 1][j]+= a[i][j];
if((i+ 1)>= 0 && (i+ 1)<= 9) b[i+ 1][j]+= a[i][j];
if((j- 1)>= 0 && (j- 1)<= 9) b[i][j- 1]+= a[i][j];
if((j+ 1)>= 0 && (j+ 1)<= 9) b[i][j+ 1]+= a[i][j];
if((i- 1)>= 0 && (i- 1)<= 9 && (j- 1)>= 0 && (j- 1)<= 9) b[i- 1][j- 1]+= a[i][j];
if((i- 1)>= 0 && (i- 1)<= 9 && (j+ 1)>= 0 && (j+ 1)<= 9) b[i- 1][j+ 1]+= a[i][j];
if((i+ 1)>= 0 && (i+ 1)<= 9 && (j+ 1)>= 0 && (j+ 1)<= 9) b[i+ 1][j+ 1]+= a[i][j];
if((i+ 1)>= 0 && (i+ 1)<= 9 && (j- 1)>= 0 && (j- 1)<= 9) b[i+ 1][j- 1]+= a[i][j];
}
}
}
for(i= 0; i< 9; i++){
for(j= 0; j< 9; j++){
a[i][j]+= b[i][j];
b[i][j]= 0;
}
}
grow(day+ 1);
}
int main(){
initial();
input();
grow(1);
output();
return 0;
}
|
48 | 23680 | void Find( int matrix[][9], int n );
int main()
{
int matrix[ 9 ][ 9 ];
int i, j;
int m, n;
for ( i =0; i < 9; i++ )
{
for ( j =0; j < 9; j++ )
matrix[ i ][ j ] = 0;
}
cin >> m >> n;
matrix[ 4 ][ 4 ] = m;
Find( matrix, n );
for ( i = 0; i < 9; i++ )
{
cout << matrix[ i ][ 0 ];
for ( j = 1; j < 9; j++ )
{
cout <<" " << matrix[ i ][ j ];
}
cout << endl;
}
}
void Find( int matrix[][9], int n)
{
int i, j;
int temp[9][9];
memset( temp,0,sizeof(temp));
if ( n == 0 )
return;
for ( i = 1; i < 8; i++ )
{
for ( j = 1; j < 8; j++ )
if ( matrix[ i ][ j ] != 0 )
{
temp[ i ][ j ] = 2 * matrix[ i ][ j ]+temp[ i ][ j ];
temp[ i + 1 ][ j ] = matrix[ i ][ j ] + temp[ i + 1 ][ j ];
temp[ i - 1 ][ j ] = matrix[ i ][ j ] + temp[ i - 1 ][ j ];
temp[ i ][ j + 1 ] = matrix[ i ][ j ] + temp[ i ][ j + 1 ];
temp[ i ][ j - 1 ] = matrix[ i ][ j ] + temp[ i ][ j - 1 ];
temp[ i + 1 ][ j - 1 ] = matrix[ i ][ j ] + temp[ i + 1 ][ j - 1 ];
temp[ i + 1 ][ j + 1 ] = matrix[ i ][ j ] + temp[ i + 1 ][ j + 1 ];
temp[ i - 1 ][ j - 1 ] = matrix[ i ][ j ] + temp[ i - 1 ][ j - 1 ];
temp[ i - 1 ][ j + 1 ] = matrix[ i ][ j ] + temp[ i - 1 ][ j + 1 ];
}
}
for ( i = 0; i < 9; i++ )
for ( j = 0; j < 9; j++ )
matrix[ i ][ j ] = temp[ i ][ j ];
Find( matrix, n - 1 );
}
|
48 | 23681 | int main ()
{
int a[11][11]={0},b[11][11];
int m,n,i,j,k;
cin >> m >> n;
a[5][5]=m;
for (k=0;k<n;k++)
{
for (i=0;i<11;i++)
for (j=0;j<11;j++)
b[i][j]=a[i][j];
for (i=1;i<11;i++)
{
for (j=1;j<11;j++)
{
a[i][j]=b[i][j]*2+b[i][j-1]+b[i][j+1]+b[i+1][j]+
b[i-1][j]+b[i+1][j+1]+b[i+1][j-1]+b[i-1][j+1]+b[i-1][j-1];
}
}
}
for (i=1;i<10;i++)
{
for (j=1;j<10;j++)
{
if(j!=1)
cout << " " << a[i][j] ;
else
cout << a[i][j];
}
cout << endl;
}
return 0;
}
|
48 | 23682 | int main()
{
int a[9][9],b[9][9],i,j,k,m,n;
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
a[i][j]=0;
b[i][j]=0;
}
}
scanf("%d %d",&m,&n);
a[4][4]=m;
b[4][4]=m;
for(k=0;k<n;k++)
{
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(a[i][j]!=0)
{
b[i][j]+=a[i][j];
b[i][j-1]+=a[i][j];
b[i][j+1]+=a[i][j];
b[i-1][j]+=a[i][j];
b[i+1][j]+=a[i][j];
b[i-1][j-1]+=a[i][j];
b[i-1][j+1]+=a[i][j];
b[i+1][j-1]+=a[i][j];
b[i+1][j+1]+=a[i][j];
}
}
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
a[i][j]=b[i][j];
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
printf("%d ",b[i][j]);
}
printf("%d",b[i][8]);
printf("\n");
}
return 0;
}
|
48 | 23683 | void step(int a[N][N])
{
int b[N][N]={0};
int i,j,k,l;
for(i=0;i<N;i++)
{
for(j=0;j<N;j++)
{
b[i][j]=a[i][j];
a[i][j]=0;
}
}
for(i=1;i<N-1;i++)
{
for(j=1;j<N;j++)
{
if(b[i][j]>0)
{
for(k=i-1;k<=i+1;k++)
{
for(l=j-1;l<=j+1;l++)
{
a[k][l]+=b[i][j];
}
}
a[i][j]+=b[i][j];
}
}
}
}
int main()
{
int a[N][N]={0},m,n,t,p;
scanf("%d %d",&m,&n);
a[N/2][N/2]=m;
for(t=0;t<n;t++)
{
step(a);
}
for(t=0;t<N;t++)
{
printf("%d",a[t][0]);
for(p=1;p<N;p++)
{
printf(" %d",a[t][p]);
}
printf("\n");
}
return 0;
} |
48 | 23684 | //********************************
//* ??? ????????
//* ????? *
//********************************
int a[9][9]={0};//??????????
int b[9][9]={0};//??????????
void f(int n)
{
int i,j;
if(n>0)
{
for(i=1;i<=7;i++)
for(j=1;j<=7;j++)
{
if(a[i][j]>0)
{
b[i][j]+=2*a[i][j];
b[i][j+1]+=a[i][j];
b[i][j-1]+=a[i][j];
b[i+1][j]+=a[i][j];
b[i-1][j]+=a[i][j];
b[i-1][j+1]+=a[i][j];
b[i+1][j-1]+=a[i][j];
b[i+1][j+1]+=a[i][j];
b[i-1][j-1]+=a[i][j];
}
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
a[i][j]=b[i][j];
b[i][j]=0;
}
f(n-1);
}
else if(n==0)
{
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(j==0)
cout<<a[i][j];
else
cout<<" "<<a[i][j];
}
cout<<endl;
}
}
}
int main()
{
int m,day;
cin>>m>>day;
a[4][4]=m;
f(day);
return 0;
} |
48 | 23685 | //**************************************
//* ???????????? **
//* ?????? 1300012948 **
//* ???2013.12.5 **
//**************************************
int a[11][11], b[11][11], day = 0;
int main()
{
int m, n;
cin >> m >> n; // ?????????????
void result(int p, int q); // ????
for(int i = 0; i <= 11; i++) // ????????????????????????0
{
for(int j = 0; j <= 11; j++)
{
a[i][j] = 0;
}
}
a[5][5] = m; // ?????????????????????
result(m, n); // ????
return 0;
}
void result(int p, int q)
{
if(day < q) // ???????????????
{
for(int r = 1; r<= 9; r++) // ?????????day???????????b??
{
for(int s = 1; s <= 9; s++)
{
b[r][s] = a[r][s]; // ??????r, s???a?????b?????
for(int temp1 = r - 1; temp1 <= r + 1; temp1++) // ?????r, s????????????????????????????????
{
for(int temp2 = s - 1; temp2 <= s + 1; temp2++)
{
b[r][s] += a[temp1][temp2];
}
}
}
}
day++; // ???1
for(int i = 1; i <= 9; i++) // ???b???????a
{
for(int j = 1; j <= 9; j++)
{
a[i][j] = b[i][j];
}
}
result(p, q); // ???????day + 1????????
}
else // ?????????????????????
{
for(int i = 1; i <= 9; i++)
{
for(int j = 1; j <= 9; j++)
{
if(j < 9)
{
cout << a[i][j] << " ";
}
else
{
cout << a[i][j] << endl;
}
}
}
}
} |
48 | 23686 | int main()
{
int m,n,i,j,k,t;
scanf("%d%d",&m,&n);
int a[9][9]={0},b[9][9]={0};
a[4][4]=m;
for (i=1;i<=n;i++)
{
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
{
if(a[j][k]==0)continue;
else
{
t=a[j][k];
b[j][k]+=2*t;
b[j-1][k-1]+=t;
b[j-1][k]+=t;
b[j-1][k+1]+=t;
b[j][k-1]+=t;
b[j][k+1]+=t;
b[j+1][k-1]+=t;
b[j+1][k]+=t;
b[j+1][k+1]+=t;
}
}
}
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
{
a[j][k]=b[j][k];
b[j][k]=0;
}
}
}
for(j=0;j<9;j++)
{
for(k=0;k<8;k++)
{
printf("%d ",a[j][k]);
}
printf("%d\n",a[j][8]);
}
return 0;
}
|
48 | 23687 | int num[11][11];
int num1[11][11];
int increase(int a,int time)
{
if(a==time) return 1;
else
{
memset(num1,0,sizeof(num1));
for(int i=0;i<11;i++)
{
num[i][0]=num[i][10]=num[0][i]=num[i][10]=0;
}
for(int i=1;i<10;i++)
{
for(int j=1;j<10;j++)
{
if(num[i][j]!=0)
{
num1[i][j]=num1[i][j]+2*num[i][j];
num1[i][j-1]=num1[i][j-1]+num[i][j];
num1[i-1][j]=num1[i-1][j]+num[i][j];
num1[i+1][j]=num1[i+1][j]+num[i][j];
num1[i][j+1]=num1[i][j+1]+num[i][j];
num1[i-1][j-1]=num1[i-1][j-1]+num[i][j];
num1[i+1][j-1]=num1[i+1][j-1]+num[i][j];
num1[i-1][j+1]=num1[i-1][j+1]+num[i][j];
num1[i+1][j+1]=num1[i+1][j+1]+num[i][j];
}
}
}
for(int i=0;i<11;i++)
{
for(int j=0;j<11;j++)
{
num[i][j]=num1[i][j];
}
}
return increase(a+1,time);
}
}
int main()
{
int n,t;
cin>>n>>t;
memset(num,0,sizeof(num));
memset(num1,0,sizeof(num1));
num[5][5]=n;
num[5][5]=n;
increase(0,t);
for(int i=1;i<10;i++)
{
for(int j=1;j<9;j++)
{
cout<<num1[i][j]<<' ';
}
cout<<num1[i][9]<<endl;
}
return 0;
}
|
48 | 23688 | int a[9][9];
int b[9][9];
int main()
{
int m, n;
cin >> m >> n;
memset(a,0,sizeof(a));
a[4][4]=m;
int i, x, y;
for (i = 0; i !=n;i++)
{
memset(b,0,sizeof(b));
for (x=1;x!=8;x++)
for(y=1;y!=8;y++)
{
b[x][y]+=2*a[x][y];
b[x-1][y-1]+=a[x][y];b[x-1][y]+=a[x][y];b[x-1][y+1]+=a[x][y];b[x][y-1]+=a[x][y];b[x][y+1]+=a[x][y];b[x+1][y-1]+=a[x][y];b[x+1][y]+=a[x][y];b[x+1][y+1]+=a[x][y];
}
memcpy(a,b,sizeof(a));
}
for(x=0;x!=9;x++)
{
for(y=0;y!=9;y++)
{
if(y==0)
cout << a[x][y];
else
cout << ' ' << a[x][y];
}
cout << endl;
}
return 0;
}
|
48 | 23689 | int main()
{
int n,m,a[9][9],i,j,z,b,c,d[9][9];
scanf("%d%d",&m,&n);
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
a[i][j]=0;
d[i][j]=0;
}
}
a[4][4]=m;
d[4][4]=m;
for(z=1;z<=n;z++)
{
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(a[i][j]!=0){
for(b=i-1;b<=i+1;b++)
{
for(c=j-1;c<=j+1;c++)
{
d[b][c]+=a[i][j];
}
}
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
a[i][j]=d[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(j==8){
printf("%d\n",d[i][j]);
}else{
printf("%d ",d[i][j]);
}
}
}
return 0;
}
|
48 | 23690 | main()
{
int a[10][10]={0},b[10][10]={0};
int i,j,k,m,n;
scanf("%d%d",&m,&n);
a[5][5]=m;
for(k=0;k<n;k++)
{
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{
if(a[i][j]!=0)
{
int s=2*a[i][j];int t=a[i][j];
b[i][j]+=s;
b[i][j+1]+=t;b[i][j-1]+=t;b[i+1][j+1]+=t;b[i+1][j-1]+=t;b[i+1][j]+=t;b[i-1][j]+=t;b[i-1][j+1]+=t;b[i-1][j-1]+=t;
}
}
for(int p=1;p<=9;p++)
{
for(int q=1;q<=9;q++)
{
a[p][q]=b[p][q];
b[p][q]=0;
}
}
}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{printf("%d",a[i][j]);
if(j==9)
{printf("\n");}
else{printf(" ");}}
}
|
48 | 23691 | //********************************
//*???2.cpp **
//*??????????? **
//*?????? 1300012838 **
//*???2013.12.4 **
//********************************
int m;
int day(int x, int y, int n)
{
if (x == 0 || x == 10 || y == 0 || y == 10)
return 0;
else if (x == 5 && y == 5 && n == 0)
return m;
else if (n == 0)
return 0;
else
return day(x, y, n-1) * 2 + day(x-1, y, n-1) + day(x+1, y, n-1) +
day(x, y-1, n-1) + day(x, y+1, n-1) + day(x-1, y-1, n-1) +
day(x-1, y+1, n-1) + day(x+1, y-1, n-1) + day(x+1, y+1, n-1);
}
int main()
{
int n;
cin >> m >> n;
for (int i = 1; i <= 9; i++)
{
cout << day(i, 1, n);
for (int j = 2; j <= 9; j++)
cout << " " << day(i, j, n);
cout << endl;
}
return 0;
}
|
48 | 23692 | int num[9][9] = {0}, flag[9][9] = {0};
int m;
int main()
{
int n;
cin >> m >> n;
void fun ( int );
num[4][4] = m;
fun ( n );
return 0;
}
void fun ( int n )
{
if ( n == 0 )
{
int i, j;
for ( i = 0; i < 9; i++ )
{
cout << num[i][0];
for ( j = 1; j < 9; j++ )
{
cout << " " << num[i][j];
}
cout << endl;
}
}
else
{
int i, j;
for ( i = 0; i < 9; i++ )
{
for ( j = 0; j < 9; j++ )
{
if ( num[i][j] != 0 )
{
flag[i][j - 1] += num[i][j];
flag[i][j + 1] += num[i][j];
flag[i + 1][j] += num[i][j];
flag[i - 1][j] += num[i][j];
flag[i + 1][j - 1] += num[i][j];
flag[i - 1][j - 1] += num[i][j];
flag[i + 1][j + 1] += num[i][j];
flag[i - 1][j + 1] += num[i][j];
flag[i][j] += num[i][j];
}
}
}
for ( i = 0; i < 9; i++ )
{
for ( j = 0; j < 9; j++ )
{
num[i][j] += flag[i][j];
}
}
for ( i = 0; i < 9; i++ )
{
for ( j = 0; j < 9; j++ )
{
flag[i][j] = 0;
}
}
fun ( n - 1 );
}
} |
48 | 23693 |
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 | 23694 |
int main()
{
int num[9][9];
int next[9][9];
int m,n,i,j,t;
int k,h;
cin>>m>>n;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{num[i][j]=0;
next[i][j]=0;}
num[4][4]=m;
for(t=n;t>=1;t--)
{for(i=0;i<9;i++)
for(j=0;j<9;j++)
if(num[i][j]!=0)
{next[i][j]+=2*num[i][j];
next[i-1][j]+=num[i][j];
next[i+1][j]+=num[i][j];
next[i][j-1]+=num[i][j];
next[i][j+1]+=num[i][j];
next[i-1][j-1]+=num[i][j];
next[i-1][j+1]+=num[i][j];
next[i+1][j-1]+=num[i][j];
next[i+1][j+1]+=num[i][j];
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{num[i][j]=next[i][j];
next[i][j]=0;}
}
for(i=0;i<9;i++)
{for(j=0;j<8;j++)
cout<<num[i][j]<<" ";
cout<<num[i][j]<<endl;}
return 0;
} |
48 | 23695 | 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 | 23696 | int f(int x,int y,int n,int m)
{
if (n>0) {
//int i,j;
//f(x,y,n)=0;
//for (i=x-1;i<=x+1;i++)
//for (j=y-1;j<=y+1;j++)
//f(x,y,n)=f(x,y,n)+f(i,j,n-1);
//return f(x,y,n)+f(x,y,n-1);}
return (f(x-1,y-1,n-1,m)+f(x-1,y,n-1,m)+f(x-1,y+1,n-1,m)+f(x,y-1,n-1,m)+2*f(x,y,n-1,m)+f(x,y+1,n-1,m)+f(x+1,y-1,n-1,m)+f(x+1,y,n-1,m)+f(x+1,y+1,n-1,m));}
else if (x==5&&y==5)
return m;
else
return 0;
}
main()
{
int i,j,m,n;
scanf("%d %d",&m,&n);
int a[12][12][n];
//a[5][5][0]=m;
for (i=1;i<=9;i++)
{
for (j=1;j<=9;j++)
{
a[i][j][n]=f(i,j,n,m);
}
}
for (i=1;i<=9;i++)
{
for (j=1;j<=8;j++)
{
printf("%d ",a[i][j][n]);
}
printf("%d\n",a[i][9][n]);
}
getchar();
getchar();
getchar();
} |
48 | 23697 | 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 | 23698 | main()
{
int a[L][L],b[L][L];
int m,n,d,i,j,x,y;
scanf("%d %d",&m,&n);
memset(a,0,sizeof(a));
a[4][4]=m;
for(d=1;d<=n;d++)
{
memset(b,0,sizeof(b));
for(i=1;i<L-1;i++)
{
for(j=1;j<L-1;j++)
{
b[i][j]+=a[i][j];
for(x=-1;x<=1;x++)
{
for(y=-1;y<=1;y++)
b[i+y][j+x]=b[i+y][j+x]+a[i][j];
}
}
}
memcpy(a,b,sizeof(a));
}
for(i=0;i<L;i++)
{
for(j=0;j<L-1;j++)
printf("%d ",a[i][j]);
printf("%d\n",a[i][8]);
}
getchar();
getchar();
getchar();
getchar();
} |
48 | 23699 | 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;} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.