Description |
给定两个正整数a、b,判断两个数是否为互质数(除1外,两个数没有相同的因子)。根据Hint中给出的主函数定义函数并给出实现。 |
Input |
本题有多组测试数据。 第一行只有一个正整数n,代表更有n组测试数据。 之后为n行,每行对应一组测试数据,包含两个正整数a、b。 |
Output |
针对每组测试数据输出一行,如果a、b为互质数,输出格式为: a and b are coprime numbers. 如果a、b不是互质数,输出格式为: a and b are not coprime numbers. 其中a、b为测试数据。 |
Sample Input |
5 3 5 5 10 7 9 9 12 11 13 |
Sample Output |
3 and 5 are coprime numbers. 5 and 10 are not coprime numbers. 7 and 9 are coprime numbers. 9 and 12 are not coprime numbers. 11 and 13 are coprime numbers. |
Hint |
int main(){ int n,a,b; cin>>n; while(n--){ cin>>a>>b; coprime(a,b); } } |
#include<bits/stdc++.h>
using namespace std;
const int N = 1000010;
void coprime(int a,int b) {
int MIN = min(a, b);
bool vis = true;
for (int i = 2;i <= MIN;i++) {
if (a % i == 0&&b%i==0) {
vis = false;
break;
}
}
if (vis)cout << a << " and " << b << " are coprime numbers." << endl;
else cout << a << " and " << b << " are not coprime numbers." << endl;
}
int main() {
int n, a, b;
cin >> n;
while (n--) {
cin >> a >> b;
coprime(a, b);
}
}