CF1184A1.Heidi Learns Hashing (Easy)
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Melody Pond was stolen from her parents as a newborn baby by Madame Kovarian, to become a weapon of the Silence in their crusade against the Doctor. Madame Kovarian changed Melody's name to River Song, giving her a new identity that allowed her to kill the Eleventh Doctor.
Heidi figured out that Madame Kovarian uses a very complicated hashing function in order to change the names of the babies she steals. In order to prevent this from happening to future Doctors, Heidi decided to prepare herself by learning some basic hashing techniques.
The first hashing function she designed is as follows.
Given two positive integers (x,y) she defines H(x,y):=x2+2xy+x+1 .
Now, Heidi wonders if the function is reversible. That is, given a positive integer r , can you find a pair (x,y) (of positive integers) such that H(x,y)=r ?
If multiple such pairs exist, output the one with smallest possible x . If there is no such pair, output "NO".
输入格式
The first and only line contains an integer r ( 1≤r≤1012 ).
输出格式
Output integers x,y such that H(x,y)=r and x is smallest possible, or "NO" if no such pair exists.
输入输出样例
输入#1
19
输出#1
1 8
输入#2
16
输出#2
NO