Advertisement
Guest User

Untitled

a guest
Jan 23rd, 2017
120
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 4.36 KB | None | 0 0
  1. // number 1
  2.  
  3. package annoy1;
  4.  
  5. import java.util.Scanner;
  6.  
  7. public class MajickSquares
  8. {
  9.  
  10. public static void main(String[] args)
  11. {
  12.  
  13. Scanner in = new Scanner(System.in);
  14. boolean truth = false;
  15. int[][] square = new int[4][4];
  16. for (int i = 0; i < 4; i++)
  17. {
  18.  
  19. for (int j = 0; j < 4; j++)
  20. {
  21.  
  22. System.out.println("Please enter a whole number.");
  23. square[i][j] = in.nextInt();
  24.  
  25. }
  26.  
  27. }
  28.  
  29. int upRow = square[0][0] + square[0][1] + square[0][2] + square[0][3];
  30. int upMidRow = square[1][0] + square[1][1] + square[1][2] + square[1][3];
  31. int lowMidRow = square[2][0] + square[2][1] + square[2][2] + square[2][3];
  32. int lowRow = square[3][0] + square[3][1] + square[3][2] + square[3][3];
  33. int leftColu = square[0][0] + square[1][0] + square[2][0] + square[3][0];
  34. int leftMidColu = square[0][1] + square[1][1] + square[2][1] + square[3][1];
  35. int rightMidColu = square[0][2] + square[1][2] + square[2][2] + square[3][2];
  36. int rightColu = square[0][3] + square[1][3] + square[2][3] + square[3][3];
  37. int leftDag = square[0][0] + square[1][1] + square[2][2] + square[3][3];
  38. int rightDag = square[0][3] + square[1][2] + square[2][1] + square[3][0];
  39. if (upRow == upMidRow)
  40. {
  41.  
  42. if (upMidRow == lowMidRow)
  43. {
  44.  
  45. if (lowMidRow == lowRow)
  46. {
  47.  
  48. if (lowRow == leftColu)
  49. {
  50.  
  51. if (leftColu == leftMidColu)
  52. {
  53.  
  54. if (leftMidColu == rightMidColu)
  55. {
  56.  
  57. if (rightMidColu == rightColu)
  58. {
  59.  
  60. if (rightColu == leftDag)
  61. {
  62.  
  63. if (leftDag == rightDag)
  64. {
  65.  
  66. truth = true;
  67.  
  68. }
  69.  
  70. else
  71. {
  72.  
  73. truth = false;
  74.  
  75. }
  76.  
  77. }
  78.  
  79. else
  80. {
  81.  
  82. truth = false;
  83.  
  84. }
  85.  
  86. }
  87.  
  88. else
  89. {
  90.  
  91. truth = false;
  92.  
  93. }
  94.  
  95. }
  96.  
  97. else
  98. {
  99.  
  100. truth = false;
  101.  
  102. }
  103.  
  104. }
  105.  
  106. else
  107. {
  108.  
  109. truth = false;
  110.  
  111. }
  112.  
  113. }
  114.  
  115. else
  116. {
  117.  
  118. truth = false;
  119.  
  120. }
  121.  
  122. }
  123.  
  124. else
  125. {
  126.  
  127. truth = false;
  128.  
  129. }
  130.  
  131. }
  132.  
  133. else
  134. {
  135.  
  136. truth = false;
  137.  
  138. }
  139.  
  140. }
  141.  
  142. else
  143. {
  144.  
  145. truth = false;
  146.  
  147. }
  148.  
  149. if (truth == true)
  150.  
  151. {
  152.  
  153. System.out.println("You are a true master of Majicks!!!");
  154.  
  155. }
  156.  
  157. else if (truth == false)
  158. {
  159.  
  160. System.out.println("You are a pathetic runt! Begone!!!");
  161.  
  162. }
  163.  
  164. in.close();
  165.  
  166. }
  167.  
  168. }
  169.  
  170.  
  171. //number 2
  172.  
  173. package annoy1;
  174.  
  175. import java.util.Scanner;
  176.  
  177. public class Asterisk
  178. {
  179.  
  180. public static void main(String[] args)
  181. {
  182.  
  183. Scanner in = new Scanner(System.in);
  184. int[][] aster = new int[2][4];
  185. for (int i = 0; i < 4; i++)
  186. {
  187.  
  188. aster[0][i] = in.nextInt();
  189.  
  190. }
  191.  
  192. int max = aster[0][0];
  193. for (int j = 0; j < 3; j++)
  194. {
  195.  
  196. if (aster[0][j] > max)
  197. {
  198.  
  199. max = aster[0][j];
  200.  
  201. }
  202.  
  203. }
  204.  
  205. double decide = 40 / max;
  206. int resul1 = (int) (aster[0][0] * decide);
  207. int resul2 = (int) (aster[0][1] * decide);
  208. int resul3 = (int) (aster[0][2] * decide);
  209. int resul4 = (int) (aster[0][3] * decide);
  210. aster[1][0] = resul1;
  211. aster[1][1] = resul2;
  212. aster[1][2] = resul3;
  213. aster[1][3] = resul4;
  214. if (aster[0][0] == max)
  215. {
  216.  
  217. aster[1][0] = 40;
  218.  
  219. }
  220.  
  221. if (aster[0][1] == max)
  222. {
  223.  
  224. aster[1][1] = 40;
  225.  
  226. }
  227.  
  228. if (aster[0][2] == max)
  229. {
  230.  
  231. aster[1][2] = 40;
  232.  
  233. }
  234.  
  235. if (aster[0][3] == max)
  236. {
  237.  
  238. aster[1][3] = 40;
  239.  
  240. }
  241.  
  242. System.out.println(aster[0][0]);
  243. for (int a = 1; a < aster[1][0]; a++)
  244. {
  245.  
  246. System.out.println("*");
  247.  
  248. }
  249.  
  250. System.out.println(aster[0][1]);
  251. for (int b = 1; b < aster[1][1]; b++)
  252. {
  253.  
  254. System.out.println("*");
  255.  
  256. }
  257.  
  258. System.out.println(aster[0][2]);
  259. for (int c = 1; c < aster[1][2]; c++)
  260. {
  261.  
  262. System.out.println("*");
  263.  
  264. }
  265.  
  266. System.out.println(aster[0][3]);
  267. for (int d = 1; d < aster[1][3]; d++)
  268. {
  269.  
  270. System.out.println("*");
  271.  
  272. }
  273.  
  274. in.close();
  275.  
  276. }
  277.  
  278. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement