added coursera examples

Author: ukirderohit

Algorithm/Coursera - 1/Fibonacci.py

@@ -0,0 +1,29 @@
+# Problem Description
+# Task. Given an integer ??, find the ??th Fibonacci number ????.
+# Input Format. The input consists of a single integer ??.
+# Constraints. 0 = ?? = 45.
+# Output Format. Output ????.
+# Time Limits.
+# language C C++ Java Python C# Haskell JavaScript Ruby Scala
+# time (sec) 1 1 1.5 5 1.5 2 5 5 3
+# Memory Limit. 512MB.
+
+
+
+
+
+n = int(raw_input())
+
+def fibo(n):
+ if n<=1:
+ return n
+ else:
+ previous = 0
+ current = 1
+ for _ in range(n-1):
+ previous, current = current, previous+current
+ return current
+ 
+
+
+print fibo(n)

Algorithm/Dynamic Programming/fibonacci_modified.py

@@ -0,0 +1,7 @@
+
+def fibo(n):
+ if n<=1:
+ return n
+ else:
+ return fibo(n-1)+fibo(n-2)
+print fibo(20)

Algorithm/Warmup/plus-minus.py

@@ -1,7 +1,7 @@
 #!/bin/python
 
 import sys
-
+print r
 
 n = float(raw_input().strip())
 arr = map(float,raw_input().strip().split(' '))

Algorithm/Warmup/timeconv.py

@@ -3,5 +3,5 @@
 import sys
 
 
-time = raw_input().strip("':'")
+time = raw_input().strip()
 print time

University Codesprint Contest/bestandworstrec.py

@@ -0,0 +1,14 @@
+noofgames = (int(raw_input()))
+score = map(int,raw_input().split())
+highscore=score[0]
+lowestscore = score[0]
+highct = 0
+lowct = 0
+for sc in score:
+ if sc>highscore:
+ highscore = sc
+ highct += 1
+ if sc<lowestscore:
+ lowestscore = sc
+ lowct += 1
+print highct, lowct

University Codesprint Contest/seperaenos.py

@@ -0,0 +1,14 @@
+q = int(raw_input().strip())
+for a0 in xrange(q):
+ s=raw_input().strip()
+ # if s.startswith('0'):
+ # print "No"
+ # print s.find('1')
+ # print s.rfind(s,a0,a0-1)
+ # posof1 = s.find('1')
+ digits = [str(x) for x in str(s)]
+ print digits
+ for digit in len(digits):
+ if digits[digit]-digits[digit-1] == 1:
+ print "yes"
+