PAT basic1001-1005(Python版)

Python2环境

1001:

from sys import exit
x = int( raw_input() )
path = 0

while 1:
	if x == 1:
		break

	if x % 2 == 0:
		x /= 2
	else:
		x = ( 3 * x + 1 ) / 2
	
	path += 1
	
	if x == 1:
		break

print path
exit(0)


1002:

from sys import exit
str = raw_input()
sum = 0

for i in str:
    sum += int(i)

sumStr = '%d' % sum
str = ""
for i in range(len(sumStr)):
    if i == len(sumStr)-1:
        flag = ''
    else:
        flag = ' '

    if sumStr[i] == '1':
        str += 'yi' + flag
    if sumStr[i] == '2':
        str += 'er' + flag
    if sumStr[i] == '3':
        str += 'san' + flag
    if sumStr[i] == '4':
        str += 'si' + flag
    if sumStr[i] == '5':
        str += 'wu' + flag
    if sumStr[i] == '6':
        str += 'liu' + flag
    if sumStr[i] == '7':
        str += 'qi' + flag
    if sumStr[i] == '8':
        str += 'ba' + flag
    if sumStr[i] == '9':
        str += 'jiu' + flag
    if sumStr[i] == '0':
        str += 'ling' + flag

print str       
exit(0)


1003:

from sys import exit

def isValid( strList ):
    if strList.count('P') != 1 or strList.count('T') != 1:
        return 1
    
    pIndex = strList.index('P')
    tIndex = strList.index('T')

    if pIndex == 0 and tIndex == 1:
        return 1
    
    listLen = len(strList)        
    if (pIndex * (tIndex - pIndex-1) != listLen - 1 - tIndex):                
        return 1

    keyNum = 0        
    for i in strList:
        if i == 'A' or i == 'P' or i == 'T':
            keyNum += 1

    if len(strList) != keyNum:
        return 1
    else:
        return 0

num = int(raw_input())
list = []

for i in range(num):
    str = raw_input()
    for j in str:
        list.append(j)
    if isValid(list) == 0:
        print 'YES'
    else:
        print 'NO'
    list = []                        

exit(0)


1004:

from sys import exit
num = input()
max = []
min = []

for i in range(num):
    stud = raw_input().split()
    if len(max) == 0 or int(stud[2]) > int(max[2]):
        max = stud

    if len(min) == 0 or int(stud[2]) < int(min[2]):
        min = stud

print max[0], max[1]
print min[0], min[1]
exit(0)


1005:

from sys import exit

def addFact( factList, keyList, key ):
    if key in factList or key in keyList:
        return 1
    keyList.append(key)
    factList.append(key)

    while True:
        if key == 1:
            if not key in factList:
                factList.append(key)
            break               
        if key % 2 == 0:
            key /= 2
        else:
            key = ( 3 * key + 1 ) / 2

        if (not key in keyList):
            if (not key in factList):
                factList.append(key)
        else:
            keyList.remove(key)

num  = input()
numList = raw_input().split()
numList = [int(numList[i]) for i in range(len(numList))]        
factList = []
keyList = []

for i in numList:
    addFact(factList, keyList, i)

keyList.sort()
keyList.reverse()

for i in range(len(keyList)):
    if i != len(keyList)-1:
        print keyList[i],
    else:
        print keyList[i]

exit(0)


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值