Added some solutions to exercises written during REC Chennai workshop.
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/day1/exercise/arms.py Tue Jan 12 19:05:09 2010 +0530
@@ -0,0 +1,18 @@
+# Armstrong Numbers
+
+for n in range(100, 1000):
+# s = str(n)
+# a, b, c = int(s[0]), int(s[1]), int(s[2])
+# if a * a * a + b * b * b + c * c * c == n:
+# print n
+# sum, copy = 0, n
+# while copy > 0:
+# sum += (copy % 10) ** 3
+# copy /= 10
+# if sum == n:
+# print n
+ u = n % 10
+ h = n / 100
+ t = (n/10) % 10
+ if h ** 3 + t ** 3 + u ** 3 == N:
+ print n
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/day1/exercise/lister.py Tue Jan 12 19:05:09 2010 +0530
@@ -0,0 +1,13 @@
+s = "1, 3-7, 12, 15, 18-21"
+answer = []
+single = "answer.append( %s )"
+many = "answer.extend(range(%s))"
+COMMA = ','
+MINUS = '-'
+for p in s.split(COMMA):
+ if MINUS not in p:
+ eval( single % (p) )
+ else:
+ p = p.replace( MINUS, COMMA) + '+ 1 '
+ eval( many % (p) )
+print answer
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/day1/exercise/x.py Tue Jan 12 19:05:09 2010 +0530
@@ -0,0 +1,19 @@
+d1 = [2,4,6,8]
+d0 = [0,2,4,6,8]
+dq = [0, 4, 6]
+
+for a in d1:
+ th = a * 1000
+ for b in d0:
+ hu = b * 100
+ for c in d0:
+ te = c * 10
+ for u in dq:
+ n = th + hu + te + u
+ if is_square(n): print n
+
+
+for i in range(46, 94, 2):
+ n = i * i
+ if all_even( n ): print n
+