随笔分类 -  基础杂题

hdu 4346 The Beautiful Road(思维，枚举，5级)
摘要：The Beautiful RoadTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 229Accepted Submission(s): 122Problem DescriptionThere is a road from city A to city B.On the road,there are N positions(indexed from 0 to N-1).In order to celebrate the Multi-Univer 阅读全文
posted @ 2013-06-29 12:33 剑不飞 阅读(222) 评论(0) 推荐(0)
hdu 4312 Meeting point-2(4级)
摘要：Meeting point-2Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 866Accepted Submission(s): 472Problem DescriptionIt has been ten years since TJU-ACM established. And in this year all the retired TJU-ACMers want to get together to celebrate the tenth 阅读全文
posted @ 2013-06-01 09:14 剑不飞 阅读(164) 评论(0) 推荐(0)
uva 10795 - A Different Task（递推，3级）
摘要：A Different TaskThe (Three peg) Tower of Hanoi problem is a popular one in computer science. Briefly the problem is to transfer all the disks from peg-Ato peg-Cusing peg-Bas intermediate one in such a way that at no stage a larger disk is above a smaller disk. Normally, we want the minimum number of 阅读全文
posted @ 2013-05-16 17:39 剑不飞 阅读(216) 评论(0) 推荐(0)
uva 11384 - Help is needed for Dexter（递推，2级）
摘要：Problem HHelp is needed for DexterTime Limit: 3 SecondDexter is tired of Dee Dee. So he decided to keep Dee Dee busy in a game. The game he planned for her is quite easy to play but not easy to win at least not for Dee Dee. But Dexter does not have time to spend on this silly task, so he wants your 阅读全文
posted @ 2013-05-15 18:45 剑不飞 阅读(252) 评论(0) 推荐(0)
uva 11464 - Even Parity（3级）
摘要：DEven ParityInput:Standard InputOutput:Standard OutputWe have a grid of sizeNxN. Each cell of the grid initially contains a zero(0) or a one(1).Theparityof a cell is the number of 1s surrounding that cell. A cell is surrounded by at most 4 cells (top, bottom, left, right).Suppose we have a grid of s 阅读全文
posted @ 2013-05-14 21:41 剑不飞 阅读(257) 评论(0) 推荐(0)
uva 1030 - Image Is Everything(思维，4级)
摘要：Your new company is building a robot that can hold small lightweight objects. The robot will have the intelligence to determine if an object is light enough to hold. It does this by taking pictures of the object from the 6 cardinal directions, and then inferring an upper limit on the object's we 阅读全文
posted @ 2013-05-14 21:02 剑不飞 阅读(225) 评论(0) 推荐(0)
uva 1388 - Graveyard(思维)
摘要：Programming contests became so popular in the year 2397 that the governor of New Earck -- the largest human-inhabited planet of the galaxy -- opened a special Alley of Contestant Memories (ACM) at the local graveyard. The ACM encircles a green park, and holds the holographic statues of famous contes 阅读全文
posted @ 2013-05-09 21:38 剑不飞 阅读(177) 评论(0) 推荐(0)
uva 11300 - Spreading the Wealth（思维）
摘要：F. Spreading the WealthProblemA Communist regime is trying to redistribute wealth in a village. They have have decided to sit everyone around a circular table. First, everyone has converted all of their properties to coins of equal value, such that the total number of coins is divisible by the numbe 阅读全文
posted @ 2013-05-09 21:23 剑不飞 阅读(187) 评论(0) 推荐(0)
uva11729 - Commando War(water)
摘要：GCommando WarInput:Standard InputOutput:Standard Output“Waiting for orders we held in the wood, word from the front never cameBy evening the sound of the gunfire was miles awayAh softly we moved through the shadows, slip away through the treesCrossing their lines in the mists in the fields on our ha 阅读全文
posted @ 2013-05-09 21:05 剑不飞 阅读(186) 评论(0) 推荐(0)
uva 11292 - Dragon of Loowater
摘要：Problem C: The Dragon of LoowaterOnce upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem.The shores of Rellau Creek in central Loowater had always been a prime breeding ground for geese. Due to the lack of predators, the geese population was out of control. The peo 阅读全文
posted @ 2013-05-09 20:48 剑不飞 阅读(128) 评论(0) 推荐(0)
NEFU 653 Grids(water)
摘要：GridsTime Limit 1000msMemory Limit 65536KdescriptionOn an 1 × 1 grid,partition the length and width into 50 parts,forming 2500 unit grids with the same size.Now,given n circles with equal radius R on the grid.Find the total number of unit grids which are not covered by any of a circle. A unit g 阅读全文
posted @ 2013-04-20 19:10 剑不飞 阅读(140) 评论(0) 推荐(0)
CF-63C - Bulls and Cows（枚举）
摘要：C -Bulls and CowsTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 63CDescriptionThe "Bulls and Cows" game needs two people to play. The thinker thinks of a number and the guesser tries to guess it.The thinker thinks of a four-digit numbe 阅读全文
posted @ 2013-03-29 10:54 剑不飞 阅读(309) 评论(0) 推荐(0)
CF-63D - Dividing Island(水题)
摘要：D -Dividing IslandTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 63DDescriptionA revolution took place on the Buka Island. New government replaced the old one. The new government includesnparties and each of them is entitled to some part of the 阅读全文
posted @ 2013-03-29 10:48 剑不飞 阅读(281) 评论(0) 推荐(0)
CF -62B - Tyndex.Brome(二分查找)
摘要：B -Tyndex.BromeTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 62BDescriptionTyndex is again well ahead of the rivals! The reaction to the release of Zoozle Chrome browser was the release of a new browser Tyndex.Brome!The popularity of the new br 阅读全文
posted @ 2013-03-27 11:51 剑不飞 阅读(322) 评论(0) 推荐(0)
hdu 4523 威威猫系列故事——过生日(简单大数相加比较)
摘要：威威猫系列故事——过生日Time Limit: 500/200 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 640Accepted Submission(s): 160Problem Description 2月29号是威威猫的生日，由于这个日子非常特殊，4年才一次，所以生日这天许多朋友都前往威威猫家祝贺他的生日。 大家给威威猫买了一个非常大非常大的蛋糕，蛋糕的形状是一个有n条边的凸多边形，可是威威猫的审美观有一点奇怪，他只喜欢有m条边的蛋糕，所以他要伙伴们把这个蛋糕切p次，然后.. 阅读全文
posted @ 2013-03-26 10:03 剑不飞 阅读(188) 评论(0) 推荐(0)