4314. Coprime
Constraints
Time Limit: 1 secs, Memory Limit: 256 MB
Description
In number theory, a branch of mathematics, two integers a and b are said to be coprime or relatively prime if the only positive integer that evenly divides both of them is 1. This is the same thing as their greatest common divisor being 1. In addition to gcd(a,b)=1 and (a,b)=1. Now, give you two numbers a and b, can you tell me whether a and b are coprime?
Input
The first line contains an integer T(1<=T<=10), indicating the number of test cases.
Then, for each case, there are two integers a, b (1<=a, b<=1000) in one line.
Output
One line for each case. Print “Yes”(without quotation) if a and b are coprime, otherwise print “No”(without quotation).
Sample Input
2
3 4
256 512
Sample Output
Yes
No
Problem Source
AcFast
// Problem#: 4314
// Submission#: 1986087
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include<iostream>
#include<stdio.h>
int gcd(int a ,int b){
int Max,Min;
Max=(a>b)?a:b;
Min=(a<b)?a:b;
while(Min!=0){
int x,y;
x=Max-Min;
y=Min;
Max=(x>y)?x:y;
Min=(x<y)?x:y;
}
return Max;
}
using namespace std;
int main(){
int n;
cin>>n;
while(n--){
int a,b;
cin>>a>>b;
if(gcd(a,b)==1){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
}
return 0;
}