1023 Have Fun with Numbers (20 分)(大数相乘)

本文介绍了一个有趣的问题:如何判断一个数的两倍是否仅由原数的数字重新排列组成。通过解析示例输入和输出,文章详细阐述了算法设计思路,包括如何处理多位数和进位情况,以及如何验证结果的有效性。

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

Notice that the number 123456789 is a 9-digit number consisting exactly the numbers from 1 to 9, with no duplication. Double it we will obtain 246913578, which happens to be another 9-digit number consisting exactly the numbers from 1 to 9, only in a different permutation. Check to see the result if we double it again!

Now you are suppose to check if there are more numbers with this property. That is, double a given number with k digits, you are to tell if the resulting number consists of only a permutation of the digits in the original number.

Input Specification:

Each input contains one test case. Each case contains one positive integer with no more than 20 digits.

Output Specification:

For each test case, first print in a line "Yes" if doubling the input number gives a number that consists of only a permutation of the digits in the original number, or "No" if not. Then in the next line, print the doubled number.

Sample Input:

1234567899

Sample Output:

Yes

2469135798

#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <cctype>
#include <string.h>
#include <cstdio>
using namespace std;
int book[10];
int main(){
    string num;
    cin>>num;
    int flag=0;
    for(int i=num.length()-1;i>=0;i--){
        int temp=num[i]-'0';
        book[temp]++;
        temp=temp*2+flag;
        flag=0;
        if(temp>=10){
            temp-=10;
            flag=1;
        }
        num[i]=temp+'0';
        book[temp]--;
    }
    int flag1=0;
    for(int i=0;i<10;i++)
        if(book[i]) flag1=1;
    if(flag||flag1) cout<<"No\n";
    else cout<<"Yes\n";
    if(flag==1) cout<<"1";
    cout<<num;
    return 0;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

小火汁猛猛

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

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

余额充值