2017年03月_LZK1997

原创蓝桥杯翻硬币 BFS

题目标题：翻硬币小明正在玩一个“翻硬币”的游戏。桌上放着排成一排的若干硬币。我们用 * 表示正面，用 o 表示反面（是小写字母，不是零）。比如，可能情形是：**oo***oooo 如果同时翻转左边的两个硬币，则变为：oooo***oooo 现在小明的问题是：如果已知了初始状态和要达到的目标状态，每次

2017-03-31 21:40:58 579

原创蓝桥杯错误票据

标题：错误票据某涉密单位下发了某种票据，并要在年终全部收回。每张票据有唯一的ID号。全年所有票据的ID号是连续的，但ID的开始数码是随机选定的。因为工作人员疏忽，在录入ID号的时候发生了一处错误，造成了某个ID断号，另外一个ID重号。你的任务是通过编程，找出断号的ID和重号的ID。假设断号不可能发生

2017-03-31 21:18:31 427

原创蓝桥杯黄金连分数

标题: 黄金连分数黄金分割数0.61803... 是个无理数，这个常数十分重要，在许多工程问题中会出现。有时需要把这个数字求得很精确。对于某些精密工程，常数的精度很重要。也许你听说过哈勃太空望远镜，它首次升空后就发现了一处人工加工错误，对那样一个庞然大物，其实只是镜面加工时有比头发丝还细许多

2017-03-31 19:17:51 1360

原创山东省第七届 ACM省赛 Fibonacci

FibonacciTime Limit: 2000 ms / Memory Limit: 131072 kbDescriptionFibonacci numbers are well-known as follow: Now given an integer N, please find out whether N can be represented as the sum

2017-03-27 16:20:31 536

原创 POJ ROADS DFS BFS 优先队列入门

ROADSTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14585 Accepted: 5288DescriptionN cities named with numbers 1 ... N are connected with one-way roa

2017-03-21 20:55:17 524

原创 POJ Part Acquisition 2457 dijkstra

Part AcquisitionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4694 Accepted: 1999 Special JudgeDescriptionThe cows have been sent on a mission t

2017-03-16 17:17:12 334

原创 HDU 1226 超级密码队列解

超级密码Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4262 Accepted Submission(s): 1369Problem DescriptionIgnatius花了一个星期的时间终于

2017-03-14 19:37:40 520

原创 HDU 1026 Ignatius and the Princess I BFS 优先队列

Ignatius and the Princess ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18557 Accepted Submission(s): 5976Special JudgeProblem

2017-03-12 15:40:43 702

原创 POJ 1013 Counterfeit Dollar

D - Counterfeit Dollar POJ - 1013 共三种状态：Up：右盘上升，说明右盘可能有轻假币，也可能左盘有重假币。Down：右盘下降，说明右盘可能有重假币，也可能左盘有轻假币。Even：右盘与左盘平衡，由于假币有且仅有1枚，则说明此时天枰两边的硬币全为真币称量硬币的方法是无规律且未知的，但是称量

2017-03-08 20:05:09 466

原创 POJ 2028 When Can We Meet? 枚举

When Can We Meet?Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 5525 Accepted: 3038DescriptionThe ICPC committee would like to have its meeting as soon

2017-03-07 17:22:57 488

转载 POJ 1511 Invitation Cards(最短路spfa算法)

Invitation CardsTime Limit: 8000MS Memory Limit: 262144KTotal Submissions: 21615 Accepted: 7089DescriptionIn the age of television, not many people attend theater performances

2017-03-07 16:19:52 545

原创 POJ 2502 Subway

SubwayTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9437 Accepted: 3059DescriptionYou have just moved from a quiet Waterloo neighbourhood to a big,

2017-03-06 16:08:40 381

原创 POJ 3660 Cow Contest 最短路线

Cow ContestTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10853 Accepted: 6045DescriptionN (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are partic

2017-03-06 15:47:54 315

原创 POJ 2240 Arbitrage 最短路线

ArbitrageTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 22267 Accepted: 9455DescriptionArbitrage is the use of discrepancies in currency exchange rat

2017-03-06 15:31:34 343

原创 POJ 3259 Wormholes 最短路径

WormholesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 48298 Accepted: 17818DescriptionWhile exploring his many farms, Farmer John has discovered a

2017-03-06 15:28:24 357

原创 POJ 3268 Silver Cow Party 最短路

Silver Cow PartyTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 20726 Accepted: 9487DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the b

2017-03-06 15:21:35 311

原创 POJ 1797 Heavy Transportation 最短路变形

Heavy TransportationTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 33121 Accepted: 8783DescriptionBackground Hugo Heavy is happy. After the breakdown

2017-03-06 15:18:45 357

原创 POJ 2387 Til the Cows Come Home 最短路

Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 49144 Accepted: 16706DescriptionBessie is out in the field and wants to get back t

2017-03-06 15:16:41 316

转载 0x3f3f3f3f…编程中无穷大常量的设置技巧

0x3f3f3f3f…编程中无穷大常量的设置技巧2013年10月12日 ⁄ 综合 ⁄ 共 1375字 ⁄ 字号小中大 ⁄ 评论关闭转自 http://aikilis.tk/如果问题中各数据的范围明确，那么无穷大的设定不是问题，在不明确的情况下，很多程序员都取0x7fffffff作为无穷大，因为这是32-bit int的最大值。如果这个无穷大

2017-03-05 17:15:12 477 1

原创 HDU 2544 最短路 Dijkstra Flyod

最短路Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 59887 Accepted Submission(s): 26380Problem Description在每年的校赛里，所有进入决赛的同学都会获

2017-03-03 17:05:05 375

原创 POJ The Clocks 1166

The ClocksTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17139 Accepted: 7067Description|-------| |-------| |-------|| | | |

2017-03-01 20:15:57 595

LZK1997的博客