Improved Code and removed Warnings (TheAlgorithms#483)

Author: ParthS007

Graphs/basic-graphs.py

@@ -168,7 +168,7 @@ def topo(G, ind=None, Q=[1]):
 
 
 def adjm():
-    n, a = input(), []
+    n, a = raw_input(), []
     for i in xrange(n):
         a.append(map(int, raw_input().split()))
     return a, n

Graphs/minimum_spanning_tree_kruskal.py

@@ -1,10 +1,10 @@
 from __future__ import print_function
-num_nodes, num_edges = list(map(int,input().split()))
+num_nodes, num_edges = list(map(int,raw_input().split()))
 
 edges = []
 
 for i in range(num_edges):
-	node1, node2, cost = list(map(int,input().split()))
+	node1, node2, cost = list(map(int,raw_input().split()))
 	edges.append((i,node1,node2,cost))
 
 edges = sorted(edges, key=lambda edge: edge[3])

Graphs/scc_kosaraju.py

@@ -1,12 +1,12 @@
 from __future__ import print_function
 # n - no of nodes, m - no of edges
-n, m = list(map(int,input().split()))
+n, m = list(map(int,raw_input().split()))
 
 g = [[] for i in range(n)] #graph
 r = [[] for i in range(n)] #reversed graph
 # input graph data (edges)
 for i in range(m):
-    u, v = list(map(int,input().split()))
+    u, v = list(map(int,raw_input().split()))
     g[u].append(v)
     r[v].append(u)
 

Maths/SieveOfEratosthenes.py

@@ -1,5 +1,5 @@
 import math
-n = int(input("Enter n: "))
+n = int(raw_input("Enter n: "))
 
 def sieve(n):
     l = [True] * (n+1)

Neural_Network/perceptron.py

@@ -120,5 +120,5 @@ def sign(self, u):
 while True:
     sample = []
     for i in range(3):
-        sample.insert(i, float(input('value: ')))
+        sample.insert(i, float(raw_input('value: ')))
     network.sort(sample)

Project Euler/Problem 02/sol3.py

@@ -7,7 +7,7 @@
 e.g. for n=10, we have {2,8}, sum is 10.
 '''
 """Python 3"""
-n = int(input())
+n = int(raw_input())
 a=0
 b=2
 count=0

Project Euler/Problem 03/sol1.py

@@ -19,7 +19,7 @@ def isprime(no):
     return True
 
 maxNumber = 0
-n=int(input())
+n=int(raw_input())
 if(isprime(n)):
     print(n)
 else:

Project Euler/Problem 03/sol2.py

@@ -4,7 +4,7 @@
 e.g. for 10, largest prime factor = 5. For 17, largest prime factor = 17.
 '''
 from __future__ import print_function
-n=int(input())
+n=int(raw_input())
 prime=1
 i=2
 while(i*i<=n):

Project Euler/Problem 04/sol1.py

@@ -4,7 +4,7 @@
 Find the largest palindrome made from the product of two 3-digit numbers which is less than N.
 '''
 from __future__ import print_function
-limit = int(input("limit? "))
+limit = int(raw_input("limit? "))
 
 # fetchs the next number
 for number in range(limit-1,10000,-1):

Project Euler/Problem 04/sol2.py

@@ -12,7 +12,7 @@
             arr.append(i*j)
 arr.sort()
 
-n=int(input())
+n=int(raw_input())
 for i in arr[::-1]:
     if(i<n):
         print(i)