Advertisement
mirozspace

TNumber_v2

Feb 13th, 2019
152
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Java 1.08 KB | None | 0 0
  1. import java.util.Scanner;
  2.  
  3. public class Pr10TopNumber_v2 {
  4.     public static void main(String[] args) {
  5.         Scanner scanner = new Scanner(System.in);
  6.         int number = Integer.parseInt(scanner.nextLine());
  7.         for (int i = 0; i < number ; i++) {
  8.            if(checkForDivisible(i)&&checkForOdd(i)){
  9.                System.out.println(i);
  10.            }
  11.         }
  12.     }
  13.  
  14.  
  15.     private static boolean checkForDivisible(int number) {
  16.         boolean isDivisible = false;
  17.         int sumDigits = 0;
  18.         while (number > 0) {
  19.             int digit = number % 10;
  20.             sumDigits += digit;
  21.             number /= 10;
  22.         }
  23.         if (sumDigits % 8 == 0) {
  24.             isDivisible = true;
  25.         }
  26.         return isDivisible;
  27.     }
  28.  
  29.     private static boolean checkForOdd(int number) {
  30.         boolean isOdd = false;
  31.         while (number > 0) {
  32.             int digit = number % 10;
  33.             if (digit % 2 != 0) {
  34.                 isOdd = true;
  35.                 break;
  36.             }
  37.             number /= 10;
  38.         }
  39.         return isOdd;
  40.     }
  41. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement