PS 부수기
Project Euler #29 : Distinct powers 본문
|
1
2
3
4
5
|
s=set([])
for i in range(2, 101) :
for j in range(2, 101) :
s.add(i**j)
print(len(s))
|
cs |
C로 풀려면 (a^b)^c = a^(b^c)임을 고려하면 풀릴거같다..! 근데 귀찮..
'Project Euler' 카테고리의 다른 글
| Project Euler #31 : Coin sums (0) | 2020.08.08 |
|---|---|
| Project Euler #30 : Digit fifth powers (0) | 2020.08.08 |
| Project Euler #28 : Number spiral diagonals (0) | 2020.08.08 |
| Project Euler #27 : Quadratic primes (0) | 2020.08.08 |
| Project Euler #26 Reciprocal cycles (0) | 2020.08.08 |
Comments