![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
其他ACM题型
文章平均质量分 82
Zeny_L
:-
展开
-
HDU 1232 (简单并查集 查连通分支 13.10.30)
畅通工程Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24266 Accepted Submission(s): 12597Problem Description某省调查城镇交通状况,得到现有城镇道路原创 2013-10-31 00:26:55 · 1196 阅读 · 0 评论 -
CF round#211-2 B (13.11.11)
B. Fencetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere is a fence in front of Polycarpus's home. The fence con原创 2013-11-11 20:23:00 · 883 阅读 · 0 评论 -
UVA 10026 (13.11.08)
Shoemaker's Problem Shoemaker has N jobs (orders from customers) which he must make. Shoemaker can work on only one job in each day. For each ith job, it is known the integer Ti (1i<=1000)原创 2013-11-08 23:50:11 · 940 阅读 · 0 评论 -
UVA 10245 (13.11.08)
Problem JThe Closest Pair ProblemInput: standard inputOutput: standard outputTime Limit: 8 secondsMemory Limit: 32 MB Given a set of points in a twodimensional space, you will have t原创 2013-11-08 23:08:31 · 866 阅读 · 0 评论 -
UVA 10714 (13.11.07)
Problem B: AntsAn army of ants walk on a horizontal pole of length l cm,each with a constant speed of 1 cm/s. When a walking ant reaches anend of the pole, it immediatelly falls off it. When two ant原创 2013-11-08 00:16:36 · 994 阅读 · 0 评论 -
UVA 270 (13.11.06)
Lining Up ``How am I ever going to solve this problem?" said the pilot. Indeed, the pilot was not facing an easy task. She had to drop packages at specific points scattered in a danger原创 2013-11-06 15:12:54 · 655 阅读 · 0 评论 -
HDU 1399 (13.11.04)
题目点此进题意与做法略过,今晚事情多,懒得写详细了,代码不难,直接可以看懂AC代码:#includeint n;int max;int mark = 0;int judge1() { mark = 0; for(int i = 0; ; i++) { if(i * i * i == n) { ma原创 2013-11-04 22:09:11 · 771 阅读 · 0 评论 -
UVA 12554 (13.11.02)
Problem AA Special "[H]appy Birthday" Song!!!There are n people (excluding myself) in my 30th birthday party. They sing the traditional "happy birthday" song:Happy birthday to you! Happy birth原创 2013-11-02 10:33:37 · 706 阅读 · 0 评论 -
CF round#211-2 A (13.11.11)
A. Sorobantime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou know that Japan is the country with almost the largest原创 2013-11-11 20:01:44 · 788 阅读 · 0 评论 -
HDU 3910 (13.10.31)
DescriptionMaybe you know “San Guo Sha”, but I guess you didn’t hear the game: “Liang Guo Sha”!Let me introduce this game to you. Unlike “San Guo Sha” with its complicated rules, “Liang Guo Sh原创 2013-10-31 22:25:37 · 992 阅读 · 0 评论 -
HDU 1013 (13.10.29)
Problem DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resultin原创 2013-10-30 00:47:42 · 1058 阅读 · 0 评论 -
CF round#302-2 B (13.10.17)
DescriptionEugeny loves listening to music. He has n songs in his play list. We know that song number i has the duration of ti minutes. Eugeny listens to each song, perhaps more than once. He li原创 2013-10-17 22:37:19 · 725 阅读 · 0 评论 -
CF round#212-2 B (13.11.14)
B. Petya and Staircasestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle boy Petya loves stairs very much. But h原创 2013-11-15 00:05:52 · 1099 阅读 · 0 评论 -
UVA 11210 (大白上的枚举题 麻将 14.4.15)
Problem CChinese MahjongMahjong () is a game of Chinese origin usually played by four persons with tiles resembling dominoes and bearing various designs, which are drawn and discarded until原创 2014-04-15 21:58:00 · 1285 阅读 · 2 评论 -
UVA 11995 (STL应用 13.08.07)
Problem II Can Guess the Data Structure!There is a bag-like data structure, supporting two operations:1 xThrow an element x into the bag.2Take out an element from the bag.Given a seque原创 2013-08-07 21:43:30 · 717 阅读 · 0 评论 -
HDU 2063 (二分图匹配问题 匈牙利算法 13.11.05)
过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8064 Accepted Submission(s): 3533Problem DescriptionRPG girls今天和大家一起去游乐场玩,终于可以原创 2013-11-06 00:16:19 · 1154 阅读 · 0 评论 -
UVA 11045 (14.05.25)
My T-shirt suits me Our friend Victor participates as an instructor in an environmental volunteer program. His boss asked Victor to distribute N T-shirts to Mvolunteers, one T-shirt ea原创 2014-05-25 20:34:52 · 569 阅读 · 0 评论 -
HDU 4788 (14.05.12)
Hard Disk DriveTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 647 Accepted Submission(s): 350Problem Description Yesterday原创 2014-05-12 22:39:15 · 697 阅读 · 0 评论 -
UVA 10125 (14.3.6)
Problem C - SumsetsGiven S, a set of integers, find the largest d such that a + b + c = d where a, b, c, and d are distinct elements of S.InputSeveral S, each consisting of a line containing an原创 2014-03-06 23:31:24 · 1040 阅读 · 1 评论 -
FZU 1913 (13.12.05)
Problem 1913 Easy Comparison Accept: 394 Submit: 511Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionGiven a string S, your task is to simulate the following operat原创 2013-12-05 22:03:58 · 822 阅读 · 0 评论 -
UVA 10763 (13.12.05)
Problem EForeign ExchangeInput: standard inputOutput: standard outputTime Limit: 1 secondYour non-profit organization (iCORE - internationalConfederation ofRevolverEnthusiasts) coordin原创 2013-12-05 21:43:41 · 784 阅读 · 0 评论 -
FZU 2104 (13.11.28)
Problem 2104 Floor problem Accept: 376 Submit: 433Time Limit: 1000 mSec Memory Limit : 32768 KB Problem DescriptionIn this problem, we have f(n,x)=Floor[n/x]. Here Floor[x] is th原创 2013-12-02 19:54:24 · 773 阅读 · 0 评论 -
CF round#202 A (13.09.28)
A. Cinema Linetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe new "Die Hard" movie has just been released! There原创 2013-09-28 00:37:26 · 1438 阅读 · 0 评论 -
HDU 网络赛(杭州赛区)1003 (13.09.15)
Problem DescriptionThere was no donkey in the province of Gui Zhou, China. A trouble maker shipped one and put it in the forest which could be considered as an N×N grid. The coordinates of the up-le原创 2013-09-16 14:20:36 · 1208 阅读 · 0 评论 -
UVA 11729 (13.09.09)
猛击这里看题目!题意:就是要对T个士兵洗脑, 叫他们做事洗脑需要时间的, 为A洗完脑就滚蛋吧, 乖乖听话做事去, 做事时间为B;求对所有士兵洗完脑并做完全部事后, 一共花了多少时间?要点:训完一个士兵后, 这个士兵做事去了, 这时候已经可以去训下一个了做法:明显的, 我们要把做事时间最久的找出来, 这样, 他做事的时候可以去训其他士兵原创 2013-09-09 16:44:50 · 639 阅读 · 0 评论 -
HDU 4510 (13.07.31)
Problem Description 我以为我会是最坚强的那一个 我还是高估了自己 我以为你会是最无情的那一个 还是我贬低了自己 就算不能够在一起 我还是为你担心 就算你可能听不清 也代表我的心意 那北极星的眼泪 闪过你曾经的眼角迷离 那玫瑰花的葬礼 埋葬的却是关于你的回忆 如果时光可以倒流 我希望不要和你分离 如果注定分离 我希望原创 2013-07-31 20:18:01 · 878 阅读 · 0 评论 -
HDU 4500 (13.07.31)
毕业于普通本科的小Q一直自称是资深�丝,不仅学校不知名,甚至他自己在这个普通学校也是默默无闻――直到临近毕业的时候,班里5朵金花中的2位甚至从没和他说过话! 谁又能想到,如此不起眼的小Q在历经重重面试环节后,竟然如愿以偿加入了心仪已久的腾讯公司!消息刚刚传开的那几天,这在他们班甚至整个学院都是讨论的热门话题,如果这时候你还表示不知道小Q是谁,你都会被大家当作怪物的。 正所谓野百合也有春原创 2013-07-31 20:12:35 · 670 阅读 · 0 评论 -
UVA 152 (13.07.30)
Tree's a Crowd Dr William Larch, noted plant psychologist and inventor of the phrase``Think like a tree--Think Fig'' has invented a new classificationsystem for trees. This is a complicate原创 2013-07-31 19:21:11 · 565 阅读 · 0 评论 -
POJ 1011 (13.07.23)
Sticks George took sticks of the same length and cut them randomly until all partsbecame at most 50 unitslong. Now he wants to return sticks to the original state, but he forgothow many st原创 2013-07-23 16:54:57 · 654 阅读 · 0 评论 -
UVA 579 (13.07.20)
ClockHands The medieval interest in mechanical contrivances is well illustrated by the development ofthe mechanical clock, the oldest of which is driven by weights and controlled by a verg原创 2013-07-21 15:04:51 · 736 阅读 · 0 评论 -
UVA 575 (13.07.20)
Skew Binary When a number is expressed in decimal, the k-th digit represents a multipleof 10k. (Digits arenumbered from right to left, where the least significant digit is number 0.)For ex原创 2013-07-21 15:01:33 · 704 阅读 · 0 评论 -
UVA 10161 (13.07.20)
Ant on a Chessboard Background One day, an ant called Alice came to an M*M chessboard. She wanted to go around all the grids. So she began to walk along the chessboard according to this way:原创 2013-07-21 14:59:04 · 596 阅读 · 0 评论 -
NBUT 1114 (13.07.17)
[1114] Alice's Puppets时间限制: 1000 ms 内存限制: 65535 K问题描述Alice Margatroid (アリス·マーガトロイド) can control puppets. What's more, she can control her pupet to control other pupets.The puppets she controls原创 2013-07-18 17:04:45 · 760 阅读 · 0 评论 -
UVA 113 (13.07.17)
Power of Cryptography BackgroundCurrent work in cryptography involves (among other things) large primenumbers and computing powers of numbers modulo functions of theseprimes. Work in t原创 2013-07-18 16:56:48 · 655 阅读 · 0 评论 -
POJ 1401 (13.07.17)
FactorialTime Limit: 1500MS Memory Limit: 65536KTotal Submissions: 13135 Accepted: 8155DescriptionThe most important part of a GSM network is so called Base Transce原创 2013-07-18 12:44:26 · 767 阅读 · 0 评论 -
UVA 340 (13.07.27)
Master-Mind Hints MasterMind is a game for two players. One of them, Designer, selects asecret code. The other,Breaker, tries to break it. A code is no morethan a row of colored dots. At t原创 2013-07-27 12:05:35 · 950 阅读 · 0 评论 -
UVA 10420 (13.07.27)
Problem BList of ConquestsInput:standardinputOutput: standard outputTime Limit: 2 secondsIn Act I, Leporello is tellingDonna Elvira about his master's long list of conquests:``This is th原创 2013-07-27 12:11:15 · 1070 阅读 · 0 评论 -
HDU 4287 (13.08.17)
Problem Description We all use cell phone today. And we must be familiar with the intelligent English input method on the cell phone. To be specific, the number buttons may correspond to some Engli原创 2013-08-17 20:35:46 · 849 阅读 · 0 评论 -
UVA 10340 (13.08.25)
Problem EAll in AllInput: standard inputOutput: standard outputTime Limit: 2 secondsMemory Limit: 32 MBYou have devised a new encryption technique whichencodes a message by inserting betwe原创 2013-08-25 21:15:30 · 635 阅读 · 0 评论 -
HDU 4642 (13.08.25)
Fliping gameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 853 Accepted Submission(s): 612Problem DescriptionAlice and Bob are p原创 2013-08-25 21:52:22 · 743 阅读 · 0 评论