Toggle navigation
linghang
F.A.Qs
Web Board
ProblemSet
Source/Category
Status
Ranklist
Contest
[
ProblemSet
Status
Ranklist
OI Ranklist
Statistics
]
Login
Problem F: 极值问题(acme)
Problem F: 极值问题(acme)
Time Limit:
1
Sec
Memory Limit:
128 MB
Submit:
7
Solved:
4
[
Submit
] [
Status
] [
Web Board
] [Creator:
]
Description
已知 m、n 为整数,且满足下列两个条件:
① m、n∈{1,2,…,k},即 1≤m,n≤k
②(n^2-m*n-m^2)^2=1
你的任务是:编程输入正整数k(1≤k≤10^9),求一组满足上述两个条件的m、n,并且使m^2+n^2的值最大。
例如,从键盘输入k=1995,则输出:m=987 n=1597。
Sample Input
Copy
1995
Sample Output
Copy
m=987 n=1597