锐客网

  1. 首页 > 生活百科 > >

大一python基础编程题，python入门程序设计作业

经验分享生活百科

1，python入门程序设计作业coinprice=coins=["5角","2角","1角","5分","2分","1分"]price=float(raw_input("请输入物品价格（元）:"))if price>1 or price <0: print "价格输入错误" exit(1)change=100-int(price*100)coinamount=totalcoin=0for coin in coins: coinamount[coin]=change//coinprice[coin] totalcoin+=coinamount[coin] change-=coinamount[coin]*coinprice[coin] if change<=0:change=0for coin in coins: print "%s:%d个"%(coin,coinamount[coin])print "总共找回硬币%d个"%totalcoin【大一python基础编程题，python入门程序设计作业】
2，Python简单的题目大家都来做一下12345678 亲，你这2113个要直到满意为止5261，就明4102显不是简单的条件语句能完1653成专的，也不是简单的for循环能解决属的，肯定是while语句的啊 。。。num =int(raw_input("Please input your number:"))whilenot0<num<101: print"Please input a num between 1 and 100!" num =int(raw_input("Please input your number:"))else: printnum12345678 whileTrue: print"Please input a number:" a =int(raw_input()) ifa>=1anda<=100: print"success!" break else: print"number must between 1 and 100"
3，python编程题 题目内容两位整数相乘形成的最大回文数是900999最好用一个单独的函数来判断回文再用另外一个函数寻找返回的是（最大回文数，被乘数，乘数）所组成的元组def isPal(s): if len(s)<=1: return True return s[0]==s[-1] and isPal(s[1:-1])def maxPal(n): maxNum, maxA, maxB = 0,0,0 for a in xrange(10**(n-1),10**n): for b in xrange(a,10**n): if isPal(str(a*b)): if a*b>maxNum: maxNum, maxA, maxB = a*b,a,b return maxNum, maxA, maxBmaxPal(2)>>> def f(n): s = range(1,n) + range(n,0,-1) print "".join([str(i) for i in s])>>> f(5)123454321>>> f(10)12345678910987654321

    推荐阅读


    上一篇：Android官方下载，android手机游戏下载

    下一篇：苹果手机怎么截屏 截图方法4，苹果手机如何截屏