浙江大学PAT_甲级_1023. 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 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

大意是：给一串由[1,9]组成的数字s，数字*2后得到第二串数字s2，如果s2里的每一位数字组成的集合等于s每一位数字组成的集合，则输出“Yes”,，否则输出“No”

python代码：

s=raw_input()#input a string of digit
s=int(s)#String conversion to int
s2=str(s*2)#Double it
s=str(s)
flag=int(0)
for i in s2:
    #If s2 char does not appear in s and The number of occurrences are not equal.
    if i not in s or s2.count(i)!=s2.count(i):
        print 'No'
        flag=1
        break
for i in s:
    #If s char does not appear in s2.
    if i not in s2 or s2.count(i)!=s.count(i):
        if flag==0:
            print 'No'
        flag=1
        break
if flag==0:
    print 'Yes'
print s2