Advertisement
Guest User

Untitled

a guest
Sep 24th, 2019
122
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.21 KB | None | 0 0
  1. package Verseny;
  2.  
  3. import java.util.Arrays;
  4. import java.util.Random;
  5. import java.util.Scanner;
  6.  
  7. public class VersenyFeladat {
  8.  
  9. public static void main(String[] args) {
  10. // TODO Auto-generated method stub
  11. long current = System.currentTimeMillis();
  12. Scanner scanner = new Scanner(System.in);
  13. Random random = new Random();
  14. int N = scanner.nextInt();
  15. int M = scanner.nextInt();
  16. int K = scanner.nextInt();
  17. int indulasM;
  18. int indulasN;
  19. int hossz = 0;
  20. String utvonal = "";
  21. int[][] grid = {
  22. {7, 7, 9, 7},
  23. {4, 5, 3, 4},
  24. {6, 6, 5, 2},
  25. {4, 7, 8, 2},
  26. {1, 2, 3, 4}
  27. };
  28. int indexI = 0;
  29. int indexJ = 0;
  30. /*
  31. * Értékek megadása véletlenszerűen:
  32. int[][] grid = new int[N][M];
  33. for(int i = 0; i < N; i++) {
  34. for(int j = 0; j < M; j++) {
  35. grid[i][j] = random.nextInt(9);
  36. }
  37. }
  38. */
  39. /*
  40. * Első ötlet
  41. System.out.println(Arrays.deepToString(grid));
  42. for(int i = 0; i < N-1; i++) {
  43. for(int j = 0; j < M-1; j++) {
  44. if(grid[i][j+1] <= grid[i][j]+K && grid[i][j+1] > grid[i][j]) {
  45. System.out.println(grid[i][j] + ", " + grid[i][j+1]);
  46. j += 1;
  47. utvonal += "J";
  48. }
  49. else if(grid[i+1][j] <= grid[i][j]+K && grid[i+1][j] > grid[i][j]) {
  50. System.out.println(grid[i][j] + ", " + grid[i+1][j]);
  51. i += 1;
  52. utvonal += "L";
  53. }
  54. else {break;}
  55. }
  56. }
  57. */
  58. System.out.println(Arrays.deepToString(grid));
  59. for(int i = 0; i < 5; i++) {
  60. indexI = i;
  61. for(int j = 0; j < 3; j++) {
  62. indexJ = j;
  63. if(grid[indexI][indexJ+1] <= grid[indexI][indexJ]+K && grid[indexI][indexJ+1] > grid[indexI][indexJ]) {
  64. System.out.println(grid[indexI][indexJ] + ", " + grid[indexI][indexJ+1]);
  65. indexJ++;
  66. utvonal += "J";
  67. hossz++;
  68. // If kell a hossz változóval
  69. continue;
  70. }
  71. else if(grid[indexI+1][indexJ] <= grid[indexI][indexJ]+K && grid[indexI+1][indexJ] > grid[indexI][indexJ]) {
  72. System.out.println(grid[indexI][indexJ] + ", " + grid[indexI+1][indexJ]);
  73. indexI++;
  74. utvonal += "L";
  75. hossz++;
  76. continue;
  77. }
  78. }
  79. }
  80. System.out.println(utvonal);
  81. System.out.println(hossz);
  82. System.out.println(System.currentTimeMillis() - current + " ms");
  83. }
  84.  
  85. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement