#include <iostream>
using namespace std;
int main()
{
int m,n,i,j,c,a=1;
cin >> m >> n;
while(1)
{
if(m==0 && n==0)
break;
char str[m+1][n+1];
for(i=1; i<=m; i++)
for(j=1; j<=n; j++)
cin >> str[i][j];
cout << "Field #" << a++ <<":\n";
for(i=1; i<=m; i++)
{
for(j=1; j<=n; j++)
{
if(str[i][j]=='*')
{
cout << "*";
continue;
}
c=0;
if(i-1>0 && j-1>0)
if(str[i-1][j-1]== '*')
c++;
if(i-1>0)
if(str[i-1][j]== '*')
c++;
if(i-1>0 && j+1<=n)
if(str[i-1][j+1]== '*')
c++;
if(j-1>0)
if(str[i][j-1]== '*')
c++;
if(j+1<=n)
if(str[i][j+1]== '*')
c++;
if(i+1<=m && j-1>0)
if(str[i+1][j-1]== '*')
c++;
if(i+1<=m )
if(str[i+1][j]== '*')
c++;
if(i+1<= m && j+1<=n)
if(str[i+1][j+1]== '*')
c++;
cout << c ;
}
cout << endl;
}
cin >> m >> n;
if(m!=0 && n!=0)
cout << endl;
}
return 0;
}
Tuesday, May 27, 2014
10189 - Minesweeper
10035 - Primary Arithmetic
#include <cstdio>
using namespace std;
int main()
{
unsigned long int m,n;
int c,d;
while(1)
{
scanf("%lu%lu",&m,&n);
if(m==0&&n==0)
break;
c=0;
d=0;
while(1)
{
if((m%10+n%10+d) >= 10)
{
c++;
d=1;
}
else
d=0;
m/=10;
n/=10;
if(m<10&&n<10)
{
if((m+n+d) >= 10)
c++;
break;
}
}
if(c==0)
printf("No carry operation.");
else if(c==1)
printf("1 carry operation.");
else
printf("%d carry operations.",c);
printf("\n");
}
return 0;
}
Subscribe to:
Posts (Atom)
Triathlon
Triathlon - CodeChef # include < bits/stdc++.h > using namespace std ; # define fi first # define se second # define mp ...
-
# include < bits/stdc++.h > using namespace std ; int main ( ) { int T , c = 1 ; double r1 , r2 , h , p ; // ...
-
# include < bits/stdc++.h > using namespace std ; int main ( ) { long long T , S , l , n , c = 1 ; // freopen(&qu...
-
# include < bits/stdc++.h > using namespace std ; int main ( ) { int T , n , p , q , c = 1 , i , w , t , arry [ 50 ] ; ...