Coin sums
来源:互联网 发布:天津农学院网络 编辑:程序博客网 时间:2024/05/18 21:08
https://projecteuler.net/problem=31
Coin sums
Problem 31
In England the currency is made up of pound, £, and pence, p, and there are eight coins in general circulation:
1p, 2p, 5p, 10p, 20p, 50p, £1 (100p) and £2 (200p).
It is possible to make £2 in the following way:
1×£1 + 1×50p + 2×20p + 1×5p + 1×2p + 3×1p
How many different ways can £2 be made using any number of coins?
使用动态规划方法
def coinSum(): #目标200 target = 200 coinList = [1,2,5,10,20,50,100,200] #准备记录过程中的所有线路数量 resultList=[0] * (target+1) #第零个是1 resultList[0]=1 for i in range(0,len(coinList)): #测试每一个类型 for j in range(coinList[i],target+1): #最新的线路数量,更新 resultList[j] += resultList[j - coinList[i]] return resultList[200]print(coinSum())
0 0
- Coin sums
- Coin sums Problem 31
- Project Euler 31- Coin sums
- Project Euler:Problem 31 Coin sums
- 欧拉工程第31题:Coin sums
- Problem 31 Coin sums(完全背包dp)
- Sums
- sums
- projecteuler---->problem=31----Coin sums 无限背包计算可能存在的次数
- .Coin
- Coin
- 2Sums&3Sums
- Sums of Sums
- Alternating Sums
- Subset Sums
- Subset Sums
- Herd Sums
- Triangular Sums
- oracle数据库乱码
- shell小脚本
- 让顶尖设计师告诉你10个色彩运用秘技
- 随机生成任意个数,然后排大小
- 进销存管理信息系统
- Coin sums
- UE4蓝图碰撞检测解析
- hdu1066Last non-zero Digit in N!
- 深入理解Android的startservice和bindservice
- 02 VoLTE - Domain Selection 和 VoLTE Signaling Overview
- 复习笔记——数据结构
- 超实用的版式设计技巧全方位总结
- 使用opencv中的分类器返回样本的类别置信度
- LeetCode *** 28. Implement strStr()