- 博客(5)
- 收藏
- 关注
原创 POJ1860 Currency Exchange 最短路bellman-ford
Currency ExchangeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 23456 Accepted: 8489DescriptionSeveral currency exchange points are working in our ci
2015-09-24 21:14:18 137
原创 POJ2240 Arbitrage 最短路 bellmanford
ArbitrageTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18275 Accepted: 7738DescriptionArbitrage is the use of discrepancies in currency exchange rat
2015-09-24 20:33:22 393
原创 POJ 3660 Cow Contest 最短路floyd
Cow ContestTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8551 Accepted: 4802DescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are partici
2015-09-22 21:39:02 481
原创 POJ1797 Heavy Transportation 最短路
Heavy TransportationTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 25200 Accepted: 6673DescriptionBackground Hugo Heavy is happy. After the breakdo
2015-09-22 08:27:21 446
原创 UVA 7040 Color 组合数加容斥原理
点击打开链接题意:告诉n个人排成一排,然后有m种颜色,要给这n个人正好涂k种颜色,相邻两个人颜色要不同,问有多少种方法。分析:m种颜色选k种,所以有C(m,k),对于选出的k种颜色去给n个人涂色,对于第一个人有k种,第二个人有k-1种,第三个人k-1种。。。。。所以总共是k*(k-1)^(n-1)种。然而不要以为这样就好了,因为这样算并不能保证是一定用了k种颜色的,可能只是选了
2015-09-08 23:59:55 661
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人