Advertisement
Guest User

dd

a guest
Apr 22nd, 2019
81
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.78 KB | None | 0 0
  1. package Tt;
  2.  
  3. import java.util.Scanner;
  4.  
  5. public class Tetirs {
  6. public static void main(String[] args) {
  7. int arr[] = new int[100];
  8. int j = 0;
  9. int i = 0;
  10. int n = 0;
  11. int botton = 0;
  12. int dumi = 0;
  13. arr[4] = 1;
  14. arr[5] = 1;
  15. arr[6] = 1;
  16. arr[14] = 1;
  17. Scanner sc = new Scanner(System.in);
  18.  
  19. while (botton == 0) {
  20. System.out.println("!!");
  21. while (n < arr.length) {
  22. System.out.print(arr[n]);
  23. if (n % 10 == 9 && n != 0) {
  24. System.out.println();
  25. }
  26. n += 1;
  27. } // 그래픽 출력.
  28. System.out.println("1.오른쪽 2.왼쪽 3.위쪽 4.아래쪽");
  29. int sel = sc.nextInt();
  30. if (sel == 1) {
  31. dumi = 0;
  32. i = 0;
  33. while (i < arr.length) {
  34. if (arr[i] == 1) {
  35. if (i % 10 == 9) {
  36. System.out.println("~~");
  37. break;
  38. } else {
  39. arr[i + 1] = arr[i];
  40. arr[i] = dumi;
  41. System.out.println("^^");
  42.  
  43. }
  44.  
  45. }
  46. i += i;
  47. }
  48. };
  49. if (sel == 2) {
  50. dumi = 0;
  51. i = 0;
  52. while (i < arr.length) {
  53. if (arr[i] == 1) {
  54. if (i % 10 == 0 && i == 0) {
  55. break;
  56. } else {
  57. arr[i - 1] = arr[i];
  58. arr[i] = dumi;
  59.  
  60. }
  61. }
  62. i += i;
  63. }
  64. };
  65. if (sel == 3) {
  66. dumi = 0;
  67. i = 0;
  68. while (i < arr.length) {
  69. if (arr[i] == 1) {
  70. if (i < 10) {
  71. break;
  72. } else {
  73. arr[i - 10] = arr[i];
  74. arr[i] = dumi;
  75.  
  76. }
  77. }
  78. i += i;
  79. }
  80. };
  81. if (sel == 4) {
  82. dumi = 0;
  83. i = 0;
  84. while (i < arr.length) {
  85. if (arr[i] == 1) {
  86. if (i > 89) {
  87. break;
  88. } else {
  89. arr[i + 10] = arr[i];
  90. arr[i] = dumi;
  91.  
  92. }
  93. }
  94. i += i;
  95. }
  96. };
  97.  
  98. } // 제일 바깥 while
  99. sc.close();}
  100. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement