Toy_problems

Author: matt-strautmann

Cut_sticks.py

@@ -0,0 +1,57 @@
+'''
+Problem Statement
+
+You are given N sticks, where the length of each stick is a positive 
+integer. A cut operation is performed on the sticks such that all of 
+them are reduced by the length of the smallest stick.
+
+Suppose we have six sticks of the following lengths:
+
+5 4 4 2 2 8
+
+Then, in one cut operation we make a cut of length 2 from each of the 
+six sticks. For the next cut operation four sticks are left (of non-zero 
+	length), whose lengths are the following:
+
+3 2 2 6
+
+The above step is repeated until no sticks are left.
+
+Given the length of N sticks, print the number of sticks that are cut 
+in subsequent cut operations.
+
+Note: For each cut operation, you have to recalcuate the length of 
+smallest sticks (excluding zero-length sticks).
+
+Input Format 
+The first line contains a single integer N. 
+The next line contains N integers: a0, a1,...aN-1 separated by space, 
+where ai represents the length of ith stick.
+
+Output Format 
+For each operation, print the number of sticks that are cut in separate 
+line.
+
+Constraints 
+1 ≤ N ≤ 1000 
+1 ≤ ai ≤ 1000
+'''
+
+def cut_sticks(sticks):
+    new_sticks = []
+    while len(sticks) > 0:
+    	new_sticks = []
+    	cuts = 0
+    	minV = min(sticks) 
+    	for i in xrange(len(sticks)):
+			sticks[i] -= minV
+			cuts += 1
+			if sticks[i] != 0:
+				new_sticks.append(sticks[i])
+    	sticks = new_sticks
+    	print cuts
+        
+if __name__ == '__main__':
+    in1 = raw_input()
+    sticks = map(int, raw_input().strip().split(" "))
+    cut_sticks(sticks)

FizzBuzzShort.py

@@ -0,0 +1,11 @@
+'''Problem Statement
+
+Write a program that prints (to STDOUT) the numbers from 1 to 100. But for multiples of three print "Fizz" instead of the number and for the multiples of five print "Buzz". For numbers which are multiples of both three and five print "FizzBuzz".
+
+The goal is to write the shortest code possible.
+'''
+
+
+for i in range(1,101):
+    print ('FizzBuzz' if i%15==0 else ('Buzz' if i%5==0 else \
+    	  ('Fizz' if i%3==0 else i) ) )

Lonely_Integer.py

@@ -0,0 +1,32 @@
+'''
+Problem Statement:
+
+There are N integers in an array A. All but one integer occur in pairs. Your task is to find the number that occurs only once.
+
+Input Format
+
+The first line of the input contains an integer N, indicating the number of integers. The next line contains N space-separated integers that form the array A.
+
+Constraints
+
+1≤N<100 
+N % 2=1 (N is an odd number) 
+0≤A[i]≤100,∀i∈[1,N]
+Output Format
+
+Output S, the number that occurs only once.
+'''
+
+from collections import Counter
+def lonelyinteger(a):
+    c = Counter(a)
+    answer = 0
+    for i in c:
+    	if c[i] == 1:
+            answer = i
+    return answer
+    
+if __name__ == '__main__':
+    a = input()
+    b = map(int, raw_input().strip().split(" "))
+    print lonelyinteger(b)