From 23a467af7807e154c9985bfebbe08f60b9418c4d Mon Sep 17 00:00:00 2001
From: Lokendra Singh Tanwar <46755891+lokendra7512@users.noreply.github.com>
Date: Thu, 1 Oct 2020 00:35:11 +0530
Subject: [PATCH] New updated code according to python 3.0

This  is a better way of solving that .
---
 problem_29.py | 24 ++++++++++--------------
 1 file changed, 10 insertions(+), 14 deletions(-)

diff --git a/problem_29.py b/problem_29.py
index 98f0b35..dbc289f 100644
--- a/problem_29.py
+++ b/problem_29.py
@@ -1,17 +1,13 @@
-from math import *
+#list to store the values of powers
+powers = []
 
-numbers_list = []
+#for loops to iterate through the numbers
+for a in range(2,101):
+	for b in range(2,101):
+		powers.append(a**b)
 
-for i in xrange(2,101):
-    for j in xrange(2,101):
-        no = pow(i,j)
-        if no not in numbers_list:
-            numbers_list.append(no)
+#removing the duplicates using sets
+powers = set(powers)
 
-print len(numbers_list)
-
-'''
-Alternative one-liner
-'''
-
-print len(set(a**b for a in xrange(2,101) for b in xrange(2,101)))
+#printing the length of powers
+print(len(powers))