Given a large positive number as string, count all rotations of the given number which are divisible by 4.
Input: 8 Output: 1 Input: 20 Output: 1 Rotation: 20 is divisible by 4 02 is not divisible by 4 Input : 13502 Output : 0 No rotation is divisible by 4 Input : 43292816 Output : 5 5 rotations are : 43292816, 16432928, 81643292 92816432, 32928164
For large numbers it is difficult to rotate and divide each number by 4. Therefore, ‘divisibility by 4’ property is used which says that a number is divisible by 4 if the last 2 digits of the number is divisible by 4. Here we do not actually rotate the number and check last 2 digits for divisibility, instead we count consecutive pairs (in circular way) which are divisible by 4.
Consider a number 928160 Its rotations are 928160, 092816, 609281, 160928, 816092, 281609. Now form pairs from the original number 928160 as mentioned in the approach. Pairs: (9,2), (2,8), (8,1), (1,6), (6,0), (0,9) We can observe that the 2-digit number formed by the these pairs, i.e., 92, 28, 81, 16, 60, 09, are present in the last 2 digits of some rotation. Thus, checking divisibility of these pairs gives the required number of rotations. Note: A single digit number can directly be checked for divisibility.
Below is the implementation of the approach.
Time Complexity : O(n) where n is number of digits in input number.
This article is contributed by Ayush Jauhari. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Count rotations divisible by 8
- Count rotations of N which are Odd and Even
- Count rotations in sorted and rotated linked list
- Count the number of pairs (i, j) such that either arr[i] is divisible by arr[j] or arr[j] is divisible by arr[i]
- Count all sub-arrays having sum divisible by k
- Count sub-matrices having sum divisible 'k'
- Count of pairs from 1 to a and 1 to b whose sum is divisible by N
- Count of sub-strings that are divisible by K
- Count pairs (i,j) such that (i+j) is divisible by A and B both
- Count divisible pairs in an array
- Count pairs in array whose sum is divisible by 4
- Count the numbers divisible by 'M' in a given range
- Count numbers in range 1 to N which are divisible by X but not by Y
- Count integers in the range [A, B] that are not divisible by C and D
- Count pairs in array whose sum is divisible by K