Submission #72196503

---

Source Code Expand

from sys import stdin,stdout
# from os import _exit
# from bisect import bisect_left,bisect
# from heapq import heapify,heappop,heappush
# from sys import setrecursionlimit
# from collections import defaultdict,Counter,deque
# from itertools import permutations
from math import gcd,ceil,sqrt,factorial
# setrecursionlimit(int(1e5))
input,print = stdin.readline,stdout.write

n = int(input())
count = [0 for i in range(n+1)]
lim = int(sqrt(n))+1
for a in range(1,lim):
    a2 = a*a
    if a2>n:
        break
    for b in range(a+1,lim):
        s = a2+b*b
        if s>n:
            break
        count[s]+=1
ans = [i for i,c in enumerate(count) if c==1]
print(f"{len(ans)}\n")
print(" ".join(map(str,ans)))

Submission Info

Judge Result