Guest User

Untitled

a guest
Nov 24th, 2017
88
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.62 KB | None | 0 0
  1. /* * * * * * * * *
  2. * Tristan Madden
  3. * 10/05/2017
  4. * * * * * * * * */
  5.  
  6. import java.io.IOException;
  7. import java.util.Scanner;
  8.  
  9. public class Main {
  10.  
  11. public static void main(String[] args) throws IOException {
  12.  
  13. Scanner sc = new Scanner(System.in);
  14.  
  15. while (sc.hasNext()) {
  16.  
  17. int n1 = sc.nextInt();
  18. int n2 = sc.nextInt();
  19.  
  20. if (n2 n1) {
  21. int largest = 0;
  22.  
  23. for (int i = n1; i = n2; i++) {
  24. int temp = collatz(i, 1);
  25. if (temp largest) {
  26. largest = temp;
  27. }
  28. }
  29.  
  30. System.out.println(n1 + + n2 + + largest);
  31. } else if (n2 n1) {
  32. int largest = 0;
  33.  
  34. for (int i = n2; i = n1; i++) {
  35. int temp = collatz(i, 1);
  36. if (temp largest) {
  37. largest = temp;
  38. }
  39. }
  40. System.out.println(n1 + + n2 + + largest);
  41. } else if (n2 == n1) {
  42. int temp = collatz(n1, 1);
  43. System.out.println(n1 + + n2 + + temp);
  44. }
  45.  
  46. }
  47. }
  48.  
  49. public static int collatz(long input, int cycleLength) {
  50.  
  51. long n = input;
  52. int counter = cycleLength;
  53.  
  54. if (n == 1) {
  55. return counter;
  56. } else if (n % 2 != 0) {
  57. n = 3 n + 1;
  58. counter++;
  59. return collatz(n, counter);
  60. } else {
  61. n = n 2;
  62. counter++;
  63. return collatz(n, counter);
  64. }
  65.  
  66. }
  67. }
Add Comment
Please, Sign In to add comment