Advertisement
Guest User

Untitled

a guest
Feb 19th, 2019
93
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 9.56 KB | None | 0 0
  1. Bingo.java:176: ']' expected
  2. private static void makeCard(int[][] card, int[picks])
  3. ^
  4. Bingo.java:176: ')' expected
  5. private static void makeCard(int[][] card, int[picks])
  6. ^
  7. Bingo.java:176: illegal start of type
  8. private static void makeCard(int[][] card, int[picks])
  9. ^
  10. Bingo.java:176: <identifier> expected
  11. private static void makeCard(int[][] card, int[picks])
  12. ^
  13. Bingo.java:177: ';' expected
  14. {
  15. ^
  16. Bingo.java:178: illegal start of type
  17. System.out.println("Current Number Picks: n");
  18. ^
  19. Bingo.java:178: ';' expected
  20. System.out.println("Current Number Picks: n");
  21. ^
  22. Bingo.java:178: invalid method declaration; return type required
  23. System.out.println("Current Number Picks: n");
  24. ^
  25. Bingo.java:178: illegal start of type
  26. System.out.println("Current Number Picks: n");
  27. ^
  28. Bingo.java:181: illegal start of type
  29. for (int i=0; i<count; i++){
  30. ^
  31. Bingo.java:181: ')' expected
  32. for (int i=0; i<count; i++){
  33. ^
  34. Bingo.java:181: illegal start of type
  35. for (int i=0; i<count; i++){
  36. ^
  37. Bingo.java:181: <identifier> expected
  38. for (int i=0; i<count; i++){
  39. ^
  40. Bingo.java:181: ';' expected
  41. for (int i=0; i<count; i++){
  42. ^
  43. Bingo.java:181: > expected
  44. for (int i=0; i<count; i++){
  45. ^
  46. Bingo.java:181: '(' expected
  47. for (int i=0; i<count; i++){
  48. ^
  49. Bingo.java:189: class, interface, or enum expected
  50. private static void announceWin(int winFound, int numPicks)
  51. ^
  52. Bingo.java:192: class, interface, or enum expected
  53. }
  54. ^
  55. Bingo.java:196: class, interface, or enum expected
  56. for (int i = 0; i < numPicks; i++){
  57. ^
  58. Bingo.java:196: class, interface, or enum expected
  59. for (int i = 0; i < numPicks; i++){
  60. ^
  61. Bingo.java:198: class, interface, or enum expected
  62. return true;}
  63. ^
  64. Bingo.java:202: class, interface, or enum expected
  65. }
  66. ^
  67. 22 errors
  68.  
  69. import java.util.*;
  70. import java.io.*;
  71. import java.util.Arrays;
  72.  
  73. public class Bingo
  74. {
  75. public static final int ROWS = 5;
  76. public static final int COLS = 5;
  77. public static final int VERTICAL = 1;
  78. public static final int DIAGONAL = 2;
  79. public static final int HORIZONTAL = 3;
  80. public static int winFound;
  81. public static int currPick = 0;
  82. public static int randomPick;
  83. public static int WinFound;
  84.  
  85. public static void main(String[] args)
  86. {
  87. int Totcards;
  88. int[][] card = new int[ROWS][COLS];
  89.  
  90. fillCard (card);
  91. printCard(card);
  92. playGame(card);
  93. printCard(card);
  94.  
  95. }
  96.  
  97. private static void fillCard (int[][] card)
  98. {
  99. // FileReader fileIn = new FileReader("Bingo.in");
  100. // Bufferreader in = new Bufferreader(fileIn);
  101.  
  102. try {
  103. Scanner scan = new Scanner(new File("bingo.in"));
  104. for (int i=0; i<card.length; i++){
  105. for (int j=0; j<card[0].length; j++){
  106. card[i][j] = scan.nextInt();
  107. }
  108. }
  109. } catch(FileNotFoundException fnfe) {
  110. System.out.println(fnfe.getMessage());
  111. }
  112.  
  113. }
  114.  
  115. private static void printCard (int[][] card)
  116. {
  117. System.out.println("ntYOUR BINGO CARD : ");
  118. System.out.println("ntB I N G O");
  119. System.out.println("t----------------------");
  120.  
  121. for (int i=0; i<card.length; i++){
  122. for (int j=0; j<card[0].length; j++){
  123. System.out.print("t" + card[i][j]);
  124. }
  125. System.out.print("n");
  126. }
  127. }
  128.  
  129. private static void playGame (int[][] card)
  130. {
  131.  
  132. int numPicks = 0;
  133.  
  134. while (true)
  135. {
  136. markCard (card); // Generate a random num & zero-it out
  137. winFound = checkForWin(card); // Look for zero sums
  138. numPicks++;
  139.  
  140. if (winFound != 0)
  141. {
  142. announceWin (winFound, numPicks);
  143. return;
  144. }
  145. }
  146.  
  147.  
  148. }
  149. private static void markCard (int[][] card)
  150. {
  151. int randomPick = (int) (Math.random() * 74) + 1;
  152.  
  153. for (int j = 0; j < ROWS; j++){
  154. for (int k = 0; k < COLS; k++){
  155. if (card[j][k]==randomPick)
  156. card[j][k] = 0;}
  157. System.out.print(" " + randomPick);
  158. }
  159. }
  160.  
  161. private static int checkForWin(int[][] card)
  162. {
  163. int sum=0;
  164.  
  165. for (int i = 0; i < ROWS; i++)
  166. {
  167. sum = 0;
  168. for (int j = 0; j < COLS; j++)
  169. sum += card[i][j];
  170.  
  171. if (sum == 0)
  172. return HORIZONTAL;
  173. }
  174.  
  175. for (int j = 0; j < COLS; j++)
  176. {
  177. sum = 0;
  178. for (int i = 0; i < ROWS; i++)
  179. sum += card[i][j];
  180.  
  181. if (sum == 0)
  182. return VERTICAL;
  183. }
  184.  
  185. sum = 0;
  186. for (int i = 0; i < ROWS; i++)
  187. sum += card[i][ROWS-i-1];
  188. if (sum == 0)
  189. return DIAGONAL;
  190.  
  191. sum = 0;
  192. for (int i = 0; i < ROWS; i++)
  193. sum += card[i][i];
  194.  
  195. if (sum == 0)
  196. return DIAGONAL;
  197.  
  198. return WinFound;
  199. }
  200.  
  201. private static void makeCard(int[][] card, int[picks])
  202. {
  203. System.out.println("Current Number Picks: n");
  204. int count = 100;
  205. int currPick = 0;
  206. for (int i=0; i<count; i++){
  207. currPick = (int)(Math.random() * 74) + 1;
  208. System.out.print(" " + currPick + "n");
  209. picks[i] = currPick;
  210. System.out.print("i: " + i);
  211. }
  212. }
  213.  
  214. private static void announceWin(int winFound, int numPicks)
  215. {
  216. System.out.println("winFound: " + winFound + "numpicks: " + numPicks);
  217. }
  218.  
  219. private static boolean duplicate (int currPick, int[picks], int numPicks)
  220. {
  221. for (int i = 0; i < numPicks; i++){
  222. if (picks[i] == currPick){
  223. return true;}
  224. }
  225. return false;
  226.  
  227. }
  228. }
  229.  
  230. import java.util.*;
  231. import java.io.*;
  232. import java.util.Arrays;
  233.  
  234. public class Bingo
  235. {
  236. public static final int ROWS = 5;
  237. public static final int COLS = 5;
  238. public static final int VERTICAL = 1;
  239. public static final int DIAGONAL = 2;
  240. public static final int HORIZONTAL = 3;
  241. public static int winFound;
  242. public static int currPick = 0;
  243. public static int randomPick;
  244. public static int WinFound;
  245.  
  246. public static void main(String[] args)
  247. {
  248. int Totcards;
  249. int[][] card = new int[ROWS][COLS];
  250.  
  251. fillCard (card);
  252. printCard(card);
  253. playGame(card);
  254. printCard(card);
  255.  
  256. }
  257.  
  258. private static void fillCard (int[][] card)
  259. {
  260. // FileReader fileIn = new FileReader("Bingo.in");
  261. // Bufferreader in = new Bufferreader(fileIn);
  262.  
  263. try {
  264. Scanner scan = new Scanner(new File("bingo.in"));
  265. for (int i=0; i<card.length; i++){
  266. for (int j=0; j<card[0].length; j++){
  267. card[i][j] = scan.nextInt();
  268. }
  269. }
  270. } catch(FileNotFoundException fnfe) {
  271. System.out.println(fnfe.getMessage());
  272. }
  273.  
  274. }
  275.  
  276. private static void printCard (int[][] card)
  277. {
  278. System.out.println("ntYOUR BINGO CARD : ");
  279. System.out.println("ntB I N G O");
  280. System.out.println("t----------------------");
  281.  
  282. for (int i=0; i<card.length; i++){
  283. for (int j=0; j<card[0].length; j++){
  284. System.out.print("t" + card[i][j]);
  285. }
  286. System.out.print("n");
  287. }
  288. }
  289.  
  290. private static void playGame (int[][] card)
  291. {
  292.  
  293. int numPicks = 0;
  294.  
  295. while (true)
  296. {
  297. markCard (card); // Generate a random num & zero-it out
  298. winFound = checkForWin(card); // Look for zero sums
  299. numPicks++;
  300.  
  301. if (winFound != 0)
  302. {
  303. announceWin (winFound, numPicks);
  304. return;
  305. }
  306. }
  307.  
  308.  
  309. }
  310. private static void markCard (int[][] card)
  311. {
  312. int randomPick = (int) (Math.random() * 74) + 1;
  313.  
  314. for (int j = 0; j < ROWS; j++){
  315. for (int k = 0; k < COLS; k++){
  316. if (card[j][k]==randomPick)
  317. card[j][k] = 0;}
  318. System.out.print(" " + randomPick);
  319. }
  320. }
  321.  
  322. private static int checkForWin(int[][] card)
  323. {
  324. int sum=0;
  325.  
  326. for (int i = 0; i < ROWS; i++)
  327. {
  328. sum = 0;
  329. for (int j = 0; j < COLS; j++)
  330. sum += card[i][j];
  331.  
  332. if (sum == 0)
  333. return HORIZONTAL;
  334. }
  335.  
  336. for (int j = 0; j < COLS; j++)
  337. {
  338. sum = 0;
  339. for (int i = 0; i < ROWS; i++)
  340. sum += card[i][j];
  341.  
  342. if (sum == 0)
  343. return VERTICAL;
  344. }
  345.  
  346. sum = 0;
  347. for (int i = 0; i < ROWS; i++)
  348. sum += card[i][ROWS-i-1];
  349. if (sum == 0)
  350. return DIAGONAL;
  351.  
  352. sum = 0;
  353. for (int i = 0; i < ROWS; i++)
  354. sum += card[i][i];
  355.  
  356. if (sum == 0)
  357. return DIAGONAL;
  358.  
  359. return WinFound;
  360. }
  361.  
  362. private static void makeCard(int[][] card, int[] picks)
  363. {
  364. System.out.println("Current Number Picks: n");
  365. int count = 100;
  366. int currPick = 0;
  367. for (int i=0; i<count; i++){
  368. currPick = (int)(Math.random() * 74) + 1;
  369. System.out.print(" " + currPick + "n");
  370. picks[i] = currPick;
  371. System.out.print("i: " + i);
  372. }
  373. }
  374.  
  375. private static void announceWin(int winFound, int numPicks)
  376. {
  377. System.out.println("winFound: " + winFound + "numpicks: " + numPicks);
  378. }
  379.  
  380. private static boolean duplicate (int currPick, int[] picks, int numPicks)
  381. {
  382. for (int i = 0; i < numPicks; i++){
  383. if (picks[i] == currPick){
  384. return true;}
  385. }
  386. return false;
  387.  
  388. }
  389. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement