Guest User

Minesweeper

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