Advertisement
tttttt32

Untitled

Oct 1st, 2020
26
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 5.68 KB | None | 0 0
  1. package com.company;
  2.  
  3. import java.util.Scanner;
  4.  
  5. public class Main {
  6. static Scanner scanner = new Scanner(System.in);
  7.  
  8. public static void main ( String[] args ) {
  9. System.out.println("This program finds the factorial of a number, checks if it is a prime natural number, prints out any string data you write down. Finds: sum, difference, product, division result (modulo and without) of two entered numbers ");
  10. Menu ();
  11. }
  12.  
  13. public static int inputChooseMenu () {
  14. int number = 0;
  15. System.out.println("Please enter a number from 1 to 4 ");
  16. boolean isCorrect = true;
  17. while (isCorrect) {
  18. isCorrect = false;
  19. number = scanner.nextInt();
  20. if (number < 1 | number > 4) {
  21. isCorrect = true;
  22. System.out.println("Your number does not match the condition. Please re-enter the number!");
  23. } else {
  24. isCorrect = false;
  25. }
  26. }
  27. return number;
  28. }
  29.  
  30. public static void chooseMenu ( int choose ) {
  31. boolean isPrime;
  32. int number = 0;
  33. switch (choose) {
  34. case 1:
  35. int result = 0;
  36. number = inputNumber();
  37. result = calculateFactorial ( number );
  38. printFactorial ( result );
  39. break;
  40. case 2:
  41. number = inputNumber ();
  42. isPrime = primeCheck ( number );
  43. printPrime ( isPrime, number );
  44. break;
  45. case 3:
  46. String dataAboutYou = inputDataAboutYou ();
  47. printYouData( dataAboutYou );
  48. break;
  49. case 4:
  50. int firstNumber = inputNumber ();
  51. int secondNumber = inputNumber ();
  52. int sumFirstNAndSecondN = sum (firstNumber , secondNumber );
  53. System.out.println(sumFirstNAndSecondN);
  54. int multiFirstNAndSecondN = multiplication ( firstNumber, secondNumber );
  55. System.out.println(multiFirstNAndSecondN);
  56. int diffFirstNAndSecondN = difference ( firstNumber, secondNumber );
  57. System.out.println(diffFirstNAndSecondN);
  58. double divisionFirstNAndSecondN = division ( firstNumber, secondNumber );
  59. System.out.println(divisionFirstNAndSecondN);
  60. int moduloDivFirstNAndSecondN = moduloDivision ( firstNumber, secondNumber );
  61. System.out.println(moduloDivFirstNAndSecondN);
  62. }
  63. }
  64.  
  65. public static int sum ( int firstNumber, int secondNumber ) {
  66. System.out.print("The sum is = ");
  67. return firstNumber + secondNumber;
  68. }
  69.  
  70. public static int multiplication ( int firstNumber, int secondNumber ) {
  71. System.out.print("The product is = ");
  72. return firstNumber * secondNumber;
  73. }
  74.  
  75. public static int difference( int firstNumber, int secondNumber ) {
  76. System.out.print("The difference is = ");
  77. return firstNumber - secondNumber;
  78.  
  79. }
  80.  
  81. public static double division ( int firstNumber, int secondNumber ) {
  82. System.out.print("Division Result = ");
  83. return firstNumber / secondNumber;
  84. }
  85.  
  86. public static int moduloDivision ( int firstNumber, int secondNumber ) {
  87. System.out.print("Modulo result = ");
  88. return firstNumber % secondNumber;
  89. }
  90.  
  91.  
  92. public static void printYouData ( String dataAboutYou ) {
  93. System.out.println(dataAboutYou);
  94.  
  95. }
  96.  
  97. public static String inputDataAboutYou () {
  98. String dataAboutYou;
  99. System.out.println("Enter your details ");
  100. dataAboutYou = scanner.nextLine();
  101. return dataAboutYou;
  102. }
  103.  
  104. public static void Menu () {
  105. System.out.println("Choose an action Enter: 1 if you want to calculate the factorial of a number. 2 if you want to check if the number is prime. 3 if you want the program to write the string data. 4, if you want the program to write down the sum, difference, product, division result (modulo and without) of two entered numbers ");
  106. int choose = inputChooseMenu ();
  107. chooseMenu ( choose );
  108. }
  109.  
  110.  
  111. public static void printFactorial ( int result ) {
  112. System.out.println("Factorial number =" + result);
  113. }
  114.  
  115. public static void printPrime ( boolean isPrime, int number ) {
  116. if (isPrime) {
  117. System.out.println(number + " - Prime number");
  118. } else {
  119. System.out.println(number + " - composite number");
  120. }
  121. }
  122.  
  123. public static boolean primeCheck ( int number ) {
  124. int temp = 0;
  125. boolean isPrime = true;
  126. for (int i = 2; i <= number / 2; i++) {
  127. temp = number % i;
  128. if (temp == 0) {
  129. isPrime = false;
  130. break;
  131. }
  132. }
  133. return isPrime;
  134. }
  135.  
  136. public static int inputNumber () {
  137. int number = 0;
  138. System.out.println("Enter any number from 2");
  139. boolean isCorrect = true;
  140. while (isCorrect) {
  141. number = scanner.nextInt();
  142. if (number < 2) {
  143. isCorrect = true;
  144. System.out.println("Your number does not match the condition. Please re-enter the number!");
  145. } else {
  146. isCorrect = false;
  147. System.out.println("You entered the number successfully!");
  148. }
  149. }
  150. return number;
  151. }
  152.  
  153. public static int calculateFactorial ( int number ) {
  154. int result = 1;
  155. for (int i = 1; i <= number; i++) {
  156. result = result * i;
  157. }
  158. return result;
  159. }
  160.  
  161. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement