随笔分类 - 勤学算法的好宝宝
摘要：Snowflake Snow Snowflakes Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 45817 Accepted: 11953 Description You may have heard that no two
阅读全文
摘要：Brainman Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 11472 Accepted: 5887 Description Background Raymond Babbitt drives his brother Cha
阅读全文
摘要：Ultra-QuickSort Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 65986 Accepted: 24686 Description In this problem, you have to analyze a pa
阅读全文
摘要：Who's in the Middle Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 44499 Accepted: 25615 Description FJ is surveying his herd to find the
阅读全文
摘要：Numbers That Count Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 21372 Accepted: 7171 Description "Kronecker's Knumbers" is a little comp
阅读全文
摘要：1.入门水题 2.初级 POJ 1135 -- Domino Effect（Dijkstra） ZOJ 2750 -- Idiomatic Phrases Game（Dijkstra） POJ-1860 POJ-3259 POJ-1062 POJ-2253 POJ-1125 POJ 2240 --
阅读全文
摘要：Power of Cryptography Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 26622 Accepted: 13301 Description Current work in cryptography involv
阅读全文
摘要：例题5-10 UVA 207 PGA Tour Prize Money PGA巡回赛的奖金 解题： 1）fegets()函数 函数原型 char * fgets ( char * str, int num, FILE * stream ); 参数*buf: 字符型指针，指向用来存储所得数据的地址。b
阅读全文
摘要：UVa 400 -- Unix ls Sample Input Sample Output
阅读全文
摘要：sample input Adventures in Disneyland Two blondes were going to Disneyland when they came to a fork in theroad. The sign read: "Disneyland Left." So t
阅读全文
摘要：Uva 101 the block problem 题目大意： 输入n，得到编号为0~n-1的木块，分别摆放在顺序排列编号为0~n-1的位置。现对这些木块进行操作，操作分为四种。 1、move a onto b：把木块a、b上的木块放回各自的原位，再把a放到b上； 2、move a over b：把
阅读全文
摘要：Integer Inquiry Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 35353 Accepted: 13781 Description One of the first users of BIT's new super
阅读全文
摘要：Crashing Robots Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11432 Accepted: 4831 Description In a modernized warehouse, robots are used
阅读全文
摘要：Parencodings Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 27602 Accepted: 16226 Description Let S = s1 s2...s2n be a well-formed string
阅读全文
摘要：Solution to the n Queens Puzzle Time Limit: 1000MS Memory Limit: 131072K Total Submissions: 3872 Accepted: 1419 Special Judge Description The eight qu
阅读全文
摘要：Tautology Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 13685 Accepted: 5276 Description WFF 'N PROOF is a logic game played with dice. E
阅读全文
摘要：Message Decoding simple input TNM AEIOU0010101100011101000100111011001111000 $#**\0100000101101100011100101000 Message Decoding - UVALive 5152 - Virtu
阅读全文
摘要：Hangman Judge Hangman Judge是一个猜英文单字的小游戏（在电子字典中常会看到），游戏规则如下：1、答案单字写在纸上（每个字元一张纸），并且被盖起来，玩家每次猜一个英文字元（letter）。2、如果这个英文字元猜中（在答案的英文单字中有出现），被猜中的字元就被翻开。例如：答案是
阅读全文
摘要：Y2K Accounting Bug Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16395 Accepted: 8251 Description Accounting for Computer Machinists (ACM
阅读全文
摘要：Radar Installation Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 96747 Accepted: 21508 Description Assume the coasting is an infinite str
阅读全文
浙公网安备 33010602011771号