algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-27 18:43:52 +08:00
Code Issues Packages Projects Releases Wiki Activity

Modernize Python 2 code to get ready for Python 3 AGAIN

Browse Source
This commit is contained in:
cclauss
2018-01-21 08:25:19 +01:00
parent 54f6d1f6d7
commit 4ee0e620cb
6 changed files with 31 additions and 30 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
Project Euler/Problem 29/solution.py
View File

@ -1,16 +1,18 @@
def main():
"""
"""
Consider all integer combinations of ab for 2 <= a <= 5 and 2 <= b <= 5:
22=4, 23=8, 24=16, 25=32
32=9, 33=27, 34=81, 35=243
42=16, 43=64, 44=256, 45=1024
52=25, 53=125, 54=625, 55=3125
If they are then placed in numerical order, with any repeats removed, we get the following sequence of 15 distinct terms:
If they are then placed in numerical order, with any repeats removed,
we get the following sequence of 15 distinct terms:
4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125
How many distinct terms are in the sequence generated by ab for 2 <= a <= 100 and 2 <= b <= 100?
How many distinct terms are in the sequence generated by ab
for 2 <= a <= 100 and 2 <= b <= 100?
"""
collectPowers = set()
@ -19,15 +21,12 @@ def main():
N = 101 # maximum limit
for a in range(2,N):
for b in range (2,N):
for a in range(2, N):
for b in range(2, N):
currentPow = a**b # calculates the current power
collectPowers.add(currentPow) # adds the result to the set
print "Number of terms ", len(collectPowers)
print("Number of terms ", len(collectPowers))
if __name__ == '__main__':