Merge pull request #42 from ajayrandy/master

Verified

Author: revannth

set1and2/1_lessthan500.py

@@ -0,0 +1,8 @@
+sum=0
+#initializing step value to 5 so that numbers which are not multiples of 5 are not counted
+for i in range(5,500,5):
+	if(i%5==0) and (i%7!=0):
+		sum=sum+i
+
+print("sum of numbers less than 500 which are divisible by 5 and not divisible by 7 is "+str(sum))
+ 

set1and2/2_room_increase.py

@@ -0,0 +1,11 @@
+def func1(increase):
+    length=6
+    breadth=8
+    height=10
+    len1=length+(increase/100)
+    breadth1=breadth+(increase/100)
+    height1=height+(increase/100)
+    newarea=len1*breadth1*height1
+    print("new area is "+str(newarea))
+func1(15)
+

set1and2/3_list.py

@@ -0,0 +1,7 @@
+list1=['Ron','Hermione','Harry','Professor','Dobby','List Items 2','The House Elf','Potter','Granger','Lockhart','Weasley']
+List_Items_2=['Potter','Fred','Greg','George','Voldemort','Sirius','Dumbledore']
+#sorting list1 items
+list1_sorted=sorted(list1)
+#adding sorted list1 and list 2 items
+list3=list1_sorted+List_Items_2
+print(list3)

set1and2/4_triplet.py

@@ -0,0 +1,13 @@
+#function to find triplets
+def triplet(a, b, c):
+    return (a**2) + (b**2) == (c**2)
+
+SUM = 1000
+#finding products of triplets whose sum is 1000
+for i in range(1, SUM):
+    for j in range(i+1, SUM):
+        c = SUM - (i + j)
+        if(triplet(i, j, c)):
+            if i + j + c == SUM:
+                print (i * j * c)
+                break

set1and2/6_print_primes.py

@@ -0,0 +1,9 @@
+def prime(q):
+    for a in range(2,q):
+        k=0
+        for i in range(2,a//2+1):
+            if(a%i==0):
+                k=k+1
+        if(k<=0):
+            print(a)
+prime(99999)

set1and2/7_palin.py

@@ -0,0 +1,14 @@
+#taking input from the user
+n= input("enter something")
+#reversing the string using n[::-1] 
+if n[::-1] == n[0:]:
+  
+	print(n, " is a palindrome")
+
+else:
+  
+	print(n, " is not a palindrome")
+
+
+
+