label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
48 | 23500 | //*************************************************
//***???????????***
//***??????***
//***???2013.1.13***
//*************************************************
int a[11][11],b[11][11];
void f()
{
int i,j;
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] + 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 <= 9; i++)
{
for (j = 1; j <= 9; j++)
{
a[i][j] = b[i][j];
}
}
}
int main ()
{
int i,j,n,m;
cin >> n >> m;
for (i = 0; i < 11; i++)
{
for (j = 0; j < 11; j++)
{
a[i][j] = 0;
}
}
a[5][5] = n;
for (i = 0; i < m; i++)
{
f();
}
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 | 23501 | int main ( )
{
int m,n,tian,i,j;
int num[6][11][11];
cin>>m>>n;
for(tian=0;tian<=n+1;tian++)
{
for(i=0;i<=10;i++)
{
for(j=0;j<=10;j++)
{
num[tian][i][j]=0;
}
}
}
num[1][5][5]=m;
for(tian=1;tian<=n;tian++)
{
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
num[tian+1][i][j]=2*num[tian][i][j]+num[tian][i-1][j-1]+num[tian][i-1][j]+num[tian][i-1][j+1]+num[tian][i][j-1]+num[tian][i][j+1]+num[tian][i+1][j-1]+num[tian][i+1][j]+num[tian][i+1][j+1];
}
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
if(j!=9)cout<<num[n+1][i][j]<<" ";
else cout<<num[n+1][i][j];
}
cout<<endl;
}
return 0;
} |
48 | 23502 |
struct bacteria
{
int have;
int add;
}a[11][11];
int main()
{
int m,n,i,j,l,k;
memset(a,0,sizeof(struct bacteria)*121);
scanf("%d%d",&a[5][5].have,&n);
for(m=1;m<=n;m++)
{
for(i=5-n;i<=5+n;i++)
{
for(j=5-n;j<=5+n;j++)
{
for(k=-1;k<=1;k++)
{
for(l=-1;l<=1;l++)
{
a[i][j].add+=a[i+l][j+k].have;
}
}
}
}
for(i=5-n;i<=5+n;i++)
{
for(j=5-n;j<=5+n;j++)
{
a[i][j].have+=a[i][j].add;
a[i][j].add=0;
}
}
}
for(i=1;i<10;i++)
{
printf("%d",a[i][1].have);
for(j=2;j<10;j++)
{
printf(" %d",a[i][j].have);
}
printf("\n");
}
return 0;
} |
48 | 23503 | int a[10][10]={0},b[10][10]={0},n;
void t(int);
int main()
{
int m ,i,j;
cin >> m >> n;
a[4][4]=m;
t(1);
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
cout <<a[i][j];
if(j==8)
cout <<endl;
else cout << " ";
}
return 0;
}
void t(int m)
{
int i, j,l;
if(m==n+1)
return;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
b[i][j]=a[i][j];
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
if(a[i][j]!=0)
{
l=b[i][j];
a[i][j]+=2*l;
a[i-1][j]+=l;
a[i+1][j]+=l;
a[i][j-1]+=l;
a[i][j+1]+=l;
a[i+1][j+1]+=l;
a[i+1][j-1]+=l;
a[i-1][j-1]+=l;
a[i-1][j+1]+=l;
}
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
a[i][j]-=b[i][j];
t(m+1);
}
|
48 | 23504 | int main()
{
int a[9][9]={0},b[9][9]={0};
char s[9][9]={0};
int m,n;
int i,j,t,p,q;
cin>> m >> n;
a[4][4]=m;
for(t=1;t<=n;t++)
{
for(i=1;i<8;i++)
{
for(j=1;j<8;j++)
{
if(a[i][j]!=0)
{
b[i][j]=b[i][j]+a[i][j]*2;
b[i-1][j]=b[i-1][j]+a[i][j];
b[i+1][j]=b[i+1][j]+a[i][j];
b[i][j-1]=b[i][j-1]+a[i][j];
b[i][j+1]=b[i][j+1]+a[i][j];
b[i-1][j-1]=b[i-1][j-1]+a[i][j];
b[i+1][j-1]=b[i+1][j-1]+a[i][j];
b[i-1][j+1]=b[i-1][j+1]+a[i][j];
b[i+1][j+1]=b[i+1][j+1]+a[i][j];
}
}
}
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++)
{
cout<<a[i][j]<<' ';
}
cout<<a[i][8]<<endl;
}
return 0;
}
|
48 | 23505 | int num[10][10] , newnum[10][10] ;
void change(int , int);
int main()
{
int m , n , i , j , k;
cin >> m >> n ;
memset(num,0,sizeof(num));
num[5][5] = m ;
for ( i = 1 ; i <= n ; i++ )
{
memset(newnum,0,sizeof(newnum));
for ( j = 1 ; j <= 9 ; j++ )
for (k = 1 ; k <= 9 ; k++ )
change(j,k);
for ( j = 1 ; j <= 9 ; j++ )
for (k = 1 ; k <= 9 ; k++ )
num[j][k] += newnum[j][k] ;
}
for ( i = 1 ; i <= 9 ; i++ )
{
for ( j = 1 ; j <= 9 ; j++ )
{
if ( j == 1 ) cout << num[i][j] ;
else cout << " " << num[i][j] ;
}
cout << endl ;
}
return 0 ;
}
void change(int a , int b)
{
int i , j ;
for ( i = a-1 ; i <= a+1 ; i++ )
for ( j = b-1 ; j <= b+1 ; j++ )
newnum[a][b] += num[i][j] ;
} |
48 | 23506 |
int main(int argc, char* argv[])
{
int a[9][9],b[10][10],i,j,k,m,n;
scanf("%d%d",&m,&n);
for (i=0;i<9;i++)
{
for (j=0;j<9;j++)
{
a[i][j]=0;
}
}
a[4][4]=m;
for (i=0;i<10;i++)
{
for (j=0;j<10;j++)
{
b[i][j]=0;
}
}
for (k=0;k<n;k++)
{
for (i=0;i<9;i++)
{
for (j=0;j<9;j++)
{
b[i][j]+=a[i][j];
b[i][j+1]+=a[i][j];
b[i][j+2]+=a[i][j];
b[i+1][j]+=a[i][j];
b[i+1][j+2]+=a[i][j];
b[i+2][j]+=a[i][j];
b[i+2][j+1]+=a[i][j];
b[i+2][j+2]+=a[i][j];
b[i+1][j+1]+=a[i][j]*2;
}
}
for (i=0;i<9;i++)
{
for (j=0;j<9;j++)
{
a[i][j]=b[i+1][j+1];
b[i+1][j+1]=0;
}
}
}
for (i=0;i<9;i++)
{
for (j=0;j<9;j++)
{
if (j==8)
{
printf("%d\n",a[i][j]);
}
else
{
printf("%d ",a[i][j]);
}
}
}
return 0;
} |
48 | 23507 | int main()
{
int a[11][11],b[11][11];
int i,j,k,m,n;
cin>>m>>n;
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
a[i][j]=0;
}
}
a[5][5]=m;
for(k=0;k<n;k++)
{
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
b[i][j]=a[i][j];
}
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if(b[i][j]!=0)
{
a[i][j]+=b[i][j];
a[i-1][j]+=b[i][j];
a[i-1][j-1]+=b[i][j];
a[i-1][j+1]+=b[i][j];
a[i][j+1]+=b[i][j];
a[i][j-1]+=b[i][j];
a[i+1][j]+=b[i][j];
a[i+1][j-1]+=b[i][j];
a[i+1][j+1]+=b[i][j];
}
}
}
}
k=0;
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
cout<<a[i][j];
k++;
if(k%9!=0)
cout<<" ";
else
cout<<endl;
}
}
return 0;
} |
48 | 23508 | main()
{
int a[11][11],b[11][11];
for(int i=0;i<11;i++)
{
for(int j=0;j<11;j++)
{
a[i][j]=0;
b[i][j]=0;
}
}
int m,n;
scanf("%d %d",&m,&n);
a[5][5]=b[5][5]=m;
for(int k=0;k<n;k++)
{
for(int i=1;i<10;i++)
{
for(int j=1;j<10;j++)
{
a[i][j]=2*b[i][j]+b[i][j-1]+b[i][j+1]+b[i-1][j-1]+b[i-1][j]+b[i-1][j+1]+b[i+1][j-1]+b[i+1][j]+b[i+1][j+1];
}
}
for(int i=1;i<10;i++)
{
for(int j=1;j<10;j++)
{
b[i][j]=a[i][j];
}
}
}
for(int i=1;i<10;i++)
{
for(int j=1;j<10;j++)
{
if(j%9==0)
printf("%d\n",a[i][j]);
else
printf("%d ",a[i][j]);
}
}
}
|
48 | 23509 | void fanzhi(int x,int y,int n);//??????????????
int a[9][9];
int add[9][9];
int main()
{
int i,j=0;
//???
for (i=0;i<9;i++)
for (j=0;j<9;j++)
a[i][j]=0;
for (i=0;i<9;i++)
for (j=0;j<9;j++)
add[i][j]=0;
int m=0,n=0;
cin>>m>>n;
a[4][4]=m;
int k=0;
for (k=1;k<=n;k++)
{
for (i=0;i<9;i++)
for (j=0;j<9;j++)
add[i][j]=0;
for (i=0;i<9;i++)
for (j=0;j<9;j++)
fanzhi(i,j,a[i][j]);//??????????
for (i=0;i<9;i++)
for (j=0;j<9;j++)
a[i][j]=add[i][j];
}
for (i=0;i<9;i++)
for (j=0;j<9;j++)
{
cout<<a[i][j];
if (j!=8)
cout<<" ";
else if (i!=8)
cout<<endl;
}
return 0;
}
void fanzhi(int x,int y,int n)
{
add[x-1][y]+=n;
add[x+1][y]+=n;
add[x][y-1]+=n;
add[x][y+1]+=n;
add[x][y]+=n*2;
add[x-1][y-1]+=n;
add[x-1][y+1]+=n;
add[x+1][y-1]+=n;
add[x+1][y+1]+=n;
} |
48 | 23510 |
int ch[9][9], ch2[9][9];
int main()
{
int m, day;
void d(int);
memset(ch, 0, sizeof ch);
cin >> m >> day;
ch[4][4] = m;
d(day);
return 0;
}
void d(int day)
{
int i, j;
memset(ch2, 0, sizeof ch2);
if(day == 0)
{
for(i = 0; i < 9; i++)
{
for(j = 0; j < 8; j++)
{
cout << ch[i][j] << " ";
}
cout << ch[i][j] << endl;
}
}
else
{
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
if(ch[i][j] != 0)
{
ch2[i][j] = ch[i][j];
ch[i][j] *= 2;
}
}
}
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
if(ch2[i][j])
{
if(i > 0) ch[i - 1][j] += ch2[i][j];
if(i < 8) ch[i + 1][j] += ch2[i][j];
if(j > 0) ch[i][j - 1] += ch2[i][j];
if(j < 8) ch[i][j + 1] += ch2[i][j];
if(i > 0 && j > 0) ch[i - 1][j - 1] += ch2[i][j];
if(i > 0 && j < 8) ch[i - 1][j + 1] += ch2[i][j];
if(i < 8 && j > 0) ch[i + 1][j - 1] += ch2[i][j];
if(i < 8 && j < 8) ch[i + 1][j + 1] += ch2[i][j];
}
}
}
d(day - 1);
}
}
|
48 | 23511 | int main()
{
int m,n,i,j;
scanf("%d %d",&m,&n);
int a[11][11]={0};
int b[11][11]={0};
a[5][5]=m;
b[5][5]=m;
while(n>0)
{
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++){
if(a[i][j]!=0)
{
b[i][j]=b[i][j]+a[i][j];
b[i-1][j]+=a[i][j];
b[i-1][j-1]+=a[i][j];
b[i-1][j+1]+=a[i][j];
b[i][j-1]+=a[i][j];
b[i][j+1]+=a[i][j];
b[i+1][j]+=a[i][j];
b[i+1][j-1]+=a[i][j];
b[i+1][j+1]+=a[i][j];
}
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
a[i][j]=b[i][j];
}
}
n--;
}
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
if(j!=9)
{ printf("%d ",a[i][j]);}
else
{printf("%d\n",a[i][j]); }
}
}
return 0;
}
|
48 | 23512 |
int f(int x, int y, int n) //??????????
{
if(n==0)
{
if(x==5&&y==5) //?????
return 1;
else
return 0;
}
else //??????????
return f(x-1, y-1, n-1)+f(x-1, y, n-1)+f(x-1, y+1, n-1)+f(x, y-1, n-1)+
f(x, y+1, n-1)+f(x+1, y-1, n-1)+f(x+1, y, n-1)+f(x+1, y+1, n-1)+2*f(x, y, n-1);
};
int main()
{
int i, j, m, n;
cin >> m >> n;
for(i=1; i<10; i++) //??????
for(j=1; j<10; j++)
{
if(j==9)
cout << m*f(i, j, n) << endl;
else
cout << m*f(i, j, n) << " ";
}
return 0;
} |
48 | 23513 | int num[9][9]={0};
int t[9][9]={0};
int main()
{
int n,m;
cin>>m>>n;
num[4][4]+=m;
t[4][4]+=m;
do
{
for(int i=1;i<8;i++)
{
for(int j=1;j<8;j++)
{
int temp=t[i][j];
for(int k=i-1;k<i+2;k++)
{
for(int p=j-1;p<j+2;p++)
{
num[k][p]+=temp;
}
}
}
}
for(int i=1;i<8;i++)
{
for(int j=1;j<8;j++)
{
t[i][j]=num[i][j];
}
}
n--;
}while(n>0);
for(int i=0;i<9;i++)
{
for(int j=0;j<9;j++)
{
cout<<num[i][j];
if(j<8) cout<<" ";
else cout<<endl;
}
}
return 0;
}
|
48 | 23514 | int main()
{
int m, n, i, j, days, left[9][9], seperate[9][9];
cin >> m >> n;
int a[9][9] = {0};
a[4][4] = m;
for (days = 0; days < n; days++)
{
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++)
{
left[i][j] = a[i][j] * 2;
a[i][j] *= 10;
seperate[i][j] = (a[i][j] - left[i][j]) / 8;
a[i][j] = left[i][j];
}
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++)
{
a[i + 1][j] += seperate[i][j];
a[i - 1][j] += seperate[i][j];
a[i + 1][j + 1] += seperate[i][j];
a[i - 1][j - 1] += seperate[i][j];
a[i + 1][j - 1] += seperate[i][j];
a[i - 1][j + 1] += seperate[i][j];
a[i][j + 1] += seperate[i][j];
a[i][j - 1] += seperate[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 | 23515 | int main()
{
int i, j, a[9][9], m, n, p, q, u, t[9][9];
for(i=0; i<9; i++)
{
for(j=0; j<9; j++)
a[i][j]=0;
}
scanf("%d %d", &m, &n);
a[4][4]=m;
for(u=0; u<n; u++)
{
for(i=4-u; i<=4+u; i++)
{
for(j=4-u; j<=4+u; j++)
{
t[i][j]=a[i][j];
}
}
for(i=4-u; i<=4+u; i++)
{
for(j=4-u; j<=4+u; j++)
{
for(p=i-1; p<=i+1; p++)
{
for(q=j-1;q<=j+1; q++)
a[p][q]=a[p][q]+t[i][j];
}
}
}
}
for(i=0; i<9; i++)
{
for(j=0; j<8; j++)
printf("%d ", a[i][j]);
if(j=8)
printf("%d\n", a[i][j]);
}
return 0;
}
|
48 | 23516 | main()
{
int i,j,m,n,k;
int a[9][9];
int b[9][9];
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
a[i][j]=0;
b[i][j]=0;
}
scanf("%d %d",&m,&n);
a[4][4]=m;
b[4][4]=m;
for(k=0;k<n;k++)
{
for(i=1;i<8;i++)
for(j=1;j<8;j++)
a[i][j]=b[i-1][j-1]+b[i-1][j]+b[i-1][j+1]+b[i][j-1]+b[i][j+1]+b[i+1][j-1]+b[i+1][j]+b[i+1][j+1]+2*b[i][j];
for(i=1;i<8;i++)
{
a[i][0]=b[i-1][0]+b[i+1][0]+b[i-1][1]+b[i][1]+b[i+1][1]+2*b[i][0];
a[i][8]=a[i][0];
}
for(j=1;j<8;j++)
{
a[0][j]=a[j][0];
a[8][j]=a[0][j];
}
a[0][0]=b[0][1]+b[1][0]+b[1][1];
a[0][8]=a[0][0];
a[8][0]=a[0][0];
a[8][8]=a[0][0];
for(i=0;i<9;i++)
for(j=0;j<9;j++)
b[i][j]=a[i][j];
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
printf("%d ",a[i][j]);
printf("%d\n",a[i][8]);
}
getchar();getchar();getchar();getchar();
}
|
48 | 23517 | main(){
int a[9][9],c[9][9];
int i,j,k,m,n;
for(i=0;i<9;i++){
for(j=0;j<9;j++){
a[i][j]=0;
c[i][j]=0;
}
}
scanf("%d %d",&n,&m);
a[4][4]=n;
for(k=0;k<m;k++){
for(i=0;i<9;i++){
for(j=0;j<9;j++){
if(a[i][j]!=0){
c[i][j]=c[i][j]+2*a[i][j];
c[i-1][j]=c[i-1][j]+a[i][j];
c[i+1][j]=c[i+1][j]+a[i][j];
c[i+1][j+1]=c[i+1][j+1]+a[i][j];
c[i+1][j-1]=c[i+1][j-1]+a[i][j];
c[i-1][j+1]=c[i-1][j+1]+a[i][j];
c[i-1][j-1]=c[i-1][j-1]+a[i][j];
c[i][j+1]=c[i][j+1]+a[i][j];
c[i][j-1]=c[i][j-1]+a[i][j];
}
}
}
for(i=0;i<9;i++){
for(j=0;j<9;j++){
a[i][j]=c[i][j];
c[i][j]=0;
}
}
}
for(i=0;i<9;i++){
for(j=0;j<9;j++){
if(j==8)
printf("%d\n",a[i][j]);
else
printf("%d ",a[i][j]);
}
}
} |
48 | 23518 | int main()
{
int a[10][10],b[10][10];
int m,n;
int i,j,d;
for(i=0;i<10;i++)
{
for(j=0;j<10;j++)
{
a[i][j]=0;
b[i][j]=0;
}
}
scanf("%d %d",&m,&n);
a[5][5]=m;
for(d=0;d<n;d++)
{
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
b[i][j]=a[i][j];
}
for(i=5-d;i<=5+d;i++)
{
for(j=5-d;j<=5+d;j++)
{
a[i][j]=b[i][j]*2+a[i][j]-b[i][j];
a[i-1][j-1]=b[i][j]+a[i-1][j-1];
a[i-1][j]=b[i][j]+a[i-1][j];
a[i-1][j+1]=b[i][j]+a[i-1][j+1];
a[i][j-1]=b[i][j]+a[i][j-1];
a[i][j+1]=b[i][j]+a[i][j+1];
a[i+1][j-1]=b[i][j]+a[i+1][j-1];
a[i+1][j]=b[i][j]+a[i+1][j];
a[i+1][j+1]=b[i][j]+a[i+1][j+1];
}
}
}
for(i=1;i<10;i++)
{
for(j=1;j<9;j++)
printf("%d ",a[i][j]);
printf("%d\n",a[i][9]);
}
return 0;
}
|
48 | 23519 | main()
{
int a[5][11][11];
int i,j,k,day;
for(i=0;i<=4;i++)
{
for (j=0;j<=10;j++)
{
for (k=0;k<=10;k++)
{
a[i][j][k]=0;
}
}
}
scanf("%d %d",&a[0][5][5],&day);
for (i=1;i<=day;i++)
{
for (j=1;j<=9;j++)
{
for (k=1;k<=9;k++)
{
a[i][j][k]=a[i-1][j][k]*2+a[i-1][j-1][k-1]+a[i-1][j-1][k]+a[i-1][j-1][k+1]+a[i-1][j+1][k-1]+a[i-1][j+1][k]+a[i-1][j+1][k+1]+a[i-1][j][k-1]+a[i-1][j][k+1];
}
}
}
for (j=1;j<=9;j++)
{
for (k=1;k<=9;k++)
{
if (k==1) printf("%d",a[day][j][k]);
else printf(" %d",a[day][j][k]);
}
printf("\n");
}
getchar();
getchar();
} |
48 | 23520 | int main()
{
int m,n;
int i=0,j=0,k=0;
int a[9][9];
int tmp[9][9];
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
a[i][j]=0;
tmp[i][j]=0;
}
}
cin>>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)
{
tmp[i][j]=tmp[i][j]+a[i][j]*2;
tmp[i+1][j]=tmp[i+1][j]+a[i][j];
tmp[i-1][j]=tmp[i-1][j]+a[i][j];
tmp[i][j+1]=tmp[i][j+1]+a[i][j];
tmp[i][j-1]=tmp[i][j-1]+a[i][j];
tmp[i+1][j+1]=tmp[i+1][j+1]+a[i][j];
tmp[i-1][j-1]=tmp[i-1][j-1]+a[i][j];
tmp[i+1][j-1]=tmp[i+1][j-1]+a[i][j];
tmp[i-1][j+1]=tmp[i-1][j+1]+a[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
a[i][j]=tmp[i][j];
tmp[i][j]=0;
}
}
}
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 | 23521 | int i, j, a[10][10] = {0}, b[10][10] = {0}, c, k, l;
void f(int n)
{
if (n == 0)
{
for (j = 1; j <= 9; j++)
{
cout << a[j][1];
for (l = 2; l <= 9; l++)
{
cout << " " << a[j][l];
}
cout << endl ;
}
return;
}
for (i = 0; i <= 80 ;i++)
{
if (b[i/9+1][i%9+1] != 0)
{
c = b[i/9+1][i%9+1];
a[i/9+2][i%9+2] += c;
a[i/9+2][i%9+1] += c;
a[i/9+1][i%9+2] += c;
a[i/9][i%9] += c;
a[i/9+2][i%9] += c;
a[i/9][i%9+2] += c;
a[i/9+1][i%9] += c;
a[i/9][i%9+1] += c;
a[i/9+1][i%9+1] += b[i/9+1][i%9+1];
}
}
for (k = 0; k <= 99; k++)
{
b[k/10][k%10] = a[k/10][k%10];
}
f(n-1);
}
int main()
{
int d;
cin >> a[5][5] >>d;
b[5][5] = a[5][5];
f(d);
return 0;
} |
48 | 23522 | int main()
{
int i,j,t,m,n,r,s,a[9][9],b[9][9];
scanf("%d %d",&m,&n);
for(j=0;j<9;j++)
{
for(i=0;i<9;i++)
{
a[j][i]=0;
b[j][i]=0;
}
}
a[4][4]=m;
b[4][4]=m;
for(t=1;t<=n;t++)
{
for(r=4-t;r<=2+t;r++)
{
for(s=4-t;s<=2+t;s++)
{
for(j=0;j<=2;j++)
{
for(i=0;i<=2;i++)
{
a[r+j][s+i]+=b[r+1][s+1];
}
}
}
}
for(j=0;j<9;j++)
{
for(i=0;i<9;i++)
{
b[j][i]=a[j][i];
//a[j][i]=0;
}
}
}
for(j=0;j<9;j++)
{
for(i=0;i<8;i++)
{
printf("%d ",b[j][i]);
}
printf("%d\n",b[j][8]);
}
return 0;
}
|
48 | 23523 | int m=0,n=0,a[9][9]={0},b[9][9]={0};
void f(int day)
{
if(day>n)
{
}
else
{
for(int i=1;i<=7;i++)
{
for(int j=1;j<=7;j++)
{
a[i][j]+=b[i][j];
a[i-1][j]+=b[i][j];
a[i+1][j]+=b[i][j];
a[i][j-1]+=b[i][j];
a[i][j+1]+=b[i][j];
a[i-1][j-1]+=b[i][j];
a[i+1][j+1]+=b[i][j];
a[i-1][j+1]+=b[i][j];
a[i+1][j-1]+=b[i][j];
}
}
for(int x=0;x<=8;x++)
{
for(int y=0;y<=8;y++)
{
b[x][y]=a[x][y];
}
}
f(day+1);
}
}
int main()
{
cin>>m>>n;
a[4][4]=m;
b[4][4]=m;
f(1);
for(int p=0;p<=8;p++)
{
cout<<a[p][0];
for(int q=1;q<=8;q++)
{
cout<<" "<<a[p][q];
}
cout<<endl;
}
return 0;
} |
48 | 23524 | void spread (int [9][9]);
int main()
{
int a[9][9];
int m,n;
int i,j;
cin>>m>>n;
for (i=0;i<9;i++)
for (j=0;j<9;j++)
a[i][j]=0;
a[4][4]=m;
for (i=0;i<n;i++)
spread(a);
for(i=0;i<9;i++)
{
cout<<a[i][0];
for (j=1;j<9;j++)
cout<<" "<<a[i][j];
cout<<endl;
}
return 0;
}
void spread(int a[9][9])
{
int b[9][9];
int i,j;
int p,q;
for (i=0;i<9;i++)
for (j=0;j<9;j++)
b[i][j]=a[i][j];
for (i=0;i<9;i++)
{
for (j=0;j<9;j++)
{
if (b[i][j]!=0)
{
for (p=i-1;p<=i+1;p++)
for (q=j-1;q<=j+1;q++)
a[p][q]+=b[i][j];
}
}
}
} |
48 | 23525 | int main(){
int i,j,k,m,n;
int set[20][20],ad[20][20]={0};
scanf("%d %d",&m,&n);
for(i=0;i<11;i++){
for(j=0;j<11;j++){
set[i][j]=0;
}
}
set[5][5]=m;
for(k=1;k<=n;k++){
for(i=1;i<=9;i++){
for(j=1;j<=9;j++){
if(set[i][j]!=0){
ad[i][j]=set[i][j];
}
}
}
for(i=1;i<=9;i++){
for(j=1;j<=9;j++){
if(ad[i][j]!=0){
set[i][j-1]+=ad[i][j];
set[i-1][j]+=ad[i][j];
set[i-1][j-1]+=ad[i][j];
set[i-1][j+1]+=ad[i][j];
set[i][j]=set[i][j]+ad[i][j];
set[i+1][j]+=ad[i][j];
set[i][j+1]+=ad[i][j];
set[i+1][j-1]+=ad[i][j];
set[i+1][j+1]+=ad[i][j];
}
}
}
for(i=0;i<11;i++){
for(j=0;j<11;j++){
ad[i][j]=0;
}
}
}
for(i=1;i<=9;i++){
for(j=1;j<=8;j++){
printf("%d ",set[i][j]);
}
printf("%d",set[i][9]);
printf("\n");
}
return 0;
}
|
48 | 23526 | // ??????
// ??? 1100012820
// 20111123
//******************
int sqr[9][9] = {0};
void printsqr(int a[9][9])
{
int i, j;
for (i = 0; i <= 8; i++)
{
for (j = 0; j <= 7; j++)
cout << a[i][j] << " ";
cout << a[i][8] << endl;
}
}
void addv()
{
int adsqr[9][9] = {0};
int i, j, m, n;
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
for(m = i - 1; m <= i + 1; m++)
{
for(n = j - 1; n <= j + 1; n++)
{
if ((m >= 0) && (m <= 8) && (n >= 0) && (n <= 8))
adsqr[m][n] += sqr[i][j];
}
}
}
}
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
sqr[i][j] += adsqr[i][j];
}
}
return;
}
void grow(int days)
{
if (days)
{
addv();
grow(days - 1);
}
return;
}
int main()
{
int num, day;
cin >> num >> day;
sqr[4][4] += num;
grow(day);
printsqr(sqr);
return 0;
}
|
48 | 23527 | int m , n ;
int i , j ;
int a[11][11] = {{0}}, b[11][11] = {{0}};
void fz(int);
int main ()
{
cin >> m >> n ;
a[5][5] = m ;
fz(0);
return 0 ;
}
void fz(int x )
{
if ( x == n )
{
for (i = 1;i < 10;i ++)
{
cout << a[i][1];
for (j = 2;j < 10; j++)
{
cout << " " << a[i][j];
}
cout << endl ;
}
}
else
{
for (i = 4 - x ;i <= 6 + x;i ++)
{
for (j = 4 - x;j <= 6 + x;j ++)
{
b[i][j] = a[i+1][j+1]+a[i][j]+ a[i+1][j-1]+ a[i-1][j+1]+ a[i+1][j] + a[i-1][j] + a[i][j+1]+ a[i][j-1]+ a[i-1][j-1];
}
}
for (i = 4 - x ;i <= 6 + x;i ++)
{
for (j = 4 - x;j <= 6 + x;j ++)
{
a[i][j] += b[i][j];
b[i][j] = 0 ;
}
}
fz(x+1);
}
} |
48 | 23528 | int main()
{
int bat[5][11][11] = {0};
int days;
cin >> bat[0][5][5] >> days;
for (int i = 1; i <= days ; i++)
{
for (int row = 1 ; row <= 9 ; row++)
{
for (int col = 1 ; col <= 9 ; col++)
{
if (bat[i-1][col][row] != 0)
{
bat[i][col][row] += 2 * bat[i-1][col][row];
bat[i][col-1][row-1] += bat[i-1][col][row];
bat[i][col-1][row] += bat[i-1][col][row];
bat[i][col-1][row+1] += bat[i-1][col][row];
bat[i][col][row-1] += bat[i-1][col][row];
bat[i][col][row+1] += bat[i-1][col][row];
bat[i][col+1][row-1] += bat[i-1][col][row];
bat[i][col+1][row] += bat[i-1][col][row];
bat[i][col+1][row+1] += bat[i-1][col][row];
}
}
}
}
for (int i = 1 ; i <= 9 ; i++)
{
cout << bat[days][i][1];
for(int j = 2; j <= 9 ; j++)
cout << ' ' << bat[days][i][j];
cout << endl;
}
return 0;
} |
48 | 23529 | int a[9][9] = {0}; //???????
void exp(int n)
{
int i = 0, j = 0, k = 0, b[9][9] = {0}, c[9][9] = {0};
for(i = 0; i < 9; i ++)
for(j = 0; j < 9; j ++)
if(a[i][j] != 0)
b[i][j] = 1; //??????
for(i = 0; i < 9; i ++)
{
for(j = 0; j < 9; j ++)
{
if((a[i][j] != 0) && (b[i][j] == 1))
{
if((i - 1 >= 0) && (j - 1 >= 0))
c[i - 1][j - 1] = c[i - 1][j - 1] + a[i][j];
if((i - 1 >= 0) && (j + 1 >= 0))
c[i - 1][j + 1] = c[i - 1][j + 1] + a[i][j];
if((i + 1 <= 8) && (j - 1 >= 0))
c[i + 1][j - 1] = c[i + 1][j - 1] + a[i][j];
if((i + 1 <= 8) && (j + 1 <= 8))
c[i + 1][j + 1] = c[i + 1][j + 1] + a[i][j];
if(i - 1 >= 0)
c[i - 1][j] = c[i - 1][j] + a[i][j];
if(i + 1 <= 8)
c[i + 1][j] = c[i + 1][j] + a[i][j];
if(j - 1 >= 0)
c[i][j - 1] = c[i][j - 1] + a[i][j];
if(j + 1 <= 8)
c[i][j + 1] = c[i][j + 1] + a[i][j];
c[i][j] = c[i][j] + a[i][j] * 2;
}
}
}
for(i = 0; i < 9; i ++)
{
for(j = 0; j < 9; j ++)
{
a[i][j] = c[i][j];
}
}
if(n > 1)
exp(n -1);
}
int main ()
{
int m = 0, n = 0, i = 0, j = 0; //m????????n???
cin >> m >> n;
a[4][4] = m; //?????
exp(n); //??????
for(i = 0; i < 9; i ++)
{
cout << a[i][0];
for(j = 1; j < 9; j ++)
cout << ' ' << a[i][j];
cout << endl;
}
return 0;
} |
48 | 23530 | int main()
{
int a[11][11]={0},b[11][11]={0},c[11][11]={0},d[11][11]={0},e[11][11]={0};
int m,n;
scanf("%d %d",&m,&n);
a[5][5]=m;
int i,j,i1,j1,i2,j2,i3,j3,i4,j4;
if(n==1)
{
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
b[i][j]=2*a[i][j]+a[i][j-1]+a[i][j+1]+a[i-1][j]+a[i+1][j]+a[i+1][j+1]+a[i+1][j-1]+a[i-1][j+1]+a[i-1][j-1];
}
}
for(i1=1;i1<=9;i1++)
{
for(j1=1;j1<=8;j1++)
{
printf("%d ",b[i1][j1]);
}
printf("%d\n",b[i1][j1]);
}
}
if(n==2)
{
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
b[i][j]=2*a[i][j]+a[i][j-1]+a[i][j+1]+a[i-1][j]+a[i+1][j]+a[i+1][j+1]+a[i+1][j-1]+a[i-1][j+1]+a[i-1][j-1];
}
}
for(i1=1;i1<=9;i1++)
{
for(j1=1;j1<=9;j1++)
{
c[i1][j1]=2*b[i1][j1]+b[i1][j1-1]+b[i1][j1+1]+b[i1-1][j1]+b[i1+1][j1]+b[i1+1][j1+1]+b[i1+1][j1-1]+b[i1-1][j1+1]+b[i1-1][j1-1];
}
}
for(i2=1;i2<=9;i2++)
{
for(j2=1;j2<=8;j2++)
{
printf("%d ",c[i2][j2]);
}
printf("%d\n",c[i2][j2]);
}
}
if(n==3)
{
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
b[i][j]=2*a[i][j]+a[i][j-1]+a[i][j+1]+a[i-1][j]+a[i+1][j]+a[i+1][j+1]+a[i+1][j-1]+a[i-1][j+1]+a[i-1][j-1];
}
}
for(i1=1;i1<=9;i1++)
{
for(j1=1;j1<=9;j1++)
{
c[i1][j1]=2*b[i1][j1]+b[i1][j1-1]+b[i1][j1+1]+b[i1-1][j1]+b[i1+1][j1]+b[i1+1][j1+1]+b[i1+1][j1-1]+b[i1-1][j1+1]+b[i1-1][j1-1];
}
}
for(i2=1;i2<=9;i2++)
{
for(j2=1;j2<=9;j2++)
{
d[i2][j2]=2*c[i2][j2]+c[i2][j2-1]+c[i2][j2+1]+c[i2-1][j2]+c[i2+1][j2]+c[i2+1][j2+1]+c[i2+1][j2-1]+c[i2-1][j2+1]+c[i2-1][j2-1];
}
}
for(i3=1;i3<=9;i3++)
{
for(j3=1;j3<=8;j3++)
{
printf("%d ",d[i3][j3]);
}
printf("%d\n",d[i3][j3]);
}
}
if(n==4)
{
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
b[i][j]=2*a[i][j]+a[i][j-1]+a[i][j+1]+a[i-1][j]+a[i+1][j]+a[i+1][j+1]+a[i+1][j-1]+a[i-1][j+1]+a[i-1][j-1];
}
}
for(i1=1;i1<=9;i1++)
{
for(j1=1;j1<=9;j1++)
{
c[i1][j1]=2*b[i1][j1]+b[i1][j1-1]+b[i1][j1+1]+b[i1-1][j1]+b[i1+1][j1]+b[i1+1][j1+1]+b[i1+1][j1-1]+b[i1-1][j1+1]+b[i1-1][j1-1];
}
}
for(i2=1;i2<=9;i2++)
{
for(j2=1;j2<=9;j2++)
{
d[i2][j2]=2*c[i2][j2]+c[i2][j2-1]+c[i2][j2+1]+c[i2-1][j2]+c[i2+1][j2]+c[i2+1][j2+1]+c[i2+1][j2-1]+c[i2-1][j2+1]+c[i2-1][j2-1];
}
}
for(i3=1;i3<=9;i3++)
{
for(j3=1;j3<=9;j3++)
{
e[i3][j3]=2*d[i3][j3]+d[i3][j3-1]+d[i3][j3+1]+d[i3-1][j3]+d[i3+1][j3]+d[i3+1][j3+1]+d[i3+1][j3-1]+d[i3-1][j3+1]+d[i3-1][j3-1];
}
}
for(i4=1;i4<=9;i4++)
{
for(j4=1;j4<=8;j4++)
{
printf("%d ",e[i4][j4]);
}
printf("%d\n",e[i4][j4]);
}
}
} |
48 | 23531 | int a[11][11][5];
main()
{
int x(int i,int j,int k);
int i,j,m,n,q;
int p=0;
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
for(p=0;p<5;p++)
a[i][j][p]=0;
}
}
scanf("%d %d",&m,&n);
a[5][5][0]=m;
for(q=0;q<n;q++)
{
for(i=1;i<10;i++)
for(j=1;j<10;j++)
a[i][j][q+1]=x(i,j,q);
}
for(i=1;i<10;i++)
{
for(j=1;j<9;j++)
printf("%d ",a[i][j][n]);
printf("%d\n",a[i][9][n]);
}
}
int x(int i,int j,int k)
{
int b=0,l;
for(l=-1;l<2;l++)
b=b+a[i+l][j][k]+a[i+l][j-1][k]+a[i+l][j+1][k];
return(b+a[i][j][k]);
} |
48 | 23532 |
main()
{
int a[9][9];
int b[9][9];
int m,n,i,j,k;
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
a[i][j]=0;
b[i][j]=0;
}
}
scanf("%d %d",&m,&n);
a[4][4]=m;
b[4][4]=m;
for(k=0;k<n;k++)
{
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
b[i][j]=a[i][j];}}
for(i=4-k;i<=4+k;i++)
{
for(j=4-k;j<=4+k;j++)
{
a[i-1][j]=b[i][j]+a[i-1][j];
a[i-1][j-1]=b[i][j]+a[i-1][j-1];
a[i-1][j+1]=b[i][j]+a[i-1][j+1];
a[i+1][j]=b[i][j]+a[i+1][j];
a[i+1][j+1]=b[i][j]+a[i+1][j+1];
a[i+1][j-1]=b[i][j]+a[i+1][j-1];
a[i][j-1]=b[i][j]+a[i][j-1];
a[i][j+1]=b[i][j]+a[i][j+1];
a[i][j]=a[i][j]+b[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(j<8)
printf("%d ",a[i][j]);
if(j==8)
printf("%d\n",a[i][j]);
}
}
}
|
48 | 23533 |
int m,n;
int a[9][9]={0},b[9][9]={0};
void xijunfanzhi (int day)
{
int i ,j;
if (day == n+1)
{
return;
}
else
{
for (i=0;i<9;i++)
{
for (j=0;j<9;j++)
{
if (a[i][j]!=0)
{
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];
b[i][j]=b[i][j]+a[i][j];
}
}
}
for (i=0;i<9;i++)
{
for (j=0;j<9;j++)
{
a[i][j]=a[i][j]+b[i][j];
b[i][j]=0;
}
}
xijunfanzhi(day+1);
}
}
int main()
{
int i,j;
cin >> m >> n;a[4][4]=m;
xijunfanzhi(1);
for (i=0;i<9;i++)
{
for (j=0;j<9;j++)
{
if (j!=8)
cout << a[i][j]<<' ';
else
cout << a[i][j]<<endl;;
}
}
return 0;
}
|
48 | 23534 | void change(int a[], int, int, int);
int main()
{
int a[9][9], b[9][9];
int m, n, g = 0;
cin >> m >> n;
for(int i = 0; i <= 8; i ++)
for(int j = 0; j <= 8; j ++)
{
b[i][j] = 0;
a[i][j] = 0;
}
a[4][4] = m;
for(int i = 1; i <= (n + 1) / 2; i ++)
{
for(int i = 0; i <= 8; i ++)
for(int j = 0; j <= 8; j ++)
{
b[i][j] = 0;
}
for(int j = 0; j <= 8; j ++)
for(int k = 0; k <= 8; k ++)
{
if(a[j][k] > 0)
{
b[j - 1][k] = a[j][k] + b[j - 1][k];
b[j][k - 1] = a[j][k] + b[j][k - 1];
b[j + 1][k] = a[j][k] + b[j + 1][k];
b[j][k + 1] = a[j][k] + b[j][k + 1];
b[j - 1][k - 1] = a[j][k] + b[j - 1][k - 1];
b[j - 1][k + 1] = a[j][k] + b[j - 1][k + 1];
b[j + 1][k - 1] = a[j][k] + b[j + 1][k - 1];
b[j + 1][k + 1] = a[j][k] + b[j + 1][k + 1];
b[j][k] = 2 * a[j][k] + b[j][k];
}
g ++;
}
if(g == n)
break;
for(int i = 0; i <= 8; i ++)
for(int j = 0; j <= 8; j ++)
{
a[i][j] = 0;
}
for(int j = 0; j <= 8; j ++)
for(int k = 0; k <= 8; k ++)
{
if(b[j][k] > 0)
{
a[j - 1][k] = b[j][k] + a[j - 1][k];
a[j][k - 1] = b[j][k] + a[j][k - 1];
a[j + 1][k] = b[j][k] + a[j + 1][k];
a[j][k + 1] = b[j][k] + a[j][k + 1];
a[j - 1][k - 1] = b[j][k] + a[j - 1][k - 1];
a[j - 1][k + 1] = b[j][k] + a[j - 1][k + 1];
a[j + 1][k - 1] = b[j][k] + a[j + 1][k - 1];
a[j + 1][k + 1] = b[j][k] + a[j + 1][k + 1];
a[j][k] = 2 * b[j][k] + a[j][k];
}
g ++;
}
}
if(n % 2 == 0)
{
for(int i = 0; i <= 8; i ++)
{
cout << a[i][0];
for(int j = 1; j <= 8; j ++)
cout << " " << a[i][j];
cout << endl;
}
}
else
{
for(int i = 0; i <= 8; i ++)
{
cout << b[i][0];
for(int j = 1; j <= 8; j ++)
cout << " " << b[i][j];
cout << endl;
}
}
return 0;
} |
48 | 23535 | //????????????????????????
int main()
{
int m,n;
int a[11][11];//a????????
int b[11][11];//b????????
int i,j,k,p,q;
for(i=0;i<11;i++)//???????
for(j=0;j<11;j++)
a[i][j]=0;
for(i=0;i<11;i++)
for(j=0;j<11;j++)
b[i][j]=0;
cin>>m>>n;
a[5][5]=m;//???????m
for(k=1;k<=n;k++)//???n?
{
for(i=1;i<=9;i++)//????????
for(j=1;j<=9;j++)
{
for(p=i-1;p<=i+1;p++)
for(q=j-1;q<=j+1;q++)
b[i][j]+=a[p][q];
b[i][j]+=a[i][j];
}
for(i=1;i<=9;i++)//???????????????????
for(j=1;j<=9;j++)
{
a[i][j]=b[i][j];
b[i][j]=0;
}
}
for(i=1;i<=9;i++)//??n??????
{
for(j=1;j<9;j++)
cout<<a[i][j]<<' ';
cout<<a[i][9]<<endl;
}
return 0;
}
|
48 | 23536 | main()
{
int m,n,k,i,j,t,g,f;
int a[9][9]={0};
int b[9][9]={0};
scanf("%d %d",&n,&m);
a[4][4]=n;
b[4][4]=n;
for(k=0;k<m;k++)
{
for(i=4-k;i<=4+k;i++)
{
for(j=4-k;j<=4+k;j++)
{
for(t=i-1;t<=i+1;t++)
{
for(g=j-1;g<=j+1;g++)
{
a[t][g]+=b[i][j];
}
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
b[i][j]=a[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(j)printf(" ");
printf("%d",a[i][j]);
}
printf("\n");
}
getchar();
getchar();
getchar();
}
|
48 | 23537 |
int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int main() {
int a[11][11], b[11][11], m, n, i, j, k;
scanf("%d%d", &m, &n);
memset(a, 0, sizeof a);
a[5][5] = m;
while (n--) {
memset(b, 0, sizeof b);
for (i = 1; i <= 9; ++i)
for (j = 1; j <= 9; ++j) {
b[i][j] += a[i][j] * 2;
for (k = 0; k < 8; ++k)
b[i + dx[k]][j + dy[k]] += a[i][j];
}
memcpy(a, b, sizeof b);
}
for (i = 1; i <= 9; ++i) {
for (j = 1; j < 9; ++j) printf("%d ", a[i][j]);
printf("%d\n", a[i][9]);
}
return 0;
}
|
48 | 23538 | int bac0[10][10];
int bac1[10][10];
int m,n;
void init1(){
for(int i = 1;i<10;i++){
for(int j = 1;j<10;j++){
bac0[i][j]=0;
}
}
bac0[5][5]=m;
return;
}
void init2(){
for(int i = 1;i<10;i++){
for(int j = 1;j<10;j++){
bac1[i][j]=0;
}
}
return;
}
void born(int a,int b){
bac1[a][b]+=(bac0[a][b]*2);
if(a-1>=1){
bac1[a-1][b]+=bac0[a][b];
if(b-1>=1) bac1[a-1][b-1]+=bac0[a][b];
if(b+1<=9) bac1[a-1][b+1]+=bac0[a][b];
}
if(a+1<=9){
bac1[a+1][b]+=bac0[a][b];
if(b-1>=1) bac1[a+1][b-1]+=bac0[a][b];
if(b+1<=9) bac1[a+1][b+1]+=bac0[a][b];
}
if(b-1>=1) bac1[a][b-1]+=bac0[a][b];
if(b+1<=9) bac1[a][b+1]+=bac0[a][b];
return;
}
void update(){
for(int i=1;i<=9;i++){
for(int j=1;j<=9;j++){
bac0[i][j]=bac1[i][j];
}
}
return;
}
void day(){
init2();
for(int i=1;i<10;i++){
for(int j = 1;j<10;j++){
if(bac0[i][j]!=0){
born(i,j);
}
}
}
update();
return;
}
void Print(){
for(int i=1;i<=9;i++){
cout<<bac0[i][1];
for(int j=2;j<=9;j++){
cout<<" "<<bac0[i][j];
}
cout<<endl;
}
return;
}
int main(){
cin>>m>>n;
init1();
for(int i=0;i<n;i++){
day();
}
Print();
return 0;
}
|
48 | 23539 | int m;
int num(int, int, int);
int main(void)
{
int n, i, j;
cin >> m >> n;
for( i = 1 ; i < 10 ; i++ )
{
for( j = 1 ; j < 9 ; j++ )
cout << num(n, i, j) << " ";
cout << num(n, i, 9) << endl;
}
return 0;
}
int num(int a, int x, int y)
{
if( a == 0 )
{
if( x == 5 && y == 5 )
return m;
else
return 0;
}
else
return num(a - 1, x, y) * 2 + num(a - 1, x - 1, y - 1) + num(a - 1, x - 1, y) + num(a - 1, x - 1, y + 1) + num(a - 1, x, y - 1) + num(a - 1, x, y + 1) + num(a - 1, x + 1, y - 1) + num(a - 1, x + 1, y) + num(a - 1, x + 1, y + 1);
} |
48 | 23540 | int main()
{
int a[11][11][5];int m,n,i,j,k;
scanf("%d%d",&m,&n);
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
for(k=0;k<5;k++)
a[i][j][k]=0;
}
}
a[5][5][0]=m;
for(k=0;k<n;k++)
{for(i=5-k;i<=5+k;i++)
{
for(j=5-k;j<=5+k;j++)
{
a[i][j][k+1]+=2*a[i][j][k];
a[i-1][j-1][k+1]+=a[i][j][k];
a[i][j-1][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][j+1][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];
}
}
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if(j!=9)
{
printf("%d ",a[i][j][n]);}
else{printf("%d\n",a[i][j][n]);}
}
}
return 0;
}
|
48 | 23541 | main()
{
int i,j,k,n,m,d;
int a[11][11]={0},b[11][11]={0};
scanf("%d %d",&m,&d);
a[5][5]=m;
for(k=1;k<=d;k++)
{
for(i=1;i<10;i++)
for(j=1;j<10;j++)
{
b[i][j]=2*a[i][j]+a[i-1][j]+a[i-1][j-1]+a[i-1][j+1]+a[i][j-1]+a[i][j+1]+a[i+1][j-1]+a[i+1][j]+a[i+1][j+1];
}
for(i=0;i<11;i++)
for(j=0;j<11;j++)
a[i][j]=b[i][j];
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if(j==1)
printf("%d",a[i][j]);
else
printf(" %d",a[i][j]);
if(j==9)
printf("\n");
}
}
}
|
48 | 23542 |
int a[9][9],b[9][9];
void work(int x,int y,char s)
{
int i,j,q;
q=(s=='b')?a[x][y]:b[x][y];
for (i=x-1;i<=x+1;i++)
for (j=y-1;j<=y+1;j++)
if (s=='a')
a[i][j]+=q;
else
b[i][j]+=q;
}
int main()
{
int m,n,k,i,j;
scanf("%d %d",&m,&n);
a[4][4]=m;
for (k=1;k<=n;k++)
if (k%2==1)
{
for (i=0;i<9;i++)
for (j=0;j<9;j++)
b[i][j]=a[i][j];
for (i=0;i<9;i++)
for (j=0;j<9;j++)
if (a[i][j]>0)
work(i,j,'b');
}
else
{
for (i=0;i<9;i++)
for (j=0;j<9;j++)
a[i][j]=b[i][j];
for (i=0;i<9;i++)
for (j=0;j<9;j++)
if (b[i][j]>0)
work(i,j,'a');
}
if (n%2==1)
for (i=0;i<9;i++)
{
for (j=0;j<8;j++)
printf("%d ",b[i][j]);
printf("%d\n",b[i][j]);
}
else
for (i=0;i<9;i++)
{
for (j=0;j<8;j++)
printf("%d ",a[i][j]);
printf("%d\n",a[i][j]);
}
return 0;
}
|
48 | 23543 | int bac[11][11],tp[11][11],n,m;
void mul(int x)
{
if (x==n) return;
else{
for(int i=0;i<11;i++){
for(int j=0;j<11;j++){
tp[i][j]=0;}}
for(int i=1;i<=9;i++){
for(int j=1;j<=9;j++){
tp[i-1][j]+=bac[i][j];
tp[i+1][j]+=bac[i][j];
tp[i-1][j-1]+=bac[i][j];
tp[i+1][j-1]+=bac[i][j];
tp[i-1][j+1]+=bac[i][j];
tp[i+1][j+1]+=bac[i][j];
tp[i][j-1]+=bac[i][j];
tp[i][j+1]+=bac[i][j];
tp[i][j]+=2*bac[i][j];}}
for(int i=1;i<=9;i++){
for(int j=1;j<=9;j++){
bac[i][j]=tp[i][j];}}
mul(x+1);}
}
int main()
{
for(int i=0;i<11;i++){
for(int j=0;j<11;j++){
bac[i][j]=0;}}
cin>>m>>n;
bac[5][5]=m;
mul(0);
for(int i=1;i<=9;i++){
cout<<bac[i][1];
for(int j=2;j<=9;j++){
cout<<" "<<bac[i][j];}
cout<<endl;}
return 0;
}
|
48 | 23544 | int main()
{
int a[11][11]={0},b[11][11]={0},i=1,j=1,t=1,number,time;
cin>>number>>time;
a[5][5]=number;
for(i=1;i<=time;i++)
{
for(j=1;j<=9;j++)
{
for(t=1;t<=9;t++)
{
if(a[j][t]!=0)
{
b[j][t]+=2*a[j][t];
b[j+1][t]+=a[j][t];
b[j-1][t]+=a[j][t];
b[j+1][t+1]+=a[j][t];
b[j-1][t+1]+=a[j][t];
b[j+1][t-1]+=a[j][t];
b[j-1][t-1]+=a[j][t];
b[j][t+1]+=a[j][t];
b[j][t-1]+=a[j][t];
}
}
}
for(j=1;j<=9;j++)
{
for(t=1;t<=9;t++)
{
a[j][t]=b[j][t];
b[j][t]=0;
}
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<=8;j++)
{
cout<<a[i][j]<<" ";
}
cout<<a[i][9]<<endl;
}
return 0;
}
|
48 | 23545 | int main()
{
int m,n,i,j,k;
scanf("%d %d",&m,&n);
int a[5][11][11]={{0},{0},{0}};
a[0][5][5]=m;
for (i=1;i<=n;i++)
{
for (j=1;j<10;j++)
{
for(k=1;k<10;k++)
{
a[i][j][k]=2*a[i-1][j][k]+a[i-1][j-1][k-1]+a[i-1][j-1][k]+a[i-1][j-1][k+1]+a[i-1][j][k-1]+a[i-1][j][k+1]+a[i-1][j+1][k-1]+a[i-1][j+1][k]+a[i-1][j+1][k+1];
}
}
}
for (j=1;j<10;j++)
{
for (k=1;k<10;k++)
{
printf("%d",a[n][j][k]);
if ((k==9)&&(j!=9)) {printf("\n");}
else if (k!=9) {printf(" ");}
}
}
getchar();
getchar();
getchar();
return 0;
} |
48 | 23546 |
int main(int argc, char* argv[])
{
int m,n,a;
scanf("%d""%d",&m,&n);
int num[5][9][9];
int i,j,k;
for(i=0;i<5;i++)
{
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
{
num[i][j][k]=0;
}
}
}
num[0][4][4]=m;
for(i=0;i<n;i++)
{
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
{
if(num[i][j][k]!=0)
{
a=num[i][j][k];
num[i+1][j][k+1]=num[i+1][j][k+1]+a;
num[i+1][j][k-1]=num[i+1][j][k-1]+a;
num[i+1][j][k]=num[i+1][j][k]+2*a;
num[i+1][j+1][k-1]=num[i+1][j+1][k-1]+a;
num[i+1][j+1][k+1]=num[i+1][j+1][k+1]+a;
num[i+1][j+1][k]=num[i+1][j+1][k]+a;
num[i+1][j-1][k+1]=num[i+1][j-1][k+1]+a;
num[i+1][j-1][k-1]=num[i+1][j-1][k-1]+a;
num[i+1][j-1][k]=num[i+1][j-1][k]+a;
}
}
}
}
for(j=0;j<9;j++)
{
for(k=0;k<8;k++)
{
printf("%d ",num[n][j][k]);
}
printf("%d\n",num[n][j][8]);
}
return 0;
}
|
48 | 23547 | main()
{
int p[5][81];//?????????
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 | 23548 | int map[10][10],add[10][10],m,n;
//????
void Generate(int x,int y){
int v = map[x][y];
for(int i = -1;i<=1;i++){
for(int j = -1;j<=1;j++){
if(i==0&&j==0) add[x+i][y+j]+=v*2;
else add[x+i][y+j]+=v;
}
}
return;
}
int main(){
cin>>m>>n;
memset(map,0,sizeof(map));
map[5][5] = m;
for(int k = 0;k<n;k++){
memset(add,0,sizeof(add));
for(int i = 1;i<10;i++){
for(int j = 1;j<10;j++){
if(map[i][j]!=0) Generate(i,j);
}
}
for(int i = 1;i<10;i++){
for(int j = 1;j<10;j++){
map[i][j]=add[i][j];
}
}
}
for(int i = 1;i<10;i++){
for(int j = 1;j<10;j++){
if(j!=1) cout<<" "<<map[i][j];
else cout<<map[i][j];
}
cout<<endl;
}
return 0;
}
|
48 | 23549 | int a[11][11] = {0};
int n;
int tian;
void ff(int a[][11], int k)
{
int aa[11][11];
for(int i = 1; i <= 9; ++i)
for(int j = 1; j <= 9; ++j)
aa[i][j] = 0;
for(int i = 1; i <= 9; ++i)
for(int j = 1; j <= 9; ++j)
{
if(a[i][j] != 0)
{
aa[i][j]+=2*a[i][j];
aa[i+1][j]+=a[i][j];
aa[i-1][j]+=a[i][j];
aa[i][j+1]+=a[i][j];
aa[i][j-1]+=a[i][j];
aa[i+1][j+1]+=a[i][j];
aa[i+1][j-1]+=a[i][j];
aa[i-1][j+1]+=a[i][j];
aa[i-1][j-1]+=a[i][j];
}
}
for(int i = 1; i <= 9; ++i)
for(int j = 1; j <= 9; ++j)
a[i][j] = aa[i][j];
if(k == tian)
{
for(int i = 1; i <= 9; ++i)
{
cout << a[i][1];
for(int j = 2; j <= 9; ++j)
{
cout << " " << a[i][j];
}
cout << endl;
}
}
else ff(a,k+1);
}
int main()
{
cin >> n >> tian;
a[5][5] = n;
ff(a,1);
//while(1);
return 0;
}
|
48 | 23550 | //????????
int x[9][9] = {0}, y[9][9] = {0};
void scan()
{
int i, j;
for(i = 0; i < 9; i++)
for(j = 0; j < 9; j++)
{
if(x[i][j] != 0)
{
y[i][j] += x[i][j] * 2;
y[i-1][j] += x[i][j];
y[i+1][j] += x[i][j];
y[i-1][j-1] += x[i][j];
y[i-1][j+1] += x[i][j];
y[i+1][j-1] += x[i][j];
y[i+1][j+1] += x[i][j];
y[i][j-1] += x[i][j];
y[i][j+1] += x[i][j];
}
}
}
int main()
{
int m, n, i, j;
cin >> m >> n;
x[4][4] = m;
while(n--)
{
scan();
for(i = 0; i < 9; i++)
for(j = 0; j < 9; j++)
{
x[i][j] = y[i][j];
y[i][j] = 0;
}
}
for(i = 0; i < 9; i++)
for(j = 0; j < 9; j++)
{
cout << x[i][j];
if(j == 8)
cout << endl;
else
cout << " ";
}
return 0;
}
|
48 | 23551 | int pymbg[11][11]={0},pymed[11][11]={0};
void peiyang(int n)
{
int i,j;
if(n!=0)
{
for (i=1;i<10;i++)for(j=1;j<10;j++)
{
pymed[i][j]=pymed[i][j]+pymbg[i][j];
pymed[i][j-1]=pymed[i][j-1]+pymbg[i][j];
pymed[i][j+1]=pymed[i][j+1]+pymbg[i][j];
pymed[i+1][j]=pymed[i+1][j]+pymbg[i][j];
pymed[i+1][j-1]=pymed[i+1][j-1]+pymbg[i][j];
pymed[i+1][j+1]=pymed[i+1][j+1]+pymbg[i][j];
pymed[i-1][j]=pymed[i-1][j]+pymbg[i][j];
pymed[i-1][j-1]=pymed[i-1][j-1]+pymbg[i][j];
pymed[i-1][j+1]=pymed[i-1][j+1]+pymbg[i][j];
}
for (i=1;i<10;i++)for(j=1;j<10;j++) pymbg[i][j]=pymed[i][j];
n--;
peiyang(n);
}
}
int main( )
{
int m,n,i,j;
cin>>m>>n;
pymbg[5][5]=m;
pymed[5][5]=m;
peiyang(n);
for (i=1;i<10;i++)
{
for (j=1;j<9;j++) cout<<pymbg[i][j]<<' ';
cout<<pymbg[i][9];
cout<<'\n';
}
return 0;
} |
48 | 23552 | int main()
{
int m,n,a[82],b[82],i,j;
scanf("%d %d",&m,&n);
for(i=0;i<81;i++)
{
a[i]=0;
}
a[40]=m;
for(i=0;i<n;i++)
{
for(j=0;j<81;j++)
{
if(j==0)
b[j]=2*a[j]+a[j+1]+a[j+9]+a[j+10];
if(j==8)
b[j]=2*a[j]+a[j-1]+a[j+8]+a[j+9];
if(j==72)
b[j]=2*a[j]+a[j-9]+a[j-8]+a[j+1];
if(j==80)
b[j]=2*a[j]+a[j-10]+a[j-9]+a[j-1];
if((j<8)&&(j>0))
b[j]=2*a[j]+a[j-1]+a[j+1]+a[j+8]+a[j+9]+a[j+10];
if((j<80)&&(j>72))
b[j]=2*a[j]+a[j-10]+a[j-9]+a[j-8]+a[j-1]+a[j+1];
if((j%9==0)&&(j!=0)&&(j!=72))
b[j]=2*a[j]+a[j-9]+a[j-8]+a[j+1]+a[j+9]+a[j+10];
if((j%9==8)&&(j!=8)&&(j!=80))
b[j]=2*a[j]+a[j-10]+a[j-9]+a[j-1]+a[j+8]+a[j+9];
if((j>9)&&(j<71)&&(j%9!=0)&&(j%9!=8))
b[j]=2*a[j]+a[j-10]+a[j-9]+a[j-8]+a[j-1]+a[j+1]+a[j+8]+a[j+9]+a[j+10];
}
for(j=0;j<81;j++)
{
a[j]=b[j];
}
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
printf("%d ",a[9*i+j]);
}
printf("%d\n",a[9*i+8]);
}
//getchar();
//getchar();
return 0;
}
|
48 | 23553 | int main(){
int m,n,i,j,k,a[11][11],b[11][11];
for(m=0;m<11;m++){
for(n=0;n<11;n++){
a[m][n]=0;
b[m][n]=0;
}
}
scanf("%d%d",&m,&n);
a[5][5]=m;
b[5][5]=m;
for(i=0;i<n;i++){
for(k=1;k<10;k++){
for(j=1;j<10;j++){
b[k][j]=2*a[k][j]+a[k-1][j-1]+a[k-1][j]+a[k-1][j+1]+a[k][j-1]+a[k][j+1]+a[k+1][j-1]+a[k+1][j]+a[k+1][j+1];
}
}
for(k=0;k<11;k++){
for(j=0;j<11;j++){
a[k][j]=b[k][j];
}
}
}
for(k=1;k<10;k++){
printf("%d",a[k][1]);
for(j=2;j<10;j++){
printf(" %d",a[k][j]);
}
if(k<9){
printf("\n");
}
}
scanf("%d",&n);
return 0;
} |
48 | 23554 | int main()
{int i,j,k;
int s[9][9][5];
int m,n;
cin>>m>>n;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
for(k=0;k<5;k++)
{s[i][j][k]=0;}
s[4][4][0]=m;
for(k=1;k<n+1;k++)
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{if(i==0&&j==0)
s[i][j][k]=s[i+1][j][k-1]+s[i][j+1][k-1]+2*s[i][j][k-1]+s[i+1][j+1][k-1];
if(i==0&&j==8)
s[i][j][k]=s[i+1][j][k-1]+s[i][j-1][k-1]+2*s[i][j][k-1]+s[i+1][j-1][k-1];
if(i==8&&j==0)
s[i][j][k]=s[i-1][j][k-1]+s[i][j+1][k-1]+2*s[i][j][k-1]+s[i-1][j+1][k-1];
if(i==8&&j==8)
s[i][j][k]=s[i-1][j][k-1]+s[i][j-1][k-1]+2*s[i][j][k-1]+s[i-1][j-1][k-1];
if(i==0&&j!=0&&j!=8)
s[i][j][k]=s[i+1][j][k-1]+s[i][j+1][k-1]+s[i][j-1][k-1]+2*s[i][j][k-1]+s[i+1][j-1][k-1]+s[i+1][j+1][k-1];
if(i==8&&j!=0&&j!=8)
s[i][j][k]=s[i-1][j][k-1]+s[i][j+1][k-1]+s[i][j-1][k-1]+2*s[i][j][k-1]+s[i-1][j-1][k-1]+s[i-1][j+1][k-1];
if(j==8&&i!=0&&i!=8)
s[i][j][k]=s[i-1][j][k-1]+s[i+1][j][k-1]+s[i][j-1][k-1]+2*s[i][j][k-1]+s[i+1][j-1][k-1]+s[i-1][j-1][k-1];
if(j==0&&i!=0&&i!=8)
s[i][j][k]=s[i-1][j][k-1]+s[i+1][j][k-1]+s[i][j+1][k-1]+2*s[i][j][k-1]+s[i+1][j+1][k-1]+s[i-1][j+1][k-1];
if(i!=0&&j!=0&&i!=8&&j!=8)
s[i][j][k]=s[i-1][j][k-1]+s[i+1][j][k-1]+s[i][j-1][k-1]+s[i][j+1][k-1]+2*s[i][j][k-1]+s[i+1][j-1][k-1]+s[i+1][j+1][k-1]+s[i-1][j-1][k-1]+s[i-1][j+1][k-1];
}
for(i=0;i<9;i++)
{for(j=0;j<8;j++)
{cout<<s[i][j][n]<<" ";}
cout<<s[i][8][n]<<endl;}
return 0;
}
|
48 | 23555 |
void reproduce(int n, int (*a)[9])
{
if(n == 0)
return;
int temp[9][9] = {0};
for(int i = 0; i < 9; i++)
for(int j = 0; j < 9; j++)
if(a[i][j])
{
temp[i][j] += 2 * a[i][j];
if(i > 0)
{
temp[i - 1][j] += a[i][j];
if(j > 0)
{
temp[i - 1][j - 1] += a[i][j];
temp[i][j - 1] += a[i][j];
if(i < 8)
{
temp[i + 1][j - 1] += a[i][j];
temp[i + 1][j] += a[i][j];
}
}
if(j < 8)
{
temp[i - 1][j + 1] += a[i][j];
temp[i][j + 1] += a[i][j];
if(i < 8)
temp[i + 1][j + 1] += a[i][j];
}
}
}
for(int i = 0; i < 9; i++)
for(int j = 0; j < 9; j++)
a[i][j] = temp[i][j];
return reproduce(n - 1, a);
}
int main()
{
int m, n;
int a[9][9] = {0};
cin >> m >> n;
a[4][4] = m;
reproduce(n, a);
for(int i = 0; i < 9; i++)
for(int j = 0; j < 9; j++)
{
cout << a[i][j];
if(j == 8)
cout << endl;
else
cout << " ";
}
return 0;
} |
48 | 23556 |
int main()
{
int c[2][11][11] = {0}, i, j, k;
int m, n;
cin >> m >> n;
c[0][5][5] = m;
for (k = 0; k <= n - 1; k++)
{
memset(c[(k+1)%2], 0, 11*11*4);
for (i = 1; i <= 9; i++)
{
for (j = 1; j <= 9; j++)
{
if (c[k%2][i][j] != 0)
{
c[(k+1)%2][i][j] += 2 * c[k%2][i][j];
c[(k+1)%2][i+1][j] += c[k%2][i][j];
c[(k+1)%2][i-1][j] += c[k%2][i][j];
c[(k+1)%2][i][j+1] += c[k%2][i][j];
c[(k+1)%2][i][j-1] += c[k%2][i][j];
c[(k+1)%2][i+1][j+1] += c[k%2][i][j];
c[(k+1)%2][i-1][j-1] += c[k%2][i][j];
c[(k+1)%2][i+1][j-1] += c[k%2][i][j];
c[(k+1)%2][i-1][j+1] += c[k%2][i][j];
}
}
}
}
for (i = 1; i <= 9; i++)
{
for (j = 1; j <= 9; j++)
{
cout << c[n%2][i][j];
if (j == 9)
{
cout << endl;
}
else
{
cout << " ";
}
}
}
return 0;
}
|
48 | 23557 | int main()
{
int a[9][9]={{0}};
int b[9][9];
int m,n,w,i,j,c;
scanf("%d %d",&m,&n);
a[4][4]=m;
for(w=1;w<=n;w++)
{
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
b[i-1][j-1]=0;
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{
c=a[i-1][j-1];
if(c!=0)
{
b[i-2][j-2]=b[i-2][j-2]+c;
b[i-2][j-1]=b[i-2][j-1]+c;
b[i-2][j]=b[i-2][j]+c;
b[i-1][j-2]=b[i-1][j-2]+c;
b[i-1][j]=b[i-1][j]+c;
b[i][j-2]=b[i][j-2]+c;
b[i][j-1]=b[i][j-1]+c;
b[i][j]=b[i][j]+c;
b[i-1][j-1]=b[i-1][j-1]+c;
}
}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
a[i-1][j-1]=a[i-1][j-1]+b[i-1][j-1];
}
for(i=1;i<=9;i++)
{
for(j=1;j<=8;j++)
printf("%d ",a[i-1][j-1]);
printf("%d\n",a[i-1][8]);
}
return 0;
} |
48 | 23558 | /************************************
1.cpp
???2011-11-23
??(11.8) ????????
?? 1100012886
************************************/
//??????????????????
int main()
{
int i, j, i1, j1, n, n1 = 0, m;
int sperm[9][9] = {0}, temp[9][9]; //??????????????????????????????????
cin >> m >> n;
sperm[4][4] = m;
do
{
n1++; //n1?????
for (i = 0; i <= 8; i++)
{
for (j = 0; j <= 8; j++)
{
temp[i][j] = 0;
}
} //?temp????
for (i = 5 - n1; i <= 3 + n1; i++)
{
for (j = 5 - n1; j <= 3 + n1; j++)
{
//?????????????n1??????
for (i1 = i - 1; i1 <= i + 1; i1++)
{
for (j1 = j - 1; j1 <= j + 1; j1++)
{
temp[i1][j1] = temp[i1][j1] + sperm[i][j]; //?????????temp
}
}
}
}
for (i = 0; i <= 8; i++)
{
for (j = 0; j <= 8; j++)
{
sperm[i][j] = sperm[i][j] + temp[i][j];
}
} //??
} while (n1 < n);
for (i = 0; i <= 8; i++)
{
for (j = 0; j <= 8; j++)
{
cout << sperm[i][j];
if (j < 8) cout << " ";
}
cout << endl;
} //??
return 0;
}
|
48 | 23559 | //*************************************************
//*3ìDò?oàyìa(11.8) ϸ¾ú?Ä·±Ö3óëà©é? *
//*DÕÃû?ooÎÔÆÆe *
//*ѧoÅ?o1300012888 *
//*èÕÆú?o2013.12.9 *
//*************************************************
void change(int a,int area[][11],int area0[][11])
{
int i, j;
if(a == 0)
return;
else
{
for(i = 1;i <= 9;i ++)
{
for(j = 1;j <= 9;j ++)
area0[i][j] = area[i][j];
}
for(i = 1;i <= 9;i ++)
{
for(j = 1;j <= 9;j ++)
{
area0[i][j] += area[i][j];
area0[i - 1][j] += area[i][j];
area0[i + 1][j] += area[i][j];
area0[i][j - 1] += area[i][j];
area0[i][j + 1] += area[i][j];
area0[i + 1][j + 1] += area[i][j];
area0[i - 1][j - 1] += area[i][j];
area0[i + 1][j - 1] += area[i][j];
area0[i - 1][j + 1] += area[i][j];
}
}
for(i = 1;i <= 9;i ++)
{
for(j = 1;j <= 9;j ++)
area[i][j] = area0[i][j];
}
change(a - 1,area,area0);
}
}
int main()
{
int area[11][11], area0[11][11], i, j;
int num, day;
cin >> num >> day;
memset(area, 0, sizeof(area));
memset(area0, 0, sizeof(area0));
area[5][5] = num;
change(day, area, area0);
for(i = 1;i <= 9;i ++)
{
for(j = 1;j <= 9;j ++)
{
if(j == 1)
cout << area[i][j];
else
cout << " " << area[i][j];
}
cout << endl;
}
return 0;
} |
48 | 23560 | int main()
{
int m, n, i, j, a[10][10] = {0}, k, b[10][10] = {0};
cin >> m >> n;
a[5][5] = m;
for (k = 1; k <= n; k++)
{
for (i = 1; i <= 9; i++)
{
for (j = 1; j <= 9; j++)
{
if (a[i][j] != 0)
{
b[i][j] += 2 * a[i][j];
b[i][j - 1] += a[i][j];
b[i][j + 1] += a[i][j];
b[i - 1][j] += a[i][j];
b[i + 1][j] += a[i][j];
b[i - 1][j - 1] += a[i][j];
b[i + 1][j - 1] += a[i][j];
b[i - 1][j + 1] += a[i][j];
b[i + 1][j + 1] += a[i][j];
}
}
}
for (i = 1; i <= 9; i++)
for (j = 1; j <= 9; j++)
a[i][j] = b[i][j];
memset(b, 0, sizeof(b));
}
for (i = 1; i <= 9; i++)
{
for (j = 1; j <= 8; j++)
cout << a[i][j] << ' ';
cout << a[i][9] << endl;
}
return 0;
}
|
48 | 23561 | main()
{
int i,j,m,n,d;
scanf("%d %d",&m,&n);
int a[11][11][6];
for(d=0;d<=n;d++)
{
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
a[i][j][d]=0;
}
}
}
a[5][5][0]=m;
for(d=1;d<=n;d++)
{
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
a[i][j][d]=2*a[i][j][d-1]+
a[i-1][j-1][d-1]+a[i-1][j][d-1]+
a[i-1][j+1][d-1]+a[i][j-1][d-1]+
a[i][j+1][d-1]+a[i+1][j-1][d-1]+
a[i+1][j][d-1]+a[i+1][j+1][d-1];
}
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<9;j++)
printf("%d ",a[i][j][n]);
printf("%d\n",a[i][9][n]);
}
getchar();
getchar();
} |
48 | 23562 | main()
{
int n,m,i,j,l,k;
int s[10][10];
int a[10][10];
scanf("%d %d",&n,&k);
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
{
a[i][j]=0;
s[i][j]=0;
}
s[5][5]=n;a[5][5]=n;
for (l=1;l<=k;l++)
{
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
if (s[i][j]>0)
{
a[i][j]+=s[i][j];
a[i-1][j-1]+=s[i][j];
a[i][j-1]+=s[i][j];
a[i-1][j]+=s[i][j];
a[i+1][j-1]+=s[i][j];
a[i-1][j+1]+=s[i][j];
a[i+1][j]+=s[i][j];
a[i][j+1]+=s[i][j];
a[i+1][j+1]+=s[i][j];
}
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
s[i][j]=a[i][j];
}
for (i=1;i<=9;i++)
{
for (j=1;j<=8;j++)
printf("%d ",a[i][j]);
printf("%d\n",a[i][9]);
}
}
|
48 | 23563 | //*******************************************
//** ???Dec 3, 2013 - ???????? **
//** ?????? 1300012719 **
//** ???2013.12.06 **
//*******************************************
int bacnum(int x, int y, int day, int bacteria[9][9]) //??????????????????,?????????=??????????*2+???????????
{
int temp = 0;
if (day == 0) //???0????????????,?????????
return bacteria[x][y];
temp = temp + 2 * bacnum(x,y,day-1,bacteria); //???????????????????+????(?????????)???????
if (x > 0 && y > 0)
temp = temp + bacnum(x-1,y-1,day-1,bacteria);
if (x > 0 && y < 8)
temp = temp + bacnum(x-1,y+1,day-1,bacteria);
if (x < 8 && y > 0)
temp = temp + bacnum(x+1,y-1,day-1,bacteria);
if (x < 8 && y < 8)
temp = temp + bacnum(x+1,y+1,day-1,bacteria);
if (x > 0)
temp = temp + bacnum(x-1,y,day-1,bacteria);
if (x < 8)
temp = temp + bacnum(x+1,y,day-1,bacteria);
if (y > 0)
temp = temp + bacnum(x,y-1,day-1,bacteria);
if (y < 8)
temp = temp + bacnum(x,y+1,day-1,bacteria);
return temp; //???????????
}
int main()
{
int bacteria[9][9], day, i, j; //bacteria????????????,day?????
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++)
bacteria[i][j] = 0;
cin >> bacteria[4][4] >> day; //???????,??????????????
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
cout << bacnum(i,j,day,bacteria); //???day?????????????
if (j < 8)
cout << " ";
else
cout << endl;
}
}
return 0;
}
|
48 | 23564 | int main()
{
int shu[9][9], qi[9][9], i, j, k, m, n;
cin >> m >> n;
memset(shu, 0, sizeof(shu));
shu[4][4] = m;
for( i = 1; i <= n; i++ )
{
memset(qi, 0, sizeof(qi));
for( j = 0; j < 9; j++ )
{
for( k = 0; k < 9; k++ )
{
if( shu[j][k] != 0)
{
qi[j][k + 1] = qi[j][k + 1] + shu[j][k];
qi[j][k - 1] = qi[j][k - 1] + shu[j][k];
qi[j - 1][k] = qi[j - 1][k] + shu[j][k];
qi[j + 1][k] = qi[j + 1][k] + shu[j][k];
qi[j + 1][k + 1] = qi[j + 1][k + 1] + shu[j][k];
qi[j + 1][k - 1] = qi[j + 1][k - 1] + shu[j][k];
qi[j - 1][k + 1] = qi[j - 1][k + 1] + shu[j][k];
qi[j - 1][k - 1] = qi[j - 1][k - 1] + shu[j][k];
shu[j][k] = shu[j][k] * 2;
}
}
}
for( j = 0; j < 9; j++ )
{
for( k = 0; k < 9; k++ )
{
shu[j][k] = shu[j][k] + qi[j][k];
}
}
}
for( i = 0; i < 9; i++ )
{
for( j = 0; j < 9; j++ )
{
if( j == 8)
cout << shu[i][j] << endl;
else
cout << shu[i][j] << " ";
}
}
return 0;
} |
48 | 23565 | int main ()
{
int a[10][11][11]={0};
int m,n,j=0,k=0,i=0;
cin>>m>>n;
a[0][5][5]=m;
for(j=1;j<n+1;j++)
for(k=1;k<10;k++)
for(i=1;i<10;i++)
{
a[j][k][i]=a[j-1][k-1][i-1]+a[j-1][k-1][i]+a[j-1][k-1][i+1]+a[j-1][k][i-1]+a[j-1][k][i+1]+a[j-1][k+1][i-1]+a[j-1][k+1][i]+a[j-1][k+1][i+1]+2*a[j-1][k][i];
}
for(j=1;j<10;j++)
for(k=1;k<10;k++)
{
if(k==9)
cout<<a[n][j][k]<<'\n';
else
cout<<a[n][j][k]<<' ';
}
return 0;
}
|
48 | 23566 | //********************************
//*?? ??????? *****
//*????? 1300012753 *****
//*???2013.11.19 *****
//********************************
void cal(int a[][9][9], int step)
{
for(int i = 4 - step; i <= 4 + step; i++)
{
for(int j = 4 - step; j <= 4 + step; j++)
{
a[step+1][i-1][j-1] += a[step][i][j];
a[step+1][i-1][j] += a[step][i][j];
a[step+1][i-1][j+1] += a[step][i][j];
a[step+1][i][j-1] += a[step][i][j];
a[step+1][i][j+1] += a[step][i][j];
a[step+1][i+1][j-1] += a[step][i][j];
a[step+1][i+1][j] += a[step][i][j];
a[step+1][i+1][j+1] += a[step][i][j];
a[step+1][i][j] += 2 * a[step][i][j];
}
}
}
int main()
{
int m, n;
cin >> m >> n;
int a[5][9][9];
memset(a,0,sizeof(a));
a[0][4][4] = 1;
for(int i = 0; i < n; i++)
cal(a,i);
for(int i = 0; i < 9; i++)
{
for(int j = 0; j < 9; j++)
{
if(j == 0)
cout << a[n][i][j] * m;
else
cout << ' ' << a[n][i][j] * m;
}
cout << endl;
}
return 0;
} |
48 | 23567 |
int main()
{
int num[11][11][11]={0};
int days,pi,pj,n,m,i,j,k,a,b;
scanf("%d%d",&m,&days);
num[5][5][1]=m;
for(n=2;n<=days+1;n++)
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
if(num[i][j][n-1]>0)
{b=num[i][j][n-1];
num[i][j][n]=num[i][j][n]+b;
for(pi=1;pi<=3;pi++)
for(pj=1;pj<=3;pj++)
num[i-2+pi][j-2+pj][n]=num[i-2+pi][j-2+pj][n]+b;
}
for(i=1;i<=9;i++)
{
for(j=1;j<=8;j++)
printf("%d ",num[i][j][days+1]);
printf("%d\n",num[i][9][days+1]);}
}
|
48 | 23568 | // * * * * * * * * * * * * * * *
// *??????????? *
// *?????? 1300013011 *
// *???2013.12.5 *
// * * * * * * * * * * * * * * *
int s (int a[9][9], int i, int j)
{
if ((i < 0) || (i >= 8) || (j < 0) || (j >= 8) || (a[i][j] == 0))
return 0;
else
return a[i][j] / 2;
}
void chart (int n, int a[9][9])
{
int i, j, k, h, w1, w2, l1, l2;
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;
}
}
else
{
int b[9][9] = {0};
for (k = 0; k < 9; k++)
for(h = 0; h < 9; h++)
{
if (a[k][h] != 0)
a[h][k] *= 2;
}
for (k = 0; k < 9; k++)
for(h = 0; h < 9; h++)
b[k][h] = s(a, k - 1, h - 1) + s(a, k, h - 1)
+ s(a, k - 1, h) + s(a, k - 1, h + 1)
+ s(a, k + 1, h) + s(a, k, h + 1)
+ s(a, k + 1, h - 1) + s(a, k + 1, h + 1);
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++)
a[i][j] += b[i][j];
chart (n - 1, a);
}
}
int main()
{
int m, n, a[9][9] = {0};
cin >> m >> n;
a[4][4] = m;
chart (n, a);
return 0;
} |
48 | 23569 | //??? ??? 1000010334
//????????????????????
//???????????
int main()
{
int end[11][11]; //???????
int start[11][11]; //????????
int b[5][11][11];
int m=0; //?????????
int n=0; //????
for(int i=0;i<11;i++)
{
for(int j=0;j<11;j++)
{
start[i][j]=0;
end[i][j]=0;
for(int k=0;k<5;k++)
{
b[k][i][j]=0;
}
}
}
cin>>m>>n;
start[5][5]=m;
b[0][5][5]=m;
for(int k=1;k<=n;k++)
{
for(int i=1;i<=9;i++)
{
for(int j=1;j<=9;j++)
{
for(int p=i-1;p<=i+1;p++)
{
for(int q=j-1;q<=j+1;q++)
{
if(p==i&&q==j)
{
b[k][p][q]=b[k][p][q]+b[k-1][p][q]*2;
}
else
{
b[k][i][j]=b[k][i][j]+b[k-1][p][q];
}
}
}
}
}
/*
for(int i=1;i<=9;i++)
{
for(int j=1;j<=9;j++)
{
if(j==1) cout<<b[k-1][i][j];
else cout<<" "<<b[k-1][i][j];
}
cout<<endl;
}
*/
}
for(int i=1;i<=9;i++)
{
for(int j=1;j<=9;j++)
{
end[i][j]=b[n][i][j];
}
}
for(int i=1;i<=9;i++)
{
for(int j=1;j<=9;j++)
{
if(j==1) cout<<end[i][j];
else cout<<" "<<end[i][j];
}
cout<<endl;
}
return 0;
}
|
48 | 23570 | /*
* ????main.cpp
* ??????
* ?????2013-01-11
* ???????9???????????????m?????????????????????10???????10??????????????????????????????????????????n(1?n?4)????????????????
*/
int main ()
{
int day,
d,i,j,k,di,dj,
a[9][9] = {0},aa[9][9],
direction[8][2] = {{1,0},{-1,0},{0,1},{0,-1},{-1,-1},{-1,1},{1,1},{1,-1}};
cin >> a[4][4] >> day;
for ( d = 0; d < day; d++ )
{
memset(aa,0,sizeof(aa));
for ( i = 0; i < 9; i++ )
for ( j = 0; j < 9; j++ )
{
if ( aa[i][j] == a[i][j] )
continue;
for ( k = 0; k < 8; k++ )
{
di = direction[k][0];
dj = direction[k][1];
if ( i + di < 9 && i + di >= 0 && j + dj < 9 && j + dj >= 0 )
{
a[i+di][j+dj] += (a[i][j] - aa[i][j]);
aa[i+di][j+dj] += (a[i][j] - aa[i][j]);
}
}
a[i][j] += (a[i][j] - aa[i][j]);
}
}
for ( i = 0; i < 9; i++ )
{
cout << a[i][0];
for ( j = 1; j < 9; j++ )
cout << ' ' << a[i][j];
cout << endl;
}
return 0;
} |
48 | 23571 | int b[9][9]; //????
int a[9][9]; //???
void f() //??
{
int i,j;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
if(a[i][j]!=0)
{
b[i][j]+=2*a[i][j];
b[i-1][j-1]+=a[i][j];
b[i-1][j]+=a[i][j];
b[i-1][j+1]+=a[i][j];
b[i][j-1]+=a[i][j];
b[i][j+1]+=a[i][j];
b[i+1][j-1]+=a[i][j];
b[i+1][j]+=a[i][j];
b[i+1][j+1]+=a[i][j];//??????
a[i][j]=0; //??????
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
a[i][j]+=b[i][j];
}
int main()
{
int m,n;
int i,j;
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
cin>>m>>n;
a[4][4]=m;
for(i=0;i<n;i++) //n???????
{
f();
memset(b,0,sizeof(b));
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
cout<<a[i][j]<<" ";
cout<<a[i][8]<<endl;
}
return 0;
}
|
48 | 23572 | int main()
{
int field[11][11];
int field1[11][11];
memset(field,0,sizeof(field));
memset(field1,0,sizeof(field1));
int n=0,m=0,i=0,j=0,k=0,count=1;
cin>>m>>n;
field1[5][5]=m;
while(count<=n)
{
for(i=1;i<10;i++)
for(j=1;j<10;j++)
field[i][j]=2*field1[i][j]+field1[i-1][j]+field1[i+1][j]+field1[i][j+1]+field1[i][j-1]+field1[i-1][j-1]+field1[i-1][j+1]+field1[i+1][j+1]+field1[i+1][j-1];
for(i=1;i<10;i++)
for(j=1;j<10;j++)
field1[i][j]=field[i][j];
count++;
}
for(i=1;i<10;i++)
{
cout<<field[i][1];
for(j=2;j<10;j++)
cout<<" "<<field[i][j];
cout<<endl;
}
return 0;
} |
48 | 23573 | int main()
{
int n,q,i,j,a[9][9],m,c[9][9],k,b[9][9];
cin>>n>>m;
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
a[i][j]=0;
c[i][j]=0;
}
}
a[4][4]=n;
for(k=1;k<=m;k++)
{
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{ b[i][j]=0;
if(a[i][j]!=0)
{
c[i][j]=1;
}
}
}
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
if(a[i][j]!=0&&c[i][j]==1)
{
b[i-1][j]=b[i-1][j]+a[i][j];
b[i+1][j]=b[i+1][j]+a[i][j];
b[i][j-1]=b[i][j-1]+a[i][j];
b[i][j+1]=b[i][j+1]+a[i][j];
b[i+1][j+1]=b[i+1][j+1]+a[i][j];
b[i-1][j-1]=b[i-1][j-1]+a[i][j];
b[i+1][j-1]=b[i+1][j-1]+a[i][j];
b[i-1][j+1]=b[i-1][j+1]+a[i][j];
b[i][j]=b[i][j]+2*a[i][j];
a[i][j]=0;
c[i][j]=0;
}
}
}
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
a[i][j]=a[i][j]+b[i][j];
}
}
}
for(i=0;i<=8;i++)
{
for(j=0;j<=7;j++)
{
cout<<a[i][j]<<" ";
}
cout<<a[i][8];
cout<<endl;
}
cin>>q;
return 0;
}
|
48 | 23574 | main()
{
int p[9][9];
int q[9][9];
int m,n,i,j,k;
scanf("%d %d",&m,&n);
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
p[i][j]=0;
q[i][j]=0;
}
p[4][4]=m;
for(k=0;k<n;k++)
{
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
if(p[i][j]!=0)
{
q[i][j]+=2*p[i][j];
q[i-1][j-1]+=p[i][j];
q[i-1][j]+=p[i][j];
q[i-1][j+1]+=p[i][j];
q[i][j-1]+=p[i][j];
q[i][j+1]+=p[i][j];
q[i+1][j-1]+=p[i][j];
q[i+1][j]+=p[i][j];
q[i+1][j+1]+=p[i][j];
}
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
p[i][j]=q[i][j];
q[i][j]=0;
}
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
if((j+1)%9!=0)printf("%d ",p[i][j]);
else printf("%d\n",p[i][j]);
}
} |
48 | 23575 | int a[9][9]={0},b[9][9];
void fanzhi(int i,int j)
{
int x,y;
for(x=i-1;x<=i+1;x++)
{
for(y=j-1;y<=j+1;y++)
{
b[x][y]=b[x][y]+a[i][j];
}
}
b[i][j]=b[i][j]+a[i][j];
}
main()
{
int m,n,k,i,j;
scanf("%d %d",&m,&n);
a[4][4]=m;
for(k=1;k<=n;k++) //???k?????
{
memset(b,0,sizeof(b));
for(i=4-k+1;i<=4+k-1;i++)
{
for(j=4-k+1;j<=4+k-1;j++)
{
fanzhi(i,j);
}
}
for(i=4-k;i<=4+k;i++)
{
for(j=4-k;j<=4+k;j++)
{
a[i][j]=b[i][j];
}
}
}
for(i=0;i<=8;i++)
{
for(j=0;j<=7;j++)
{
printf("%d ",a[i][j]);
}
printf("%d\n",a[i][8]);
}
} |
48 | 23576 | //****************************
//**Title:???????? **
//**Author:?? 1300012732 **//Std: '56 280 728 1232 1456 1232 728 280 56'
// Out: '56 204 494 760 904 760 494 204 56'
// Input of in case 0:
// 14 4
//**Date?2013.11.4 **
//**File?2.cpp **
//****************************
int dish[11][11];
int die[11][11];
int increase[11][11];
void breed (int day, int count)
{
int i, j;
if (count > day)
{
for (i = 1; i < 10; i++)
{
for (j = 1; j < 9; j++)
cout << dish[i][j] << ' ';
cout << dish[i][9] << endl;
}
return;
}
else
{
for (i = 1; i < 10; i++)
for (j = 1; j < 10; j++)
{
if (dish[i][j] != 0)
{
increase[i][j] += 2 * dish[i][j];
increase[i][j + 1] += dish[i][j];
increase[i][j - 1] += dish[i][j];
increase[i - 1][j] += dish[i][j];
increase[i + 1][j] += dish[i][j];
increase[i + 1][j - 1] += dish[i][j];
increase[i + 1][j + 1] += dish[i][j];
increase[i - 1][j - 1] += dish[i][j];
increase[i - 1][j + 1] += dish[i][j];
}
}
for (i = 1; i < 10; i++)
for (j = 1; j < 10; j++)
{
dish[i][j] += increase[i][j];
dish[i][j] -= die[i][j];
}
for (i = 1; i < 10; i++)
for (j = 1; j < 10; j++)
{
die[i][j] = increase[i][j];
increase[i][j] = 0;
}
breed (day, count + 1);
}
}
int main()
{
int num, day, i, j;
cin >> num >> day;
for (i = 0 ; i < 11; i++)
for (j = 0; j < 11; j++)
dish[i][j] = die[i][j] = 0;
dish[5][5] = die[5][5] = num;
breed (day, 1);
return 0;
}
|
48 | 23577 | 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];
if(i==0||i==8||i==72||i==80)//???????????????3???????
{
if(i==0)
{
p[k+1][0]+=2*add;
p[k+1][1]+=add;
p[k+1][9]+=add;
p[k+1][10]+=add;
}
if(i==8)
{
p[k+1][8]+=2*add;
p[k+1][7]+=add;
p[k+1][16]+=add;
p[k+1][17]+=add;
}
if(i==72)
{
p[k+1][72]+=2*add;
p[k+1][63]+=add;
p[k+1][64]+=add;
p[k+1][73]+=add;
}
if(i==80)
{
p[k+1][80]+=2*add;
p[k+1][70]+=add;
p[k+1][71]+=add;
p[k+1][79]+=add;
}
}
if(i%9==0&&i!=0&&i!=72)
{
p[k+1][i]+=2*add;
p[k+1][i-9]+=add;
p[k+1][i-8]+=add;
p[k+1][i+1]+=add;
p[k+1][i+9]+=add;
p[k+1][i+10]+=add;
}
else if((i+1)%9==0)
{
p[k+1][i]+=2*add;
p[k+1][i-9]+=add;
p[k+1][i-10]+=add;
p[k+1][i-1]+=add;
p[k+1][i+8]+=add;
p[k+1][i+9]+=add;
}
else if(i>0&&i<8)
{
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;
}
else if(i>72&&i<80)
{
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;
}
else
{
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 | 23578 |
int main()
{
int stat[2][11][11];
int m, n;
int i, j, k;
int tmp1, tmp2;
scanf("%d %d", &m, &n);
for (i = 0; i < 2; i++) {
for (j = 0; j < 11; j++) {
for (k = 0; k < 11; k++) {
stat[i][j][k] = 0;
}
}
}
stat[0][5][5] = 1;
for (i = 0; i < n; i++) {
tmp1 = i % 2;
tmp2 = (i + 1) % 2;
for (j = 1; j <= 9; j++) {
for (k = 1; k <= 9; k++) {
stat[tmp2][j][k] = stat[tmp1][j - 1][k - 1] + stat[tmp1][j - 1][k]
+ stat[tmp1][j - 1][k + 1] + stat[tmp1][j][k - 1]
+ stat[tmp1][j][k] * 2 + stat[tmp1][j][k + 1]
+ stat[tmp1][j + 1][k - 1] + stat[tmp1][j + 1][k]
+ stat[tmp1][j + 1][k + 1];
}
}
}
i = n % 2;
for (j = 1; j <= 9; j++) {
for (k = 1; k <= 9; k++) {
printf("%d", m * stat[i][j][k]);
if(k!=9)
printf(" ");
}
printf("\n");
}
return 0;
} |
48 | 23579 | void zengjia();
int num[9][9] = {0};
int main()
{
int m, n, i, j;
cin >> m >> n;
num[4][4] = m;
for (i = 0; i < n; i++)
zengjia();
for (i = 0; i < 9; i++)
{
cout << num[i][0];
for (j = 1; j < 9; j++)
cout << " " << num[i][j];
cout << endl;
}
return 0;
}
void zengjia()
{
int num2[9][9] = {0};
int i, j;
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++)
{
if (num[i][j] > 0)
{
if (i > 0)
num2[i - 1][j] = num[i][j] + num2[i - 1][j];
if (i < 8)
num2[i + 1][j] = num[i][j] + num2[i+ 1][j];
if (j > 0)
num2[i][j - 1] = num[i][j] + num2[i][j - 1];
if (j < 8)
num2[i][j + 1] = num[i][j] + num2[i][j + 1];
if (i > 0 && j > 0)
num2[i - 1][j - 1] = num[i][j] + num2[i - 1][j - 1];
if (i < 8 && j > 0)
num2[i + 1][j - 1] = num[i][j] + num2[i + 1][j - 1];
if (i > 0 && j < 8)
num2[i - 1][j + 1] = num[i][j] + num2[i - 1][j + 1];
if (i < 8 && j < 8)
num2[i + 1][j + 1] = num[i][j] + num2[i + 1][j + 1];
num2[i][j] = num[i][j] * 2 + num2[i][j];
}
}
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++)
num[i][j] = num2[i][j];
return;
} |
48 | 23580 | int c[11][11]={0}; //???n?????
int temp[11][11]={0}; //????n-1?????
int n,m;
int deal(int num);
int main()
{
int i,j;
cin>>m>>n;
c[5][5]=m;
temp[5][5]=m;
deal(1);
for (i=1;i<=9;i++)
{
for (j=1;j<=8;j++)
cout<<c[i][j]<<' ';
cout<<c[i][9];
cout<<endl;
}
return 0;
}
int deal(int num)
{
int i,j;
if (num==n+1) //??????
return 0;
else
{
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
{
c[i][j]+=temp[i][j];
c[i+1][j]+=temp[i][j];
c[i-1][j]+=temp[i][j];
c[i][j+1]+=temp[i][j];
c[i][j-1]+=temp[i][j];
c[i+1][j+1]+=temp[i][j];
c[i+1][j-1]+=temp[i][j];
c[i-1][j+1]+=temp[i][j];
c[i-1][j-1]+=temp[i][j];
}
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
temp[i][j]=c[i][j];
deal(num+1);
}
} |
48 | 23581 | int m,n,i,j;//m???????????,n???????
int a[10][10]={0};
int pat(int a[][10],int n)
{
int b[10][10],x,y;
if(n==0)
{
for(i=1;i<=9;i++)
{
for(j=1;j<=8;j++)
cout<<a[i][j]<<" ";
cout<<a[i][9]<<endl;
}
return 0;
}
else
{
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
b[i][j]=a[i][j]*2+a[i-1][j-1]+a[i-1][j]+a[i-1][j+1]+a[i][j-1]+a[i][j+1]+a[i+1][j-1]+a[i+1][j]+a[i+1][j+1];
for(x=1;x<=9;x++)
for(y=1;y<=9;y++)
a[x][y]=b[x][y];
return pat(a,n-1);
}
}
int main()
{
cin>>m>>n;
a[5][5]=m;
pat(a,n);
return 0;
}
|
48 | 23582 |
int main()
{
int m,n; //?? ???????? ??
int i,j,k,p,q; //????
int b[9][9][5]={0}; //?? ????0 b???? b[i][j][k]???i??j??k?
scanf("%d %d", &m, &n);
b[4][4][0]=m;
//printf("%d", b[8][8][3]);
for(i=1;i<=n;i++) //??????
{
for(j=1;j<8;j++)
{
for(k=1;k<8;k++)
{
while(b[j][k][i-1]!=0)
{
//printf("xunhuan");
b[j][k+1][i]+=b[j][k][i-1];
b[j][k-1][i]+=b[j][k][i-1];
b[j-1][k-1][i]+=b[j][k][i-1];
b[j-1][k][i]+=b[j][k][i-1];
b[j-1][k+1][i]+=b[j][k][i-1];
b[j+1][k-1][i]+=b[j][k][i-1];
b[j+1][k][i]+=b[j][k][i-1];
b[j+1][k+1][i]+=b[j][k][i-1];
b[j][k][i]+=2*b[j][k][i-1];
break;
}
}
}
}
for(p=0;p<=8;p++)
{
for(q=0;q<8;q++)
printf("%d ", b[p][q][n]);
printf("%d\n", b[p][8][n]);
}
return 0;
} |
48 | 23583 | int main()
{
int m,n,i,j,k;
cin>>m>>n;
int a[11][11][2];
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
a[i][j][0]=0;
}
}
a[5][5][0]=m;
for(k=1;k<=n;k++)
{
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
a[i][j][1]=a[i][j][0]*2+a[i][j-1][0]+a[i][j+1][0]+a[i+1][j][0]+a[i-1][j][0]+a[i+1][j+1][0]+a[i-1][j-1][0]+a[i+1][j-1][0]+a[i-1][j+1][0];
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
a[i][j][0]=a[i][j][1];
}
}
}
for(i=1;i<=9;i++)
{
cout<<a[i][1][1];
for(j=2;j<=9;j++)
{
cout<<' '<<a[i][j][1];
}
cout<<endl;
}
return 0;
}
|
48 | 23584 | int a[9][9]={0};
int b[9][9]={0};
void ganster()
{
int i,j,c;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
b[i][j]=0;
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(a[i][j]!=0)
{c=a[i][j];
b[i][j]+=c;b[i][j-1]+=c;b[i][j+1]+=c;
b[i+1][j]+=c;b[i+1][j-1]+=c;b[i+1][j+1]+=c;
b[i-1][j]+=c;b[i-1][j-1]+=c;b[i-1][j+1]+=c;}
}
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
a[i][j]+=b[i][j];
}
int main(void)
{
int m,n,i,j;
scanf("%d%d",&m,&n);
a[4][4]=m;
for(i=0;i<n;i++)
{
ganster();
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
printf("%d ",a[i][j]);
}
printf("%d\n",a[i][j]);
}
}
|
48 | 23585 | int main()
{
int m,n,row,col,i;
int sz[11][11],by[11][11];
scanf("%d %d",&m,&n);
for(row=1;row<=9;row++){
for(col=1;col<=9;col++){
sz[row][col]=0;
by[row][col]=0;
}
}
sz[5][5]=m;
by[5][5]=m;
for(i=1;i<=n;i++){
for(row=1;row<=9;row++){
for(col=1;col<=9;col++){
if(sz[row][col]!=0){
by[row][col]=sz[row][col]+by[row][col];
by[row-1][col]+=sz[row][col];
by[row-1][col-1]+=sz[row][col];
by[row-1][col+1]+=sz[row][col];
by[row][col-1]+=sz[row][col];
by[row][col+1]+=sz[row][col];
by[row+1][col]+=sz[row][col];
by[row+1][col-1]+=sz[row][col];
by[row+1][col+1]+=sz[row][col];
}
}
}
for(row=1;row<=9;row++){
for(col=1;col<=9;col++){
sz[row][col]=by[row][col];
}
}
}
for(row=1;row<=9;row++){
for(col=1;col<=9;col++){
if(col!=9) printf("%d ",sz[row][col]);
else printf("%d\n",sz[row][col]);
}
}
return 0;
} |
48 | 23586 | int m,n;
int num(int a,int b,int c)
{
int i,j;
if((a==0)||(a==10)||(b==0)||(b==10))
return 0;
else if(c==0)
{
if (a==5&&b==5)
return m;
else return 0;
}
else
{
int d=num(a,b,c-1);
for(i=a-1;i<=a+1;i++)
{
for(j=b-1;j<=b+1;j++)
d=d+num(i,j,c-1);
}
return d;
}
}
int main()
{
int i,j,s;
scanf("%d %d",&m,&n);
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
s=num(i,j,n);
if(j==9)
printf("%d\n",s);
else printf("%d ",s);
}
}
return 0;
}
|
48 | 23587 |
int a[9][9] = {0}, b[9][9] = {0}; //a????????b????????
void propagate( int m, int n )
{
int k = 0;
int num; //??????
a[4][4] = m;
while ( k < n )
{
for ( int i = 0; i < 9; i++ )
{
for ( int j = 0; j < 9; j++ )
{
b[i][j] = 0; //?????
}
}
for (int i = 0; i < 9; i++ )
{
for ( int j = 0; j < 9; j++ )
{
if ( a[i][j] != 0 )
{
num = a[i][j];
a[i][j] = 2 * num;
b[i-1][j-1] += num;
b[i-1][j] += num;
b[i-1][j+1] += num;
b[i+1][j] += num;
b[i+1][j+1] += num;
b[i+1][j-1] += num;
b[i][j+1] += num;
b[i][j-1] += num;
}
}
}
for ( int i = 0; i < 9; i++ )
{
for ( int j = 0; j < 9; j++ )
{
a[i][j] += b[i][j];
}
}
k++;
}
for ( int x = 0; x < 9; x++ )
{
for ( int y = 0; y < 9; y++ )
{
if ( y == 0 )
cout << a[x][y];
else if ( y == 8 )
cout << " " << a[x][y] << endl;
else
cout << " " << a[x][y];
}
}
}
int main()
{
int m, n;
cin >> m >> n;
propagate( m, n );
return 0;
} |
48 | 23588 | int a[9][9]={0},m,n;
void produce(int i,int j,int n)
{
if(n == 0)
{
return;
}
else
{
a[i - 1][j - 1] += m;
a[i - 1][j] += m;
a[i - 1][j + 1] += m;
a[i][j - 1] +=m;
a[i][j] += m;
a[i][j + 1] += m;
a[i + 1][j - 1] += m;
a[i + 1][j] += m;
a[i + 1][j + 1] += m;
produce(i,j,n-1);
produce(i,j,n-1);
produce(i-1,j-1,n-1);
produce(i-1,j,n-1);
produce(i-1,j+1,n-1);
produce(i,j-1,n-1);
produce(i,j+1,n-1);
produce(i+1,j-1,n-1);
produce(i+1,j,n-1);
produce(i+1,j+1,n-1);
}
}
int main()
{
cin>>m>>n;
a[4][4]=m;
produce(4,4,n);
int row=0,col=0;
for(row=0;row<=8;row++)
{
for(col=0;col<=8;col++)
{
if(col != 8)
{
cout<<a[row][col]<<" ";
}
else
{
cout<<a[row][col]<<endl;
}
}
}
return 0;
} |
48 | 23589 | main()
{
int a[9][9],b[9][9],i,j,k,m,n,fx,fy;
scanf("%d %d",&m,&n);
memset(a,0,sizeof(a));
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(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++)
{
for(j=0;j<8;j++)
printf("%d ",a[i][j]);
printf("%d\n",a[i][8]);
}
} |
48 | 23590 | int a[11][11];
void day()
{
int i,j,b[11][11];
for(i=0;i<11;i++)for(j=0;j<11;j++)b[i][j]=a[i][j];
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{
b[i+1][j]+=a[i][j];b[i-1][j]+=a[i][j];b[i][j+1]+=a[i][j];b[i][j-1]+=a[i][j];
b[i+1][j+1]+=a[i][j];b[i+1][j-1]+=a[i][j];b[i-1][j+1]+=a[i][j];b[i-1][j-1]+=a[i][j];
b[i][j]+=a[i][j];
}
for(i=0;i<11;i++)for(j=0;j<11;j++)a[i][j]=b[i][j];
}
int main()
{
int i,j,n,days;
for(i=0;i<11;i++)for(j=0;j<11;j++)a[i][j]=0;
cin>>n;cin>>days;
a[5][5]=n;
for(i=1;i<=days;i++)day();
for(i=1;i<10;i++)
{
cout<<a[i][1];for(j=2;j<10;j++)cout<<' '<<a[i][j];cout<<endl;
}
getchar();getchar();
return 0;
}
|
48 | 23591 | int main()
{
int i, j, m, day, a[9][9] = {0};
cin >> m >> day;
a[4][4] = m;
while(day--)
{
int b[9][9] = {0};
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
if(a[i][j] > 0)
{
b[i - 1][j - 1] += a[i][j];
b[i - 1][j] += a[i][j];
b[i - 1][j + 1] += a[i][j];
b[i][j - 1] += a[i][j];
b[i][j + 1] += a[i][j];
b[i + 1][j - 1] += a[i][j];
b[i + 1][j] += a[i][j];
b[i + 1][j + 1] += a[i][j];
}
}
}
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
a[i][j] = 2 * a[i][j] + b[i][j];
}
}
}
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
if(j == 0)
{
cout << a[i][j];
}
else if(j == 8)
{
cout << " " << a[i][j] << endl;
}
else if(j > 0 && j < 8)
{
cout << " " << a[i][j];
}
}
}
return 0;
} |
48 | 23592 |
int main()
{
int a[5][11][11]={0};
int m,n,i,j,k;
cin>>m>>n;
a[0][5][5]=m;
for(i=0;i<n;i++)
for(j=1;j<=9;j++)
for(k=1;k<=9;k++)
{
a[i+1][j][k]=2*a[i][j][k]+a[i][j-1][k-1]+a[i][j-1][k+1]+a[i][j+1][k]+a[i][j-1][k]+a[i][j][k+1]+a[i][j][k-1]+a[i][j+1][k+1]+a[i][j+1][k-1];
}
for(j=1;j<=9;j++)
{cout<<a[n][j][1];
for(k=2;k<=9;k++)
cout<<' '<<a[n][j][k];
cout<<endl;
}
return 0;
}
|
48 | 23593 | int main()
{
int n[5][9][9],a,b,k=0,i,j;
cin>>a>>b;
memset(n,0,sizeof(n));
n[0][4][4]=a;
for(i=1;i<=b;i++)
{
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
{
n[i][j][k]=n[i-1][j][k]*2;
if(j>0)
{
n[i][j][k]+=n[i-1][j-1][k];
if(k>0)
{
n[i][j][k]+=n[i-1][j-1][k-1];
}
if(k<8)
{
n[i][j][k]+=n[i-1][j-1][k+1];
}
}
if(k>0)
{
n[i][j][k]+=n[i-1][j][k-1];
}
if(k<8)
{
n[i][j][k]+=n[i-1][j][k+1];
}
if(j<8)
{
n[i][j][k]+=n[i-1][j+1][k];
if(k>0)
{
n[i][j][k]+=n[i-1][j+1][k-1];
}
if(k<8)
{
n[i][j][k]+=n[i-1][j+1][k+1];
}
}
}
}
}
for(i=0;i<9;i++)
{
cout<<n[b][i][0];
for(j=1;j<9;j++)
{
cout<<' '<<n[b][i][j];
}
cout<<endl;
}
return 0;
}
|
48 | 23594 |
void xijun(int a[5][11][11],int x,int n)
{
int i,j,k;
for(i=1;i<=n;i++)
{
for(j=1;j<10;j++)
{
for(k=1;k<10;k++)
{
a[i][j][k]=2*(a[i-1][j][k])+a[i-1][j-1][k-1]+a[i-1][j-1][k]+a[i-1][j-1][k+1]+a[i-1][j][k-1]+a[i-1][j][k+1]+a[i-1][j+1][k-1]+a[i-1][j+1][k]+a[i-1][j+1][k+1];
}
}
}
}
void main()
{
int m,n;
scanf("%d%d",&m,&n);
int a[5][11][11]={0};
a[0][5][5]=m;
xijun (a,m,n);
int i,j;
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if(j==9)
{
printf("%d\n",a[n][i][j]);
continue;
}
printf("%d ",a[n][i][j]);
}
}
} |
48 | 23595 |
int main()
{
int num[10][10]; //?? 1 ? 9
int next[10][10];
int m,n;
int i,j,k;
for(i=0;i<10;i++)
for(j=0;j<10;j++)
{num[i][j]=0;
next[i][j]=0;}
cin>>m; //??num?5??5?????m?
cin>>n; //n?
num[5][5]=m;
for(i=0;i<n;i++)
{
for(j=1;j<9;j++)
for(k=1;k<9;k++)
if(num[j][k]!=0)
{
next[j][k]+=num[j][k]*2;
next[j-1][k]+=num[j][k];
next[j+1][k]+=num[j][k];
next[j][k-1]+=num[j][k];
next[j][k+1]+=num[j][k];
next[j-1][k-1]+=num[j][k];
next[j-1][k+1]+=num[j][k];
next[j+1][k+1]+=num[j][k];
next[j+1][k-1]+=num[j][k];
}
for(j=0;j<10;j++)
for(k=0;k<10;k++)
{num[j][k]=next[j][k];
next[j][k]=0;}
}
for(i=1;i<10;i++)
{
for(j=1;j<9;j++)
cout<<num[i][j]<<" ";
cout<<num[i][j]<<endl;}
return 0;
}
|
48 | 23596 | int a[20][20],b[20][20];
void print()
{
int i,j;
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
if (j<9) printf("%d ",a[i][j]);
else printf("%d\n",a[i][j]);
}
main()
{ int m,n,i,j,d;
scanf("%d %d",&m,&n);
for (i=0;i<=10;i++)
for (j=0;j<=10;j++)
a[i][j]=0;
a[5][5]=m;
for (d=1;d<=n;d++)
{
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
b[i][j]=0;
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
if (a[i][j]>0)
{
b[i][j]=b[i][j]+a[i][j]*2;
b[i-1][j-1]=b[i-1][j-1]+a[i][j];
b[i-1][j]=b[i-1][j]+a[i][j];
b[i-1][j+1]=b[i-1][j+1]+a[i][j];
b[i][j-1]=b[i][j-1]+a[i][j];
b[i][j+1]=b[i][j+1]+a[i][j];
b[i+1][j-1]=b[i+1][j-1]+a[i][j];
b[i+1][j]=b[i+1][j]+a[i][j];
b[i+1][j+1]=b[i+1][j+1]+a[i][j];
}
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
a[i][j]=b[i][j];
if (d==n)
print();
}
}
|
48 | 23597 | int main(){
int sz[11][11][5]={0},n,i,k,d;
scanf("%d",&sz[5][5][0]);
scanf("%d",&n);
for(d=0;d<n;d++){
for(i=1;i<10;i++){
for(k=1;k<10;k++){
sz[i][k][d+1]=2*sz[i][k][d];
sz[i][k][d+1]+=sz[i-1][k][d]+sz[i][k-1][d]+sz[i+1][k][d]+sz[i][k+1][d]+sz[i+1][k+1][d]+sz[i-1][k-1][d]+sz[i+1][k-1][d]+sz[i-1][k+1][d];
}
}
}
for(i=1;i<10;i++){
for(k=1;k<9;k++){
printf("%d ",sz[i][k][n]);
}
printf("%d\n",sz[i][9][n]);
}
return 0;
} |
48 | 23598 | int main()
{
int a[9][9]={{0}},b[9][9]={{0}};
int days,i,j,k,l,m;
cin>>a[4][4]>>days;
for(i=0;i<days;i++)
{for(l=0;l<9;l++)
for(m=0;m<9;m++)
b[l][m]=0;
for(j=1;j<8;j++)
for(k=1;k<8;k++)
{
if(a[j][k]==0)continue;
else
{
b[j][k]+=2*a[j][k];
b[j-1][k-1]+=a[j][k];
b[j+1][k+1]+=a[j][k];
b[j-1][k+1]+=a[j][k];
b[j+1][k-1]+=a[j][k];
b[j][k+1]+=a[j][k];
b[j-1][k]+=a[j][k];
b[j+1][k]+=a[j][k];
b[j][k-1]+=a[j][k];
a[j][k]=0;
}
}
for(j=0;j<9;j++)
for(k=0;k<9;k++)
a[j][k]=b[j][k];
}
for(j=0;j<9;j++)
{
cout<<a[j][0];
for(k=1;k<9;k++)
{cout<<" "<<a[j][k];}
cout<<endl;
}
cin>>days;
return 0;
}
|
48 | 23599 | //
// main.c
// aa
//
// Created by Duan on 12-11-27.
// Copyright (c) 2012? __MyCompanyName__. All rights reserved.
//
void nextday(int a[11][11],int b[11][11])
{
int i,j;
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
b[i][j]=0;
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
{
b[i][j]+=a[i][j]*2;
b[i+1][j]+=a[i][j];
b[i-1][j]+=a[i][j];
b[i+1][j+1]+=a[i][j];
b[i+1][j-1]+=a[i][j];
b[i-1][j+1]+=a[i][j];
b[i-1][j-1]+=a[i][j];
b[i][j+1]+=a[i][j];
b[i][j-1]+=a[i][j];
}
}
void printarray(int a[11][11])
{
int i,j;
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
{
printf("%d",a[i][j]);
if (j!=9) printf(" ");
else printf("\n");
}
}
int main()
{
int m,n,i;
scanf("%d %d",&m,&n);
int a[11][11]={0},b[11][11]={0};
a[5][5]=m;
for (i=0;i<=n;i++)
{
if (i%2==0) nextday(a, b);
else nextday(b, a);
}
if(i%2==0) printarray(b);
else printarray(a);
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.