Given an array arr[], the task is to determine the number of elements of the array which are not divisible by any other element in the given array. Examples:...
Given a large positive number as string, count all rotations of the given number which are divisible by 4....
Given a number N, the task is to count all the rotations of the given number which are divisible by 10.Examples:...
Given a large positive number as string, count all rotations of the given number which are divisible by 4....
Given a large positive number as string, count all rotations of the given number which are divisible by 8....
Given a large positive number as string, count all rotations of the given number which are divisible by 8....
Given an array of size n, the task is to find the minimum number of operations required in the array such that the product of all array elements is divisible by nth power of 2. In one operation, you can select any index i and multiply ai by i, you can perform an operation on a particular index at most 1 time. (Follow 1-based indexing)...
Given an array arr[] of N integers, the task is to find an integer X such that the integers that are divisible by X and the integers that are not divisible by X are alternative to each other in the array. If there is no such value print -1....
Given a large positive number as string, count all rotations of the given number which are divisible by 8....
Given two integers N and K, the task is to calculate the minimum number of adjacent swaps of digits required to make the integer N divisible by K....
Given a large positive number as string, count all rotations of the given number which are divisible by 4....
Given an array arr[] of size N, the task is to check if the sum of the left subarray is divisible by the sum of the right subarray or vice-versa. Print Yes if it was, otherwise No. Here, the left subarray will contain the string from 0 to mid=(N-1)/2 and the right subarray will contain the string from mid+1 to N-1....
