Python solution for day 19 (#181)

* Add @vishalshirke7 as a contributor

* Update @vishalshirke7 as a contributor

* Added python solutions for Day 4

* modified readme

* Add @Vishal

* reverted adding as a contributor

* Update README.md

* Update CONTRIBUTORS.md

* Update CONTRIBUTORS.md

* Added python solutions for day 7

* Edited python solution for day 7

* Edited python solution for day 7

* Added python solution for day 10

* Changed readme for day 10

* minor changes

* Python solution for day 11

* Python solution for day10 and day11

* Added python solution for day 13

* python solution for day 14

* Python solution for day 16

* Python solution for day 19

Author: vishalshirke7

day16/README.md

@@ -46,7 +46,6 @@ console.log ('\n/* ===== for 3 disks ===== */');
 towerOfHanoi (3, 'A', 'C', 'B');
 ```
 
-
 ## Java Implementation
 
 ### [Solution](./Java/towersOfHanoi.java)
@@ -135,7 +134,7 @@ main
 
 
 def towerhanoi(n, from_rod, to_rod, aux_rod):
-    if n = 1:
+    if n == 1:
         print("Move disk 1 from rod %d to rod %d"%(from_rod, to_rod))
         return
     towerhanoi(n - 1, from_rod, aux_rod, to_rod)
@@ -145,6 +144,7 @@ def towerhanoi(n, from_rod, to_rod, aux_rod):
 
 no_of_disks = int(input())
 towerhanoi(no_of_disks, 'A', 'C', 'B')
+
 ```
 
 ### [Solution by @hiteshsubnani0128](./python3/hitesh_toh.py)

day19/Python/Cartesian.py

@@ -0,0 +1,30 @@
+"""
+  @author : vishalshirke7
+  @date : 15/01/2019
+"""
+
+import itertools
+
+
+def cartesian1(*iplists):   # method 1 using product function
+    for element in itertools.product(*iplists):
+        print(element)
+
+
+def cartesian2(ip1, ip2):   # method 2 using iteration
+    if not ip1 or not ip2:
+        return None
+    cartesian_product = []
+    for i in ip1:
+        for j in ip2:
+            cartesian_product.append((i, j))
+
+    return cartesian_product
+
+
+ip1 = list(map(int, input().split()))
+ip2 = list(map(int, input().split()))
+cartesian1(ip1, ip2)
+cartesian = cartesian2(ip1, ip2)
+for i in cartesian:
+    print(i)

day19/README.md

@@ -200,6 +200,44 @@ def main():
 
 ***
 
+### Python Implementation
+
+#### [Solution by @vishalshirke7](./Python/Cartesian.py)
+
+```python
+"""
+  @author : vishalshirke7
+  @date : 15/01/2019
+"""
+
+import itertools
+
+
+def cartesian1(*iplists):   # method 1 using product function
+    for element in itertools.product(*iplists):
+        print(element)
+
+
+def cartesian2(ip1, ip2):   # method 2 using iteration
+    if not ip1 or not ip2:
+        return None
+    cartesian_product = []
+    for i in ip1:
+        for j in ip2:
+            cartesian_product.append((i, j))
+
+    return cartesian_product
+
+
+ip1 = list(map(int, input().split()))
+ip2 = list(map(int, input().split()))
+cartesian1(ip1, ip2)
+cartesian = cartesian2(ip1, ip2)
+for i in cartesian:
+    print(i)
+```
+
+
 ## Ques B
 
 **Question** -- Given an array, write a function that returns an array with shuffled elements form the original array