challenge-066/lubos-kolouch/python/ch-2.py


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

#!/usr/bin/env python
# -*- coding: utf-8 -*-

from math import sqrt, log


def find_expressions(N: int):
    solutions = []

    for m in range(2, int(sqrt(N)) + 1):
        for n in range(2, int(log(N) / log(m)) + 1):
            if m**n == N:
                solutions.append(f"{m}^{n}")

    return solutions or 0


N = 64
result = find_expressions(N)
if isinstance(result, list):
    print(' or '.join(result))
else:
    print("0")