Codeforces Round #697 (Div. 3), problem: (A) Odd Divisor,

最新推荐文章于 2021-02-10 20:01:16 发布

aisliveF

最新推荐文章于 2021-02-10 20:01:16 发布

阅读量913

点赞数 1

分类专栏：竞赛

本文链接：https://blog.csdn.net/weixin_46006714/article/details/113178073

版权

本文讨论了Codeforces Round #697 (Div. 3)中的问题A——Odd Divisor。题目要求检查给定整数n是否有一个大于1的奇数除数。通过分析，发现直接对n的平方根进行操作会导致效率低下，因此提出使用logn级别的算法优化求解，提高解题效率。文章附带了相关代码实现。

摘要由CSDN通过智能技术生成

A. Odd Divisor
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given an integer n. Check if n has an odd divisor, greater than one (does there exist such a number x (x>1) that n is divisible by x and x is odd).

For example, if n=6, then there is x=3. If n=4, then such a number does not exist.

Input
The first line contains one integer t (1≤t≤104) — the number of test cases. Then t test cases follow.

Each test case contains one integer n (2≤n≤1014).

Please note, that the input for some test cases won’t fit into 32-bit integer type, so you should use at least 64-bit integer type in your programming language.

Output
For each test case, output on a separate line:

“YES” if n has an odd divisor, greater than one;
“NO” otherwise.
You can output “YES” and “NO” in any case (for example, the strings yEs, yes, Yes