Add files via upload

Author: abrahamalbert18

Second Largest Num.py

@@ -0,0 +1,22 @@
+# Enter your code here. Read input from STDIN. Print output to STDOUT
+N= input()
+L= raw_input().split()
+I=[]
+assert N>=2 and N<=10
+#print type(L[0])
+for i in L:
+    I.append(int(i))
+I.sort()
+#print L
+largest=max(I)
+#print "Large=" + str(largest)
+count=I.count(largest)
+for i in range(count):
+    I.remove(largest)
+print max(I)
+
+
+        
+
+5
+-7 -7 -7 -7 -6

Sets Subset.py

@@ -0,0 +1,7 @@
+for i in range(int(input())): #More than 4 lines will result in 0 score. Blank lines won't be counted. 
+    a = int(input()); A = set(input().split()) 
+    b = int(input()); B = set(input().split())
+    print (A.issubset(B))
+
+    
+    

Sets Superset.py

@@ -0,0 +1,6 @@
+A,N= set(input().split()) , int(input())
+ans=True
+for i in range(N):
+    check= set(input().split())
+    ans= (ans) and ( A.issuperset(check)) and len(A)> len(check)
+print (ans)    

Snakes&Ladder.py

@@ -0,0 +1,51 @@
+# Enter your code here. Read input from STDIN. Print output to STDOUT
+T=input()
+def gamePlay(dice,position,ladders,snakes):
+    ladders.sort()
+    snakes.sort()
+    ladderLow=[ladders[i][0] for i in range(len(ladders))]
+    snakesHead=[snakes[i][0] for i in range(len(snakes))]
+    count=0
+    while (position<=98):
+        roll=max(dice)
+        position+=roll
+        if position in snakesHead and roll!=1:
+            roll-=1
+        if position in snakesHead and roll==1:
+            position = snakes[snakesHead.index(position)][1]   
+            
+        
+        if position in ladderLow:
+            position= ladders[ladderLow.index(position)][1]
+        count+=1    
+        print snakesHead
+        print ladderLow
+        print "count ="+str(count) 
+        print "position="+str(position)   
+    print "position="+str(position)    
+    return count    
+    
+for testCase in range(T):
+    N=input()
+    ladders=[raw_input().split() for n in range(N)]
+    M=input()
+    snakes=[raw_input().split() for m in range(M)]
+    position=1
+    dice=[1,2,3,4,5,6]
+    #Select the higher number
+    #Check if there's a snake head
+    #if there's a snake head go for the next highest number
+    #if there's no snake head go for another roll and make a count of the step.
+    #if there's a ladder bottom in the position, change the position and make a count
+    #make sure the position reaches till 98.
+    #steps=0
+    maxCount=gamePlay(dice,position,ladders,snakes)
+    print maxCount
+    
+
+            
+        
+        
+        
+    
+    

Sort a particular column using Lambda.py

@@ -0,0 +1,9 @@
+# Enter your code here. Read input from STDIN. Print output to STDOUT
+N, M =map(int, raw_input().split())
+sample= [ map(int, raw_input().split()) for i in range(N)]
+k=input()
+sample.sort(key=lambda x: x[k])
+for i in sample:
+    print " ".join(map(str,i))
+
+    

Stack.py

@@ -0,0 +1,33 @@
+# Enter your code here. Read input from STDIN. Print output to STDOUT
+'''
+class Stack(object):
+    def __init__(self):
+        self.stack=[]
+        
+    def push(self,element):
+        self.stack.append(element)
+        
+    
+    def pop(self):
+        if len(self.stack)!=0:
+            self.stack.remove(self.stack[0])       
+                      
+    def maxElement(self):
+        if len(self.stack)!=0:
+            return max(self.stack)   
+'''        
+    
+N=input()
+s=[]
+for n in range(N):
+    #S=Stack()
+    #print S.stack
+    op= raw_input().split()
+    if op[0]=='1':
+        print op[1]
+        s.insert(0,op[1])
+    if op[0]=='2':
+        s.pop(s[0])
+    if op[0]=='3':
+        print max(s)
+        

sets discard, pop, remove using format.py

@@ -0,0 +1,6 @@
+n = int(input())
+s = set(map(int, raw_input().split())) 
+for i in range(int(raw_input())):
+    eval('s.{0}({1})'.format(*raw_input().split()+['']))
+
+print(sum(s))

sets.py

@@ -0,0 +1,10 @@
+numOfEng= raw_input()
+rollOfEng=set(raw_input().split())
+numOfFre= raw_input()
+rollOfFre=set(raw_input().split())
+
+total= numOfEng+numOfFre
+
+studentsTakingPaper= list(rollOfEng.union(rollOfFre)) #converting set into list
+print len(studentsTakingPaper)
+