Modified

Author: Rezwan

CodeChef/Life, the Universe, and Everything.py

@@ -0,0 +1,4 @@
+n = int(input())
+while n != 42:
+    print(n)
+    n = int(input())

CodeChef/N different palindromes.py

@@ -0,0 +1,11 @@
+from string import ascii_lowercase
+T = int(input())
+for i in range(T):
+    chars = ascii_lowercase
+    n = int(input())
+    ans = ''
+    ind = 0
+    while ind<n:
+        ans += chars[ind%26]
+        ind += 1
+    print (ans)

HackerRank/Loops.py

@@ -0,0 +1,4 @@
+# Enter your code here. Read input from STDIN. Print output to STDOUT
+n = int(input())
+for i in range (0,n):
+    print (i*i)

Loop.py

@@ -0,0 +1,149 @@
+for i in range(10):
+    print(i,end=' ')
+print()
+'''
+Output:
+0 1 2 3 4 5 6 7 8 9 
+'''
+
+for i in range(10, 0, -1):
+    print(i, end=' ')
+print()
+'''
+Output:
+10 9 8 7 6 5 4 3 2 1 
+'''
+
+for i in reversed(range(10)):
+    print(i, end=' ')
+print()
+'''
+Output:
+9 8 7 6 5 4 3 2 1 0 
+'''
+
+i = 10
+while i != 0:
+    print(i, end=' ')
+    i -= 1
+print()
+'''
+Output:
+10 9 8 7 6 5 4 3 2 1 
+'''
+
+
+# 1 + 2 + 3 + ....... + n
+### for loop
+n = int(input())
+sm = 0
+for i in range(1, n + 1):
+    sm += i
+
+print(sm)
+'''
+Input:
+100
+
+Output:
+5050
+'''
+
+### while loop
+n = int(input())
+i = 0
+sm = 0
+while i <= n:
+    sm += i
+    i += 1
+print(sm)
+
+
+# Counts how many 2 divides 100
+x = 100
+cnt = 0
+while x%2 == 0:
+    x = x//2
+    cnt += 1
+print(cnt)
+'''
+Output:
+2 
+'''
+
+#### Finds out the highest number which is power of 2 and less than 1000
+x = 1
+# if multiplying by 2 does not exceed 1000, multiply
+while x*2 < 1000:
+    x *= 2
+print(x)
+
+
+#### prints odd numbers 1 to 10
+for i in range(1, 10 + 1):
+    if i % 2 == 0: continue
+    print(i, end= ' ')
+print()
+
+### Print only 1,2,3
+for i in range(1, 11):
+    if i > 3:
+        break
+    print(i, end=' ')
+print()
+
+
+
+##### 1 + (1+2) + (1+2+3) + .... + (1+2+3+..+n)
+n = int(input())
+sm = 0
+for i in range(1, n+1):
+    for j in range(1, i):
+        sm += j
+print(sm)
+
+
+### Simple function for problem solving
+
+def Main():  # user define function
+    n = int(input())
+    # now we will calculate the factorial of a number
+    fact = 1
+    for i in range(1, n + 1):
+        fact *= i
+
+    print(fact)
+
+
+if __name__ == '__main__':  # python3 'main' function
+    Main()  # call the user define function 'Main()'
+
+###########
+
+### EOF
+
+while True:
+    try:
+        a = input()
+        print(a)
+    except EOFError:
+        break
+
+
+
+
+
+'''
+** You are now able to solve following online-judge problems.
+------------------------------------------------------------
+(1) URI Online Judge | 1103 Alarm Clock
+(2) Timus | 1083. Factorials!!!
+(3) Timus | 1209. 1, 10, 100, 1000...
+(4) URI Online Judge | 1161 Factorial Sum
+(5) URI Online Judge | 1059 Even Numbers
+(6) HackerRank | Loops
+(7) Spoj | TEST - Life, the Universe, and Everything
+(8) CodeChef | Life, the Universe, and Everything 
+(9) CodeChef | N different palindromes
+(10) UVa | 10055 Hashmat the Brave Warrior
+'''

Spoj/TEST - Life, the Universe, and Everythin.py

@@ -0,0 +1,4 @@
+n = int(input())
+while n != 42:
+    print(n)
+    n = int(input())

Timus/1083. Factorials!!!.py

@@ -0,0 +1,11 @@
+def Main():
+    n, s = map(str, input().split())
+    ln = len(s)
+    fact = 1
+    n = int(n)
+    for i in range(n, 1, -ln):
+        fact *= i
+    print(fact)
+
+if __name__ == '__main__':
+    Main()

Timus/1209. 1, 10, 100, 1000....py

@@ -0,0 +1,14 @@
+import  math
+T = int(input())
+while T != 0:
+    k = int(input())
+    t = int(math.sqrt((k-1)*2))
+
+    if (t*(t+1)//2 + 1) == k:
+        print(1, end=' ')
+    else:
+        print(0, end=' ')
+
+    T -= 1
+
+# Vertict TLE

URI/1059 Even Numbers.py

@@ -0,0 +1,14 @@
+# -*- coding: utf-8 -*-
+
+'''
+Escreva a sua solução aqui
+Code your solution here
+Escriba su solución aquí
+'''
+'''
+Created on Aug 16, 2016
+
+@author: Md. Rezwanul Haque
+'''
+for _ in range(2,102,2):
+    print(_)

URI/1161 Factorial Sum.py

@@ -0,0 +1,23 @@
+
+'''
+Escreva a sua solução aqui
+Code your solution here
+Escriba su solución aquí
+'''
+
+'''
+Created on Aug 9, 2016
+
+@author: Md. Rezwanul Haque
+'''
+def Fact(n):
+    if n == 0 or n == 0: return 1
+    return n*Fact(n-1)
+
+while True:
+    try:
+        a, b = map(int, input().split())
+        S = Fact(a) + Fact(b)
+        print(S)
+    except EOFError:
+            break

UVa/10055 Hashmat the Brave Warrior.py

@@ -0,0 +1,10 @@
+'''
+Created on Jul 28, 2016
+@author: Md. Rezwanul Haque
+'''
+while(True):
+    try:
+        x, y = map(int,input().split())
+        print(abs(x-y))
+    except EOFError:
+        break