自测-4 Have Fun with Numbers（测试点4.5未通过）

#include <stdio.h>
int num[25] = {10};//都赋成二位数可以避免初值对查找一位数的影响 
int max = 0;
int search(int num[],int n);
int main()
{	
	unsigned long long N,N2,n2;
	int i=0,n,flag=0;
	scanf("%llu",&N);
	
	N2 = N*2;
	n2 = N2;
	while(N2!=0){
		num[i] = N2%10;
		N2 /= 10;
		max++;
		i++;
	}//将二倍的数存入数组，用于后续比较 

	while(N!=0){
		n = N%10;
		N /= 10;
		if(search(num,n))//分解N，与二倍数逐个对比 
			flag++;	
	}
	
	if(flag==max)//当flag即相同位数与总位数一致时YES 
		printf("Yes\n%llu",n2);
	else
		printf("No\n%llu",n2);
		
	return 0;
}
int search(int num[],int n)//找相同函数 
{
	int eye = 0;
	for(int j=0;j<max;j++){
		if(num[j]==n){
			num[j] = 10;//找到一次后即赋值10，避免下次重复找 
			eye = 1;
			break;
		}
	}
	if(eye)
		return 1;
	else
		return 0;
	
}

更新：已解决数组加法全通过，点击这里

unsigned long long位数大时×2会丢失精度，因此测试点4.5过不去，下次换个思路来吧

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.