PTA 7-49 Have Fun with Numbers

最新推荐文章于 2022-11-24 21:02:34 发布

「已注销」

最新推荐文章于 2022-11-24 21:02:34 发布

阅读量183

点赞数

本文链接：https://blog.csdn.net/j826435617/article/details/104870315

版权

该博客讨论了一种有趣的数学现象，即数字123456789翻倍后仍由原数字的排列组成。文章提出一个问题，要求检查给定的不超过20位的正整数，翻倍后是否也具有这种性质，并提供了相应的代码实现。

摘要由CSDN通过智能技术生成

题目：
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.

代码如下：

#include <stdio.h>
#include <math.h>

int main()
{
   
    char number[21],cnt=0,flag=0,copy[20],k;
    int a[10]={
   0},b[10]={
   0};
    scanf("%s",number);
    //