Have Fun with Numbers(C语言)

最新推荐文章于 2023-04-03 11:25:41 发布

sharon_JIAN

最新推荐文章于 2023-04-03 11:25:41 发布

阅读量1.8k

点赞数 7

CC 4.0 BY-SA版权

分类专栏： C语言文章标签： C语言基础

本文链接：https://blog.youkuaiyun.com/sharon_1995/article/details/89296019

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>
#define SIZE 20
int main()
{
   
   
    int num[SIZE],double_num[SIZE],bit=0; //bit记录原始数位数
    int digit[10]={
   
   0