7-3 Have Fun with Numbers (20分)

7-3 Have Fun with Numbers (20分)
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 <string>
using namespace std;

int main(){
	string num = "";
	getline(cin,num);
	string data = num;
	int step = 0;
	int i;
	for(i = num.size()-1; i >= 0; --i){
		if(((num[i]-'0')*2+step)<10){
			num[i] = num[i]*2-'0'+step;
			step = 0;
		}
		else {
			int temp = (num[i]-'0')*2+step;
			num[i] = temp%10 + '0';
			step = temp/10;
		}
	}
	bool flag = true;
	if(step)
		num.insert(num.begin(),1,step+'0'), flag = false;
	if(flag){
		int vis[10][2]={0};
		for(int i = data.size()-1; i >= 0; --i)
			vis[(data[i]-'0')%10][0]++, vis[(num[i]-'0')%10][1]++;
		for(int i = 0; i < 10; ++i){
			if(vis[i][0]!=vis[i][1]){
				flag = false;
				break;
			}
		}
		if(flag)
			cout << "Yes" << endl;
		else 
			cout << "No" << endl;
	}
	else {
		cout << "No" << endl;
	}
	cout << num;
	return 0;
}