Skip to main content

The Divisibility Dilemma Code Techgig Geek Goddess Solution

The Divisibility Dilemma Code Techgig Geek Goddess Solution


100% Working Code uploaded on Youtube: https://youtu.be/6cn7nNtSiKo

100% Working Code uploaded on Telegram: https://telegram.me/PLACEMENTLELO


The Divisibility Dilemma (100 Marks)

In the picturesque village of Numeropolis, the annual "Divisibility Day" is celebrated with great enthusiasm. This day is marked by various mathematical challenges and games that put the villagers' arithmetic skills to the test. This year, the villagers are embarking on a quest to explore the distinctive properties of subarrays within integer arrays.

The village's renowned mathematician, Professor Arithmo, has crafted an intriguing challenge. He has provided the villagers with an integer array nums`and two additional integers, K and P. Professor Arithmo's challenge revolves around discovering and counting distinct subarrays from the array nums. The uniqueness of these subarrays is determined by their divisibility characteristics.

Specifically, Professor Arithmo asks the villagers to identify subarrays that have no more than K elements divisible by P. To put it simply, a subarray is considered valid if the count of elements divisible by P within it does not exceed K.

In Numeropolis, the concept of distinctiveness extends to subarrays as well. Two subarrays, subarray1 and subarray2, are said to be distinct under the following conditions:

1. They possess different lengths.

2. There is at least one index i where subarray1[i] is not equal to subarray2[i].

To assist the villagers in this quest, you are tasked with calculation of count of distinct subarrays that satisfy the divisibility condition and the distinctiveness condition.


Input Format

First line contains three space-separated integers N, K and P respectively.

Second line contains N space-separated integers representing elements of array nums.


Constraints

1 <= N <= 200

1 <= nums[i], P <= 200

1 <= K <= N


Output Format

Print a single integer representing the count of distinct subarrays.


Sample TestCase 1

Input

4 1 2

3 4 5 6

Output

8


Explanation

There are a total of 8 subarrays following the condition:

{ 3 }

{ 3, 4 }

{3, 4, 5}

{ 4 }

{ 4, 5 }

{ 5 } 

{ 5, 6 }

{ 6 }


Time Limit(X): 0.50 sec(s) for each input.

Memory Limit: 512 MB

Source Limit: 100 KB

Allowed Languages:

C, C++, C++11, C++14, C#, Java, Java 8, Kotlin, PHP, PHP 7, Python, Python 3, Perl, Ruby, Node Js, Scala, Clojure, Haskell, Lua, Erlang, Swift, VBnet, Js, Objc, Pascal, Go, F#, D, Groovy, Tcl, Ocaml, Smalltalk, Cobol, Racket, Bash, GNU Octave, Rust, Common LISP, R, Julia, Fortran, Ada, Prolog, Icon, Elixir, CoffeeScript, Brainfuck, Pypy, Lolcode, Nim, Picolisp, Pike, pypy3




Labels:

Comments

Post a Comment

Popular posts from this blog

TechGig Code Gladiators 2023 Coding Solutions

TechGig Open Coding Round Code Gladiators 2023 Answers Round 1  - Problem 1 Forest Fire Coding Solution Figure out the minimum energy level P such that they can get exactly X animals to transport.  Test Case: 5 4  1 3 2 4 5 Output: 2 Coding Solution in Python 3: from bisect import bisect_left #Telegram - @PLACEMENTLELO n, m = map ( int , input ().split()) a = list ( map ( int , input ().split())) a.sort() #Telegram - @PLACEMENTLELO if n - bisect_left(a, a[n-m]) != m: print ( -1 ) else : print (a[n - m]) #Telegram - @PLACEMENTLELO ------------------------------------------- Round 2  - Problem 2 The Magic Coding Solution The cost of using wand for operation on element equal to absolute difference between value of element and desired value after operation. Test Case: 5 3 1 2 3 4 5 5 2 1 Output: 10 7 10 Coding Solution in Python 3: from bisect import bisect_left #Telegram - @PLACEMENTLELO n, m = map ( int , input ().split()) A = list ( map ( int , input ().split())) Q = list
1 comment
Read more

Google Girl Hackathon 3 June 2023 Solutions

Google Girl Hackathon 3 June 2023 Solutions Google Girl Hackathon 2023   Maximize equal numbers Code in Python Task Determine the maximum length of the subsequence of array a, such that all numbers in that subsequence are equal after applying the given operation. Code in Python def MaximizeEqualNumber(n, k, a):     #Telegram - @PLACEMENTLELO     max_length = 0     for i in range(n):     #Telegram - @PLACEMENTLELO         count = 1          for x in range(-k, k+1):     #Telegram - @PLACEMENTLELO             if a[i] + x in a[i+1:]:                 count += 1     #Telegram - @PLACEMENTLELO         max_length = max(max_length, count)     return max_length n = 4 k = 1 a = [2, 5, 1, 2] # Output: 3 n = 4 k = 0 a = [2, 2, 5, 6] # Output: 2 n = 3 k = 2 a = [1,5,6] # Output: 2 That is Perfection Code in Python  def is perfect number (n):      divisors_sum = sum(i for i in range(1, n) if n % i == 0)      return divisors_sum == n Balanced Brackets You are given a string S of length N. It consists
Post a Comment
Read more