摘要:StuPIdTime Limit:3000MSMemory Limit:65536KTotal Submissions:5507Accepted:2839DescriptionBackgroundAt DUT, the Dreamland University of Technology, all students have personal id, numbers with six or seven digits. But they're not just any numbers. Only those that have a checksum with a zero as last
阅读全文
随笔分类 - POJ
POJ solutions
摘要:Primary ArithmeticTime Limit:1000MSMemory Limit:65536KTotal Submissions:7852Accepted:2962DescriptionChildren are taught to add multi-digit numbers from right-to-left one digit at a time. Many find the "carry" operation - in which a 1 is carried from one digit position to be added to the ne
阅读全文
摘要:BullseyeTime Limit:1000MSMemory Limit:65536KTotal Submissions:4123Accepted:1927DescriptionA simple dartboard consists of a flat, circular piece of cork with concentric rings drawn on it. Darts are thrown at the board by players in an attempt to hit the center of the dartboard (the Bullseye). The reg
阅读全文
摘要:Binomial ShowdownTime Limit:1000MSMemory Limit:65536KTotal Submissions:14048Accepted:4282DescriptionIn how many ways can you choose k elements out of n elements, not taking order into account?Write a program to compute this number.InputThe input will contain one or more test cases.Each test case con
阅读全文
摘要:BlocksTime Limit:1000MSMemory Limit:65536KTotal Submissions:5381Accepted:2555DescriptionDonald wishes to send a gift to his new nephew, Fooey. Donald is a bit of a traditionalist, so he has chosen to send a set of N classic baby blocks. Each block is a cube, 1 inch by 1 inch by 1 inch. Donald wants
阅读全文
摘要:Questions and answersTime Limit:1000MSMemory Limit:65536KTotal Submissions:7534Accepted:4044DescriptionThe database of the Pentagon contains a top-secret information. We don't know what the information is — you know, it's top-secret, — but we know the format of its representation. It is extr
阅读全文
摘要:StampsTime Limit:2000MSMemory Limit:65536KTotal Submissions:6687Accepted:3105DescriptionBackgroundEverybody hates Raymond. He's the largest stamp collector on planet earth and because of that he always makes fun of all the others at the stamp collector parties. Fortunately everybody loves Lucy,
阅读全文
摘要:Rotten RopesTime Limit:1000MSMemory Limit:65536KTotal Submissions:4150Accepted:2697DescriptionSuppose we have n ropes of equal length and we want to use them to lift some heavy object. A tear-off weight t is associated to each rope, that is, if we try to lift an object, heavier than t with that rope
阅读全文
摘要:Tour de FranceTime Limit:1000MSMemory Limit:65536KTotal Submissions:3418Accepted:1655DescriptionA racing bicycle is driven by a chain connecting two sprockets. Sprockets are grouped into two clusters: the front cluster (typically consisting of 2 or 3 sprockets) and the rear cluster (typically consis
阅读全文
摘要:Mine SweeperTime Limit:1000MSMemory Limit:65536KTotal Submissions:5316Accepted:2074DescriptionThe game Minesweeper is played on an n by n grid. In this grid are hidden m mines, each at a distinct grid location. The player repeatedly touches grid positions. If a position with a mine is touched, the m
阅读全文
摘要:小孩报数问题Time Limit:1000MSMemory Limit:65536KTotal Submissions:5440Accepted:2646Description有N个小孩围成一圈,给他们从1开始依次编号,现指定从第W个开始报数,报到第S个时,该小孩出列,然后从下一个小孩开始报数,仍是报到S个出列,如此重复下去,直到所有的小孩都出列(总人数不足S个时将循环报数),求小孩出列的顺序。Input第一行输入小孩的人数N(N<=64)接下来每行输入一个小孩的名字(人名不超过15个字符)最后一行输入W,S (W < N),用逗号","间隔Output按人名输
阅读全文
摘要:Find the ClonesTime Limit:5000MSMemory Limit:65536KTotal Submissions:5391Accepted:1998DescriptionDoubleville, a small town in Texas, was attacked by the aliens. They have abducted some of the residents and taken them to the a spaceship orbiting around earth. After some (quite unpleasant) human exper
阅读全文
摘要:Recaman's SequenceTime Limit:3000MSMemory Limit:60000KTotal Submissions:15860Accepted:6666DescriptionThe Recaman's sequence is defined by a0 = 0 ; for m > 0, am= am−1− m if the rsulting amis positive and not already in the sequence, otherwise am= am−1+ m.The first few numbers in the Recam
阅读全文
摘要:Ancient CipherTime Limit:1000MSMemory Limit:65536KTotal Submissions:17773Accepted:6103DescriptionAncient Roman empire had a strong government system with various departments, including a secret service department. Important documents were sent between provinces and the capital in encrypted form to p
阅读全文
摘要:Power of CryptographyTime Limit:1000MSMemory Limit:30000KTotal Submissions:10442Accepted:5392DescriptionCurrent work in cryptography involves (among other things) large prime numbers and computing powers of numbers among these primes. Work in this area has resulted in the practical use of results fr
阅读全文
摘要:IMMEDIATE DECODABILITYTime Limit:1000MSMemory Limit:10000KTotal Submissions:7371Accepted:3513DescriptionAn encoding of a set of symbols is said to be immediately decodable if no code for one symbol is the prefix of a code for another symbol. We will assume for this problem that all codes are in bina
阅读全文
摘要:DoublesTime Limit:1000MSMemory Limit:10000KTotal Submissions:14336Accepted:8049DescriptionAs part of an arithmetic competency program, your students will be given randomly generated lists of from 2 to 15 unique positive integers and asked to determine how many items in each list are twice some other
阅读全文
摘要:Ecology taxTime Limit:1000MSMemory Limit:65536KTotal Submissions:3443Accepted:1769DescriptionIn a big and rich on natural resources country, the government started a campaign to control deforestation. In fact the government is not too interested in how many trees get fallen, but rather how effective
阅读全文
摘要:1062*昂贵的聘礼枚举等级限制+dijkstra1087*APlugforUNIX2分匹配1094SortingItAllOutfloyd或拓扑1112*TeamThemUp!2分图染色+DP1125StockbrokerGrapevineFLOYD1135DominoEffect最短路1149*PIGS网络流1161*Wallsfloyd1201Intervals差分约束1236*NetworkofSchools强联通1251JungleRoadsMST1273DrainageDitches最大流1274ThePerfectStall2分匹配1275*CashierEmployment差分
阅读全文
摘要:http://hi.baidu.com/novosbirsk/blog/item/723a9727a9ab8804918f9dca.html其实也谈不上推荐,只是自己做过的题目而已,甚至有的题目尚未AC,让在挣扎中。之所以推荐计算几何题,是因为,本人感觉ACM各种算法中计算几何算是比 较实际的算法,在很多领域有着重要的用途(例如本人的专业,GIS)。以后若有机会,我会补充、完善这个列表。计算几何题的特点与做题要领:1.大部分不会很难,少部分题目思路很巧妙2.做计算几何题目,模板很重要,模板必须高度可靠。3.要注意代码的组织,因为计算几何的题目很容易上两百行代码,里面大部分是模板。如果代码一片混
阅读全文

浙公网安备 33010602011771号