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

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

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

题目

原文描述
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≤106, 1≤B≤106) — numbers that Nastia has.

Output
For each test case print:

  • “YES” and 3 different positive integers x, y, and z (1≤x,y,z≤1018) 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.

input
3
5 3
13 2
7 11
output
YES 10 50 6
评论 2
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值