diff --git a/.idea/misc.xml b/.idea/misc.xml
new file mode 100644
index 0000000..240f774
--- /dev/null
+++ b/.idea/misc.xml
@@ -0,0 +1,4 @@
+
+
+
+
\ No newline at end of file
diff --git a/.idea/modules.xml b/.idea/modules.xml
new file mode 100644
index 0000000..9307b63
--- /dev/null
+++ b/.idea/modules.xml
@@ -0,0 +1,8 @@
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/.idea/pycbit-hackathon.iml b/.idea/pycbit-hackathon.iml
new file mode 100644
index 0000000..6711606
--- /dev/null
+++ b/.idea/pycbit-hackathon.iml
@@ -0,0 +1,11 @@
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/.idea/vcs.xml b/.idea/vcs.xml
new file mode 100644
index 0000000..94a25f7
--- /dev/null
+++ b/.idea/vcs.xml
@@ -0,0 +1,6 @@
+
+
+
+
+
+
\ No newline at end of file
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
new file mode 100644
index 0000000..b764e0d
--- /dev/null
+++ b/.idea/workspace.xml
@@ -0,0 +1,276 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ 1521363394362
+
+
+ 1521363394362
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/1_sum.py b/1_sum.py
new file mode 100644
index 0000000..98ba7ac
--- /dev/null
+++ b/1_sum.py
@@ -0,0 +1,12 @@
+nums = []
+for i in range(1,500):
+ if i%5==0 and i%7!=0:
+ nums.append(i)
+ else:
+ a = 1
+print(nums)
+sum=0
+for n in range(0,len(nums)):
+ ins=nums[n]
+ sum=sum +ins
+print(sum)
\ No newline at end of file
diff --git a/2_room_total_surface_area.py b/2_room_total_surface_area.py
new file mode 100644
index 0000000..7aeb5ba
--- /dev/null
+++ b/2_room_total_surface_area.py
@@ -0,0 +1,14 @@
+l=6
+b=8
+h=10
+def calc(l,b,h):
+ area=2*((l*b)+(b*h)+(h*l))
+ print(area)
+calc(6,8,10)
+def inc(l,b,h):
+ l=l*1.15
+ b=b*1.15
+ h=h*1.15
+ area = 2 * ((l * b) + (b * h) + (h * l))
+ print(area)
+inc(6,8,10)
\ No newline at end of file
diff --git a/3_sort.py b/3_sort.py
new file mode 100644
index 0000000..eb93519
--- /dev/null
+++ b/3_sort.py
@@ -0,0 +1,7 @@
+list2=['Potter','Fred','Greg','George','Voldemort','Sirius','Dumbledore']
+list2.sort()
+list1=['ron','hermione','harry','professor','dobby',str(list2),'The House Elf','Potter','Granger','Lockhart','Weasley']
+list1.sort()
+print(list1)
+list3=list1+list2
+print(list3)
\ No newline at end of file
diff --git a/4_triplet.py b/4_triplet.py
new file mode 100644
index 0000000..6e516c5
--- /dev/null
+++ b/4_triplet.py
@@ -0,0 +1,10 @@
+for a in range(1, 1000):
+ for b in range(a + 1, 1000):
+ c = 1000-(a + b)
+ if (a * 2)+(b * 2) == (c ** 2):
+ if a + b + c == 1000:
+ print(a)
+ print(b)
+ print(c)
+ print(a*b*c)
+ break
\ No newline at end of file
diff --git a/6_primes.py b/6_primes.py
new file mode 100644
index 0000000..2d8aec1
--- /dev/null
+++ b/6_primes.py
@@ -0,0 +1,14 @@
+def isprime(num):
+ if num > 1:
+ # check for factors
+ for i in range(2, num):
+ if (num % i) == 0:
+ break
+ else:
+ print(num, "is a prime number")
+
+ else:
+ print(num, "is not a prime number")
+
+for n in range(1,99999):
+ isprime(n)
\ No newline at end of file
diff --git a/7_palindrome.py b/7_palindrome.py
new file mode 100644
index 0000000..ce2021c
--- /dev/null
+++ b/7_palindrome.py
@@ -0,0 +1,11 @@
+def reverse(test):
+ n = len(test)
+ x=""
+ for i in range(n-1,-1,-1):
+ x += test[i]
+ return x
+
+value = input("your input ")
+revved=reverse(value)
+if (value==revved):
+ print("palindrome")
\ No newline at end of file