label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
48 | 23700 | int main()
{
int m,n,i,j,k,x,y;
scanf("%d %d",&m,&n);
int u[10][10]={0};
int q[10][10]={0};
u[4][4]=m;
q[4][4]=m;
for(k=1;k<=n;k++){
for(i=0;i<9;i++){
for(j=0;j<9;j++){
if(q[i][j]!=0)
{
u[i][j]+=q[i][j];
u[i-1][j-1]+=q[i][j];
u[i-1][j]+=q[i][j];
u[i-1][j+1]+=q[i][j];
u[i][j-1]+=q[i][j];
u[i][j+1]+=q[i][j];
u[i+1][j-1]+=q[i][j];
u[i+1][j]+=q[i][j];
u[i+1][j+1]+=q[i][j];
}
}
}
for(x=0;x<9;x++){
for(y=0;y<9;y++){
q[x][y]=u[x][y];
}
}
}
for(i=0;i<9;i++){
for(j=0;j<9;j++){
if(j==8)
{
printf("%d\n",u[i][j]);
}
else
{
printf("%d ",u[i][j]);
}
}
}
return 0;
} |
48 | 23701 |
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 | 23702 |
void propagate( int day ); //propagete????????????????day????
void print(); //?????
int a[9][9] = {0}, b[9][9] = {0}, m = 0; //a????????b????????,m??????????m???
int main()
{
int n; //n??????
cin >> m >> n;
propagate( n );
print();
return 0;
}
void propagate( int day )
{
int num = 0;
if ( day == 0 )
{
a[4][4] = m; //????????????
return;
}
propagate( day - 1 ); //????????
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]; //num??????????
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]; //????????????????
}
}
return;
}
void print()
{
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]; //??????????
}
}
} |
48 | 23703 | int main()
{
int a[9][9] ={0, 0};
int n, day;
cin >> n >> day;
a[4][4] = n;
for(int i = 1; i <= day; i ++)
{
int b[9][9] = {0, 0};
for(int j = 0; j < 9; j ++)
for(int k = 0; k < 9; k++)
{
if(a[j][k] != 0)
{
b[j][k] += a[j][k];
b[j - 1][k - 1] += a[j][k];
b[j - 1][k] += a[j][k];
b[j - 1][k + 1] += a[j][k];
b[j][k - 1] += a[j][k];
b[j][k + 1] += a[j][k];
b[j + 1][k - 1] += a[j][k];
b[j + 1][k] += a[j][k];
b[j + 1][k + 1] += a[j][k];
}
}
for(int j = 0; j < 9; j ++)
for(int k = 0; k < 9; k ++)
a[j][k] += b[j][k];
}
for(int i = 0; i < 9; i ++)
{
cout << a[i][0];
for(int j = 1; j < 9; j ++)
cout << " " << a[i][j];
cout << endl;
}
return 0;
} |
48 | 23704 | //fanzhi
int a[10][10] = {0};
void fanzhi();
int main()
{
int m, n;
cin >> m >> n;
a[5][5] = m;
for(int i = 0; i < n; i++)
fanzhi();
for(int i = 1; i <= 9;i++)
{
for(int j = 1; j <= 8; j++)
cout << a[i][j] << ' ';
cout << a[i][9] << endl;
}
cin.get();
cin.get();
return 0;
}
void fanzhi()
{
int b[10][10] = {0};
for(int i = 1; i < 10; i++)
for(int j = 1; j < 10; 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 < 10; i++)
for(int j = 1; j < 10; j++)
a[i][j] = b[i][j];
return;
}
|
48 | 23705 | int main()
{
int n,day,i,j;
int day0[9][9],day1[9][9], day2[9][9],day3[9][9],day4[9][9];
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
day0[i][j]=0;
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
day1[i][j]=0;
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
day2[i][j]=0;
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
day3[i][j]=0;
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
day4[i][j]=0;
}
}
scanf("%d %d",&n,&day);
day0[4][4]=n;
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(day0[i][j]!=0)
{
day1[i-1][j-1]=1*day0[i][j];
day1[i-1][j-0]=1*day0[i][j];
day1[i-1][j+1]=1*day0[i][j];
day1[i-0][j-1]=1*day0[i][j];
day1[i-0][j+1]=1*day0[i][j];
day1[i+1][j-1]=1*day0[i][j];
day1[i+1][j-0]=1*day0[i][j];
day1[i+1][j+1]=1*day0[i][j];
day1[i][j]=2*day0[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(day1[i][j]!=0)
{
day2[i-1][j-1]=1*day1[i][j]+day2[i-1][j-1];
day2[i-1][j-0]=1*day1[i][j]+day2[i-1][j-0];
day2[i-1][j+1]=1*day1[i][j]+day2[i-1][j+1];
day2[i-0][j-1]=1*day1[i][j]+day2[i-0][j-1];
day2[i-0][j+1]=1*day1[i][j]+day2[i-0][j+1];
day2[i+1][j-1]=1*day1[i][j]+day2[i+1][j-1];
day2[i+1][j-0]=1*day1[i][j]+day2[i+1][j-0];
day2[i+1][j+1]=1*day1[i][j]+day2[i+1][j+1];
day2[i][j]=2*day1[i][j]+day2[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(day2[i][j]!=0)
{
day3[i-1][j-1]=1*day2[i][j]+day3[i-1][j-1];
day3[i-1][j-0]=1*day2[i][j]+day3[i-1][j-0];
day3[i-1][j+1]=1*day2[i][j]+day3[i-1][j+1];
day3[i-0][j-1]=1*day2[i][j]+day3[i-0][j-1];
day3[i-0][j+1]=1*day2[i][j]+day3[i-0][j+1];
day3[i+1][j-1]=1*day2[i][j]+day3[i+1][j-1];
day3[i+1][j-0]=1*day2[i][j]+day3[i+1][j-0];
day3[i+1][j+1]=1*day2[i][j]+day3[i+1][j+1];
day3[i][j]=2*day2[i][j]+day3[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(day3[i][j]!=0)
{
day4[i-1][j-1]=1*day3[i][j]+day4[i-1][j-1];
day4[i-1][j-0]=1*day3[i][j]+day4[i-1][j-0];
day4[i-1][j+1]=1*day3[i][j]+day4[i-1][j+1];
day4[i-0][j-1]=1*day3[i][j]+day4[i-0][j-1];
day4[i-0][j+1]=1*day3[i][j]+day4[i-0][j+1];
day4[i+1][j-1]=1*day3[i][j]+day4[i+1][j-1];
day4[i+1][j-0]=1*day3[i][j]+day4[i+1][j-0];
day4[i+1][j+1]=1*day3[i][j]+day4[i+1][j+1];
day4[i][j]=2*day3[i][j]+day4[i][j];
}
}
}
if(day==1)
{
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
printf("%d ", day1[i][j]);
}
printf("%d\n",day1[i][8]);
}
}
if(day==2)
{
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
printf("%d ", day2[i][j]);
}
printf("%d\n",day2[i][8]);
}
}
if(day==3)
{
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
printf("%d ", day3[i][j]);
}
printf("%d\n",day3[i][8]);
}
}
if(day==4)
{
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
printf("%d ", day4[i][j]);
}
printf("%d\n",day4[i][8]);
}
}
return 0;
} |
48 | 23706 | int main()
{
int board[9][9],temp[9][9];
int n;
memset(board,0,81*sizeof(int));
cin>>board[4][4]>>n;
while(n--)
{
memset(temp,0,81*sizeof(int));
for(int i=1;i<8;i++)
{
for(int j=1;j<8;j++)
{
if(board[i][j]>0)
{
temp[i][j]+=(2*board[i][j]);
temp[i-1][j-1]+=board[i][j];
temp[i-1][j]+=board[i][j];
temp[i-1][j+1]+=board[i][j];
temp[i][j-1]+=board[i][j];
temp[i][j+1]+=board[i][j];
temp[i+1][j-1]+=board[i][j];
temp[i+1][j]+=board[i][j];
temp[i+1][j+1]+=board[i][j];
}
}
}
for(int i=0;i<9;i++)
{
for(int j=0;j<9;j++)
{
board[i][j]=temp[i][j];
}
}
}
for(int i=0;i<9;i++)
{
cout<<board[i][0];
for(int j=1;j<9;j++)
{
cout<<' '<<board[i][j];
}
cout<<endl;
}
return 0;
} |
48 | 23707 | 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 | 23708 | void change(int, int[][10]);
void print(int[][10]);
int m, n;
int main()
{
int i, j, fb[10][10];
cin >> m >> n;
for(i = 1; i <= 9; i++)
for(j = 1; j <= 9; j++)
fb[i][j] = 0;
fb[5][5] = m;
change(1, fb);
return 0;
}
void change(int day, int temp[][10])
{
int i, j, t[10][10];
if(day == n + 1)
{
print(temp);
return;
}
for(i = 1; i <= 9; i++)
for(j = 1; j <= 9; j++)
t[i][j] = 0;
for(i = 1; i <= 9; i++)
for(j = 1; j <= 9; j++)
if(temp[i][j] != 0)
{
t[i][j] = t[i][j] + temp[i][j];
t[i + 1][j] = t[i + 1][j] + temp[i][j];
t[i + 1][j + 1] = t[i + 1][j + 1] + temp[i][j];
t[i + 1][j - 1] = t[i + 1][j - 1] + temp[i][j];
t[i][j + 1] = t[i][j + 1] + temp[i][j];
t[i][j - 1] = t[i][j - 1] + temp[i][j];
t[i - 1][j] = t[i - 1][j] + temp[i][j];
t[i - 1][j + 1] = t[i - 1][j + 1] + temp[i][j];
t[i - 1][j - 1] = t[i - 1][j - 1] + temp[i][j];
}
for(i = 1; i <= 9; i++)
for(j = 1; j <= 9; j++)
temp[i][j] = temp[i][j] + t[i][j];
change(day + 1, temp);
}
void print(int array[][10])
{
int i = 1, j;
while(1)
{
for(j = 1; j <= 8; j++)
cout << array[i][j] << " ";
cout << array[i][9] << endl;
if(i == 9)
break;
i++;
}
} |
48 | 23709 | int j, k, bec[9][9] = {0}, tempbec[9][9] = {0};
void increase(int bec[][9])
{
bec[j - 1][k] += tempbec[j][k];
bec[j - 1][k - 1] += tempbec[j][k];
bec[j - 1][k + 1] += tempbec[j][k];
bec[j][k - 1] += tempbec[j][k];
bec[j][k + 1] += tempbec[j][k];
bec[j + 1][k - 1] += tempbec[j][k];
bec[j + 1][k] += tempbec[j][k];
bec[j + 1][k + 1] += tempbec[j][k];
}
int main()
{
int m, n, i = 0, num = 1;
cin >> m >> n;
bec[4][4] = m;
for (i = 0; i < n; i++)
{
for(j = 0; j < 9; j++)
for(k = 0; k < 9; k++)
{
tempbec[j][k] = bec[j][k];
bec[j][k] = bec[j][k] * 2;
}
for (j = 1; j < 8; j++)
for(k = 1; k < 8; k++)
increase (bec);
}
for (j = 0; j < 9; j++)
for (k = 0; k < 9; k++)
{
if(num % 9 == 1)
cout << bec[j][k];
if(num % 9 == 0)
cout << " " << bec[j][k] << "\n";
if(num % 9 != 0 && num % 9 != 1)
cout << " " << bec[j][k];
num++;
}
return 0;
}
|
48 | 23710 | 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 | 23711 | int main()
{
int a[9][9]={0},b[9][9]={0};
int m,n;
cin>>m>>n;
int i,j,k,l;
a[4][4]=m;
for(i=1;i<=n;i++)
{
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
{
if(a[j][k]!=0)
{
b[j][k-1]=b[j][k-1]+a[j][k];
b[j][k+1]=b[j][k+1]+a[j][k];
b[j-1][k]=b[j-1][k]+a[j][k];
b[j+1][k]=b[j+1][k]+a[j][k];
b[j-1][k-1]=b[j-1][k-1]+a[j][k];
b[j+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];
}
}
}
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
{
if(a[j][k]!=0)
a[j][k]=a[j][k]+a[j][k];
}
}
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
a[j][k]=a[j][k]+b[j][k];
}
for(j=0;j<9;j++)
{
for(k=0;k<9;k++)
b[j][k]=0;
}
}
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 | 23712 |
int main()
{
int a[11][11] = {0}, i, j, t[11][11] = {0}, m, n;
const int move[8][2]= {-1, 0, 1, 0, 0, 1, 0, -1, -1, -1, 1, -1, 1, 1, -1, 1};
cin >> m >> n;
a[5][5] = m;
while (n--)
{
memset(t, 0, sizeof(t));
for (i = 1; i < 10; i++)
{
for (j = 1; j < 10; j++)
{
for (int k = 0; k < 8; k++)
{
t[i + move[k][0]][j + move[k][1]] += a[i][j];
}
t[i][j] += a[i][j];
}
}
for (i = 1; i < 10; i++)
{
for (j = 1; j < 10; j++)
{
a[i][j] += t[i][j];
}
}
}
for (i = 1; i < 10; i++)
{
for (j = 1; j < 10; j++)
{
if (j > 1)
{
cout << " ";
}
cout << a[i][j];
}
cout << endl;
}
return 0;
} |
48 | 23713 | //****************************************
//*??????????? **
//*?????? 1100012760**
//*???2011.11.26 **
//****************************************
int main()
{
int mat[10][10] = {0} , New[10][10];
int i , j , l , m , n;
cin >> m >> n;
mat[5][5] = m;
for(i = 1 ; i <= n ; i++)
{
for (j = 1 ; j <= 9 ; j++)
{
for (l = 1 ; l <= 9 ; l++)
{
New[j][l] = 0;
}
}
for (j = 1 ; j <= 9 ; j++)
{
for (l = 1 ; l <= 9 ; l++)
{
New[j][l] += 2 * mat [j][l];
New[j - 1][l - 1] += mat [j][l];
New[j + 1][l - 1] += mat [j][l];
New[j - 1][l + 1] += mat [j][l];
New[j + 1][l + 1] += mat [j][l];
New[j][l - 1] += mat [j][l];
New[j - 1][l] += mat [j][l];
New[j + 1][l] += mat [j][l];
New[j][l + 1] += mat [j][l];
}
}
for (j = 1 ; j <= 9 ; j++)
{
for (l = 1 ; l <= 9 ; l++)
{
mat[j][l] = New[j][l];
}
}
}
for (j = 1 ; j <= 9 ; j++)
{
cout << mat[j][1];
for (l = 2 ; l <= 9 ; l++)
{
cout << ' ' << mat[j][l];
}
cout << endl;
}
return 0;
}
|
48 | 23714 | main()
{
int a[11][11],b[11][11];
int i,j,k,l,m,n;
for(i=0;i<11;i++)
for(j=0;j<11;j++)
{
a[i][j]=0;
b[i][j]=0;
}
scanf("%d %d",&m,&n);
a[5][5]=m;
for(k=0;k<n;k++)
{
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
b[i][j]=2*a[i][j]+a[i-1][j-1]+a[i-1][j]+a[i-1][j+1]+a[i][j-1]+a[i][j+1]+a[i+1][j+1]+a[i+1][j-1]+a[i+1][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\n",a[i][9]);
else
printf("%d ",a[i][j]);
}
}
getchar();
getchar();
}
|
48 | 23715 | int main(){
int n,m,i,j,k;
int a[10][10][10];
scanf ("%d %d",&m,&n);
for (k=0;k<11;k++){
for (j=0;j<11;j++){
a[0][k][j]=0;
a[1][k][j]=0;
a[2][k][j]=0;
a[3][k][j]=0;
a[4][k][j]=0;
}
}
a[0][5][5]=m;
for (i=1;i<n+1;i++){
for (k=1;k<10;k++){
for (j=1;j<10;j++){
a[i][k][j]=2*a[i-1][k][j]+a[i-1][k][j-1]+a[i-1][k][j+1]+a[i-1][k+1][j-1]+a[i-1][k+1][j]+a[i-1][k+1][j+1]+ a[i-1][k-1][j-1]+a[i-1][k-1][j]+a[i-1][k-1][j+1];
}
}
}
for (k=1;k<10;k++){
for (j=1;j<9;j++){
printf("%d ",a[n][k][j]) ;
}
printf("%d\n",a[n][k][9]) ;
}
return 0;
} |
48 | 23716 | 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 | 23717 | 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;
b[i][j]=0;
}
}
a[5][5]=m;
for(k=0;k<n;k++)
{
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
b[i][j]=a[i][j];
}
}
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if(b[i][j]!=0)
{
a[i][j]=a[i][j]+b[i][j];
a[i][j+1]+=b[i][j];
a[i][j-1]+=b[i][j];
a[i+1][j]+=b[i][j];
a[i-1][j]+=b[i][j];
a[i+1][j+1]+=b[i][j];
a[i-1][j-1]+=b[i][j];
a[i+1][j-1]+=b[i][j];
a[i-1][j+1]+=b[i][j];
}
}
}
}
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 | 23718 | int m, n;
int i, j;
int a[10][10] = {0}, b[10][10] = {0};
void zuo(int x)
{
if(x == n)
{
for(i = 1; i <= 9; i++)
{
for(j = 1; j < 9; j++)
cout << a[i][j] << " ";
cout << a[i][9] << endl;
}
}
else
{
for(i = 1; i <= 9; i++)
{
for(j = 1; j <= 9; 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 = 1; i <= 9; i++)
{
for (j = 1; j <= 9; j++)
{
a[i][j] += b[i][j];
b[i][j] = 0;
}
}
zuo(x + 1);
}
}
int main ()
{
cin >> m >> n;
a[5][5] = m;
zuo(0);
return 0;
}
|
48 | 23719 | int q[9][9]={0},mark[9][9]={0},a[9][9]={0};//????
int d[8][2]={{-1,0},{0,-1},{1,0},{0,1},{-1,-1},{-1,1},{1,-1},{1,1}};//??????
void kuosan(int i,int n)//????
{
if(i==n+1)//????n?
{
for(int k=0;k<9;k++)
{
for(int l=0;l<9;l++)
{
if(l==0)cout<<q[k][0];
else cout<<' '<<q[k][l];
}
cout<<endl;
}
}//????
else
{
for(int j=0;j<9;j++)
for(int k=0;k<9;k++)
a[j][k]=q[j][k];//???q?????a?
for(int j=0;j<9;j++)
for(int k=0;k<9;k++)
if(mark[j][k]>0&&mark[j][k]<=i)
{
a[j][k]=a[j][k]+2*q[j][k];
for(int p=0;p<8;p++)
{
a[j+d[p][0]][k+d[p][1]]=a[j+d[p][0]][k+d[p][1]]+q[j][k];
if(mark[j+d[p][0]][k+d[p][1]]==0)mark[j+d[p][0]][k+d[p][1]]=i+1;
}
}//????
for(int j=0;j<9;j++)
for(int k=0;k<9;k++)
q[j][k]=a[j][k]-q[j][k];//??????
kuosan(i+1,n);//??????
}
}
int main()
{
int m,n;
cin>>m>>n;//??m,n
q[4][4]=m;mark[4][4]=1;//???
kuosan(1,n);
return 0;
} |
48 | 23720 | //******************************
//???:2.cpp
//??: ??? 1300012754
//??:2013.12.06
//??:???????? (???????????????????
//******************************
int m, n; // m:?????????,n:?????
int map[10][10]; // ???
int Breed(int, int, int); // ????
int main()
{
memset(map, 0, sizeof(map)); // ?????
cin >> m >> n; // ??????????,?????
// ??1???9?
for (int i = 1; i <= 9; i++)
{
cout << Breed(i, 1, n); // ??n????i????????
for (int j = 2; j <= 9; j++)
{
cout << " " << Breed(i, j, n); // ???i???8?????,???????
}
cout << endl; // ?????
}
return 0;
}
// ????,x,y????,p??????
int Breed(int x, int y, int p)
{
if (p == 0) // ????????0?
{
if (x == 5 && y == 5) // ??????,????m
return m;
else
return 0; // ???????0
}
else
{
return Breed(x + 1, y, p - 1) + Breed(x + 1, y + 1, p - 1) +
Breed(x, y + 1, p - 1) + Breed(x - 1, y + 1, p - 1) +
Breed(x - 1, y, p - 1) + Breed(x - 1, y - 1, p - 1) +
Breed(x, y - 1, p - 1) + Breed(x + 1, y - 1, p - 1) +
2 * Breed(x, y, p - 1); // ???????, ???????????????????????????2???????????
}
}
|
48 | 23721 | //*********************************************
//** ??????????? **
//** ?????? 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 | 23722 | int main()
{
int container[10][10]={0};
int temp[10][10]={0};
int m,day;
int i,j,k;
cin>>m>>day;
container[5][5]=m;
for(i=1;i<=day;i++) //?i?
{
for(j=1;j<=9;j++)
{ for(k=1;k<=9;k++) //???????????0??
{
if(container[j][k]!=0)
{
temp[j][k]+=container[j][k]*2; //???2
temp[j-1][k]+=container[j][k];
temp[j+1][k]+=container[j][k];
temp[j][k-1]+=container[j][k];
temp[j][k+1]+=container[j][k];
temp[j-1][k+1]+=container[j][k];
temp[j-1][k-1]+=container[j][k];
temp[j+1][k-1]+=container[j][k];
temp[j+1][k+1]+=container[j][k]; //????????1
}
}
}
for(j=1;j<=9;j++)
{ for(k=1;k<=9;k++)
{
container[j][k]=temp[j][k]; //?????????????container
}
}
for(j=1;j<=9;j++)
for(k=1;k<=9;k++)
temp[j][k]=0;
}
//?????????
for(i=1;i<=9;i++)
{ for(j=1;j<=8;j++)
{
cout<<container[i][j]<<" ";
}
cout<<container[i][9]<<endl;
}
return 0;
} |
48 | 23723 | 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 | 23724 | int main()
{
int m,n,i,j,k;
int juzhen1[11][11];
int juzhen2[11][11];
scanf("%d %d",&m,&n);
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
juzhen1[i][j]=0;
juzhen2[i][j]=0;
}
}
juzhen1[5][5]=m;
for(k=1;k<n+1;k++)
{
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if(k%2!=0)
{
if(juzhen1[i][j]>0)
{
juzhen2[i][j]=juzhen2[i][j]+2*(juzhen1[i][j]);
juzhen2[i-1][j-1]=juzhen2[i-1][j-1]+juzhen1[i][j];
juzhen2[i-1][j]=juzhen2[i-1][j]+juzhen1[i][j];
juzhen2[i-1][j+1]=juzhen2[i-1][j+1]+juzhen1[i][j];
juzhen2[i][j-1]=juzhen2[i][j-1]+juzhen1[i][j];
juzhen2[i][j+1]=juzhen2[i][j+1]+juzhen1[i][j];
juzhen2[i+1][j-1]=juzhen2[i+1][j-1]+juzhen1[i][j];
juzhen2[i+1][j]=juzhen2[i+1][j]+juzhen1[i][j];
juzhen2[i+1][j+1]=juzhen2[i+1][j+1]+juzhen1[i][j];
//juzhen1[i][j]=0;
}
}
if(k%2==0)
{
if(juzhen2[i][j]>0)
{
juzhen1[i][j]=juzhen1[i][j]+2*(juzhen2[i][j]);
juzhen1[i-1][j-1]=juzhen1[i-1][j-1]+juzhen2[i][j];
juzhen1[i-1][j]=juzhen1[i-1][j]+juzhen2[i][j];
juzhen1[i-1][j+1]=juzhen1[i-1][j+1]+juzhen2[i][j];
juzhen1[i][j-1]=juzhen1[i][j-1]+juzhen2[i][j];
juzhen1[i][j+1]=juzhen1[i][j+1]+juzhen2[i][j];
juzhen1[i+1][j-1]=juzhen1[i+1][j-1]+juzhen2[i][j];
juzhen1[i+1][j]=juzhen1[i+1][j]+juzhen2[i][j];
juzhen1[i+1][j+1]=juzhen1[i+1][j+1]+juzhen2[i][j];
//juzhen2[i][j]=0;
}
}
}
}
if(k%2!=0)
{
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
juzhen1[i][j]=0;
}
}
}
if(k%2==0)
{
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
juzhen2[i][j]=0;
}
}
}
}
if(k%2==0)
{
for(i=1;i<10;i++)
{
printf("%d %d %d %d %d %d %d %d %d\n",juzhen2[i][1],juzhen2[i][2],juzhen2[i][3],juzhen2[i][4],juzhen2[i][5],juzhen2[i][6],juzhen2[i][7],juzhen2[i][8],juzhen2[i][9]);
}
}
if(k%2!=0)
{
for(i=1;i<10;i++)
{
printf("%d %d %d %d %d %d %d %d %d\n",juzhen1[i][1],juzhen1[i][2],juzhen1[i][3],juzhen1[i][4],juzhen1[i][5],juzhen1[i][6],juzhen1[i][7],juzhen1[i][8],juzhen1[i][9]);
}
}
return 0;
} |
48 | 23725 | //***************************
//??????? *
//?????? 1100012895 *
//???2011-11-23 *
//***************************
int main()
{
int Ground[5][11][11] = {0}; // ??????????????????
cin >> Ground[0][5][5]; // ?????????????
int n; // n??????
cin >> n;
// ????????????????????????
int day, j, k;
for (day = 1; day <= n; day++)
for (j = 5 - day; j <= 5 + day; j++)
for (k = 5 - day; k <= 5 + day; k++)
// ?????????????????????????
Ground[day][j][k] = Ground[day - 1][j][k]*2 + Ground[day - 1][j - 1][k - 1]
+ Ground[day - 1][j - 1][k] + Ground[day - 1][j - 1][k + 1] + Ground[day - 1][j][k - 1] + Ground[day - 1][j][k + 1]
+ Ground[day - 1][j + 1][k - 1] + Ground[day - 1][j + 1][k] + Ground[day - 1][j + 1][k + 1];
for (j = 1; j <= 9; j++)
{
cout << Ground[n][j][1];
for (k = 2; k <= 9; k++)
cout << ' ' << Ground[n][j][k];
cout << endl;
}
return 0;
}
|
48 | 23726 | void fanzhi(int a[11][11],int n)
{
int i,j;
int b[11][11]={0};
if(n==0)
return;
else
{
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-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=1;i<=9;i++)
for(j=1;j<=9;j++)
{
a[i][j]=b[i][j];
b[i][j]=0;
}
fanzhi(a,n-1);
}
}
int main()
{
int m,n;
int a[11][11]={0};
cin>>m>>n;
a[5][5]=m;
fanzhi(a,n);
int i,j;
for(i=1;i<=9;i++)
{
for(j=1;j<=9;j++)
{
if(j!=1)
cout<<" ";
cout<<a[i][j];
}
cout<<endl;
}
return 0;
} |
48 | 23727 | int a[11][11];
int backup_a[11][11];
int b[11][11];
void backup1()
{
for(int i=1;i<9;i++)
{
for(int j=0;j<9;j++)
{
backup_a[i][j]=a[i][j];
b[i][j]=a[i][j];
}
}
}
void cal1()
{
for(int i=1;i<10;i++)
{
for(int j=1;j<10;j++)
{
if(i>0&&i<10&&j<10&&j>0)
{
a[i][j]=b[i-1][j-1]+b[i-1][j+1]+b[i+1][j-1]+b[i+1][j+1]+b[i-1][j]+b[i+1][j]+b[i][j-1]+b[i][j+1]+2*b[i][j];
}
}
}
}
int main()
{
int n=0;
int d;
cin>>d;
cin>>n;
memset(a,0,sizeof(a));
a[5][5]=d;
backup1();
for(int i=0;i<n;i++)
{
cal1();
backup1();
}
for(int i=1;i<10;i++)
{
for(int j=1;j<10;j++)
{
if(i>0&&i<10&&j<10&&j>0)
{
if(j!=9) cout<<a[i][j]<<" ";
else if(j==9)cout<<a[i][j]<<endl;
}
}
}
return 0;
} |
48 | 23728 | //****************************************
//*?????(11.8) ???????? **
//*?????? 1100012798 **
//*???2011.11.26 **
//****************************************
int a[9][9] = {0} , m;
void breed(int x,int y,int nf) //??????
{
int xx,yy;
if (nf != 0) //??????:??
{
breed(x,y,nf - 1); //??
for (xx = x - 1;xx <= x + 1;xx++)
{
for (yy = y - 1;yy <= y + 1;yy++)
{
a[xx][yy]+= m;
breed(xx,yy,nf - 1);
}
}
}
}
int main()
{
int n , i , j; //??????
cin >> m >> n; //????
a[4][4] = m;
breed(4,4,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 | 23729 | void main(){
long d,i,j,m,n,a[11][11][5]={0,0};
scanf("%d%d",&m,&n);
a[5][5][0]=m;
for(d=1;d<=n;d++)
for(i=1;i<10;i++)
for(j=1;j<10;j++)
a[i][j][d]=
a[i-1][j-1][d-1]
+a[i][j-1][d-1]
+a[i-1][j][d-1]
+a[i][j][d-1]*2
+a[i+1][j-1][d-1]
+a[i+1][j][d-1]
+a[i+1][j+1][d-1]
+a[i-1][j+1][d-1]
+a[i][j+1][d-1];
for(i=1;i<10;i++)printf("%ld %ld %ld %ld %ld %ld %ld %ld %ld\n",
a[i][1][n],
a[i][2][n],
a[i][3][n],
a[i][4][n],
a[i][5][n],
a[i][6][n],
a[i][7][n],
a[i][8][n],
a[i][9][n]);}
|
48 | 23730 | //**********************************
//*?????????.cpp *
//*? ????? *
//*? ??2013.12.4 *
//**********************************
void judge(int m , int n ,int (*p)[9])
{
int str[9][9] , i , j ;
if ( n == 0 ) //??n??0??????n???????
return ;
memcpy(str,p,sizeof(str)); //?p???str??????????????
for ( i = 0 ; i <= 8 ; i++ )
{
for ( j = 0 ; j <=8 ; j++ )
if (str[i][j] != 0)
{
if ( i != 0 ) //???????????????p???
{
if ( j != 0 )
p[i-1][j-1] += str[i][j] ;
if ( j != 8 )
p[i-1][j+1] += str[i][j] ;
p[i-1][j] += str[i][j] ;
}
if ( i != 8 )
{
if ( j != 0 )
p[i+1][j-1] += str[i][j] ;
if ( j != 8 )
p[i+1][j+1] += str[i][j] ;
p[i+1][j] += str[i][j] ;
}
if ( j != 0 )
p[i][j-1] += str[i][j] ;
if ( j != 8 )
p[i][j+1] += str[i][j] ;
p[i][j] += str[i][j] ;
}
}
judge(m,n-1,p); //?????
}
void output(int (*p)[9])
{
int i , j ;
for ( i = 0 ; i <= 8 ; i++ )
{
for ( j = 0 ; j <= 8 ; j++ )
{
cout << p[i][j] ;
if ( j != 8 )
cout << " " ;
else
cout << endl ;
}
}
}
int main ()
{
int m , n ,p[9][9]={0};
cin >> m >> n ;
p[4][4]=m;
judge(m,n,p); //????
output(p); //????
return 0 ;
} |
48 | 23731 | /*
* 2.Cap
*
* Created on: 2011-11-22
* Author: Administrator
*/
int a[10][10] = {0}, b[10][10] = {0};
void born( int i, int j )
{
int num = b[i][j];
if ( i > 1 )
a[i - 1][j] += num;
if ( i > 1 && j > 1 )
a[i - 1][j - 1] += num;
if ( j > 1 )
a[i][j - 1] += num;
if ( i < 9 && j > 1 )
a[i + 1][j - 1] += num;
if ( i < 9 )
a[i + 1][j] += num;
if ( i < 9 && j < 9 )
a[i + 1][j + 1] += num;
if ( j < 9 )
a[i][j + 1] += num;
if ( i > 1 && j < 9 )
a[i - 1][j + 1] += num;
a[i][j] += num;
}
int main()
{
int m, n, i, j, k;
cin >> m >> n;
a[5][5] = m;
for ( k = 1; k <= n; k++ )
{
for ( i = 1; i <= 9; i++ )
{
for ( j = 1; j <= 9; j++ )
{
b[i][j] = a[i][j];
}
}
for ( i = 1; i <= 9; i++ )
{
for ( j = 1; j <= 9; j++ )
{
born( 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];
cout << endl;
}
return 0;
}
|
48 | 23732 | 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 | 23733 |
int main()
{
int grids[9][9] = {0}, daysLeft, history[81][3], historyCount = 0, x, y;
cin >> grids[4][4];
for (cin >> daysLeft; daysLeft > 0; daysLeft--)
{
historyCount = 0;
for (y = 0; y < 9; y++)
for (x = 0; x < 9; x++)
if (grids[x][y])
{
history[historyCount][0] = x;
history[historyCount][1] = y;
history[historyCount][2] = grids[x][y];
historyCount++;
};
for (int i = 0; i < historyCount; i++)
{
x = history[i][0];
y = history[i][1];
int val = history[i][2];
if (x > 0)
{
grids[x - 1][y] += val;
if (y > 0)
grids[x - 1][y - 1] += val;
if (y < 8)
grids[x - 1][y + 1] += val;
}
if (x < 8)
{
grids[x + 1][y] += val;
if (y > 0)
grids[x + 1][y - 1] += val;
if (y < 8)
grids[x + 1][y + 1] += val;
}
if (y > 0)
grids[x][y - 1] += val;
if (y < 8)
grids[x][y + 1] += val;
grids[x][y] += val;
}
}
for (y = 0; y < 9; y++)
{
cout << grids[0][y];
for (x = 1; x < 9; x++)
cout << ' ' << grids[x][y];
cout << endl;
}
return 0;
} |
48 | 23734 | 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 | 23735 | 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 | 23736 | /*
* 321.cpp
*
* Created on: 2011-1-9
* Author: jsgl
*/
int a[9][9];
int b[9][9];
void fanzhi(int n)
{ if(n==0) return;
int i,j;
for(i=0;i<9;i++){
for(j=0;j<9;j++){
if(a[i][j]!=0){
b[i][j]=b[i][j]+a[i][j]*2;
b[i][j+1]=b[i][j+1]+a[i][j];
b[i+1][j+1]=b[i+1][j+1]+a[i][j];
b[i-1][j+1]=b[i-1][j+1]+a[i][j];
b[i][j-1]=b[i][j-1]+a[i][j];
b[i-1][j-1]=b[i-1][j-1]+a[i][j];
b[i+1][j-1]=b[i+1][j-1]+a[i][j];
b[i+1][j]=b[i+1][j]+a[i][j];
b[i-1][j]=b[i-1][j]+a[i][j];
}
}
}
for(i=0;i<9;i++){
for(j=0;j<9;j++){
a[i][j]=b[i][j];
b[i][j]=0;
}
}
fanzhi(n-1);
}
int main(){
int i,j;
int m,n;
cin>>m;
cin>>n;
for(i=0;i<9;i++){
for(j=0;j<9;j++){
a[i][j]=0;
if(i==4&&j==4) a[i][j]=m;
b[i][j]=0;
}
}
fanzhi(n);
for(i=0;i<9;i++){
for(j=0;j<9;j++){
if(j!=8)
cout<<a[i][j]<<" ";
else cout<<a[i][j];
}
cout<<endl;
}
}
|
48 | 23737 | int main()
{
long int a[11][11] = {0}, b[11][11] = {0};
int m, n, i, j, k, p, q;
cin >> m >> n;
a[5][5] = m;
for (k = 1; k <= n; k++)
{
for (i = 0; i <= 10; i++)
for (j = 0; j <= 10; j++)
b[i][j] = a[i][j];
for (i = 5 - k; i <= 5 + k; i++)
for (j = 5 - k; j <= 5 + k; j++)
for(p = i - 1; p <= i + 1; p++)
for(q = j - 1; q <= j + 1; q++)
a[i][j] = a[i][j] + b[p][q];
}
for (i = 1; i <= 9; i++)
for(j = 1; j <= 9; j++)
{
if (j == 9)
cout << a[i][j] << endl;
else
cout << a[i][j] << " ";
}
return 0;
}
|
48 | 23738 | //********************************
//*??????????? **
//*?????? 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 | 23739 | int main()
{int a[11][11],b[11][11],m,n,i,j,k;
cin>>m>>n;
for(i=0;i<11;i++)
{for(j=0;j<11;j++)
{a[i][j]=0;
b[i][j]=0;}}
a[5][5]=m;
for(k=0;k<n;k++)
{for(i=1;i<10;i++)
{for(j=1;j<10;j++)
b[i][j]=a[i][j]+a[i-1][j-1]+a[i-1][j]+a[i-1][j+1]+a[i][j-1]+a[i][j]+a[i][j+1]+a[i+1][j-1]+a[i+1][j]+a[i+1][j+1];}
for(i=1;i<10;i++)
{for(j=1;j<10;j++)
a[i][j]=b[i][j];}}
for(i=1;i<10;i++)
{for(j=1;j<9;j++)
{cout<<a[i][j]<<" ";}
cout<<a[i][9]<<endl;}
return 0;} |
48 | 23740 |
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 | 23741 | int main()
{
int a[9][9]={0},b[9][9]={0};
int m,n,i,j,k;
scanf("%d%d",&m,&n);
a[4][4]=m;
for(k=0;k<n;k++)
{
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
b[i][j]+=2*a[i][j];
b[i-1][j]+=a[i][j];
b[i-1][j-1]+=a[i][j];
b[i-1][j+1]+=a[i][j];
b[i][j-1]+=a[i][j];
b[i][j+1]+=a[i][j];
b[i+1][j-1]+=a[i][j];
b[i+1][j+1]+=a[i][j];
b[i+1][j]+=a[i][j];
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
a[i][j]=b[i][j];
b[i][j]=0;
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(j==0)
printf("%d",a[i][j]);
else
printf(" %d",a[i][j]);
}
printf("\n");
}
return 0;
} |
48 | 23742 |
int main()
{
int a[5][11][11] = {0};
int m, n, i, j, k;
cin >> m >> n;
a[0][5][5] = m;
for(i = 1; i < n + 1; i++)
{
for(k = 1; k < 10; k++)
for(j = 1; j < 10; j++)
{
a[i][k][j] = a[i - 1][k][j] * 2 + a[i - 1][k - 1][j] + a[i - 1][k + 1][j] + a[i - 1][k][j + 1] + a[i - 1][k][j - 1] + a[i - 1][k + 1][j+1] + a[i - 1][k + 1][j -1] + a[i - 1][k - 1][j + 1] + a[i - 1][k - 1][j - 1];
}
}
for(i = 1; i < 10; i++)
{
cout << a[n][i][1];
for(j = 2; j < 10; j++)
cout << ' ' << a[n][i][j];
cout << endl;
}
return 0;
} |
48 | 23743 | int main()
{
int a[9][9],b[9][9]; //?????????????
int i=0,j=0,m=0,n=0,k=0,l=0;
cin>>m>>n;
for ( i=0;i<9;i++ )
{
for ( j=0;j<9;j++ )
{
a[i][j]=b[i][j]=0;
}
}
b[4][4]=m;
while ( k<n )
{
for ( i=0;i<9;i++ ) //???a????????
{
for ( j=0;j<9;j++ )
{
if (b[i][j]!=0)
{
a[i-1][j-1]=a[i-1][j-1]+b[i][j];
a[i-1][j]=a[i-1][j]+b[i][j];
a[i-1][j+1]=a[i-1][j+1]+b[i][j];
a[i][j-1]=a[i][j-1]+b[i][j];
a[i][j+1]=a[i][j+1]+b[i][j];
a[i+1][j-1]=a[i+1][j-1]+b[i][j];
a[i+1][j]=a[i+1][j]+b[i][j];
a[i+1][j+1]=a[i+1][j+1]+b[i][j];
}
}
}
for ( i=0;i<9;i++ ) //?b???????????
{
for ( j=0;j<9;j++ )
{
b[i][j]=2*b[i][j]+a[i][j];
a[i][j]=0; //???a????????
}
} //??b??????????????????
k++;
}
for ( i=0;i<9;i++ )
{
for ( j=0;j<9;j++ )
{
if ( j!=8 )
cout<<b[i][j]<<" ";
else if ( j==8 )
cout<<b[i][j]<<endl;
}
}
return 0;
} |
48 | 23744 | //????
int bac[5][11][11] = {0}; //bac???????n??i,j???????
void boom (int m,int n)
{
int i,j,d1,d2;
if (n == 0) //?n=0??????
bac[n][5][5] = m;
else //?n>1?????????
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]; //?n>1??????????
}
}
int main()
{
int m,n,i,j;
cin >> m >> n;
boom (m,n); //?????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;
}
return 0;
}
|
48 | 23745 | int a[9][9];
int b[9][9];
main()
{
int m,n,i,j,k;
scanf("%d %d",&m,&n);
a[4][4]=m;
for(i=1;i<=n;i++)
{
for(j=0;j<9;j++)
for(k=0;k<9;k++)
b[j][k]=a[j][k];
a[0][0]=2*b[0][0]+b[0][1]+b[1][0]+b[1][1];
a[0][8]=2*b[0][8]+b[0][7]+b[1][8]+b[1][7];
a[8][0]=2*b[8][0]+b[7][0]+b[8][1]+b[7][1];
a[8][8]=2*b[8][8]+b[8][7]+b[7][8]+b[7][7];
for(j=1;j<8;j++)
a[0][j]=2*b[0][j]+b[0][j-1]+b[0][j+1]+b[1][j]+b[1][j-1]+b[1][j+1];
for(j=1;j<8;j++)
a[8][j]=2*b[8][j]+b[8][j-1]+b[8][j+1]+b[7][j]+b[7][j-1]+b[7][j+1];
for(j=1;j<8;j++)
a[j][0]=2*b[j][0]+b[j-1][0]+b[j+1][0]+b[j][1]+b[j-1][1]+b[j+1][1];
for(j=1;j<8;j++)
a[j][8]=2*b[j][8]+b[j-1][8]+b[j+1][8]+b[j][7]+b[j-1][7]+b[j+1][7];
for(j=1;j<8;j++)
for(k=1;k<8;k++)
a[j][k]=2*b[j][k]+b[j-1][k]+b[j+1][k]+b[j][k-1]+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(i=0;i<9;i++)
for(j=0;j<9;j++)
{
if(j!=8)
printf("%d ",a[i][j]);
else
printf("%d\n",a[i][j]);
}
}
|
48 | 23746 | int main ()
{
int i, j, k, num, day;
int a[20][20] = {0};
int b[20][20] = {0};
int temp[20][20] = {0};
cin >> num >> day;
a[5][5] = num;
for ( k = 1; k <= day; k++ )
{
for ( i = 1; i <= 9; i++ )
{
for ( j = 1; j <= 9; j++ )
a[i][j]+= -b[i][j] ;
}
for ( i = 1; i <= 9; i++ )
{
for ( j = 1; j <= 9; j++ )
b[i][j] = a[i][j];
}
for ( i = 1; i <= 9; i++ )
{
for ( j = 1; j <= 9; j++ )
if ( a[i][j] != 0 )
{
temp[i+1][j]+= a[i][j];
temp[i-1][j]+= a[i][j];
temp[i+1][j+1]+= a[i][j];
temp[i-1][j+1]+= a[i][j];
temp[i+1][j-1]+= a[i][j];
temp[i-1][j-1]+= a[i][j];
temp[i][j+1]+= a[i][j];
temp[i][j-1]+= a[i][j];
temp[i][j]+= 2 * a[i][j];
}
}
for ( i = 1; i <= 9; i++ )
{
for ( j = 1; j <= 9; j++ )
a[i][j]+=temp[i][j], temp[i][j] = 0;
}
}
for ( i = 1; i <= 9; i++ )
{
for ( j = 1; j <= 9; j++ )
a[i][j]+= -b[i][j] ;
}
for ( i = 1; i <= 9; i++ )
{
for ( j = 1; j <= 8; j++ )
cout << a[i][j] << " ";
cout << a[i][9] << endl;
}
return 0;
} |
48 | 23747 | int map[2][12][12];
void Make(int,int,int);
int main()
{
int i,j;
int m,n,turn=0;
memset(map,0,sizeof(map));
map[0][5][5]=1;
map[1][5][5]=1;
cin>>m>>n;
for(;n>0;--n)
{
turn=1-turn;
for(i=0;i<12;++i)
{
for(j=0;j<12;++j)
{
map[1-turn][i][j]=0;
}
}
for(i=1;i<=9;++i)
{
for(j=1;j<=9;++j)
{
Make(i,j,turn);
}
}
}
for(i=1;i<=9;++i)
{
cout<<map[1-turn][i][1]*m;
for(j=2;j<=9;++j)
{
cout<<" "<<map[1-turn][i][j]*m;
}
cout<<endl;
}
return 0;
}
void Make(int x,int y,int t)
{
int n=map[t][x][y];
map[1-t][x][y]+=n*2;
map[1-t][x-1][y]+=n;
map[1-t][x+1][y]+=n;
map[1-t][x][y-1]+=n;
map[1-t][x][y+1]+=n;
map[1-t][x-1][y-1]+=n;
map[1-t][x-1][y+1]+=n;
map[1-t][x+1][y-1]+=n;
map[1-t][x+1][y+1]+=n;
return;
}
|
48 | 23748 | int main()
{
int a[9][9],b[9][9],i,j,k,m,n;
for(i=0;i<9;i++){
for(j=0;j<9;j++){
a[i][j]=0;
b[i][j]=0;
}
}
scanf("%d %d",&m,&n);
a[4][4]=m;
for(k=0;k<n;k++){
for(i=0;i<9;i++){
for(j=0;j<9;j++){
if(a[i][j]!=0){
b[i][j-1]+=a[i][j];
b[i][j+1]+=a[i][j];
b[i-1][j-1]+=a[i][j];
b[i-1][j]+=a[i][j];
b[i-1][j+1]+=a[i][j];
b[i+1][j-1]+=a[i][j];
b[i+1][j]+=a[i][j];
b[i+1][j+1]+=a[i][j];
b[i][j]+=a[i][j]*2;
}
}
}
for(i=0;i<9;i++){
for(j=0;j<9;j++){
a[i][j]=b[i][j];
b[i][j]=0;
}
}
}
for(i=0;i<9;i++){
for(j=0;j<8;j++){
printf("%d ",a[i][j]);
}
printf("%d\n",a[i][8]);
}
return 0;
}
|
48 | 23749 | 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 | 23750 |
void prop(int num1[11][11],int num2[11][11],int n)
{
int i,j;
if(n)
{
for(i=1;i<10;i++)for(j=1;j<10;j++)
num2[i][j]= num1[i-1][j-1]+num1[i-1][j]+num1[i-1][j+1]
+num1[i][j-1]+num1[i][j]*2+num1[i][j+1]
+num1[i+1][j-1]+num1[i+1][j]+num1[i+1][j+1];
prop(num2,num1,n-1);
}
}
main()
{
int m,n,num1[11][11]={0},num2[11][11]={0};
int i,j;
scanf("%d %d",&m,&n);
num1[5][5]=m;
prop(num1,num2,n);
if(n%2==0)
for(i=1;i<10;i++)
{
for(j=1;j<9;j++) printf("%d ",num1[i][j]);
printf("%d\n",num1[i][9]);
}
else
for(i=1;i<10;i++)
{
for(j=1;j<9;j++) printf("%d ",num2[i][j]);
printf("%d\n",num2[i][9]);
}
}
|
48 | 23751 | /**
*@file 2.cpp
*@author ???
*@date 2013-12-03
*@description ????????
*/
int a[11][11]={0}, b[11][11]={0}, m, n;
void xi(int n)
{
int i, j, p;
if(n==0)
a[5][5]=m;
else
{
xi(n-1);
p=0;
for(i=1; i<=9; i++)
{
for(j=1; j<=9; j++)
{
if(a[i][j]!=0)
{
p++;
}
}
}
p= sqrt(p)/2;
for(i=5-p; i<=5+p; i++)
{
for(j=5-p; j<=5+p; j++)
{
b[i][j]=a[i][j];
a[i][j]=a[i][j] * 2;
}
}
for(i=5-p; i<=5+p; i++)
{
for(j=5-p; j<=5+p; j++)
{
a[i-1][j]+=b[i][j];
a[i+1][j]+=b[i][j];
a[i][j+1]+=b[i][j];
a[i][j-1]+=b[i][j];
a[i-1][j+1]+=b[i][j];
a[i-1][j-1]+=b[i][j];
a[i+1][j+1]+=b[i][j];
a[i+1][j-1]+=b[i][j];
}
}
}
}
int main()
{
int i, j;
cin >> m >> n;
xi(n);
for(i=1; i<=9; i++)
{
for(j=1; j<=9; j++)
{
cout << a[i][j];
if(j<=8)
cout << " ";
}
cout << endl;
}
return 0;
} |
48 | 23752 | int m[L+5][L+5]={0},tmp[L+5][L+5]={0};
int i=0,j=0,k=0;
int n;
main()
{
scanf("%d%d",&m[4][4],&n);
for(k=1;k<=n;k++)
{
memset(tmp,0,sizeof(tmp));
for(i=0;i<=L-1;i++)
{
for(j=0;j<=L-1;j++)
{
tmp[i][j]=2*m[i][j]+m[i-1][j-1]+m[i][j-1]+m[i+1][j-1]+m[i+1][j]+m[i-1][j]+m[i+1][j+1]+m[i][j+1]+m[i-1][j+1];
}
}
for(i=0;i<=L-1;i++)
{
for(j=0;j<=L-1;j++)
{
m[i][j]=tmp[i][j];
}
}
}
for(i=0;i<=L-1;i++)
{
printf("%d %d %d %d %d %d %d %d %d\n",m[i][0],m[i][1],m[i][2],m[i][3],m[i][4],m[i][5],m[i][6],m[i][7],m[i][8]);
}
getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();getchar();
}
|
48 | 23753 | int main()
{int a[11][11],b[11][11];
int i,j,k,n,m;
scanf("%d %d",&m,&n);
for(i=0;i<11;i++)
for(j=0;j<11;j++)
a[i][j]=0;
a[5][5]=1;
for(k=0;k<n;k++)
{
for(i=1;i<10;i++)
for(j=1;j<10;j++)
b[i][j]=a[i+1][j-1]+a[i+1][j+1]+a[i+1][j]+a[i][j+1]+a[i][j-1]+2*a[i][j]+a[i-1][j-1]+a[i-1][j+1]+a[i-1][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==1)&&(i!=0))
printf("\n");
printf("%d",a[i][j]*m);
if(j!=9)
printf(" ");
}
}
getchar();
getchar();
} |
48 | 23754 |
const int N = 9;
int n,m;
int a[N+1][N+1];
void dfs(int x, int y, int s, int d)
{
if (x<1 || x>N || y<0 || y>N) return;
if (d==m)
{
a[x][y] += s;
return;
}
dfs(x,y,s*2,d+1);
for (int dx=-1;dx<=1;dx++)
for (int dy=-1;dy<=1;dy++)
if (dx!=0 || dy!=0)
dfs(x+dx,y+dy,s,d+1);
}
int main()
{
scanf("%d%d",&n,&m);
memset(a,0,sizeof a);
dfs(5,5,n,0);
for (int i=1;i<=N;i++)
{
for (int j=1;j<N;j++) printf("%d ",a[i][j]);
printf("%d\n",a[i][N]);
}
return 0;
}
|
48 | 23755 | //*********************
// ????????
// ??? 1300062709
// 2013.12.09
//*********************
int shu[9][9] = {0};
int aa[9][9] = {0};
int x,y;
int n, m, i, j;
void grems(int x, int y)
{
if ( x+1<9&&y+1<9&&x-1>=0&&y-1>=0)
{
shu[x+1][y+1] += aa[x][y];
shu[x+1][y] += aa[x][y];
shu[x+1][y-1] += aa[x][y];
shu[x][y+1] += aa[x][y];
shu[x][y-1] += aa[x][y];
shu[x-1][y] += aa[x][y];
shu[x-1][y+1] += aa[x][y];
shu[x-1][y-1] += aa[x][y];
}
shu[x][y] += 2 * aa[x][y];
}
int main()
{
cin >> m >> n;
aa[4][4]=m;
while(n!=0)
{
for ( i = 0 ; i < 9 ; i++ )
{
for ( j = 0 ; j < 9; j++ )
{
if(aa[i][j]>0)
grems(i,j);
}
}
for ( i = 0 ; i < 9 ; i++ )
{
for ( j = 0 ; j < 9; j++ )
{
aa[i][j] = shu[i][j];
}
}
if ( n > 0)
{
for ( i = 0 ; i < 9 ; i++ )
{
for ( j = 0 ; j < 9; j++ )
{
shu[i][j]=0;
}
}
}
n--;
}
for ( i = 0 ; i < 9 ; i++ )
{
for ( j = 0 ; j < 8 ; j++ )
cout << aa[i][j] << ' ' ;
cout << aa[i][8] << endl;
}
return 0;
} |
48 | 23756 | int area[11][11]={0};
void grow(int day)
{
int temp[11][11]={0};
for(int i=1;i<10;i++)
{
for(int j=1;j<10;j++)
{
temp[i-1][j]+=area[i][j]*1;
temp[i+1][j]+=area[i][j]*1;
temp[i][j-1]+=area[i][j]*1;
temp[i][j+1]+=area[i][j]*1;
temp[i+1][j+1]+=area[i][j]*1;
temp[i-1][j+1]+=area[i][j]*1;
temp[i+1][j-1]+=area[i][j]*1;
temp[i-1][j-1]+=area[i][j]*1;
temp[i][j]+=area[i][j]*2;
}
}
for(int i=1;i<10;i++)
{
for(int j=1;j<10;j++)
{
area[i][j]=temp[i][j];
}
}
day-=1;
if(day>0)
{
grow(day);
}
}
void print()
{
for(int i=1;i<10;i++)
{
for(int j=1;j<9;j++)
{
cout<<area[i][j]<<" ";
}
cout<<area[i][9]<<endl;
}
}
int main()
{
int start=0,day=0;
cin>>start>>day;
area[5][5]=start;
grow(day);
print();
return 0;
} |
48 | 23757 | int main()
{
int a[11][11],b[11][11],i,j,n,d,days,k,l;
for (i=0;i<=10;i++)
{
for (j=0;j<=10;j++)
{
a[i][j]=0;
b[i][j]=0;
}
}
cin>>n>>days;
a[5][5]=n;
for (d=1;d<=days;d++)
{
for (k=0;k<=10;k++)
for (l=0;l<=10;l++)
b[k][l]=0;
for (i=1;i<=9;i++)
{
for (j=1;j<=9;j++)
{
if (a[i][j]!=0)
{
b[i][j]=a[i-1][j-1]+a[i-1][j]+a[i-1][j+1]+a[i][j-1]+a[i][j+1]+a[i+1][j-1]+a[i+1][j]+a[i+1][j+1]+a[i][j]*2;
}
else
{
if (a[i][j]==0&&((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])!=0))
b[i][j]=a[i-1][j-1]+a[i-1][j]+a[i-1][j+1]+a[i][j-1]+a[i][j+1]+a[i+1][j-1]+a[i+1][j]+a[i+1][j+1];
}
}
}
for (k=1;k<=9;k++)
for (l=1;l<=9;l++)
a[k][l]=b[k][l];
}
for (i=1;i<=9;i++)
{
for (j=1;j<=8;j++)
{
cout<<a[i][j]<<" ";
}
cout<<a[i][9];
cout<<endl;
}
return 0;
}
|
48 | 23758 | 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 | 23759 | //????
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 | 23760 | int m, n;
int board[2][9][9] = {0};
void fanzhi(int k)
{
if(k == n)
{
return;
}
int s = k % 2;
int i, j;
for (i = 0; i < 9; i ++)
{
for (j = 0; j < 9; j ++)
{
board[1 - s][i - 1][j] += board[s][i][j];
board[1 - s][i + 1][j] += board[s][i][j];
board[1 - s][i][j - 1] += board[s][i][j];
board[1 - s][i][j + 1] += board[s][i][j];
board[1 - s][i + 1][j + 1] += board[s][i][j];
board[1 - s][i - 1][j + 1] += board[s][i][j];
board[1 - s][i + 1][j - 1] += board[s][i][j];
board[1 - s][i - 1][j - 1] += board[s][i][j];
board[1 - s][i][j] += board[s][i][j] * 2;
board[s][i][j] = 0;
}
}
fanzhi(k + 1);
return;
}
int main()
{
cin >> m;
cin >> n;
board[0][4][4] = m;
fanzhi(0);
int i, j;
int p = n % 2;
for (i = 0; i < 9; i ++)
{
int shou = 0;
for (j = 0; j < 9; j ++)
{
if(shou != 0)
{
cout << " ";
}
shou = 1;
cout << board[p][i][j];
}
cout << endl;
}
return 0;
} |
48 | 23761 |
//****************************************
//*???????? **
//*??? 1100012927 **
//*2011.11.29 **
//****************************************
int num[9][9];
void f(int, int, int, int);
int main()
{
int m, n, i, j;
for (i = 0; i < 9; i++)
for (j = 0; j < 9; j++)
num[i][j] = 0;
cin >> m >> n;
f(4, 4, m, n);
for (i = 0; i < 9; i++)
{
for (j = 0; j < 9; j++)
{
if (j < 8)
cout << num[i][j]<<" ";
else
cout << num[i][j];
}
cout << endl;
}
return 0;
}
void f(int i, int j, int m, int n)
{
int h, k;
if (n == 0)
num[i][j] += m;
else
for (h = i - 1; h <= i + 1; h++)
for (k = j - 1; k <= j + 1; k++)
{
if (k >= 0 && k < 10 && h >= 0 && h < 10)
{
if (h == i && k == j ) //??????????????
{
f(h, k, 2 * m, n - 1);
}
else //???????????
{
f(h, k, m, n - 1);
}
}
}
}
|
48 | 23762 | int main()
{
int m,n;
scanf("%d %d",&m,&n);
int germ[11][11]={0};
int a[11][11]={0};
int i,j,k,x;
germ[5][5]=m;
a[5][5]=m;
for(k=0;k<n;k++)
{
for(i=1;i<10;i++)
{
for(j=1;j<10;j++)
{
if(a[i][j]!=0)
{
germ[i-1][j-1]+=a[i][j];
germ[i-1][j]+=a[i][j];
germ[i-1][j+1]+=a[i][j];
germ[i][j-1]+=a[i][j];
germ[i][j+1]+=a[i][j];
germ[i+1][j-1]+=a[i][j];
germ[i+1][j]+=a[i][j];
germ[i+1][j+1]+=a[i][j];
germ[i][j]+=a[i][j];
}
}
}
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
a[i][j]=germ[i][j];
}
}
}
for(i=1;i<10;i++)
{
for(j=1;j<9;j++)
{
printf("%d ",germ[i][j]);
}
printf("%d\n",germ[i][9]);
}
}
|
48 | 23763 |
int bac[9][9] = {0};
void born(int x, int n)
{
if(x < n)
{
int i, j, k, l;
int a[9][9] = {0};
for(i = 4 - x; i <= 4 + x; i++)
for(j = 4 - x; j <= 4 + x; j++)
{
if(bac[i][j] != 0)
{
a[i][j] += bac[i][j];
for(k = i - 1; k <= i + 1; k++)
for(l = j - 1; l <= j + 1; l++)
{
a[k][l] += bac[i][j];
}
}
}
for(i = 0; i < 9; i++)
for(j = 0; j < 9; j++)
{
bac[i][j] = a[i][j];
}
born(x+1, n);
}
}
int main()
{
int m, n;
cin >> m >> n;
bac[4][4] = m;
born(0, n);
for(int i = 0; i < 9; i++)
for(int j = 0; j < 9; j++)
{
cout << bac[i][j];
if(j != 8)
cout << " ";
else
cout << endl;
}
return 0;
}
|
48 | 23764 | 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 | 23765 | //*****************************************
//* ?????(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 | 23766 | int main()
{
int a[9][9]={0},b[9][9]={0};
int i,j,k,m,n,fx,fy;
scanf("%d %d",&m,&n);
a[4][4]=m;
for(k=0;k<n;k++)
{
for(i=0;i<9;i++)
for(j=0;j<9;j++)
b[i][j]=0;
for(i=1;i<8;i++)
{
for(j=1;j<8;j++)
{
b[i][j]=b[i][j]+a[i][j];
for(fx=-1;fx<=1;fx++)
{
for(fy=-1;fy<=1;fy++)
{
b[i+fx][j+fy]=b[i+fx][j+fy]+a[i][j];
}
}
}
}
for(i=0;i<9;i++)
for(j=0;j<9;j++)
a[i][j]=b[i][j];
}
for(i=0;i<9;i++)
{
printf("%d",a[i][0]);
for(j=1;j<9;j++)
printf(" %d",a[i][j]);
printf("\n");
}
}
|
48 | 23767 | int main()
{
int a[5][11][11]={0},m,n,i,j,k,p,q;
scanf("%d%d", &m, &n);
a[0][5][5]=m;
for(k=1;k<=n;k++) 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++) a[k][i][j]+=a[k-1][p][q]; a[k][i][j]+=a[k-1][i][j];}
for(i=1;i<=9;i++)
{
for(j=1;j<=8;j++) printf("%d ", a[n][i][j]);
printf("%d\n", a[n][i][9]);
}
return 0;
}
|
48 | 23768 | //*************************
//*??:???????? **
//*??:??? 1300013007**
//*??:2013.12.6 **
//*************************
int bacteria[11][11] = {0}, flag[11][11] = {0}, add[11][11] = {0};
void reproduce(int x, int y)
{
if(x > 1) add[x-1][y] += (bacteria[x][y] / 2);
if(x < 9) add[x+1][y] += (bacteria[x][y] / 2);
if(y > 1) add[x][y-1] += (bacteria[x][y] / 2);
if(y < 9) add[x][y+1] += (bacteria[x][y] / 2);
if(x > 1 && y > 1) add[x-1][y-1] += (bacteria[x][y] / 2);
if(x < 9 && y < 9) add[x+1][y+1] += (bacteria[x][y] / 2);
if(x > 1 && y < 9) add[x-1][y+1] += (bacteria[x][y] / 2);
if(x < 9 && y > 1) add[x+1][y-1] += (bacteria[x][y] / 2);
}
int main()
{
int m, n;
int i, j, k;
cin >> m >> n; //m???????????,n???????
bacteria[5][5] = m;
for(i = 1; i <= n; i++)
{
for(j = 1; j <= 9; j++)
for(k = 1; k <= 9; k++)
if(bacteria[j][k] != 0)
{
flag[j][k] = 1;
bacteria[j][k] *= 2;
}
for(j = 1; j <= 9; j++)
for(k = 1; k <= 9; k++)
if(flag[j][k] != 0)
{
flag[j][k] = 0;
reproduce(j, k);
}
for(j = 1; j <= 9; j++)
for(k = 1; k <= 9; k++)
{
bacteria[j][k] += add[j][k];
add[j][k] = 0;
}
}
for(j = 1; j <= 9; j++)
for(k = 1; k <= 9; k++)
{
if(k == 1)
cout << bacteria[j][k];
else
{
cout << ' ' << bacteria[j][k];
if(k == 9)
cout << endl;
}
}
return 0;
} |
48 | 23769 | int main()
{
int s[9][9],s1[9][9],i=0,j=0,m=0,n=0,k=0;
for(i=0;i<=8;i++)//???
{
for(j=0;j<=8;j++)
{
s[i][j]=0;
s1[i][j]=0;
}
}
cin>>m>>n;
s[4][4]=m;
for(k=1;k<=n;k++)//??
{
for(i=1;i<=7;i++) //??
{
for(j=1;j<=7;j++)
{
if(s[i][j]!=0)
{
s1[i][j]+=2*s[i][j];
s1[i+1][j]+=s[i][j];
s1[i-1][j]+=s[i][j];
s1[i][j+1]+=s[i][j];
s1[i][j-1]+=s[i][j];
s1[i+1][j+1]+=s[i][j];
s1[i-1][j-1]+=s[i][j];
s1[i+1][j-1]+=s[i][j];
s1[i-1][j+1]+=s[i][j];
}
}
}
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
s[i][j]=s1[i][j];
}
}
for(i=0;i<=8;i++) //s1??
{
for(j=0;j<=8;j++)
{
s1[i][j]=0;
}
}
}
for(i=0;i<=8;i++)//??
{
for(j=0;j<=8;j++)
{
if(j==0)
{cout<<s[i][j];continue;}
if(j==8)
{cout<<" "<<s[i][j]<<endl;continue; }
cout<<" "<<s[i][j];
}
}
return 0;
} |
48 | 23770 | main()
{
int m,n,i,j,k;
scanf("%d %d",&m,&n);
int a[11][11],b[11][11];
for(i=0;i<11;i++)
for(j=0;j<11;j++)
a[i][j]=b[i][j]=0;
a[5][5]=b[5][5]=m;
for(k=0;k<n;k++)
{
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{
b[i][j]=2*a[i][j]+a[i-1][j]+a[i+1][j]+a[i-1][j-1]+a[i+1][j+1]+a[i+1][j-1]+a[i-1][j+1]+a[i][j-1]+a[i][j+1];
}
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{
a[i][j]=b[i][j];
}
}
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]);
}
}
getchar();getchar();
}
|
48 | 23771 |
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 | 23772 | 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 | 23773 | //**********************************
//* ????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 | 23774 | int main()
{
int a[100][11][11],i,j,num,days,day;
for(day=0;day<100;day++)
for(i=0;i<11;i++)
for(j=0;j<11;j++)
a[day][i][j]=0;
cin>>num>>days;
a[0][5][5]=num;
for(day=0;day<days;day++)
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
a[day+1][i][j]=(a[day][i-1][j-1]+a[day][i-1][j]+a[day][i-1][j+1]+
a[day][i][j-1]+a[day][i][j+1]+
a[day][i+1][j-1]+a[day][i+1][j]+a[day][i+1][j+1])+
2*a[day][i][j];
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{
if(j==9)
cout<<a[days][i][j]<<endl;
else
cout<<a[days][i][j]<<' ';
}
return 0;
} |
48 | 23775 | 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 | 23776 |
int cell[15][15] = {0};
void change()
{
int cell2[15][15] = {0};
for(int i = 1; i <= 9; i++)
for(int j = 1; j<= 9; j++)
{
if(cell[i][j] != 0)
{
int k = cell[i][j] * 2;
cell2[i][j] += k;
cell2[i - 1][j] += cell[i][j];
cell2[i + 1][j] += cell[i][j];
cell2[i][j + 1] += cell[i][j];
cell2[i][j - 1] += cell[i][j];
cell2[i - 1][j - 1] += cell[i][j];
cell2[i + 1][j - 1] += cell[i][j];
cell2[i - 1][j + 1] += cell[i][j];
cell2[i + 1][j + 1] += cell[i][j];
}
}
for(int i = 1; i <= 9; i++)
for(int j = 1; j <= 9; j++)
cell[i][j] = cell2[i][j];
}
int main() {
int m = 0, n = 0;
cin >> m >> n;
cell[5][5] = m;
for(int i = 0; i < n; i++)
change();
for(int i = 1; i <= 9; i++){
for(int j = 1; j < 9; j++)
cout << cell[i][j] << ' ';
cout << cell[i][9] << endl;
}
return 0;
} |
48 | 23777 | main()
{
int m,n,i,j,t;
scanf("%d %d",&m,&n);
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;}
a[4][4]=m;b[4][4]=m;
for(t=0;t<n;t++)
{
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++)
{
if(b[i][j]!=0)
{ a[i][j]=a[i][j]+2*b[i][j];
a[i+1][j]=a[i+1][j]+b[i][j];
a[i-1][j]=a[i-1][j]+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+1]+b[i][j];
a[i][j+1]=a[i][j+1]+b[i][j];
a[i-1][j-1]=a[i-1][j-1]+b[i][j];
a[i][j-1]=a[i][j-1]+b[i][j];
a[i+1][j-1]=a[i+1][j-1]+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==8)
{ printf("%d",a[i][j]);
printf("\n");
}
else
printf("%d ",a[i][j]);
}
}
|
48 | 23778 | 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 | 23779 | int main()
{
int m,n;
scanf("%d %d",&m,&n);
int a[9][9]={0},b[9][9]={0};
a[4][4]=m;
int i,j,k,fx,fy;
for(i=0;i<n;i++)
{
memset(b,0,sizeof(b));
for(j=1;j<8;j++)
{
for(k=1;k<8;k++)
{
b[j][k]+=a[j][k];
for(fx=-1;fx<=1;fx++)
for(fy=-1;fy<=1;fy++)
b[j+fx][k+fy]+=a[j][k];
}
}
memcpy(a,b,sizeof(a));
}
for(j=0;j<9;j++)
{
for(k=0;k<8;k++)
{
printf("%d ",a[j][k]);
}
printf("%d\n",a[j][8]);
}
return 0;
}
|
48 | 23780 | 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 | 23781 | main()
{
int real[9][9]={0};
int virtl[9][9]={0};
int m,n,i,j,k;
scanf("%d%d",&m,&n);
for(i=3;i<6;i++)
for(j=3;j<6;j++)
real[i][j]=m;
real[4][4]=2*m;
for(k=3;k>4-n;k--)
{
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
{
virtl[i][j]=real[i][j];
real[i][j]=0;
}
}
for(i=k;i<9-k;i++)
{
for(j=k;j<9-k;j++)
{
real[i][j]=real[i][j]+2*virtl[i][j];
real[i-1][j-1]+=virtl[i][j];
real[i-1][j]+=virtl[i][j];
real[i-1][j+1]+=virtl[i][j];
real[i][j-1]+=virtl[i][j];
real[i][j+1]+=virtl[i][j];
real[i+1][j-1]+=virtl[i][j];
real[i+1][j]+=virtl[i][j];
real[i+1][j+1]+=virtl[i][j];
}
}
}
for(i=0;i<9;i++)
{
for(j=0;j<8;j++)
printf("%d ",real[i][j]);
printf("%d\n",real[i][8]);
}
}
|
48 | 23782 | 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 | 23783 | 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 | 23784 |
int main()
{
int a[11][11]={0};
int b[11][11]={0};
int i,j,k,l,m,n,x,y;
scanf("%d %d",&m,&n);
a[5][5]=m;
b[5][5]=m;
for(i=1;i<=n;i++)
{
for(j=1;j<10;j++)
{
for(k=1;k<10;k++)
{
for(x=0-1;x<=1;x++)
{
for(y=0-1;y<=1;y++)
{
b[j][k]=b[j][k]+a[j+x][k+y];
}
}
}
}
for(j=1;j<10;j++)
{
for(k=1;k<10;k++)
{
a[j][k]=b[j][k];
}
}
}
for(j=1;j<10;j++)
{
for(k=1;k<9;k++)
{
printf("%d ",a[j][k]);
}
printf("%d\n",a[j][9]);
}
} |
48 | 23785 | 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 | 23786 |
int main()
{
int m, n;
int a[9][9] = {0}, b[9][9] = {0};
cin >> m >> n;
a[4][4] = m;
for(int i = 1; i <= n; i++)
{
for(int j = 0; j < 9; j++)
{
for(int k = 0; k < 9; k++)
{
if(a[j][k])
{
b[j][k] += 2 * a[j][k];
b[j][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 - 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];
}
}
}
for(int j = 0; j <= 8; j++)
{
for(int k = 0; k <= 8; k++)
{
a[j][k] = b[j][k];
}
}
memset(b, 0, sizeof(b));
}
for(int i = 0; i < 9; i++)
{
for(int j = 0; j < 8; j++)
{
cout << a[i][j] << " ";
}
cout << a[i][8] << "\n";
}
return 0;
} |
48 | 23787 |
int main ()
{
const int sz=9;
int a[sz][sz],b[sz][sz];
int i,j,k,m,n,fx,fy;
scanf("%d%d",&m,&n);
memset(a,0,sizeof(a));
a[sz/2][sz/2]=m;
for(k=0;k<n;k++)
{
memset(b,0,sizeof(b));
for(i=1;i<sz-1;i++)
{
for(j=1;j<sz-1;j++)
{
b[i][j]+=a[i][j];
for(fx=-1;fx<=1;fx++)
{
for(fy=-1;fy<=1;fy++)
b[i+fx][j+fy]+=a[i][j];
}
}
}
memcpy(a,b,sizeof(a));
}
for(i=0;i<sz;i++)
{
for(j=0;j<sz-1;j++)
printf("%d ",a[i][j]);
printf("%d\n",a[i][sz-1]);
}
return 0;
} |
48 | 23788 | int main()
{
int m,n,i,p,q;
int a[11][11]={0};
int b[11][11];
scanf("%d %d",&m,&n);
a[5][5]=m;
for (i=0;i<n;i++)
{
for (p=0;p<11;p++)
{
for (q=0;q<11;q++)
b[p][q]=a[p][q];
}
for (p=1;p<10;p++)
{
for (q=1;q<10;q++)
a[p][q]=2*b[p][q]+b[p-1][q]+b[p-1][q-1]+b[p][q-1]+b[p+1][q]+b[p][q+1]+b[p+1][q+1]+b[p+1][q-1]+b[p-1][q+1];
}
}
for (p=1;p<10;p++)
{
for (q=1;q<10;q++)
{
if (q<9)
printf ("%d ",a[p][q]);
if (q==9)
printf ("%d\n",a[p][q]);
}
}
}
|
48 | 23789 | int main ()
{
int day[5][9][9]={0};
int n;
cin>>day[0][4][4]>>n;
int a[3]={-1,0,1};
int b[3]={-1,0,1};
for (int d=1;d<=4;d++)
{
for (int i=0;i<9;i++)
for (int j=0;j<9;j++)
{
if (day[d-1][i][j]!=0)
{
for (int p=0;p<3;p++)
for (int q=0;q<3;q++)
day[d][i+a[p]][j+b[q]]+=day[d-1][i][j];
day[d][i][j]+=day[d-1][i][j];
}
}
}
for (int i=0;i<9;i++)
{
for (int j=0;j<9;j++)
{
if (j!=0) cout<<" ";
cout<<day[n][i][j];
}
cout<<endl;
}
return 0;
} |
48 | 23790 | int a[10][10];
void does(int,int,int);
int main()
{
memset(a,0,sizeof(a) );
a[5][5]=1;
int n,m;
int i,j;
cin >> m >> n;
does(5,5,n);
for(i=1;i<=9;i++)
for(j=1;j<=9;j++)
{
if(j<9)
cout << m*a[i][j] << ' ';
else
cout << m*a[i][j] << endl;
}
return 0;
}
void does (int i,int j,int n )
{
if( n>0 )
{
int b;
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]++;
does(i,j,n-1);
does(i,j,n-1);
does(i,j+1,n-1);
does(i,j-1,n-1);
does(i+1,j,n-1);
does(i-1,j,n-1);
does(i-1,j-1,n-1);
does(i-1,j+1,n-1);
does(i+1,j-1,n-1);
does(i+1,j+1,n-1);
}
} |
48 | 23791 | int main()
{
int i,j,m,n,k;
scanf("%d%d",&m,&n);
int xj[50][9]={0};
xj[4][4]=m;
for(k=1;k<=n;k++)
{
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
xj[i+k*9][j]+=xj[i+(k-1)*9][j]*2;
xj[i-1+k*9][j-1]+=xj[i+(k-1)*9][j];
xj[i-1+k*9][j]+=xj[i+(k-1)*9][j];
xj[i-1+k*9][j+1]+=xj[i+(k-1)*9][j];
xj[i+k*9][j-1]+=xj[i+(k-1)*9][j];
xj[i+k*9][j+1]+=xj[i+(k-1)*9][j];
xj[i+1+k*9][j-1]+=xj[i+(k-1)*9][j];
xj[i+1+k*9][j]+=xj[i+(k-1)*9][j];
xj[i+1+k*9][j+1]+=xj[i+(k-1)*9][j];
}
}
}
for(i=0;i<9;i++)
{
printf("%d %d %d %d %d %d %d %d %d\n",xj[i+9*n][0],xj[i+9*n][1],xj[i+9*n][2],xj[i+9*n][3],xj[i+9*n][4],xj[i+9*n][5],xj[i+9*n][6],xj[i+9*n][7],xj[i+9*n][8]);
}
return 0;
}
|
48 | 23792 | int main()
{
int n, m, i, j, a[9][9], b[9][9];
cin>>n>>m;
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
a[i][j] = 0;
}
}
int ave, k, x, y;
a[4][4] = n;
for(k = 0; k < m; k++)
{
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
b[i][j] = 0;
}
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
if(a[i][j] != 0)
{
int num = a[i][j];
a[i][j] = 2 * num;
ave = num;
for(x = i - 1; x <= i + 1; x++)
{
for(y = j - 1; y <= j + 1; y++)
{
if(x == i && y == j)
continue;
b[x][y] = b[x][y] + ave;
}
}
}
}
}
for(i = 0; i < 9; i++)
{
for(j = 0; j < 9; j++)
{
a[i][j] = a[i][j] + b[i][j];
}
}
}
for(i = 0; i < 9; i++)
{
for(j = 0; j < 8; j++)
cout<<a[i][j]<<" ";
cout<<a[i][8]<<endl;
}
return 0;
}
|
48 | 23793 | 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 | 23794 | main()
{ int a[10][10],b[10][10];
int i,j,k,m,n,p,q;
scanf("%d%d",&m,&n);
for (i=1;i<=9;i++)
for (j=1;j<=9;j++)
a[i][j]=0;
a[5][5]=m;
/*for (j=1;j<=9;j++)
{
for (k=1;k<=9;k++) printf("%d ",a[j][k]);
printf("\n");}
printf("\n");*/
for (i=1;i<=n;i++)
{for (j=1;j<=9;j++)
for (k=1;k<=9;k++)
b[j][k]=0;
for (j=1;j<=9;j++)
for (k=1;k<=9;k++)
{ b[j][k]=b[j][k]+2*a[j][k];
for (p=-1;p<=1;p++)
for (q=-1;q<=1;q++)
if ((p!=0)||(q!=0)) b[j+p][k+q]=b[j+p][k+q]+a[j][k];
}
for (j=1;j<=9;j++)
for (k=1;k<=9;k++)
a[j][k]=b[j][k];
}
for (j=1;j<=9;j++)
{
for (k=1;k<=9;k++)
{printf("%d",a[j][k]); if (k<9) printf(" ");}
printf("\n");}
}
|
48 | 23795 | 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 | 23796 | 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 | 23797 | // lp.cpp : Defines the entry point for the console application.
//
// ??????.cpp : Defines the entry point for the console application.
//
int a[10][10],b[10][10]={0};
int n,m;
void f(int a[10][10])
{
int i,j;
while(n>0)
{
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
b[i-1][j-1]+=a[i][j];
b[i][j-1]+=a[i][j];
b[i+1][j-1]+=a[i][j];
b[i-1][j]+=a[i][j];
b[i][j]+=a[i][j]*2;
b[i+1][j]+=a[i][j];
b[i-1][j+1]+=a[i][j];
b[i][j+1]+=a[i][j];
b[i+1][j+1]+=a[i][j];
}
}
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
a[i][j]=b[i][j];
b[i][j]=0;
}
}
n--;
}
}
int main()
{
int i,j;
cin>>m>>n;
memset(a,0,100);
a[4][4]=m;
f(a);
for(i=0;i<9;i++)
for(j=0;j<9;j++)
{
if(j<8)
cout<<a[i][j]<<' ';
else
{
cout<<a[i][j]<<endl;
}
}
return 0;
} |
48 | 23798 | int main()
{
int m,n,i,j,k;
scanf("%d %d",&m,&n);
int a[9][9];
int b[9][9];
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
a[i][j]=0;
b[i][j]=0;
}
}
a[4][4]=m;
for(k=1;k<=n;k++)
{
for(i=5-k;i<=3+k;i++)
{
for(j=5-k;j<=3+k;j++)
{
b[i][j]+=2*a[i][j];
b[i-1][j-1]+=a[i][j];
b[i-1][j]+=a[i][j];
b[i-1][j+1]+=a[i][j];
b[i][j-1]+=a[i][j];
b[i][j+1]+=a[i][j];
b[i+1][j-1]+=a[i][j];
b[i+1][j]+=a[i][j];
b[i+1][j+1]+=a[i][j];
}
}
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
a[i][j]=b[i][j];
b[i][j]=0;
}
}
}
for(i=0;i<=8;i++)
{
for(j=0;j<=8;j++)
{
printf("%d",a[i][j]);
if(j<8) printf(" ");
}
if(i<8) printf("\n");
}
return 0;
}
|
48 | 23799 |
int main()
{
int result[SCALE][SCALE]={{0}}; //??
int temp[SCALE][SCALE]={{0}}; //??
int i,j;
int day;
int m,n;
int x,y;
scanf("%d %d",&m,&n); //??
result[SCALE/2][SCALE/2]=m; //????????
for(day=0;day<n;day++) //????????
{
memset(temp,0,sizeof(temp)); //??????????
for(i=0;i<SCALE;i++)
{
for(j=0;j<SCALE;j++)
{
temp[i][j]+=result[i][j];
//???????????
for(x=-1;x<=1;x++)
{
for(y=-1;y<=1;y++) //???+1????+1
{
if((i+x>=0)&&(i+x<SCALE)&&(j+y>=0)&&(j+y<SCALE))
temp[i+x][j+y]+=result[i][j];
}
}
}
}
memcpy(result,temp,sizeof(result));
}
for(i=0;i<SCALE;i++)
{
for(j=0;j<SCALE-1;j++)
{
printf("%d ",result[i][j]);
}
printf("%d\n",result[i][SCALE-1]);
}
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.