Codeforces Round #767 (Div. 2)

2022-01-23 09:00:44 阅读：234 来源： 互联网

标签：case NO 767 Codeforces YES test input Div array

比赛链接

Codeforces Round #767 (Div. 2)

B. GCD Arrays

time limit per test 2 seconds
memory limit per test 256 megabytes
inputstandard input
outputstandard output

Consider the array \(a\) composed of all the integers in the range \([l,r]\). For example, if \(l=3\) and \(r=7\), then \(a=[3,4,5,6,7]\).

Given \(l, r\), and \(k\), is it possible for \(gcd(a)\) to be greater than \(1\) after doing the following operation at most \(k\) times?

Choose \(2\) numbers from \(a\).
Permanently remove one occurrence of each of them from the array.
Insert their product back into \(a\).
\(gcd(b)\) denotes the greatest common divisor (GCD) of the integers in \(b\).

Input

The first line of the input contains a single integer \(t (1≤t≤10^5)\) — the number of test cases. The description of test cases follows.

The input for each test case consists of a single line containing \(3\) non-negative integers \(l, r\), and \(k (1≤l≤r≤10^9,0≤k≤r−l)\).

Output

For each test case, print "YES" if it is possible to have the GCD of the corresponding array greater than 1 by performing at most k operations, and "NO" otherwise (case insensitive).

Example

input

output

NO
NO
YES
YES
YES
YES
NO
NO
YES

Note

For the first test case, \(a=[1]\), so the answer is "NO", since the only element in the array is \(1\).

For the second test case the array is \(a=[3,4,5]\) and we have \(1\) operation. After the first operation the array can change to: \([3,20], [4,15]\) or \([5,12]\) all of which having their greatest common divisor equal to 1 so the answer is "NO".

For the third test case, \(a=[13]\), so the answer is "YES", since the only element in the array is \(13\).

For the fourth test case, \(a=[4]\), so the answer is "YES", since the only element in the array is \(4\).

解题思路

思维题

由于数是连续的，一些数的倍数关系，所有数的分解质因数出现的最大次数的质数是 \(2\)，所以只需要找出奇数出现的次数，每一次操作用偶数合并，即奇数个数减一。最终转换为奇数个数是否小于等于 \(k\)，另外需要特判 \(l=r\) 的情况。这里求奇数个数有个公式，可转换为求偶数个数：\(r/2-(l-1)/2\)

时间复杂度：\(O(t)\)

代码

#include<bits/stdc++.h>
using namespace std;
int t,l,r,k;
int main()
{
    for(cin>>t;t;t--)
    {
        cin>>l>>r>>k;
        if(l==r)
            puts(l==1?"NO":"YES");
        else
            puts(r-l+1-(r/2-(l-1)/2)<=k?"YES":"NO");
    }
    return 0;
}

标签：case,NO,767,Codeforces,YES,test,input,Div,array
来源： https://www.cnblogs.com/zyyun/p/15835708.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。

ICode9

Codeforces Round #767 (Div. 2)

比赛链接