PAT (Advanced Level)1023. Have Fun with Numbers (20)

题目链接

1023. Have Fun with Numbers (20)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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 file 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

//1023. Have Fun with Numbers(20)

#include <iostream>
#include <string>
using namespace std;

int main() {
	int s0[11] = { 0 }, s1[11] = { 0 };
	string s;
	cin >> s;
	string sx = s;
	for (int i = 0; i < s.size(); i++)
		s0[s[i] - '0']++;
	int jinwei = 0;
	for (int i = s.size() - 1; i >= 0; i--) {
		sx[i] = ((s[i] - '0') * 2 + jinwei) % 10 + '0';
		s1[sx[i] - '0']++;
		jinwei = ((s[i] - '0') * 2 + jinwei) / 10;
	}
	if (jinwei) {
		char c = jinwei + '0';
		sx = c + sx;
		cout << "No" << endl << sx << endl;
		return 0;
	}
	for (int i = 0; i < 11; i++) {
		if (s0[i] != s1[i]) {
			cout << "No" << endl << sx << endl;
			return 0;
		}
	}
	cout << "Yes" << endl << sx << endl;
	return 0;
}

ps : string定义量一定要初始化，否则会提示下标越界！！！！！

ps : 完全折服于我这个用一会就卡出shit的computer，今天就到这里了。