| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 87011 | sh25_zhangyy | 二的幂次方 | Python3 | Accepted | 28 MS | 3712 KB | 530 | 2026-04-10 15:06:29 |
def f(n): if n == 0: return "0" if n == 1: return "2(0)" if n == 2: return "2" parts = [] i = 0 while n: if n & 1: parts.append(i) n >>= 1 i += 1 parts.reverse() res = [] for p in parts: if p == 0: res.append("2(0)") elif p == 1: res.append("2") else: res.append("2(" + f(p) + ")") return "+".join(res) n = int(input()) print(f(n))