CodeForces 1521A 题目翻译+思路详解+样例程序

最新推荐文章于 2025-04-28 17:28:47 发布

原创

最新推荐文章于 2025-04-28 17:28:47 发布 · 528 阅读

5 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #acm竞赛

这篇博客详细介绍了CodeForces 1521A题目的翻译、解题思路和样例程序。文章讨论了如何找到满足特定条件的不同正整数x、y、z，即一个为好数，其余为次好数，并满足x+y=z。博主提供了具体的解决方案，考虑了数据类型的选择和边界条件。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

CodeForces 1521A

题目
思路整理
- 数据的类型选择
样例程序

题目

原文描述：
Nastia has 2 positive integers A and B. She defines that:

The integer is good if it is divisible by A⋅B；
Otherwise, the integer is nearly good, if it is divisible by A.

For example, if A=6 and B=4, the integers 24 and 72 are good, the integers 6, 660 and 12 are nearly good, the integers 16, 7 are neither good nor nearly good.

Find 3 different positive integers x, y, and z such that exactly one of them is good and the other 2 are nearly good, and x+y=z.

Input：
The first line contains a single integer t (1≤t≤10 000) — the number of test cases.

The first line of each test case contains two integers A and B (1≤A≤10⁶, 1≤B≤10⁶) — numbers that Nastia has.

Output：
For each test case print:

“YES” and 3 different positive integers x, y, and z (1≤x,y,z≤10¹⁸) such that exactly one of them is good and the other 2 are nearly good, and x+y=z.
“NO” if no answer exists.

You can print each character of “YES” or “NO” in any case.
If there are multiple answers, print any.