Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- char array[110][110];
- long long int num[150][150];
- int main()
- {
- int n,m,i,j,k,t;
- t=1;
- while(scanf("%d %d",&n,&m)&&(!(m==0&&n==0)))
- {
- i=0;
- while(i<n)
- {
- j=0;
- while(j<=m)
- {
- scanf("%c",&array[i][j]);
- j++;
- }
- i++;
- }
- i=0;
- while(i<n)
- {
- j=0;
- while(j<=m)
- {
- num[i][j]=0;
- j++;
- }
- i++;
- }
- printf("Field #%d:\n",t);
- for(i=0;i<n;i++)
- {
- for(j=1;j<=m;j++)
- {
- if(array[i][j]=='*')
- {
- num[i][j]=array[i][j];
- if(i==0)
- {
- if(j==1)
- {
- num[i][j+1]++;
- num[i+1][j]++;
- num[i+1][j+1]++;
- }
- else if(j==m)
- {
- num[i][j-1]++;
- num[i+1][j-1]++;
- num[i+1][j]++;
- }
- else
- {
- num[i-1][j-1]++;
- num[i-1][j]++;
- num[i-1][j+1]++;
- num[i][j-1]++;
- num[i][j+1]++;
- num[i+1][j-1]++;
- num[i+1][j]++;
- num[i+1][j+1]++;
- }
- }
- else if(i==n-1)
- {
- if(j==1)
- {
- num[i][j+1]++;
- num[i-1][j]++;
- num[i-1][j+1]++;
- }
- else if(j==m)
- {
- num[i][j-1]++;
- num[i-1][j-1]++;
- num[i-1][j]++;
- }
- else
- {
- num[i-1][j-1]++;
- num[i-1][j]++;
- num[i-1][j+1]++;
- num[i][j-1]++;
- num[i][j+1]++;
- num[i+1][j-1]++;
- num[i+1][j]++;
- num[i+1][j+1]++;
- }
- }
- else
- {
- if(j==1)
- {
- num[i][j+1]++;
- num[i-1][j]++;
- num[i-1][j+1]++;
- num[i+1][j]++;
- num[i+1][j+1]++;
- }
- else if(j==m)
- {
- num[i][j-1]++;
- num[i-1][j-1]++;
- num[i-1][j]++;
- num[i+1][j-1]++;
- num[i+1][j]++;
- }
- else
- {
- num[i-1][j-1]++;
- num[i-1][j]++;
- num[i-1][j+1]++;
- num[i][j-1]++;
- num[i][j+1]++;
- num[i+1][j-1]++;
- num[i+1][j]++;
- num[i+1][j+1]++;
- }
- }
- }
- }
- }
- i=0;
- while(i<n)
- {
- j=1;
- while(j<=m)
- {
- if(array[i][j]=='*') printf("%c",array[i][j]);
- else printf("%lld",num[i][j]);
- j++;
- }
- printf("\n");
- i++;
- }
- printf("\n");
- t++;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement