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

最新推荐文章于 2018-01-15 09:08:19 发布

_Occult_

最新推荐文章于 2018-01-15 09:08:19 发布

阅读量485

点赞数

分类专栏： PAT甲级 ----模拟文章标签： PAT

本文链接：https://blog.csdn.net/jtjy568805874/article/details/50806630

版权

PAT甲级同时被 2 个专栏收录

135 篇文章 0 订阅

订阅专栏

----模拟

44 篇文章 0 订阅

订阅专栏

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

简单的模拟#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
#include<iostream>
#include<queue>
#include<map>
#include<algorithm>
using namespace std;
typedef long long LL;
const int INF = 0x7FFFFFFF;
const int maxn = 1e5 + 10;
int ch[maxn], f[maxn], flag;
char s[maxn];

int main()
{
	scanf("%s", s);
	for (int i = strlen(s) - 1, j = 0; i >= 0; i--)
	{
		ch[j++] = s[i] - '0';
		f[ch[j - 1]]++;
	}
	for (int i = 0, j = 0; s[i]; i++)
	{
		ch[i] = ch[i] * 2 + j;
		j = ch[i] / 10;
		ch[i] %= 10;
		if (--f[ch[i]] < 0) flag = 1;
		if (!s[i + 1] && j) { flag = 1; ch[i + 1] = j; }
	}
	if (!flag) printf("Yes\n"); else printf("No\n");
	if (ch[strlen(s)]) printf("%d", ch[strlen(s)]);
	for (int i = strlen(s) - 1; i >= 0; i--) printf("%d", ch[i]);
	return 0;
}