【PAT-甲级】1023-Have Fun with Numbers

最新推荐文章于 2024-05-20 20:08:58 发布

__zz11

最新推荐文章于 2024-05-20 20:08:58 发布

阅读量104

点赞数

分类专栏： PAT甲级文章标签：算法 c++

本文链接：https://blog.csdn.net/i777777777777777/article/details/123834828

版权

PAT甲级专栏收录该内容

6 篇文章 0 订阅

订阅专栏

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

AC 代码:

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
	string s;
	cin >> s;
	string tmp = "";
	int jinwei = 0;
	for (auto i = s.rbegin(); i != s.rend(); i++)
	{
		int num = (*i - '0') * 2 + jinwei;
		jinwei = num / 10;
		tmp += num % 10 + '0';
	}
	string ret = tmp;
	sort(s.begin(), s.end());
	sort(tmp.begin(), tmp.end());
	if (!jinwei && tmp == s)
		cout << "Yes" << endl;
	else
		cout << "No" << endl;
    if(jinwei)
        ret+='1';
	reverse(ret.begin(), ret.end());
	cout << ret;
	return 0;
}