Advertisement
Guest User

Untitled

a guest
Jan 19th, 2020
90
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.66 KB | None | 0 0
  1. package pack;
  2. import javafx.scene.control.TextField;
  3. import java.util.Arrays;
  4. import javafx.scene.control.Label;
  5.  
  6. public class Functions
  7. {
  8.  
  9. static String chronology = "";
  10. static int count = 0;
  11. static int gcd = 0;
  12.  
  13. public static void Function1( TextField inText1, Label label)
  14. {
  15. String result = "";
  16. int n = Integer.parseInt(inText1.getText());
  17.  
  18. try
  19. {
  20. Integer.parseInt(inText1.getText());
  21. }
  22. catch (NumberFormatException e)
  23. {
  24. label.setText (" The integers must be > 1");
  25. }
  26.  
  27. if (n <= 1)
  28. label.setText("The integers must be > 1");
  29. else
  30. {
  31. int countP = 0;
  32. boolean A[] = new boolean [n + 1];
  33. Arrays.fill(A,true);
  34.  
  35. for(int i = 2; i <= (int)Math.sqrt(n); i++)
  36. {
  37. if (A[i] == true)
  38. {
  39. for (int j = i * i; j <= n; j = j + i)
  40. {
  41. A[j]= false;
  42. }
  43. }
  44. }
  45.  
  46. for (int i = 2; i < A.length; i++)
  47. {
  48. if (A[i] == true)
  49. {
  50. result += i + "\n";
  51. countP++;
  52. }
  53. count = countP;
  54. label.setText(result);
  55.  
  56. chronology += "Function type: Eratosthenes \n"
  57. + "Input: " + n + "\nResult: " + result;
  58. }
  59. }
  60. }
  61.  
  62.  
  63. public static void Function2 (TextField inText1, TextField inText2, Label label)
  64. {
  65. String result = "";
  66. int n = Integer.parseInt(inText1.getText());
  67. int m = Integer.parseInt(inText2.getText());
  68.  
  69. try
  70. {
  71. Integer.parseInt(inText1.getText());
  72. Integer.parseInt(inText2.getText());
  73. }
  74. catch (NumberFormatException e)
  75. {
  76. label.setText ("The integers must be > 0");
  77. }
  78.  
  79. if (n <= 0 || m <= 0)
  80. {
  81. result.setText("The integers must be > 0");
  82. }
  83. else
  84. {
  85. while (n != m)
  86. {
  87. if (n > m)
  88. n = n - m;
  89. else
  90. m = m - n;
  91. }
  92. gcd = n;
  93. result = Integer.toString(n);
  94. result.setText(result);
  95.  
  96. chronology += "Function type: Euclid algorithm \n"
  97. + "Input: " + n + "," + m + "\nResult: " + result;
  98. }
  99. }
  100. public static void Function3(TextField inText1, Label label)
  101. {
  102. String result = "";
  103. int n = Integer.parseInt(inText1.getText());
  104.  
  105. try
  106. {
  107. Integer.parseInt(inText1.getText());
  108. }
  109. catch (NumberFormatException e)
  110. {
  111. label.setText (" The integers must be > 0");
  112. }
  113. for (int i = 2; i <= n; i++)
  114. {
  115. if(n % i == 0)
  116. {
  117. count++;
  118. }
  119. }
  120.  
  121. result = Integer.toString(count);
  122. result.setText(result);
  123.  
  124. chronology += "Function type: Number of prime numbers\n"
  125. + "Input: " + n + "\nResult: " + result;
  126. }
  127. public static void Function4(TextField inText1, Label label)
  128. {
  129. String result = "";
  130. int n = Integer.parseInt(inText1.getText());
  131. int k = 0;
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement