Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package lab8;
- import java.util.ArrayList;
- import java.util.List;
- import java.util.Scanner;
- public class PrimeFactorization {
- public static List<Integer> getPrimeFactors(int n) {
- List<Integer> primeFactors = new ArrayList<>();
- while (n % 2 == 0) {
- primeFactors.add(2);
- n /= 2;
- }
- for (int i = 3; i <= Math.sqrt(n); i = i + 2) {
- while (n % i == 0) {
- primeFactors.add(i);
- n = n / i;
- }
- }
- if (n > 2) {
- primeFactors.add(n);
- }
- return primeFactors;
- }
- public static void main(String[] args) {
- Scanner scanner = new Scanner(System.in);
- int number = scanner.nextInt();
- List<Integer> primeFactors = getPrimeFactors(number);
- System.out.println("Простые множители числа " + number + ": " + primeFactors);
- }
- }
- package lab8;
- import java.util.Scanner;
- public class PalindromeCheck {
- public static boolean isPalindrome(String s) {
- if (s.length() <= 1) {
- return true;
- } else {
- return s.charAt(0) == s.charAt(s.length() - 1) && isPalindrome(s.substring(1, s.length() - 1));
- }
- }
- public static void main(String[] args) {
- Scanner scanner = new Scanner(System.in);
- String word = scanner.nextLine();
- if (isPalindrome(word)) {
- System.out.println("YES");
- } else {
- System.out.println("NO");
- }
- }
- }
- package lab8;
- import java.util.Scanner;
- public class BinarySequences {
- public static int HowMany(int a, int b) {
- if (a == 0){
- return 1;
- }
- if (a == 1) {
- return b + 1;
- }
- if (a > 1 & b == 0) {
- return 0;
- }
- return HowMany(a - 1, b - 1) + HowMany(a, b - 1);
- }
- public static void main(String[] args) {
- Scanner scanner = new Scanner(System.in);
- int a = scanner.nextInt();
- int b = scanner.nextInt();
- System.out.println("Количество последовательностей: " + HowMany(a, b));
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement