Java Program to check whether it is possible to make a divisible by 3 number using all digits in an array

Java Program to Check if all digits of a number divide it

Last Updated : 12 Jun, 2022

Given a number n, find whether all digits of n divide it or not.
Examples:

Input : 128
Output : Yes
128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0.

Input : 130
Output : No

We want to test whether each digit is non-zero and divides the number. For example, with 128, we want to test d != 0 && 128 % d == 0 for d = 1, 2, 8. To do that, we need to iterate over each digit of the number.

Java

// Java program to check whether
// number is divisible by all its digits.
import java.io.*;
 
class GFG {
 
    // Function to check the divisibility
    // of the number by its digit.
    static boolean checkDivisibility(int n, int digit)
    {
        // If the digit divides the number
        // then return  true else return false.
        return (digit != 0 && n % digit == 0);
    }
 
    // Function to check if all
    // digits of n divide it or not,
    static boolean allDigitsDivide(int n)
    {
        int temp = n;
        while (temp > 0) {
 
            // Taking the digit of the
            // number into var 'digit'.
            int digit = n % 10;
 
            if ((checkDivisibility(n, digit)) == false)
                return false;
 
            temp /= 10;
        }
        return true;
    }
 
    // Driver function
    public static void main(String args[])
    {
        int n = 128;
 
        // function call to check
        // digits divisibility
        if (allDigitsDivide(n))
            System.out.println("Yes");
 
        else
            System.out.println("No");
    }
}
 
/*This code is contributed by Nikita Tiwari.*/

Output:

Yes

Time Complexity: O(log₁₀n), where n represents the given integer.
Auxiliary Space: O(1), no extra space is required, so it is a constant.

Please refer complete article on Check if all digits of a number divide it for more details!

Java Program to check whether it is possible to make a divisible by 3 number using all digits in an array

kartik

Improve

Article Tags :

Java Programs

Similar Reads

Java Program to Check if a Given Number is Perfect Number

A number is said to be a perfect number if the sum of its proper divisors ( i.e. all positive divisors excluding the number itself )is equal to that number itself. Aliquot sum is the sum of divisors of a number, excluding the number itself. Hence, a number is a perfect number only if it is equal to

Java Program to Check Whether Number is Divisible by 5

Generic rules in mathematics to test divisibility by 5 in a number system is followed as numbers that end in 5 or 0 are divisible by 5. It doesn't matter how big the number is. Modulo operator will be used most frequently in programming when it comes down to divisibility. Knowledge of the range of n

Java Program for Sum the digits of a given number

Given a number, find the sum of its digits.Example : Input : n = 687Output : 21 Input : n = 12Output : 3 1. Iterative: Java Code // Java program to compute // sum of digits in number. import java.io.*; class GFG { /* Function to get sum of digits */ static int getSum(int n) { int sum = 0; while (n !

Java Program for How to check if a given number is Fibonacci number?

Given a number 'n', how to check if n is a Fibonacci number. First few Fibonacci numbers are 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 141, .. Examples : Input : 8 Output : Yes Input : 34 Output : Yes Input : 41 Output : No Following is an interesting property about Fibonacci numbers that can also be

Java Program to check whether it is possible to make a divisible by 3 number using all digits in an array

Given an array of integers, the task is to find whether it's possible to construct an integer using all the digits of these numbers such that it would be divisible by 3. If it is possible then print "Yes" and if not print "No". Examples: Input : arr[] = {40, 50, 90} Output : Yes We can construct a n

Java Program to Check if count of divisors is even or odd

Given a number "n", find its total number of divisors is even or odd. Examples: Input: n = 10 Output: EvenInput: n = 100Output: OddInput: n = 125Output: EvenA naive approach would be to find all the divisors and then see if the total number of divisors is even or odd. The time complexity for such a

Java Program to Increment by 1 to all the Digits of a given Integer

Given an integer, the task is to generate a Java Program to Increment by 1 All the Digits of a given Integer. Examples: Input: 12345 Output: 23456 Input: 110102 Output: 221213 Approach 1: In this approach, we will create a number which will be of the same length as the input and will contain only 1

Java Program for Smallest K digit number divisible by X

Integers X and K are given. The task is to find the smallest K-digit number divisible by X. Examples: Input : X = 83, K = 5 Output : 10043 10040 is the smallest 5 digit number that is multiple of 83. Input : X = 5, K = 2 Output : 10 An efficient solution would be : Compute MIN : smallest K-digit num

Java Program to Find sum of even factors of a number

Given a number n, the task is to find the even factor sum of a number. Examples: Input : 30 Output : 48 Even dividers sum 2 + 6 + 10 + 30 = 48 Input : 18 Output : 26 Even dividers sum 2 + 6 + 18 = 26 Let p1, p2, â€¦ pk be prime factors of n. Let a1, a2, .. ak be highest powers of p1, p2, .. pk respect

Java Program for Largest K digit number divisible by X

Integers X and K are given. The task is to find highest K-digit number divisible by X. Examples: Input : X = 30, K = 3 Output : 990 990 is the largest three digit number divisible by 30. Input : X = 7, K = 2 Output : 98 An efficient solution is to use below formula. ans = MAX - (MAX % X) where MAX i