id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
23,800 | int main()
{
int xijun[11][11]={0};
for (int i=0;i<11;i++)
{
for (int j=0;j<11;j++)
{
xijun[i][j]=0;
}
}
int result[11][11]={0};
int m=0;
int n=0;
cin>>m>>n;
xijun[5][5]=m;
result[5][5]=m;
for (int x=0;x<n;x++)
{
for (int i=0;i<11;i++)
{
for (int j=0;j<11;j++)
{
xijun[i][j]=result[i][j];
}
}
for (int i=1;i<10;i++)
{
for (int j=1;j<10;j++)
{
result[i][j]=2*xijun[i][j]+xijun[i][j+1]+xijun[i][j-1]+xijun[i+1][j]+xijun[i-1][j]+xijun[i+1][j+1]+xijun[i+1][j-1]+xijun[i-1][j+1]+xijun[i-1][j-1];
}
}
}
for (int i=1;i<10;i++)
{
for (int j=1;j<10;j++)
{
if (j==1) cout<<result[i][j];
else if (j==9) cout<<" "<<result[i][j]<<endl;
else cout<<" "<<result[i][j];
}
}
/*int i=0;
int j=0;
for(i=1;i<10;i++)
{
bool p=0;
for(j=1;j<10;j++)
{
if(p) cout<<" ";
p=1;
cout<<result[i][j];
}
cout<<endl;
}
*/return 0;
}
| 48 |
23,801 | 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 |
23,802 | 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 |
23,803 |
int main()
{
int a[100][11][11]={0};
int n,t;
int i,j,k;
for(i=0;i<100;i++)
for(j=0;j<=10;j++)
for(k=0;k<=10;k++)
a[i][j][k]=0;
cin>>n>>t;
for(i=0;i<t;i++)
{
a[0][5][5]=n;
for(j=1;j<=9;j++)
for(k=1;k<=9;k++)
{
a[i+1][j][k]=2*a[i][j][k]+a[i][j-1][k]+a[i][j+1][k]+a[i][j][k-1]+a[i][j][k+1]+a[i][j-1][k-1]+a[i][j+1][k+1]+a[i][j-1][k+1]+a[i][j+1][k-1];
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
if(j==1)
cout<<a[t][i][j];
else if(j>0&&j<9)
cout<<' '<<a[t][i][j];
else if(j==9)
cout<<' '<<a[t][i][j]<<endl;
}
}
return 0;
}
| 48 |
23,804 | int num[9][9],im[9][9];
main()
{
int i,j,k,m,n;
scanf("%d%d",&m,&n);
num[4][4]=m;
for(i=0;i<n;i++)
{
for(j=0;j<9;j++)
for(k=0;k<9;k++)
im[j][k]=0;
for(j=1;j<8;j++)
{
for(k=1;k<8;k++)
{
im[j-1][k]+=num[j][k];
im[j][k]+=2*num[j][k];
im[j][k-1]+=num[j][k];
im[j+1][k]+=num[j][k];
im[j][k+1]+=num[j][k];
im[j-1][k-1]+=num[j][k];
im[j-1][k+1]+=num[j][k];
im[j+1][k-1]+=num[j][k];
im[j+1][k+1]+=num[j][k];
}
}
for(j=0;j<9;j++)
for(k=0;k<9;k++)
num[j][k]=im[j][k];
}
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
{
printf("%d%c",num[j][k],k==8?'\n':' ');
}
}
}
| 48 |
23,805 | 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 |
23,806 | 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 |
23,807 | int main()
{
int i,j,m,n,a[9][9]={0},b[9][9]={0};
cin>>m>>n;
a[4][4]=m;
while(n--)
{
for(i=0;i<9;i++)
for(j=0;j<9;j++)
if(a[i][j]!=0)
{
b[i][j]+=2*a[i][j];
b[i-1][j]+=a[i][j];
b[i+1][j]+=a[i][j];
b[i][j-1]+=a[i][j];
b[i][j+1]+=a[i][j];
b[i-1][j-1]+=a[i][j];
b[i-1][j+1]+=a[i][j];
b[i+1][j-1]+=a[i][j];
b[i+1][j+1]+=a[i][j];
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
a[i][j]=b[i][j];
memset(b,0,sizeof(b));
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
cout<<a[i][j]<<' ';
cout<<a[i][8]<<endl;
}
return 0;
}
| 48 |
23,808 | 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 |
23,809 |
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 |
23,810 | 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 |
23,811 | int main()
{
int a[11][11],b[11][11];//??????????????????????????????
int n,m,i,k,j,l,x;
cin>>m>>n;
for(i=0;i<11;i++)//???
for(j=0;j<11;j++)
{
a[i][j]=0;
b[i][j]=0;
}
b[5][5]=m;
for(x=1;x<=n;x++)//??n????????????
{
for(i=0;i<11;i++)
for(j=0;j<11;j++)
{
a[i][j]=0;
}
for(i=1;i<10;i++)
for(j=1;j<10;j++)
{
a[i][j]=2*b[i][j]+b[i-1][j-1]+b[i-1][j]+b[i-1][j+1]+b[i][j-1]+b[i][j+1]+b[i+1][j-1]+b[i+1][j]+b[i+1][j+1];
}
for(i=0;i<10;i++)
for(j=1;j<10;j++)
{
b[i][j]=a[i][j];
}
}
for(i=1;i<10;i++)
{
for(j=1;j<9;j++)
{
cout<<a[i][j];
cout<<" ";
}
cout<<a[i][9]<<endl;
}
return 0;
} | 48 |
23,812 | int main()
{
int m,n,s[A][A]={0},t[A][A]={0},i,a,b;
scanf ("%d%d",&m,&n);
s[4][4]=m;
t[4][4]=m;
for (i=0;i<n;i++)
{
for (a=0;a<9;a++)
{
for (b=0;b<9;b++)
{
if (s[a][b]!=0)
{
t[a-1][b]+=s[a][b];
t[a][b-1]+=s[a][b];
t[a+1][b]+=s[a][b];
t[a][b+1]+=s[a][b];
t[a+1][b-1]+=s[a][b];
t[a+1][b+1]+=s[a][b];
t[a-1][b+1]+=s[a][b];
t[a-1][b-1]+=s[a][b];
t[a][b]+=s[a][b];
}
}
}
for (a=0;a<9;a++)
{
for (b=0;b<9;b++)
{
s[a][b]=t[a][b];
}
}
}
for (a=0;a<9;a++)
{
for (b=0;b<8;b++)
{
printf ("%d ",s[a][b]);
}
printf("%d\n",s[a][8]);
}
return 0;
} | 48 |
23,813 | int main()
{
int m,n,a[11][11][6]={0},i,j,k;
cin>>m>>n;
a[5][5][1]=m;
for(i=1;i<=n;i++)
{
for(j=1;j<10;j++)
{
for(k=1;k<10;k++)
{
a[j][k][i+1]=2*a[j][k][i]+a[j-1][k-1][i]+a[j-1][k][i]+a[j-1][k+1][i]+a[j][k-1][i]+a[j][k+1][i]+a[j+1][k-1][i]+a[j+1][k][i]+a[j+1][k+1][i];
}
}
}
for(j=1;j<10;j++)
{
for(k=1;k<9;k++)
{
cout<<a[j][k][n+1]<<" ";
}
cout<<a[j][9][n+1]<<endl;
}
return 0;
} | 48 |
23,814 | int a[10][10] = {0};
int b[10][10] = {0};
int i , j;
void f(int day);
int main()
{
int m , n ;
cin >> m >> n;
a[5][5] = m;
f(n);
for( i = 1 ; i <= 9 ; i++)
for(j = 1 ; j <= 9 ; j++)
{
if(j == 9)
printf("%d\n",a[i][j]);
else
printf("%d ",a[i][j]);
}
return 0;
}
void f(int day)
{
int k,l;
for(i = 1 ; i <= 9 ; i ++)
for(j = 1 ; j <= 9 ; j++)
b[i][j] = a[i][j];
if(day > 0)
{
for(i = 1 ; i <= 9 ; i ++)
for(j = 1 ; j <= 9 ; j++)
if(a[i][j] != 0)
{
for(k = i - 1; k <= i + 1; k ++)
for(l = j - 1; l <= j + 1; l++)
a[k][l] = a[k][l] + b[i][j];
}
f(day - 1);
}
}
| 48 |
23,815 |
void fanzhi(int day);
int n, a[10][10] = {0}, b[10][10] = {0};
int main()
{
int m;
cin >> m >> n;
b[5][5] = m;
fanzhi(1);
for (int i = 1; i < 10; i++)
{
cout << a[i][1];
for (int j = 2; j < 10; j++)
{
cout << ' ' << a[i][j];
}
cout << endl;
}
return 0;
}
void fanzhi(int day)
{
if (day == n + 1)
{
return;
}
else
{
int i, j;
memset(a, 0, sizeof(a));
for (i = 1; i < 10; i++)
{
for (j = 1; j < 10; j++)
{
if (b[i][j] != 0)
{
a[i][j] += 2 * b[i][j];
if(i > 1 && j > 1)
a[i - 1][j - 1] += b[i][j];
if(i > 1)
a[i - 1][j] += b[i][j];
if(i > 1 && j < 9)
a[i - 1][j + 1] += b[i][j];
if(j < 9)
a[i][j + 1] += b[i][j];
if(j < 9 && i < 9)
a[i + 1][j + 1] += b[i][j];
if(i < 9)
a[i + 1][j] += b[i][j];
if(i < 9 && j > 1)
a[i + 1][j - 1] += b[i][j];
if(j > 1)
a[i][j - 1] += b[i][j];
}
}
}
for (i = 1; i < 9; i++)
{
for (j = 1; j < 9; j++)
{
b[i][j] = a[i][j];
}
}
fanzhi(day + 1);
}
} | 48 |
23,816 | int main(){
int m,n,i,j,r,k,h;
scanf("%d%d",&m,&n);
int a[11][11]={0};
a[5][5]=m;
for(h=0;h<n;h++){
int b[11][11]={0};
for(i=1;i<10;i++){
for(j=1;j<10;j++){
if(a[i][j]!=0){
for(r=i-1;r<=i+1;r++){
for(k=j-1;k<=j+1;k++){
b[r][k]+=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<10;j++){
if(j!=9)
printf("%d ",a[i][j]);
else
printf("%d\n",a[i][j]);
}
}
} | 48 |
23,817 | int main()
{
int n,m,i;
int num[11][11],tem[11][11];
int j,k;
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
num[i][j]=0;
tem[i][j]=0;
}
}
scanf("%d %d",&m,&n);
num[5][5]=m;
tem[5][5]=m;
for(i=1;i<=n;i++)//i????
{
for(j=5-i;j<=5+i;j++)
{
for(k=5-i;k<=5+i;k++)
{
num[j][k]=tem[j-1][k-1]+tem[j][k-1]+tem[j+1][k-1]+tem[j-1][k]+tem[j+1][k]+tem[j+1][k+1]+tem[j][k+1]+tem[j-1][k+1]+2*tem[j][k];
}
}
for(j=5-i;j<=5+i;j++)
{
for(k=5-i;k<=5+i;k++)
{
tem[j][k]=num[j][k];
}
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<9;j++)
{
printf("%d ",num[j][i]);
}
printf("%d\n",num[9][i]);
}
return 0;
}
| 48 |
23,818 | int main()
{
int m,n;
int a[11][11]={0},add[11][11]={0};
scanf ("%d %d",&m,&n);
a[5][5]=m;
for (int i=0;i<n;i++)
{
for (int x=1;x<10;x++)
{
for (int y=1;y<10;y++)
add[x][y]=a[x][y]+a[x-1][y]+a[x][y-1]+a[x-1][y-1]+a[x-1][y+1]+a[x][y+1]+a[x+1][y+1]+a[x+1][y]+a[x+1][y-1];
}
for (int x=1;x<10;x++)
{
for (int y=1;y<10;y++)
a[x][y]=a[x][y]+add[x][y];
}
}
for (int i=1;i<10;i++)
{
for (int j=1;j<10;j++)
{
if (j==1) printf ("%d",a[i][j]);
else printf (" %d",a[i][j]);
}
printf ("\n");
}
return 0;
} | 48 |
23,819 | int main()
{
int row,col,i,a[N][N],b[N][N],n,d;
for(row=0;row<N;row++)
for(col=0;col<N;col++)
a[row][col]=0;
scanf("%d %d",&a[4][4],&d);
for(i=0;i<d;i++)
{
for(row=0;row<N;row++)
for(col=0;col<N;col++)
b[row][col]=0;
for(row=0;row<N;row++)
{
for(col=0;col<N;col++)
{
if(a[row][col]!=0)
{
b[row-1][col-1]+=a[row][col];
b[row][col-1]+=a[row][col];
b[row+1][col-1]+=a[row][col];
b[row-1][col]+=a[row][col];
b[row+1][col]+=a[row][col];
b[row-1][col+1]+=a[row][col];
b[row][col+1]+=a[row][col];
b[row+1][col+1]+=a[row][col];
a[row][col]*=2;
}
}
}
for(row=0;row<N;row++)
{
for(col=0;col<N;col++)
{
a[row][col]=a[row][col]+b[row][col];
}
}
}
for(row=0;row<N;row++)
{
for(col=0;col<N-1;col++)
{
printf("%d ",a[row][col]);
}
printf("%d\n",a[row][N-1]);
}
return 0;
}
| 48 |
23,820 | 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 |
23,821 | //********************************
//*??????????? **
//*?????? 1300012946 **
//*???2013.11.28 **
//********************************
int a[9][9]={0},b[9][9]={0};//???a????????????,???b??????????????????
void breed(int n)
{
if (n == 0)//??????0,?????
return;
int temp,p,q,i,j;
for (p=0 ; p<9 ; p++)//???b?0
for (q=0 ; q<9 ; q++)
b[p][q]=0;
for (p=0 ; p<9 ; p++)
for (q=0 ; q<9 ; q++)
{
if (a[p][q] != 0)
{
temp=a[p][q];//???????????
for (i=p-1 ; i<=p+1 ; i++)
for (j=q-1 ; j<=q+1 ; j++)
b[i][j] += temp;//??????????????
}
}
for (p=0 ; p<9 ; p++)
for (q=0 ; q<9 ; q++)//??????????
a[p][q] += b[p][q];
breed(n-1);
}
int main ()
{
int m,n,i,j;
cin >> m >> n;
a[4][4] = 1;//m??????????1????m?
breed(n);//????breed,??n????
for (i=0 ; i<9 ; i++)//?????,?????????
{
cout << m * a[i][0];
for (j=1 ; j<9 ; j++)
{
cout << " " << m * a[i][j];
}
cout << endl;
}
return 0;
} | 48 |
23,822 | int m,n,a[11][11][5]={0};
main()
{
int xj(int i,int j,int k);
int i,j,k;
scanf("%d %d",&m,&n);
a[5][5][0]=m;
for (k=0;k<n;k++)
for (i=4-k;i<7+k;i++)
for(j=4-k;j<7+k;j++)
{
a[i][j][k+1]=xj(i,j,k);
}
for (i=1;i<10;i++)
{
for(j=1;j<9;j++)
printf("%d ",a[i][j][n]);
printf("%d",a[i][9][n]);
printf("\n");
}
}
int xj(int i,int j,int k)
{
int p=0,l;
for ( l=-1;l<2;l++)
p=p+a[i+l][j][k]+a[i+l][j-1][k]+a[i+l][j+1][k];
return p+a[i][j][k];
}
| 48 |
23,823 | //********************************
//*??????????? **
//*????? 1300012990 **
//*???2013.12.07 **
//********************************
int b[9][9], old[9][9];
void num( int a,int e);
void ab(int c,int d);
int main()
{
int m,n,i,j;
memset(b, 0, sizeof(b));
cin >> m >> n;
b[4][4]=m;
num(0,n);
for(i=0;i<=8;i++)
{
cout << b[i][0];
for(j=1;j<=8;j++)
cout << " " << b[i][j] ;
cout << endl;
}
return 0;
}
void num( int a,int e)
{
int i,j;
for(i=0;i<=8;i++)
for(j=0;j<=8;j++)
old[i][j]=b[i][j];
for(i = 4 - a; i <= 4 + a; i++)
for(j = 4 - a; j <= 4 + a; j++)
ab(i, j);
a++;
if(a==e)
return;
else
num(a,e);
}
void ab(int c,int d)
{
int i, j;
for(i = c - 1; i <= c + 1; i++)
for(j = d - 1; j <= d + 1; j++)
b[i][j] = b[i][j] + old[c][d];
return;
}
| 48 |
23,824 | int main()
{
int num[9][9]={0};
int t;cin>>num[4][4]>>t;
for(int i=0;i<t;i++)
{
int beifen[9][9]={0};
for(int j=0;j<9;j++)
{
for(int k=0;k<9;k++)
{
if(num[j][k]!=0)
{
beifen[j][k]+=num[j][k]*2;
beifen[j][k+1]+=num[j][k];
beifen[j][k-1]+=num[j][k];
beifen[j+1][k+1]+=num[j][k];
beifen[j-1][k+1]+=num[j][k];
beifen[j-1][k-1]+=num[j][k];
beifen[j+1][k-1]+=num[j][k];
beifen[j+1][k]+=num[j][k];
beifen[j-1][k]+=num[j][k];
}
}
}
for(int j=0;j<9;j++)
{
for(int k=0;k<9;k++)
num[j][k]=beifen[j][k];
}
}
for(int i=0;i<9;i++)
{
for(int j=0;j<8;j++)
{
cout<<num[i][j]<<' ';
}
cout<<num[i][8]<<endl;
}
return 0;
} | 48 |
23,825 | 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 |
23,826 | int main()
{
int sum=0,day=0,a[11][11],b[11][11],i=0,j=0,p=0; //???????sum,????day,?????a[11][11],??????b[11][11],??????i,j
cin>>sum>>day;
for(i=0;i<11;i++) //?????
{
for(j=0;j<11;j++)
{
a[i][j]=0;
}
}
a[5][5]=sum; //????????????????
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
b[i][j]=a[i][j];
}
}
for(p=0;p<day;p++)
{
for(i=0;i<11;i++)
{
for(j=0;j<11;j++) //???????a[i][j]?????b[i][j]
{
b[i][j]=a[i][j];
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
a[i][j]=2*b[i][j]+b[i-1][j-1]+b[i-1][j]+b[i-1][j+1]+b[i][j-1]+b[i][j+1]+b[i+1][j-1]+b[i+1][j]+b[i+1][j+1]; //???????
}
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<9;j++)
{
cout<<a[i][j]<<" "; //????????
}
cout<<a[i][9]<<endl;
}
return 0;
}
| 48 |
23,827 | int main()
{
int array[9][9] ;
int temp[9][9] ;
int i , j , k , p ;
for(i = 0 ;i < 9 ;i ++)
for(j = 0 ; j < 9 ; j ++)
{
array[i][j] = 0 ;
temp[i][j] = 0 ;
}
int m ;
int n ;
cin >> m >>n ;
array[4][4] = m ;
while(n)
{
for(i = 0; i < 9 ;i ++)//??????
for(j = 0 ;j < 9 ; j ++)
{
if(i - 1 >= 0 && j - 1 >= 0 && array[i][j] != 0)//??i,j?????????
{
for(k = i - 1 ;k <= i + 1 ;k ++)
for(p = j - 1 ; p <= j + 1 ;p ++)
{
if(k == i && p == j)
{
temp[i][j] = temp[i][j] + array[i][j]*2 ;
}else
{
temp[k][p] = temp[k][p] + array[i][j] ;
}
}
}
}
for(i = 0 ;i < 9 ;i ++)//???????????
for(j = 0 ; j < 9 ; j ++)
{
array[i][j] = temp[i][j] ;
temp[i][j] = 0 ;
}
n -- ;
}
for(i = 0 ;i < 9 ;i ++)//??
{
for(j = 0 ; j < 9 ; j ++)
{
if(j == 8)
cout<<array[i][j];
else
cout<<array[i][j]<<" ";
}
cout<<endl ;
}
}
| 48 |
23,828 | //*********************************************
//** ??????????? **
//** ?????? 1300012722 **
//** ???2013.12.06 **
//*********************************************
int b[9][9], old[9][9]; //????b??????????????old??????????????
void mul(int k, const int day); //?????day????????k??????
void pam(int x, int y); //x?y???????????
int main()
{
int m, n, i, j; //m????????????n???????
memset(b, 0, sizeof(b)); //b????
cin >> m >> n;
b[4][4] = m; //????????
mul(0, n); //??????n??????????????
for(i = 0; i <= 8; i++)
{
for(j = 0; j < 8; j++)
cout << b[i][j] << " ";
cout << b[i][8] << endl;
} //?????
return 0;
}
void mul(int k, const int day)
{
int i, j;
for(i = 4 - k; i <= 4 + k; i++)
for(j = 4 - k; j <= 4 + k; j++)
old[i][j] = b[i][j]; //??????????????
for(i = 4 - k; i <= 4 + k; i++)
for(j = 4 - k; j <= 4 + k; j++)
pam(i, j); //????????????????
k++;
if(k < day)
mul(k, day); //???????????????
else
return;
}
void pam(int x, int y) //?????????10????????????????????????????????????????
{
int i, j;
for(i = x - 1; i <= x + 1; i++)
for(j = y - 1; j <= y + 1; j++)
b[i][j] = b[i][j] + old[x][y]; //????????????????????
return;
}
| 48 |
23,829 | int main(){
int a[11][11]={0},b[11][11]={0},m,n,x,i,r;
scanf("%d%d",&m,&n);
a[5][5]=m;
b[5][5]=m;
for(x=0;x<n;x++){
for(i=1;i<10;i++){
for(r=1;r<10;r++){
a[i][r]=2*b[i][r]+b[i-1][r-1]+b[i-1][r]+b[i-1][r+1]+b[i][r-1]+b[i][r+1]+b[i+1][r-1]+b[i+1][r]+b[i+1][r+1];
}
}
for(i=1;i<10;i++){
for(r=1;r<10;r++){
b[i][r]=a[i][r];
}
}
}
for(i=1;i<10;i++){
for(r=1;r<9;r++){
printf("%d ",a[i][r]);
}
printf("%d\n",a[i][r]);
}
return 0;
} | 48 |
23,830 | 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 |
23,831 |
int a[11][11] = {0};
int b[11][11] = {0};
void f(int d)
{
if (d == 0)
return;
int u, v;
for (u = 1; u <= 9; u++)
{
for (v = 1; v <= 9; v++)
{
b[u][v] = 2 * a[u][v] + a[u + 1][v] + a[u - 1][v] + a[u][v + 1] + a[u][v - 1] + a[u - 1][v - 1] + a[u - 1][v + 1] + a[u + 1][v - 1] + a[u + 1][v + 1];
}
}
for (u = 1; u <= 9; u++)
{
for (v = 1; v <= 9; v++)
{
a[u][v] = b[u][v];
}
}
f(d - 1);
}
int main()
{
int n, d;
int u, v;
cin >> n >> d;
a[5][5] = n;
f(d);
for (u = 1; u <= 9; u++)
{
for (v = 1; v <= 8; v++)
{
cout << a[u][v] << " ";
}
cout << a[u][9] << endl;
}
return 0;
} | 48 |
23,832 | int main()
{
int a[10][10],t[10][10];
int time=0,i=0,j=0,k=0;
for(i=1;i<10;i++)
for(j=1;j<10;j++)
a[i][j]=0;
cin>>a[5][5]>>time;
for(i=0;i<time;i++)
{
for(j=5-i;j<=5+i;j++)
for(k=5-i;k<=5+i;k++)
t[j][k]=a[j][k];
for(j=5-i;j<=5+i;j++)
for(k=5-i;k<=5+i;k++)
{
a[j-1][k-1]=a[j-1][k-1]+t[j][k];
a[j-1][k]=a[j-1][k]+t[j][k];
a[j-1][k+1]=a[j-1][k+1]+t[j][k];
a[j][k-1]=a[j][k-1]+t[j][k];
a[j][k]=a[j][k]+t[j][k];
a[j][k+1]=a[j][k+1]+t[j][k];
a[j+1][k-1]=a[j+1][k-1]+t[j][k];
a[j+1][k]=a[j+1][k]+t[j][k];
a[j+1][k+1]=a[j+1][k+1]+t[j][k];
}
}
for(i=1;i<10;i++)
{
for(j=1;j<=8;j++)
cout<<a[i][j]<<" ";
cout<<a[i][9]<<endl;
}
return 0;
}
| 48 |
23,833 | void change(int [][9]);
int main()
{
int m, n, i, j;
int matrix[9][9] = {0};
cin >> m >> n;
matrix[4][4] = m;
for (i = 0; i < n; i++)
{
change(matrix);
}
for (i = 0; i < 9; i++)
{
cout << matrix[i][0];
for (j = 1; j < 9; j++)
{
cout << ' ' << matrix[i][j];
}
cout << endl;
}
return 0;
}
void change(int matrix[9][9])
{
int i, j;
int plus[9][9] = {0};
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
if (matrix[i][j] > 0)
{
plus[i][j] += matrix[i][j];
plus[i - 1][j] += matrix[i][j];
plus[i][j - 1] += matrix[i][j];
plus[i + 1][j] += matrix[i][j];
plus[i][j + 1] += matrix[i][j];
plus[i - 1][j - 1] += matrix[i][j];
plus[i - 1][j + 1] += matrix[i][j];
plus[i + 1][j + 1] += matrix[i][j];
plus[i + 1][j - 1] += matrix[i][j];
}
}
}
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
matrix[i][j] += plus[i][j];
}
}
} | 48 |
23,834 | 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 |
23,835 | int main()
{
int juzhen[11][11],zhi[11][11];//???
int chu,day,i,j,n;//chu?????day?????
cin>>chu>>day;
for(i=0;i<11;i++)
for(j=0;j<11;j++) juzhen[i][j]=0;
juzhen[5][5]=chu;//??????????
for(n=0;n<day;n++)
{
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
zhi[i][j]=2*juzhen[i][j]+juzhen[i][j-1]+juzhen[i][j+1]+
juzhen[i-1][j-1]+juzhen[i-1][j]+juzhen[i-1][j+1]+juzhen[i+1][j-1]+
juzhen[i+1][j]+juzhen[i+1][j+1];//?????
}
}
for(i=1;i<10;i++)
for(j=1;j<10;j++) juzhen[i][j]=zhi[i][j];
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if (j==9) cout<<juzhen[i][j]<<endl;//????
else cout<<juzhen[i][j]<<" ";
}
}
return 0;
}
| 48 |
23,836 | 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 |
23,837 | /*
*??? 1200012851
*???????
*2013.1.4
**/
int main()
{
int a[2][11][11] = {0};
int t, i, k, j, n, days, flag = 0;
cin >> n >> days;
a[0][5][5] = n;
for (t = 1; t <= days; t++)
{
i = t % 2;
for (k = 0; k < 11; k++)
for (j = 0; j < 11; j++)
a[i][k][j] = 0;
for (k = 1; k <= 9; k++)
for (j = 1; j <= 9; j++)
{
a[i][k][j] += 2 * a[1 - i][k][j];
a[i][k + 1][j] += a[1 - i][k][j];
a[i][k - 1][j] += a[1 - i][k][j];
a[i][k][j + 1] += a[1 - i][k][j];
a[i][k][j - 1] += a[1 - i][k][j];
a[i][k + 1][j + 1] += a[1 - i][k][j];
a[i][k - 1][j - 1] += a[1 - i][k][j];
a[i][k - 1][j + 1] += a[1 - i][k][j];
a[i][k + 1][j - 1] += a[1 - i][k][j];
}
}
for (k = 1; k <= 9; k++)
{
for (j = 1; j <= 9; j++)
{
if (flag)
cout << " ";
cout << a[i][k][j];
flag = 1;
}
flag = 0;
cout << endl;
}
return 0;
}
| 48 |
23,838 | int main(){
int a[5][10][10]={0},k,i,j,m,n;
scanf("%d%d",&m,&n);
for (i=0;i<=10;i++){
for (j=0;j<=10;j++){
a[0][i][j]=0;
}
}
a[0][5][5]=m;
for (k=1;k<=n;k++){
for (i=1;i<=9;i++){
for (j=1;j<=9;j++){
a[k][i][j]=a[k-1][i][j]*2+a[k-1][i-1][j-1]+a[k-1][i][j-1]+a[k-1][i-1][j]+a[k-1][i][j+1]+a[k-1][i+1][j]+a[k-1][i+1][j+1]+a[k-1][i+1][j-1]+a[k-1][i-1][j+1];
}
}
}
for (i=1;i<=9;i++){
for (j=1;j<=9;j++){
if ((abs(i-5)>n)||(abs(j-5)>n))
a[k][i][j]=0;
}
}
for (i=1;i<=9;i++){
for (j=1;j<=9;j++){
if (j!=9)
printf("%d ",a[n][i][j]);
else printf("%d",a[n][i][j]);
}
printf("\n");
}
return 0;
}
| 48 |
23,839 |
int main(int argc, char* argv[])
{
const int sz=9;
int k,i,j,m,n,fx,fy;
int a[sz][sz],b[sz][sz];
scanf("%d%d",&m,&n);
memset (a,0,sizeof (a));
a[sz/2][sz/2]=m;
for (k=0;k<n;k++)
{
memset(b,0,sizeof (b));
for (i=1;i<sz-1;i++)
{
for (j=1;j<sz-1;j++)
{
b[i][j]+=a[i][j];
for (fx=-1;fx<=1;fx++)
{
for (fy=-1;fy<=1;fy++)
b[i+fx][j+fy]+=a[i][j];
}
}
}
memcpy (a,b, sizeof (a));
}
for (i=0;i<sz;i++)
{
for (j=0;j<sz-1;j++)
printf ("%d ",a[i][j]);
printf ("%d\n",a[i][sz-1]);
}
return 0;
} | 48 |
23,840 | 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 |
23,841 | int main()
{
const int x = 9;
int i, j, k, m, n, fx, fy;
int a[9][9], b[9][9];
scanf("%d%d", &m, &n);
memset(a, 0, sizeof(a));
a[x / 2][x / 2] = m;
for (k = 0; k < n; k++) {
memset(b, 0, sizeof(b));
for (i = 1; i < x - 1; i++) {
for (j = 1; j < x - 1; j++) {
b[i][j] += a[i][j];
for (fx = -1; fx <= 1; fx++) {
for (fy = -1; fy <= 1; fy++)
b[i + fx][j + fy] += a[i][j];
}
}
}
memcpy(a, b, sizeof(a));
}
for (i = 0; i < x; i++) {
for (j = 0; j < x - 1; j++)
printf("%d ", a[i][j]);
printf("%d\n", a[i][x - 1]);
}
return 0;
}
| 48 |
23,842 | 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 |
23,843 |
int main()
{
int a[10][10] = {0}, b[10][10] = {0};
int i, j, m, n;
cin >> m >> n;
a[5][5] = m;
while (n--)
{
for (i = 1; i <= 9; i++)
{
for (j = 1; j <= 9; j++)
{
if (a[i][j] != 0)
{
b[i][j] = b[i][j] + 2 * a[i][j];
b[i + 1][j] = b[i + 1][j] + a[i][j];
b[i][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 - 1][j + 1] = b[i - 1][j + 1] + a[i][j];
b[i - 1][j - 1] = b[i - 1][j - 1] + a[i][j];
}
}
}
for (i = 1; i <= 9; i++)
{
for (j = 1; j <= 9; j++)
{
a[i][j] = b[i][j];
b[i][j] = 0;
}
}
}
for (i = 1; i <= 9; i++)
{
for (j = 1; j <= 8; j++)
cout << a[i][j] << ' ';
cout << a[i][9] << endl;
}
return 0;
} | 48 |
23,844 | 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 |
23,845 | int p[9][9],q[9][9];
main()
{void xijun();
int m,n;
int i,j,k;
scanf("%d%d",&m,&n);
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
p[i][j]=q[i][j]=0;
}
}
p[4][4]=m;
for(i=0;i<=n-1;i++)
{xijun();}
for(i=0;i<=8;i++)
{
for(j=0;j<8;j++)
{
printf("%d ",p[i][j]);
}
printf("%d",p[i][8]);
printf("\n");
}
}
void xijun()
{
int i,j,k;
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
if(p[i][j]!=0)
{q[i-1][j-1]=q[i-1][j-1]+p[i][j];
q[i-1][j]=q[i-1][j]+p[i][j];
q[i-1][j+1]=q[i-1][j+1]+p[i][j];
q[i][j-1]=q[i][j-1]+p[i][j];
q[i][j+1]=q[i][j+1]+p[i][j];
q[i+1][j-1]=q[i+1][j-1]+p[i][j];
q[i+1][j]=q[i+1][j]+p[i][j];
q[i+1][j+1]=q[i+1][j+1]+p[i][j];
q[i][j]=2*p[i][j]+q[i][j];
}
}
}
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
p[i][j]=q[i][j];
q[i][j]=0;
}
}
}
| 48 |
23,846 |
int a[11][11];
void start(int n)
{
a[5][5]=n;
}
void day()
{
int b[11][11];
for (int i=1; i<=9; i++)
{
for (int j=1; j<=9;j++ )
{
b[i][j]=0;
}
}
for (int i=1; i<=9; i++)
{
for (int j=1; j<=9;j++ )
{
b[i][j]+=2*a[i][j];
b[i-1][j]+=a[i][j];
b[i+1][j]+=a[i][j];
b[i][j-1]+=a[i][j];
b[i][j+1]+=a[i][j];
b[i-1][j-1]+=a[i][j];
b[i+1][j+1]+=a[i][j];
b[i+1][j-1]+=a[i][j];
b[i-1][j+1]+=a[i][j];
}
}
for (int i=1; i<=9; i++)
{
for (int j=1; j<=9;j++ )
{
a[i][j]=b[i][j];
}
}
}
int main()
{
int n,m;
scanf("%d%d",&n,&m);
start(n);
while (m--)
{
day();
}
for (int i=1; i<=9; i++)
{
for (int j=1;j<9 ;j++ )
{
printf("%d ",a[i][j]);
}
printf("%d\n",a[i][9]);
}
return 0;
}
| 48 |
23,847 |
const int dx[8] = {-1, -1, 0 , 1, 1, 1, 0, -1},
dy[8] = {0 , -1, -1, -1, 0, 1, 1, 1};
int a[9][9];
int number (int x, int y, int day)
{
if (day == 0) return a[x][y];
int v = 0;
for (int i = 0; i < 8; ++i)
if (x + dx[i] >=0 && x + dx[i] < 9 && y + dy[i] >= 0 && y + dy[i] < 9)
v += number(x + dx[i], y + dy[i], day - 1);
v += 2 * number(x, y, day - 1);
return v;
}
int main()
{
int m, n;
cin >> m >> n;
for (int j = 0; j < 9; ++j)
for (int k = 0; k < 9; ++k)
a[j][k] = 0;
a[4][4] = m;
for (int j = 0; j < 9; ++j)
{
for (int k = 0; k < 9; ++k)
{
if (k != 0) cout << " ";
cout << number(j, k, n);
}
cout << endl;
}
return 0;
}
| 48 |
23,848 | int main()
{
int m,n,i,j,a,b,sz[11][11],de[11][11];
scanf("%d%d",&m,&n);
for(i=0;i<11;i++){
for(j=0;j<11;j++){
sz[i][j]=0;
de[i][j]=0;
}
}
de[5][5]=m;
for(a=0;a<n;a++){
for(i=1;i<10;i++){
for(j=0;j<10;j++){
sz[i][j]=de[i][j];
}
}
for(i=1;i<10;i++){
for(j=1;j<10;j++){
if(sz[i][j]!=0){
b=sz[i][j];
de[i][j+1]=de[i][j+1]+b;
de[i][j-1]=de[i][j-1]+b;
de[i-1][j]=de[i-1][j]+b;
de[i+1][j]=de[i+1][j]+b;
de[i-1][j-1]=de[i-1][j-1]+b;
de[i-1][j+1]=de[i-1][j+1]+b;
de[i+1][j-1]=de[i+1][j-1]+b;
de[i+1][j+1]=de[i+1][j+1]+b;
de[i][j]=de[i][j]+b;
}
}
}
}
for(i=1;i<10;i++){
for(j=1;j<10;j++){
if(j<9)
printf("%d ",de[i][j]);
else
printf("%d\n",de[i][j]);
}
}
return 0;
}
| 48 |
23,849 | 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 |
23,850 |
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 |
23,851 | int main()
{
int a[10][10],t[10][10];
int time=0,i=0,j=0,k=0;
for(i=1;i<10;i++)
for(j=1;j<10;j++)
a[i][j]=0;
cin>>a[5][5]>>time;
for(i=0;i<time;i++)
{
for(j=5-i;j<=5+i;j++)
for(k=5-i;k<=5+i;k++)
t[j][k]=a[j][k];
for(j=5-i;j<=5+i;j++)
for(k=5-i;k<=5+i;k++)
{
a[j-1][k-1]=a[j-1][k-1]+t[j][k];
a[j-1][k]=a[j-1][k]+t[j][k];
a[j-1][k+1]=a[j-1][k+1]+t[j][k];
a[j][k-1]=a[j][k-1]+t[j][k];
a[j][k]=a[j][k]+t[j][k];
a[j][k+1]=a[j][k+1]+t[j][k];
a[j+1][k-1]=a[j+1][k-1]+t[j][k];
a[j+1][k]=a[j+1][k]+t[j][k];
a[j+1][k+1]=a[j+1][k+1]+t[j][k];
}
}
for(i=1;i<10;i++)
{
for(j=1;j<=8;j++)
cout<<a[i][j]<<" ";
cout<<a[i][9]<<endl;
}
cin.get();cin.get();cin.get();cin.get();
return 0;
}
| 48 |
23,852 | //*****************************************
//* ?????(11.8) ???????? **
//* ?????? 1300012741 **
//* ???2013.10.16 **
//*****************************************
void bacteria( int, int[9][9] );
int main()
{
int numBacteria, numDay;
int container[9][9] = { 0 };
int i, j;
cin >> numBacteria >> numDay;
container[4][4] = numBacteria;
bacteria( numDay, container );
for ( i = 0; i < 9; i++ )
{
for ( j = 0; j < 9; j++ )
{
cout << container[i][j];
if ( j != 8 )
cout << " ";
}
cout << endl;
}
return 0;
}
void bacteria( int numDay, int container[9][9] )
{
int i, j;
int tempContainer[9][9] = { 0 };
if ( !numDay )
return;
else
bacteria( numDay - 1, container );
for ( i = 0; i < 9; i++ )
for ( j = 0; j < 9; j++ )
if ( container[i][j] )
{
tempContainer[i - 1][j] += container[i][j];
tempContainer[i + 1][j] += container[i][j];
tempContainer[i][j - 1] += container[i][j];
tempContainer[i][j + 1] += container[i][j];
tempContainer[i - 1][j - 1] += container[i][j];
tempContainer[i - 1][j + 1] += container[i][j];
tempContainer[i + 1][j - 1] += container[i][j];
tempContainer[i + 1][j + 1] += container[i][j];
tempContainer[i][j] += 2 * container[i][j];
}
for ( i = 0; i < 9; i++ )
for ( j = 0; j < 9; j++ )
if ( tempContainer[i][j] )
container[i][j] = tempContainer[i][j];
return;
} | 48 |
23,853 | 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 |
23,854 | int main()
{ int date,day,i,j;
int a[11][11]={0},t[11][11];
scanf("%d %d",&a[5][5],&date);
for(day=1;day<=date;day++){
for(i=1;i<10;i++){
for(j=1;j<10;j++){
t[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]=t[i][j];
}
}
}
for(i=1;i<10;i++){
if(i!=1){
printf("\n");
}
for(j=1;j<10;j++){
if(j!=1){
printf(" ");
}
printf("%d",a[i][j]);
}
}
return 0;
} | 48 |
23,855 | //????
int bac[5][11][11];
void boom (int m,int n)
{
int i,j,d1,d2;
if (n == 0)
bac[n][5][5] = m;
else
boom (m , n - 1);
if (n > 0)
for (i = 1; i <= 9; i++)
for (j = 1; j <= 9; j++)
{
bac[n][i][j] = bac[n - 1][i][j];
for (d1 = -1; d1 <= 1; d1++)
for (d2 = -1; d2 <= 1; d2++)
bac[n][i][j] += bac[n - 1][i + d1][j + d2];
}
}
int main()
{
int m,n,i,j,day;
cin >> m >> n;
for (i = 0; i <= 10; i++)
for (j = 0;j <= 10; j++)
for (day = 0; day <= 4; day++)
bac[day][i][j] = 0;
boom (m,n);
for (i = 1; i <= 9; i++)
{
for (j = 1; j <= 8; j++)
cout << bac[n][i][j] << ' ';
cout << bac[n][i][9] << endl;
}
cin >> i;
return 0;
}
| 48 |
23,856 |
int main()
{
int m,n,a[12][12],b[12][12],i,j,k;
scanf("%d %d",&m,&n);
for(j=0;j<=10;j++){
for(k=0;k<=10;k++){
b[j][k]=0;
a[j][k]=0;
}
}
b[5][5]=m;
for(i=0;i<n-1;i++){
for(j=1;j<=9;j++){
for(k=1;k<=9;k++){
a[j][k]+=2*b[j][k]+b[j-1][k]+b[j][k-1]+b[j+1][k]+b[j][k+1]+b[j-1][k-1]+b[j+1][k+1]+b[j+1][k-1]+b[j-1][k+1];
}
}
for(j=1;j<=9;j++){
for(k=1;k<=9;k++){
b[j][k]=a[j][k];
a[j][k]=0;
}
}
}
for(j=1;j<=9;j++){
for(k=1;k<=9;k++){
a[j][k]+=2*b[j][k]+b[j-1][k]+b[j][k-1]+b[j+1][k]+b[j][k+1]+b[j-1][k-1]+b[j+1][k+1]+b[j+1][k-1]+b[j-1][k+1];
}
}
for(j=1;j<=9;j++){
for(k=1;k<9;k++){
printf("%d ",a[j][k]);
}
printf("%d\n",a[j][9]);
}
return 0;
} | 48 |
23,857 | //**********************************
//* ????homework_20.cpp *
//* ??????1200012884 *
//* ?????2012?11?15? *
//* ????????????? *
//**********************************
int a[9][9] = {0};
int b[9][9] = {0};
int x[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
int y[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int main()
{
int p, q, i;
int m, n;
cin >> m >> n;
a[4][4] = m;
for (;n > 0;n--)
{
for (p = 0;p < 9;p++)
for (q = 0;q < 9;q++)
{
for (i = 0;i < 8;i++)
b[p + x[i]][q + y[i]] += a[p][q];
b[p][q] += a[p][q] * 2;
}
for (p = 0;p < 9;p++)
for (q = 0;q < 9;q++)
{
a[p][q] = b[p][q];
b[p][q] = 0;
}
}
for (p = 0;p < 9;p++)
{
for (q = 0;q < 8;q++)
cout << a[p][q] << " ";
cout << a[p][8] << endl;
}
return 0;
} | 48 |
23,858 | 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 |
23,859 | int main( )
{
int m,n,i,j,p,q;
int a[11][11]={0},b[11][11]={0};
cin>>m>>n;
a[5][5]=m;
while(n>0)
{
n--;
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
for(p=-1;p<=1;p++)
{
for(q=-1;q<=1;q++)
{
b[i+p][j+q]+=a[i][j]; //????????????????
}
}
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
a[i][j]+=b[i][j]; //???
b[i][j]=0;
}
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<9;j++)
cout<<a[i][j]<<" ";
cout<<a[i][j]<<endl;
}
return 0;
} | 48 |
23,860 | int main()
{
int a[9][9]={0};
int b[9][9]={0};
int m,t;
cin>>m>>t;
a[4][4]=m;
int i;int k,l;
for(i=0;i<t;i++)
{
for(k=0;k<9;k++)
{
for(l=0;l<9;l++)
{
if(a[k][l]!=0)
{
b[k][l]=b[k][l]+a[k][l]*2;
if(k>0)b[k-1][l]=b[k-1][l]+a[k][l];
if(k<8)b[k+1][l]=b[k+1][l]+a[k][l];
if(l>0)b[k][l-1]=b[k][l-1]+a[k][l];
if(l<8)b[k][l+1]=b[k][l+1]+a[k][l];
if(k>0 && l>0)b[k-1][l-1]=b[k-1][l-1]+a[k][l];
if(k>0 && l<8)b[k-1][l+1]=b[k-1][l+1]+a[k][l];
if(k<8 && l>0)b[k+1][l-1]=b[k+1][l-1]+a[k][l];
if(k<8 && l<8)b[k+1][l+1]=b[k+1][l+1]+a[k][l];
}
}
}
for(k=0;k<9;k++)
{
for(l=0;l<9;l++)
{
a[k][l]=b[k][l];b[k][l]=0;
}
}
}
for(k=0;k<9;k++)
{
for(l=0;l<9;l++)
{
cout<<a[k][l];
if(l!=8)cout<<" ";
}
cout<<endl;
}
return 0;
} | 48 |
23,861 | 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 |
23,862 | 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 |
23,863 | 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 |
23,864 | int a[10][10],b[10][10],i,j,k;
int main()
{
int m,n,x1,x2,y1,y2;
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[4][4]=m;
x1=y1=x2=y2=4;
for(i=0;i<n;i++)
{
for(j=x1-1;j<=x2+1;j++)
for(k=y1-1;k<=y2+1;k++)
b[j][k]=a[j][k]+a[j-1][k-1]+a[j-1][k]+a[j-1][k+1]+a[j][k-1]+a[j][k+1]+a[j+1][k-1]+a[j+1][k]+a[j+1][k+1];
for(j=0;j<9;j++)
for(k=0;k<9;k++)
a[j][k]=a[j][k]+b[j][k];
x1--;
y1--;
x2++;
y2++;
}
for(j=0;j<9;j++)
for(k=0;k<9;k++)
if(k!=8)
printf("%d ",a[j][k]);
else
printf("%d\n",a[j][k]);
}
| 48 |
23,865 | //********************************
//*?????(11.8) ???????? **
//*?????? 1300012745 **
//*???2013.12.5 **
//*******************************
int germs[4][9][9]; //????????????????????
void reproduction (int i, int n) //i????
{
int j, k, x, y; //??????
if (i == n) //????n????
return;
for (x = 0; x <= 8; x++)
{
for (y = 0; y <= 8; y++)
{
for (j = -1; j <= 1; j++)
{
for (k = -1; k <= 1; k++)
{
germs[i + 1][x + j][y + k]+=germs[i][x][y]; //???????????????
}
}
germs[i + 1][x][y]+=germs[i][x][y]; //?????????????????
}
}
reproduction (i + 1, n); //??????
}
int main()
{
int n, m, i, j, k;
cin >> m >> n;
for (i = 0; i <= 4; i++)
{
for (j = 0; j <= 8; j++)
{
for (k = 0; k <= 8; k++)
{
germs[i][j][k] = 0; //??
}
}
}
germs[0][4][4] = m; //???
reproduction (0, n); //??????
for (i = 0; i <= 8; i++)
{
for (j = 0; j <= 8; j++)
{
if (j == 8)
cout << germs[n][i][j]; //???????
else
cout << germs[n][i][j] << " ";
}
cout << endl;
}
cin.get();cin.get();
return 0;
}
| 48 |
23,866 | 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 |
23,867 |
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 |
23,868 | int main()
{
int i,j,d,m,n,a[20][20][20]={0};
scanf("%d%d",&m,&n);
a[1][5][5]=m;
for(d=1;d<=n;d++)
{
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
if(a[d][i][j]!=0)
{
a[d+1][i-1][j-1]=a[d+1][i-1][j-1]+a[d][i][j];
a[d+1][i-1][j]=a[d+1][i-1][j]+a[d][i][j];
a[d+1][i-1][j+1]=a[d+1][i-1][j+1]+a[d][i][j];
a[d+1][i][j-1]=a[d+1][i][j-1]+a[d][i][j];
a[d+1][i][j+1]=a[d+1][i][j+1]+a[d][i][j];
a[d+1][i+1][j-1]=a[d+1][i+1][j-1]+a[d][i][j];
a[d+1][i+1][j]=a[d+1][i+1][j]+a[d][i][j];
a[d+1][i+1][j+1]=a[d+1][i+1][j+1]+a[d][i][j];
a[d+1][i][j]=a[d+1][i][j]+a[d][i][j]*2;
}
}
}
}
for(i=1;i<=9;i++)
{
printf("%d %d %d %d %d %d %d %d %d\n",a[n+1][i][1],a[n+1][i][2],a[n+1][i][3],a[n+1][i][4],a[n+1][i][5],a[n+1][i][6],a[n+1][i][7],a[n+1][i][8],a[n+1][i][9]);
}
return 0;
} | 48 |
23,869 | int main()
{
int m, n;
int bac[9][9] = {{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0}};
scanf("%d %d",&m,&n);
int i = 1;
bac[4][4] = m;
int p = 0,q = 0;
while(i<=n)
{
q = 0;
int a[9][9] = {{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0},{0,0,0,0,0,0,0,0,0}};
while(q<9)
{
p = 0;
while(p<9)
{
if(bac[p][q]!=0)
{
a[p][q] = a[p][q] + 2 * bac[p][q];
a[p-1][q] += bac[p][q];
a[p+1][q] += bac[p][q];
a[p][q-1] += bac[p][q];
a[p][q+1] += bac[p][q];
a[p-1][q-1] += bac[p][q];
a[p-1][q+1] += bac[p][q];
a[p+1][q-1] += bac[p][q];
a[p+1][q+1] += bac[p][q];
}
p++;
}
q++;
}
p = 0;
q = 0;
while(q<9)
{
p = 0;
while(p<9)
{
bac[p][q] = a[p][q];
p++;
}
q++;
}
i++;
}
p = 0;
q = 0;
while(q<9)
{
p = 0;
while(p<8)
{
printf("%d ",bac[p][q]);
p++;
}
printf("%d\n",bac[p][q]);
q++;
}
return 0;
} | 48 |
23,870 |
int main()
{
int a[MAX][MAX] = { 0 };
int b[MAX][MAX] = { 0 };
int m, n;
cin >> m >> n;
a[MAX / 2][MAX / 2] = m;
for (int k = 0; k < n; k++)
{
memset(b, 0, sizeof(b));
for (int i = 1; i < MAX - 1; i++)
{
for (int j = 1; j < MAX - 1; j++)
{
b[i][j] += a[i][j];
for (int x = -1; x <= 1; x++)
{
for (int y = -1; y <= 1; y++)
{
b[i + x][j + y] += a[i][j];
}
}
}
}
memcpy(a, b, sizeof(a));
}
for (int i = 0; i < MAX; i++)
{
for (int j = 0; j < MAX - 1; j++)
{
cout << a[i][j] << ' ';
}
cout << a[i][MAX - 1] << endl;
}
return 0;
} | 48 |
23,871 | int a[11][11],b[11][11];
int grow(int i,int j)
{
int p;
p=a[i-1][j-1]+a[i-1][j]+a[i-1][j+1]+a[i][j-1]+2*a[i][j]+a[i][j+1]+a[i+1][j-1]+a[i+1][j]+a[i+1][j+1];
return p;
}
main()
{
int n,m,i,j,k;
scanf("%d %d",&m,&n);
for(i=0;i<11;i++)
for(j=0;j<11;j++)
{a[i][j]=0;
b[i][j]=0;}
a[5][5]=m;b[5][5]=m;
for(k=1;k<=n;k++)
{
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
b[i][j]=grow(i,j);
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
a[i][j]=b[i][j];
}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{ if(j==9)
printf("%d\n",b[i][j]);
else
printf("%d ",b[i][j]);
}
}
| 48 |
23,872 | int main()
{
int k,n;
scanf("%d%d",&k,&n);
int a[12][12][5];
int i,j,l,x;
for(i=1;i<=11;i++)
{
for(j=1;j<=11;j++)
{
for(l=0;l<=4;l++)
{
a[i][j][l]=0;
}
}
}
a[6][6][0]=k;
for(l=1;l<=n;l++)
{
for(i=2;i<=10;i++)
{
for(j=2;j<=10;j++)
{
a[i][j][l]=
a[i-1][j-1][l-1]
+a[i-1][j][l-1]
+a[i-1][j+1][l-1]
+a[i][j-1][l-1]
+a[i][j+1][l-1]
+a[i+1][j-1][l-1]
+a[i+1][j][l-1]
+a[i+1][j+1][l-1]
+2*a[i][j][l-1];
}
}
}
for(i=2;i<=9;i++)
{
for(j=2;j<=9;j++)
{
printf("%d ",a[i][j][n]);
}
printf("%d\n",a[i][10][n]);
}
for(j=2;j<=9;j++)
{
printf("%d ",a[10][j][n]);
}
printf("%d",a[10][10][n]);
//scanf("%d",&l);
return 0;
}
| 48 |
23,873 | 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 |
23,874 | 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 |
23,875 | int main()
{
int a[11][11],n,i,j,x,b[11][11];
for(i=0;i<=10;i++)
for(j=0;j<=10;j++)
a[i][j]=0;
for(i=0;i<=10;i++)
for(j=0;j<=10;j++)
b[i][j]=0;
scanf("%d",&a[5][5]);
scanf("%d",&n);
for(x=1;x<=n;x++)
{ for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
b[i][j]=a[i][j]*2+a[i+1][j+1]+a[i+1][j]+a[i+1][j-1]+a[i][j+1]+a[i][j-1]+a[i-1][j+1]+a[i-1][j]+a[i-1][j-1];
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
a[i][j]=b[i][j];
}
for(i=1;i<=9;i++)
{
printf("%d",b[i][1]);
for(j=2;j<=9;j++)
printf(" %d",b[i][j]);
printf("\n");
}
return 0;
}
| 48 |
23,876 |
int main()
{
int f[2][15][15];
int i, j, k, m, n, p, q, t;
scanf("%d %d", &m, &n);
memset(f, 0, sizeof(f));
f[0][5][5] = m;
p = 0;
q = 1;
for(k=1; k<=n; k++)
{
for(i=1; i<=9; i++)
for(j=1; j<=9; j++)
f[q][i][j] = 0;
for(i=1; i<=9; i++)
for(j=1; j<=9; j++)
if(f[p][i][j]!=0)
{
f[q][i][j] += f[p][i][j]*2;
f[q][i-1][j-1] += f[p][i][j];
f[q][i-1][j] += f[p][i][j];
f[q][i-1][j+1] += f[p][i][j];
f[q][i][j-1] += f[p][i][j];
f[q][i][j+1] += f[p][i][j];
f[q][i+1][j-1] += f[p][i][j];
f[q][i+1][j] += f[p][i][j];
f[q][i+1][j+1] += f[p][i][j];
}
t = p; p = q; q = t;
}
for(i=1; i<=9; i++)
{
for(j=1; j<9; j++)
printf("%d ", f[p][i][j]);
printf("%d\n", f[p][i][9]);
}
return 0;
}
| 48 |
23,877 | int pool[11][11][2]={0}; //?????????????????????
void breed(int j,int k) //?????????????
{pool[j][k][1]+=2*pool[j][k][0];
pool[j-1][k-1][1]+=pool[j][k][0];
pool[j+1][k][1]+=pool[j][k][0];
pool[j-1][k][1]+=pool[j][k][0];
pool[j][k+1][1]+=pool[j][k][0];
pool[j][k-1][1]+=pool[j][k][0];
pool[j+1][k+1][1]+=pool[j][k][0];
pool[j+1][k-1][1]+=pool[j][k][0];
pool[j-1][k+1][1]+=pool[j][k][0];
pool[j][k][0]=0;}
int main()
{
int m,n,i,j,k;
cin>>m>>n;
pool[5][5][0]=m;
for(i=0;i<n;i++)
{for(j=1;j<10;j++) for(k=1;k<10;k++) breed(j,k);
for(j=1;j<10;j++) for(k=1;k<10;k++) pool[j][k][0]=pool[j][k][1]; //????
for(j=1;j<10;j++) for(k=1;k<10;k++) pool[j][k][1]=0; //????
}
for(j=1;j<10;j++) {for(k=1;k<9;k++) cout<<pool[j][k][0]<<" "; cout<<pool[j][9][0]<<endl;}
return 0;
}
| 48 |
23,878 |
int a[11][11][5] ; //??????????????????? a[i][j][d]??i?j??d??????
int f(int x , int y , int d) //??f?????x?y?d?????????-1??????????????0
{
int s ; //?????s????????
if ((a[x][y][d] > 0) || (d == 0)) //?????????????d = 0??????????
return a[x][y][d] ;
if (a[x][y][d] == -1) //????????????-1????0
return 0 ;
s = f(x , y , d - 1) * 2 ; //??????????????
if (x > 1) //????????????????????????
{
s += f(x - 1 , y , d - 1) ;
if (y > 1) //??????????????????????????
s += f(x - 1 , y - 1 , d - 1 ) ;
if (y < 9) //????????????????
s += f(x - 1 , y + 1 , d - 1 ) ;
}
if (x < 9) //??????????
{
s += f(x + 1 , y , d - 1) ;
if (y > 1)
s += f(x + 1 , y - 1 , d - 1 ) ;
if (y < 9)
s += f(x + 1 , y + 1 , d - 1 ) ;
}
if (y > 1) //????????????????
s += f(x , y - 1 , d - 1) ;
if (y < 9)
s += f(x , y + 1 , d - 1) ;
if (s != 0) //????????0??????????
{
a[x][y][d] = s ;
return s ;
}
else //?????0??a???-1???0
{
a[x][y][d] = -1 ;
return 0 ;
}
}
int main()
{
int m , i , j ; //????m?????i,j
memset(a , 0 , sizeof(a)) ; //??a??
cin >> a[5][5][0] >> m ; //?????????????
for (i = 1 ; i <= 9 ; i ++ ) //?????????
{
cout << f(i , 1 , m) ;
for (j = 2 ; j <= 9 ; j ++ )
cout << ' ' << f(i , j , m) ;
cout << endl ;
}
return 0 ;
}
| 48 |
23,879 | int x[9][9];
int num(int i, int j, int k)
{
if (k == 1)
return x[i][j];
else
{
int t = num(i, j, k - 1);
int d[3] = {-1, 0, 1}, l[3] = {-1, 0, 1};
for (int p = 0; p < 3; p ++)
for (int q = 0; q < 3; q ++)
if ((i + d[p]) >= 0 && (i + d[p] <= 8) && (j + l[q] >= 0) && (j + l[q] <= 8))
t = t + num(i + d[p], j + l[q], k - 1);
return t;
}
}
int main()
{
int i, j, m, n;
for (i = 0; i < 9; i ++)
for (j = 0; j < 9; j ++)
x[i][j] = 0;
cin >> m;
x[4][4] = m;
cin >> n;
for (i = 0; i < 9; i ++)
{
for (j = 0; j < 8; j ++)
cout << num(i, j, n + 1) << " ";
cout << num(i, 8, n + 1) << endl;
}
return 0;
} | 48 |
23,880 | int main()
{
int a[15][15]={0};
int m=0,n=0;
cin>>m>>n;
a[5][5]=m;
for(int i=1;i<=n;i++)
{
int b[15][15]={0};
for(int j=1;j<=9;j++)
{
for(int k=1;k<=9;k++)
{
if(a[j][k]!=0)
{
//int b[15][15]={0};
for(int p=j-1;p<=j+1;p++)
{
for(int q=k-1;q<=k+1;q++)
{
b[p][q]+=a[j][k];
}
}
b[j][k]+=a[j][k];
}
}
}
for(int j=1;j<=9;j++)
{
for(int k=1;k<=9;k++)
{
a[j][k]=b[j][k];
}
}
}
for(int i=1;i<=9;i++)
{
for(int k=1;k<=8;k++)
{
cout<<a[i][k]<<" ";
}
cout<<a[i][9]<<endl;
}
return 0;
} | 48 |
23,881 | int main()
{
int m,n,i,j;
cin>>m>>n;
int a[11][11]={0},save[11][11]={0};
a[5][5]=m;
while(n--)
{
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
if(a[i][j]!=0)
{
save[i-1][j]+=a[i][j];
save[i+1][j]+=a[i][j];
save[i][j-1]+=a[i][j];
save[i][j+1]+=a[i][j];
save[i-1][j-1]+=a[i][j];
save[i-1][j+1]+=a[i][j];
save[i+1][j-1]+=a[i][j];
save[i+1][j+1]+=a[i][j];
a[i][j]*=2;
}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
if(save[i][j]!=0)
{a[i][j]+=save[i][j];
save[i][j]=0;}
}
for(i=1;i<=9;i++)
{
for(j=1;j<=8;j++)
cout<<a[i][j]<<' ';
cout<<a[i][9]<<endl;
}
return 0;
} | 48 |
23,882 |
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 |
23,883 | int main()
{
int num1[11][11],num2[11][11],m,day,t,j,i,k;
scanf("%d%d",&m,&day);
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
num1[i][j]=0;
num2[i][j]=0;
}
}
num1[5][5]=m;
for(k=1;k<=day;k++)
{
for(i=5-k;i<=5+k;i++)
{
for(j=5-k;j<=5+k;j++)
{
num2[i][j]=num2[i][j]+num1[i-1][j]+num1[i-1][j-1]+num1[i-1][j+1]+num1[i+1][j]+num1[i+1][j-1]+num1[i+1][j+1]+num1[i][j-1]+num1[i][j+1];
num2[i][j]=num2[i][j]+2*num1[i][j];
}
}
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
num1[i][j]=num2[i][j];
}
}
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
num2[i][j]=0;
}
}
}
for(i=1;i<10;i++)
{
for(j=1;j<9;j++)
{
printf("%d ",num1[i][j]);
}
printf("%d\n",num1[i][9]);
}
return 0;
} | 48 |
23,884 | int main()
{
int k,n;
scanf("%d%d",&k,&n);
int a[12][12][5];
int i,j,l,x;
for(i=1;i<=11;i++)
{
for(j=1;j<=11;j++)
{
for(l=0;l<=4;l++)
{
a[i][j][l]=0;
}
}
}
a[6][6][0]=k;
for(l=1;l<=n;l++)
{
for(i=2;i<=10;i++)
{
for(j=2;j<=10;j++)
{
a[i][j][l]=
a[i-1][j-1][l-1]
+a[i-1][j][l-1]
+a[i-1][j+1][l-1]
+a[i][j-1][l-1]
+a[i][j+1][l-1]
+a[i+1][j-1][l-1]
+a[i+1][j][l-1]
+a[i+1][j+1][l-1]
+2*a[i][j][l-1];
}
}
}
for(i=2;i<=9;i++)
{
for(j=2;j<=9;j++)
{
printf("%d ",a[i][j][n]);
}
printf("%d\n",a[i][10][n]);
}
for(j=2;j<=9;j++)
{
printf("%d ",a[10][j][n]);
}
printf("%d",a[10][10][n]);
//scanf("%d",&l);
getchar();getchar();
return 0;
}
| 48 |
23,885 | main()
{
int m,n,i,j,k,l;
scanf("%d %d",&m,&n);
int a[5][11][11]={0};
a[0][5][5]=m;
for(i=0;i<n;i++)
{
for(j=1;j<=9;j++)
{
for(k=1;k<=9;k++)
{
a[i+1][j-1][k-1]+=a[i][j][k];
a[i+1][j-1][k]+=a[i][j][k];
a[i+1][j-1][k+1]+=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]+=a[i][j][k];
a[i+1][j+1][k+1]+=a[i][j][k];
a[i+1][j][k]+=(2*a[i][j][k]);
}
}
}
for(l=1;l<=9;l++)
{
printf("%d %d %d %d %d %d %d %d %d\n",a[i][l][1],a[i][l][2],a[i][l][3],a[i][l][4],a[i][l][5],a[i][l][6],a[i][l][7],a[i][l][8],a[i][l][9]);
}
}
| 48 |
23,886 | 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 |
23,887 |
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 |
23,888 | int main()
{
int m,n,i,j,k;
int now[11][11],pre[11][11];
for(i=0;i<=10;i++)
{
for(j=0;j<=10;j++)
{
now[i][j]=0;
}
}
cin>>m>>n;
now[5][5]=m;
for(i=1;i<=n;i++)
{
for(j=0;j<=10;j++)
{
for(k=0;k<=10;k++)
{
pre[j][k]=0;
}
}
for(j=1;j<=9;j++)
{
for(k=1;k<=9;k++)
{
pre[j-1][k-1]+=now[j][k];
pre[j][k-1]+=now[j][k];
pre[j+1][k-1]+=now[j][k];
pre[j-1][k]+=now[j][k];
pre[j+1][k]+=now[j][k];
pre[j-1][k+1]+=now[j][k];
pre[j][k+1]+=now[j][k];
pre[j+1][k+1]+=now[j][k];
pre[j][k]+=2*now[j][k];
}
}
for(j=1;j<=9;j++)
{
for(k=1;k<=9;k++)
{
now[j][k]=pre[j][k];
}
}
}
for(i=1;i<=9;i++)
{
for(j=1;j<=8;j++)
{
cout<<now[i][j]<<" ";
}
cout<<now[i][9]<<endl;
}
return 0;
} | 48 |
23,889 | 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 |
23,890 | //****************************************
//*???cell birth **
//*????? 1100013004 **
//*???2010.11.28 **
//****************************************
int a[9][9];
void birth(int i,int j,int m,int n)
{
if (n==0)
{
a[i][j]+=m;
return;
}
else
{
int k,l;
for (k = i - 1;k < i + 2;k++)
for(l = j - 1;l < j + 2;l++)
if (k>=0 && k<9 && l>=0 && l<9) //????????
{
if (k==i && l==j)
birth(k,l,2*m,n-1);
else
birth(k,l,m,n-1);
}
}
}
int main()
{
int m,n,i,j;
cin>>m>>n;
for (i = 0;i < 9; i++)
for(j = 0;j < 9; j++)
a[i][j]=0;
birth(4,4,m,n);
for (i = 0;i < 9; i++)
for(j = 0;j < 9; j++)
{
if(j == 8)
cout<<a[i][j]<<endl;
else
cout<<a[i][j]<<' ';
}
return 0;
} | 48 |
23,891 | 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 |
23,892 | void p(int a[9][9])
{
int b[9][9],i,j,x,y;
for(i=0;i<9;i++)
for(j=0;j<9;j++)
b[i][j]=a[i][j];
for(i=1;i<8;i++)
for(j=1;j<8;j++)
{
for(x=-1;x<=1;x++)
for(y=-1;y<=1;y++)
b[i+x][j+y]+=a[i][j];
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
a[i][j]=b[i][j];
}
int main()
{
int a[9][9]={0},m,n,i,j,k;
scanf("%d%d",&m,&n);
a[4][4]=m;
for(k=0;k<n;k++)
p(a);
for(i=0;i<9;i++)
for(j=0;j<9;j++)
printf("%d%c",a[i][j],(j==8)?'\n':' ');
}
| 48 |
23,893 | int m,n;
int num1[11][11]={0},num2[11][11]={0};
int i,j,t;
int num(int x,int y)
{
int N;
N=num1[x-1][y-1]+num1[x][y-1]+num1[x+1][y-1]+num1[x-1][y]+num1[x+1][y]+num1[x-1][y+1]+num1[x][y+1]+num1[x+1][y+1];
return N;
}
main()
{
scanf("%d %d",&m,&n);
num1[5][5]=num2[5][5]=m;
for(t=1;t<=n;t++)
{
for(i=5-t;i<=5+t;i++)
{
for(j=5-t;j<=5+t;j++)
{
num2[i][j]=2*num1[i][j]+num(i,j);
}
}
for(i=5-t;i<=5+t;i++)
{
for(j=5-t;j<=5+t;j++)
{
num1[i][j]=num2[i][j];
}
}
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if(j==1)printf("%d",num1[i][j]);
else printf(" %d",num1[i][j]);
}
printf("\n");
}
}
| 48 |
23,894 | /**********************
*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 |
23,895 | /*????9???????????????m?????????????????????10???????10??????????????????????????????????????????n(1?n?4)????????????????
????
?????????????m????????????2?m?30???????n????????1?m?4??
????
??????????????????????????????n???????????????
????
2 1*/
int main()
{
int a[10][10][5];
int m;
short int i,j,k,n,t=2;
for(k=0;k<=4;k++)
for(i=1;i<=9;i++)
for(j=1;j<=9;j++) a[i][j][k]=0;
cin>>a[5][5][0]>>n;
m=a[5][5][0];
a[5][5][1]=2*m;
a[4][4][1]=a[4][6][1]=a[6][4][1]=a[6][6][1]=a[4][5][1]=a[5][4][1]=a[6][5][1]=a[5][6][1]=m;
while(t<=n)
{
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{
if(a[i][j][t-1]!=0)
{
a[i-1][j][t]+=a[i][j][t-1];
a[i][j-1][t]+=a[i][j][t-1];
a[i+1][j][t]+=a[i][j][t-1];
a[i][j+1][t]+=a[i][j][t-1];
a[i][j][t]+=2*a[i][j][t-1];
a[i-1][j+1][t]+=a[i][j][t-1];
a[i+1][j-1][t]+=a[i][j][t-1];
a[i-1][j-1][t]+=a[i][j][t-1];
a[i+1][j+1][t]+=a[i][j][t-1];
}
}
t++;
}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{
cout<<a[i][j][n];
if(j==9) cout<<endl;
else cout<<' ';
}
return 0;
}
| 48 |
23,896 | main()
{
struct point
{
int hen,shu,shumu;
}s[81];
int a,b,i,j,k,m[4][81]={0};
scanf("%d %d",&a,&b);
for(i=0;i<=8;i++)
for(j=0;j<=8;j++)
{
s[9*i+j].hen=i;
s[9*i+j].shu=j;
s[9*i+j].shumu=0;
}
s[40].shumu=a;
for(i=0;i<=b-1;i++)
{
for(j=0;j<=80;j++)
if(s[j].shumu!=0)
for(k=0;k<=80;k++)
if((s[k].hen==s[j].hen-1||s[k].hen==s[j].hen+1||s[k].hen==s[j].hen)&&(s[k].shu==s[j].shu+1||s[k].shu==s[j].shu-1||s[k].shu==s[j].shu))
m[i][k]=m[i][k]+s[j].shumu;
for(k=0;k<=80;k++)
s[k].shumu=s[k].shumu+m[i][k];
}
for(i=0;i<=8;i++)
for(j=0;j<=8;j++)
{
if(j==8)
printf("%d\n",s[9*i+j].shumu);
else
printf("%d ",s[9*i+j].shumu);
}
} | 48 |
23,897 | main()
{
int h,l,i,m,n,j,y;
int a[11][11],b[11][11];
scanf("%d %d",&m,&n);
for(h=0;h<11;h++)
{
for(l=0;l<11;l++)
{
a[h][l]=0;
b[h][l]=0;
}
}
a[5][5]=m;
b[5][5]=m;
// printf("%d %d\n",a[4][4],b[4][4]);
for(i=0;i<n;i++)
{
for(y=0;y<=n;y++)
{
for(j=0;j<=n;j++)
{
/// if((4-y==4-n)&&(4-j==4-n))
{a[5-y][5-j]=2*b[5-y][5-j]+b[4-y][4-j]+b[4-y][5-j]+b[4-y][6-j]+b[5-y][4-j]+b[5-y][6-j]+b[6-y][4-j]+b[6-y][5-j]+b[6-y][6-j];
// b[h][l]=a[h][l];
// printf("%d %d\n",y,j);
//printf("a=%d+%d+%d+%d+%d+%d+%d+%d+%d\n",2*b[4-y][4-j],b[3-y][3-j],b[3-y][4-j],b[3-y][5-j],b[4-y][3-j],b[4-y][5-j],b[5-y][3-j],b[5-y][4-j],b[5-y][5-j]);
}
a[5+y][5+j]=a[5-y][5-j];
a[5-y][5+j]=a[5-y][5-j];
a[5+y][5-j]=a[5-y][5-j];
/* else
{ if(j==0&&y==0)
{ a[4][4]=2*b[4][4]+8*b[3][3] ;
//b[4][4]= a[4][4];
}
else
{
a[4-y][4-j]=2*b[4-y][4-j]+2*b[4-y][4]+b[4][4]+b[4-y][4-j];
}
// break;
} */
}
}
for(h=0;h<11;h++)
{
for(l=0;l<11;l++)
{
b[h][l]= a[h][l];;
}
}
}
for(h=1;h<10;h++)
{
for(l=1;l<10;l++)
{
if(l!=9)
{printf("%d ",b[h][l]);}
else
{printf("%d",b[h][l]);}
}
printf("\n");
}
getchar();
getchar();
getchar();
} | 48 |
23,898 | 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 |
23,899 | 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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.