A. Nastia and Nearly Good Numbers
题面:
中文题意:
很简单啦,给你ab两个数字,要你输出xyz三个数字,要求这三个数字满足如下条件:
- x + y = = z x+y==z x+y==z
- x , y , z x,y,z x,y,z中有两个仅为a的倍数,有一个是 a ∗ b a*b a∗b的倍数。
看代码就完事了,构造奥利给
代码:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 10;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T;
cin >> T;
while (T--) {
ll a, b;
cin >> a >> b;
// if (a % b == 0) {
// cout << "No" << endl;
// continue;
// }
if (b > 2) {
cout << "yes" << endl;
cout << a << " " << a * (b - 1) << " " << a * b << endl;
} else if (b == 2) {
cout << "yes" << endl;
cout << a << " " << a * 3 << " " << a * 4 << endl;
} else cout << "No" << endl;
}
}