Advertisement
Guest User

Minesweeper

a guest
May 27th, 2016
59
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.89 KB | None | 0 0
  1. #include <stdio.h>
  2.  
  3. int main() {
  4. int i,j,n,m,br=0;
  5. char a[100][100],b[100][100];
  6. scanf("%d%d",&n,&m);
  7. for(i=0; i<n; i++) {
  8. for(j=0; j<m; j++) {
  9. scanf("%c",&a[i][j]);
  10. }
  11. }
  12. for(i=0; i<n; i++) {
  13. for(j=0; j<m; j++) {
  14. if(a[i][j]=='1')
  15. {
  16. b[i][j] = '*';
  17. }
  18.  
  19. else {
  20. if(i>0) //ima sosed gore
  21. {
  22. if(a[i-1][j]=='1')
  23. br++;
  24. }
  25. if(i<n-1) //ima sosed dolu
  26. {
  27. if(a[i+1][j]=='1')
  28. br++;
  29. }
  30. if(j>0) //ima sosed levo
  31. {
  32. if(a[i][j-1]=='1')
  33. br++;
  34. }
  35. if(j<m-1) //ima sosed desno
  36. {
  37. if(a[i][j+1]=='1')
  38. br++;
  39. }
  40. if(i>0&&j>0) //ima sosed gore - levo
  41. {
  42. if(a[i-1][j-1]=='1')
  43. br++;
  44. }
  45. if(i>0 && j<m-1) //ima sosed gore -desno
  46. {
  47. if(a[i-1][j+1]=='1')
  48. br++;
  49. }
  50. if(i<n-1 && j<m-1) //ima sosed dolu - desno
  51. {
  52. if(a[i+1][j+1]=='1')
  53. br++;
  54. }
  55. if(i<n-1 && j<0) //ima sosed dolu levo
  56. {
  57. if(a[i+1][j-1]=='1')
  58. br++;
  59. }
  60. b[i][j] = br+'0';
  61. }
  62. br=0;
  63.  
  64. }
  65. }
  66. for(i=0;i<n;i++)
  67. {
  68. for(j=0;j<m;j++)
  69. {
  70. printf("%c ",b[i][j]);
  71. }
  72. printf("\n");
  73. }
  74. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement