Merge pull request #427 from sreelakshmig009/techgig

This will close issue #356(techgig problem)

Author: smv1999

Techgig Code Gladiators 2021/Readme.md

@@ -0,0 +1,15 @@
+# Techgig Code Gladiators 2021 Solutions
+
+### Language Used: Python3
+
+* Content:
+      
+   * Open Coding Round :
+                                 
+        * <a href ="https://github.com/sreelakshmig009/CompetitiveProgrammingQuestionBank/blob/techgig/Techgig%20Code%20Gladiators%202021/open%20round/virus_outbreak.md">Virus Outbreak</a>
+
+        * <a href="https://github.com/sreelakshmig009/CompetitiveProgrammingQuestionBank/blob/techgig/Techgig%20Code%20Gladiators%202021/open%20round/prime_game.md">Prime Game</a>
+     
+   * Semi Finals Round:
+    
+        * <a href="https://github.com/sreelakshmig009/CompetitiveProgrammingQuestionBank/blob/techgig/Techgig%20Code%20Gladiators%202021/semifinals/jazzy%20and%20cricket%20balls.md">Jazzy And Cricket Balls</a>

Techgig Code Gladiators 2021/open round/prime_game.md

@@ -0,0 +1,81 @@
+# Prime Game
+
+
+
+Rax, a school student, was bored at home in the pandemic. He wanted to play but there was no one to play with. He was doing some mathematics questions including prime numbers and thought of creating a game using the same. After a few days of work, he was ready with his game. He wants to play the game with you.
+
+### GAME:
+
+Rax will randomly provide you a range [ L , R ] (both inclusive) and you have to tell him the maximum difference between the prime numbers in the given range. There are three answers possible for the given range.
+<ol>
+  <li>There are two distinct prime numbers in the given range so the maximum difference can be found.</li>
+  <li>There is only one distinct prime number in the given range. The maximum difference in this case would be 0.</li>
+  <li>There are no prime numbers in the given range. The output for this case would be -1.</li>
+</ol>
+
+To win the game, the participant should answer the prime difference correctly for the given range.
+
+#### Example:
+
+##### Range: [ 1, 10 ]:
+
+The maximum difference between the prime numbers in the given range is 5.
+Difference = 7 - 2 = 5
+
+##### Range: [ 5, 5 ]:
+
+There is only one distinct prime number so the maximum difference would be 0.
+
+##### Range: [ 8 , 10 ]:
+
+There is no prime number in the given range so the output for the given range would be -1.
+
+Can you win the game?
+
+<b>Input Format:</b>
+
+The first line of input consists of the number of test cases, T
+Next T lines each consists of two space-separated integers, L and R
+
+<b>Constraints:</b>
+
+1<= T <=10
+2<= L<= R<=10^6
+
+<b>Output Format</b>
+
+For each test case, print the maximum difference in the given range in a separate line. 
+
+##### Sample Test Case:
+
+Input:
+```
+5
+5 5
+2 7
+8 10
+10 20
+4 5
+```
+Output:
+```
+0
+5
+-1
+8
+0
+```
+Explanation:
+```
+Test Case 1: [ 5 - 2 ] = 3
+
+Test Case 2: [ 7 - 2 ] = 5
+
+Test Case 3: No prime number in the given range. Output = -1
+
+Test Case 4: [ 19 - 11 ] = 8
+
+Test Case 5: The difference would be 0 since there is only one prime number in the given range.
+```
+    
+      

Techgig Code Gladiators 2021/open round/prime_game.py

@@ -0,0 +1,40 @@
+def main():
+    
+    T = int(input())
+    def isprime(n):
+        if n<=1:
+            return False
+        for i in range(2,n):
+            if n%i ==0:
+                return False
+        return True
+    
+    # to run each testcase
+    while testCase >0:
+        LR = list(map(int,input().strip().split()))
+        L = LR[0]
+        R = LR[1]
+        f = 0
+        l = 0
+        for i in range(L,R+1):
+            if f ==0:
+                if isprime(i):
+                    f=i
+                else:
+                    i = i+1
+            if l==0:
+                if isprime(R):
+                    l=R
+                else:
+                    R -=1
+            if f!=0 and l!=0:
+                break
+            
+        if f!=0 and l!=0:
+            print(l-f)
+        else:
+            print(-1)
+        
+        T -=1
+
+main()

Techgig Code Gladiators 2021/open round/virus_outbreak.md

@@ -0,0 +1,56 @@
+## Virus Outbreak
+
+In the Martian land faraway, a new virus has evolved and is attacking the individuals at a fast pace. The scientists have figured out the virus composition, V. The big task is to identify the people who are infected. The sample of N people is taken to check if they are POSITIVE or NEGATIVE. A report is generated which provides the current blood composition B of the person. 
+
+#### POSITIVE or NEGATIVE ?
+
+If the blood composition of the person is a subsequence of the virus composition V, then the person is identified as POSITIVE otherwise NEGATIVE.
+
+#### Example:
+
+Virus Composition, V = coronavirus
+Blood Composition of the person , B = ravus
+
+The person in question is POSITIVE as B is the subsequence of the V. 
+
+The scientists are busy with their research for medicine and request you to build a program which can quickly figure out if the person is POSITIVE or NEGATIVE. They will provide you with the virus composition V and all the people’s current blood composition. Can you help them?
+
+<mark><b>Note</b>: The virus and blood compositions are lowercase alphabet strings.</mark>
+
+#### Input Format:
+
+The first line of the input consists of the virus composition, V
+
+The second line of he input consists of the number of people, N
+
+Next N lines each consist of the blood composition of the ith person, Bi
+
+#### Constraints:
+
+1<= N <=10
+
+1<= |B|<= |V|<= 10^5
+
+#### Output Format:
+
+For each person, print POSITIVE or NEGATIVE in a separate line
+
+Sample Test Case 1:
+
+Input
+
+```
+coronavirus
+3
+abcde
+crnas
+onarous
+```
+
+Output
+
+```
+NEGATIVE
+POSITIVE
+NEGATIVE
+```

Techgig Code Gladiators 2021/open round/virus_outbreak.py

@@ -0,0 +1,29 @@
+  
+def isSubsequence(V,B):
+    list_v = []
+    list_b = []
+    for c in V:
+         list_v.append(c)
+
+    for j in B:
+        list_b.append(j)
+
+    vindex = 0
+    bindex = 0
+    while vindex < len(list_v) and bindex < len(list_b):
+        if list_v[vindex] == list_b[bindex]:
+            bindex += 1
+        vindex += 1
+
+    if bindex == len(list_b):
+        return True
+    return False
+
+V = str(input())
+N = int(input())
+for i in range(N):
+    B = str(input())
+    result = isSubsequence(V,B)
+    if result == True:
+        print("POSITIVE")
+    else:   

Techgig Code Gladiators 2021/semifinals/jazzy and cricket balls.md

@@ -0,0 +1,68 @@
+# Jazzy And Cricket Balls
+
+Jazzy is good with bowling but is not good with studies. His mom wants him to focus on studies too and for this she has found an interesting way. She has brought N packets of balls which may or may not have the same number of balls in them. The balls in a packet are arranged in a linear manner and Jazzy wants to play with the balls.
+
+She will give the balls to Jazzy only if he can tell the maximum number of moves required in which he can get to play with all the balls. There are few conditions though:
+ 
+     
+  * In one move, Jazzy can divide the number of balls in the packet into an equal number of groups only.
+     
+     Example : Suppose there are 6 balls in the packet. 
+     
+     Jazzy can divide this packet in 3 ways.
+       
+        1. Two groups of 3 balls each. (3, 3)
+        2. Three groups of 2 balls each (2, 2, 2)
+        3. Six groups of 1 ball each.
+        
+     Note: Dividing a single group into multiple groups of equal number is considered one move only.
+     
+ * Jazzy can get to play with the balls when they are present as a single unit only and not in any group of size greater than 1. Also, getting to play with a ball is considered a move.
+    
+    Example: In a group there are 2 balls, then Jazzy cannot play with them until he further divides them into single-single units.
+    
+ * The length of all the packets/groups should always be an integer.
+
+    Example: Number of Packets, N = 1
+             Number of balls in packet = 6
+            
+Jazzy only cares about playing with the balls and needs your help in finding the maximum number of moves. Can you help him?
+
+#### Input Format:
+ 
+The first line of input consists of the number of packets, N.
+The second line of input consists of N space-separated integers representing the number of balls in the packet (length of the packet), Ni
+
+#### Constraints:
+
+1<= N <=100
+1<= Ni <=10^12 (1e12)
+
+#### Output Format:
+
+Print the required number of maximum moves to get to play with the balls.
+
+##### Sample Test :
+
+Input
+
+```
+2
+6 1
+```
+
+Output
+
+```
+11
+```
+
+Explanation
+
+```
+For 6 numbers of balls in a packet, 10 moves are required as explained above.
+
+For 1 ball, only 1 move is required.
+
+Total number of moves = 10 + 1 = 11
+```

Techgig Code Gladiators 2021/semifinals/jazzy and cricket balls.py

@@ -0,0 +1,28 @@
+# import the math module for mathematical functions
+import math
+# define the function moves
+def movess(v):
+    # create a variable move to count the number of moves for balls in each packet
+    move=v
+    # initially seperate the balls into two groups
+    while(v%2==0):
+        v=v//2
+        move+=v
+        # keep increasing the counts while seperating the balls into groups
+    for i in range(3,int(math.sqrt(v))+2,2):
+        while(v%i==0):
+            v=v//i
+            move+=v
+    if v>2:
+        move+=1        
+    return move
+
+# input the number of packets
+b=int(input()) 
+# input the number of balls in the packet
+j=list(map(int,input().strip().split(" ")))
+k=0
+# call the function moves for balls in every packet
+for w in j:
+    k+=movess(w)
+print(k)