poj
LZK1997
这个作者很懒,什么都没留下…
展开
-
POJ 3050 Hopscotch
HopscotchTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3394 Accepted: 2337DescriptionThe cows play the child's game of hopscotch in a non-traditional原创 2016-09-13 17:22:31 · 272 阅读 · 0 评论 -
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 阅读 · 0 评论 -
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 阅读 · 0 评论 -
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 阅读 · 0 评论 -
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 阅读 · 0 评论 -
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 阅读 · 0 评论 -
POJ 3414 Pots
PotsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15123 Accepted: 6359 Special JudgeDescriptionYou are given two pots, having the volume of A and原创 2016-12-11 18:48:24 · 404 阅读 · 0 评论 -
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 阅读 · 0 评论 -
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 阅读 · 0 评论 -
poj 1573 Robot Motion 模拟
Robot MotionTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14135 Accepted: 6800DescriptionA robot has been programmed to follow the instructions in原创 2017-07-18 20:59:19 · 413 阅读 · 0 评论 -
poj 2533 最长上升子序列 多种姿势
Longest Ordered SubsequenceTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 54789 Accepted: 24545DescriptionA numeric sequence of ai is ordered if a1 a原创 2017-08-17 20:12:08 · 241 阅读 · 0 评论 -
poj 3616 简单dp
Milking TimeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10486 Accepted: 4396DescriptionBessie is such a hard-working cow. In fact, she is so focus原创 2017-08-18 10:34:14 · 236 阅读 · 0 评论 -
poj 1458 Common Subsequence 最长公共子序列 入门
Common SubsequenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 54255 Accepted: 22551DescriptionA subsequence of a given sequence is the given seque原创 2017-08-11 10:56:48 · 303 阅读 · 0 评论 -
POJ 2398 Toy Storage
Toy StorageTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6120 Accepted: 3655DescriptionMom and dad have a problem: their child, Reza, never puts his原创 2017-10-30 15:24:18 · 248 阅读 · 0 评论 -
POJ 2318 TOYS
TOYSTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 16570 Accepted: 7952DescriptionCalculate the number of toys that land in each bin of a partitioned原创 2017-10-26 22:19:16 · 261 阅读 · 0 评论 -
POJ 3061 尺取法
Language:DefaultSubsequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17744 Accepted: 7557DescriptionA sequence of N positive integers (10原创 2018-01-29 08:35:56 · 246 阅读 · 0 评论 -
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 阅读 · 0 评论 -
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 阅读 · 0 评论 -
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 阅读 · 0 评论 -
POJ 3117 World Cup
World CupTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9172 Accepted: 4599DescriptionA World Cup of association football is being held with teams fr原创 2016-09-04 16:16:32 · 344 阅读 · 0 评论 -
poj 1942 Counterfeit Dollar
Language:DefaultCounterfeit DollarTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 45287 Accepted: 14316DescriptionSally Jones has a dozen Voyageur原创 2016-11-12 10:03:15 · 367 阅读 · 0 评论 -
poj 1942 Paths on a Grid
Paths on a GridTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 25124 Accepted: 6266DescriptionImagine you are attending your math lesson at school. Once转载 2016-11-12 15:39:29 · 448 阅读 · 0 评论 -
POJ 1218 THE DRUNK JAILER
F - THE DRUNK JAILERTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionA certain prison contains a long hall of n cells, each right原创 2016-11-12 17:00:48 · 388 阅读 · 0 评论 -
POJ 2000 Gold Coins
Gold CoinsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 22762 Accepted: 14266DescriptionThe king pays his loyal knight in gold coins. On the first day原创 2016-11-12 17:35:04 · 525 阅读 · 2 评论 -
POJ 1426 Find The Multiple (Special Judge)
Find The MultipleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 28281 Accepted: 11722 Special JudgeDescriptionGiven a positive integer n, write a p原创 2016-11-26 16:38:31 · 458 阅读 · 0 评论 -
poj 3006 Dirichlet's Theorem on Arithmetic Progressions
Dirichlet's Theorem on Arithmetic ProgressionsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18314 Accepted: 9215DescriptionIf a and d are relatively p原创 2016-12-10 10:19:33 · 653 阅读 · 0 评论 -
poj Ultra-QuickSort
Ultra-QuickSort 本来以为挺水的,结果那么难,归并排序。。。。ac代码#include int a[500005],t[500005];long long cnt;void merge_sort(int x,int y){ long long mid,p,q,i,j; if(y-x<=1) retur原创 2017-01-19 16:57:02 · 282 阅读 · 0 评论 -
poj 1408 Fishnet
FishnetTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2212 Accepted: 1396DescriptionA fisherman named Etadokah awoke in a very small island. He could s原创 2017-01-19 22:25:52 · 435 阅读 · 0 评论 -
POJ The Clocks 1166
The ClocksTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17139 Accepted: 7067Description|-------| |-------| |-------|| | | |原创 2017-03-01 20:15:57 · 595 阅读 · 0 评论 -
poj 1000 入门题
A+B ProblemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 412305 Accepted: 231456DescriptionCalculate a+bInputTwo integer a,b (0OutputOutpu原创 2017-02-22 16:18:28 · 464 阅读 · 0 评论 -
POJ 3030 Nasty Hacks
Nasty HacksTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 13610 Accepted: 9443DescriptionYou are the CEO of Nasty Hacks Inc., a company that creates原创 2017-01-29 16:51:57 · 319 阅读 · 0 评论 -
poj 3984 迷宫问题(简单迷宫)
迷宫问题Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18530 Accepted: 10967Description定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0原创 2017-01-31 22:11:33 · 436 阅读 · 0 评论 -
POJ 1013 Counterfeit Dollar
D - Counterfeit Dollar POJ - 1013 共三种状态:Up:右盘上升,说明右盘可能有轻假币,也可能左盘有重假币。Down:右盘下降,说明右盘可能有重假币,也可能左盘有轻假币。Even:右盘与左盘平衡,由于假币有且仅有1枚,则说明此时天枰两边的硬币全为真币称量硬币的方法是无规律且未知的,但是称量原创 2017-03-08 20:05:09 · 467 阅读 · 0 评论 -
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 阅读 · 0 评论 -
POJ 3320 尺取法
Jessica's Reading ProblemTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14562 Accepted: 4988DescriptionJessica's a very lovely girl wooed by lots o原创 2018-01-29 16:58:13 · 314 阅读 · 0 评论