| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 85287 | 彭士宝 | 水仙花数II | Python3 | Accepted | 37 MS | 3784 KB | 530 | 2024-07-16 21:17:07 |
def find_narcissistic_numbers(m, n): narcissistic_numbers = [] for number in range(m, n + 1): digits = [int(x) for x in str(number)] if sum([x**3 for x in digits]) == number: narcissistic_numbers.append(number) return narcissistic_numbers def main(): m, n = map(int, input().split()) result = find_narcissistic_numbers(m, n) if result: print(' '.join(map(str, sorted(result)))) else: print('no') if __name__ == "__main__": main()