4.10

Author: JiayangWu

023-5kyu-Happy^^ numbers.py

@@ -0,0 +1,15 @@
+def is_happy(n):
+    for i in range(100):
+      k = check(n)
+      if k == 1:
+        return True
+      else:
+        n = k
+    return False
+def check(n):
+  sum = 0
+  while ( n > 9 ):
+    sum += (n % 10) ** 2
+    n = n - n % 10
+    n /= 10
+  return sum + n ** 2

024-5kyu-Where my anagrams at.py

@@ -0,0 +1,9 @@
+def anagrams(s, words):
+    res = []
+    s = "".join((lambda x:(x.sort(),x)[1])(list(s)))
+    for w in words:
+      t = sorted(list(w))
+      temp = "".join(x for x in t)
+      if temp == s:
+        res.append(w)
+    return res

025-6kyu-Persistent Bugger.py

@@ -0,0 +1,14 @@
+def persistence(n):
+    res = 0
+    temp = 1
+    while (n > 9):
+        if temp == 1:
+          temp = n % 10
+        n -= n %10
+        n /= 10
+        temp *= (n % 10)
+        if (n <= 9) :
+          n = temp
+          temp = 1
+          res += 1
+    return res

026-6kyu-Travelling on a Grid.py

@@ -0,0 +1,21 @@
+def travel_chessboard(s):
+    s=s.replace(')(',',')
+    s=s.replace(' ',',')
+    s=s.replace(')','')
+    s=s.replace('(','')
+    string = s.split(',')
+    x1 = s[0]
+    y1 = s[2]
+    x2 = s[4]
+    y2 = s[6]
+    a = [[0] * 8 for i in range(8)]
+    for i in range(8):
+      for j in range(8):
+          if i == 0:
+            a[i][j] = 1
+          elif j == 0:
+            a[i][j] = 1
+          else:
+             a[i][j] = a[i-1][j] + a[i][j-1]
+    print a
+    return a[int(x2)-int(x1)][int(y2)-int(y1)]