Question

Write a program named Remainder.java then implement the following method: public static int divisibleBy(int[] arr, int M, int K) this method determines the number of elements in the int array (arr) that are divisible by M but not K. Then write code inside main method to test your method: your main method accepts three numbers from the command argument list, N, M, K, use the first number to create int array with size of N, assign random number between 0 and Integer.MAX_VALUE [0,Integer.MAX_VALUE) , then call your method to determine and then print how many numbers are divisible by M but not K

Answer 1

Thanks for the question, here is the complete code in Java.

import java.util.Random;

public class Remainder {


    public static int divisibleBy(int[] arr, int M, int K) {

        int count = 0;

        for (int i = 0; i < arr.length; i++) {

/// condition to check if its divisible by M but not K
            if (arr[i] % M == 0 && arr[i] % K != 0) {
                count += 1;
            }
        }
        return count;
    }

    public static void main(String[] args) {

        int N = 100;
        int M = 5;
        int K = 7;

        int[] arr = new int[N];
        Random random = new Random();
        for (int i = 0; i < N; i++) {

// generating a random number between 0 and MAX INT and storing it in array
            arr[i] = random.nextInt(Integer.MAX_VALUE);
        }
        int counts = divisibleBy(arr, M, N);
        System.out.println("Count: "+counts);

    }
}

================================================================================