Submission #3225163

---

Source Code Expand

from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())

N = int(input())

for h in range(1,3501):
	for n in range(1,3501):
		si = h*n*N
		bo = 4*h*n-(h+n)*N
		if bo > 0 and si%bo == 0:
			print(h,n,si//bo)
			sys.exit()

Submission Info

Judge Result