- 博客(40)
- 收藏
- 关注
RSS订阅原创 CSU 1120 病毒
J - 病毒Time Limit:3000MS Memory Limit:131072KB 64bit IO Format:%lld & %lluSubmit Status Practice CSU 1120Appoint description: System Crawler (2014-11-20)Description
2014-11-24 00:06:39
577
原创 CSU 1115 最短的名字
1115: 最短的名字Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 483 Solved: 177[Submit][Status][Web Board]Description在一个奇怪的村子中，很多人的名字都很长，比如aaaaa, bbb and abababab。名字这么长，叫全名显然起来很不方便。所以村民之间一
2014-11-23 21:14:25
579
原创 UVA - 11235 Frequent values
Frequent valuesTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescription2007/2008 ACM International Collegiate Programming
2014-11-22 01:42:47
294
原创 UVALive - 4329 Ping pong
Ping pongTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionN(3N20000) ping pong players live along a west-east st
2014-11-21 00:44:00
347
原创 UVALive - 3027 Corporative Network
Corporative NetworkTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionA very big corporation is developing its corpo
2014-11-20 20:43:45
343
原创 UVA - 11997 K Smallest Sums
K Smallest SumsTime Limit: 1000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem KK Smallest SumsYou're given k arr
2014-11-20 02:29:31
304
原创 UVALive - 3135 Argus
ArgusTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionA data stream is a real-time, continuous, ordered sequence o
2014-11-20 00:50:57
440
原创 UVA - 11991 Easy Problem from Rujia Liu?
Easy Problem from Rujia Liu?Time Limit: 1000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem EEasy Problem from Rujia
2014-11-19 22:18:02
463
原创 UVA - 11995 I Can Guess the Data Structure!
I Can Guess the Data Structure!Time Limit: 1000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem II Can Guess the Data
2014-11-18 23:06:51
426
原创 UVALive - 3644 X-Plosives
3644 X-PlosivesA secret service developed a new kind of explosive that attain its volatile property only when a speci cassociation of products occurs. Each product is a mix of two different simple
2014-11-17 22:04:52
366
原创 算法思想——知其所以然（三）：为什么算法这么难？
链接：http://mindhacks.cn/2011/07/10/the-importance-of-knowing-why-part3/
2014-11-17 21:04:38
6409
原创 UVA - 10340 All in All
All in AllTime Limit: 3000MSMemory Limit: Unknown64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem EAll in AllInput: standard inputOutput: standard ou
2014-11-15 16:28:02
369
原创 UVA - 10970 Big Chocolate
Big ChocolateTime Limit: 3000MSMemory Limit: Unknown64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem GBig ChocolateMohammad has recently visited Switze
2014-11-15 14:15:25
353
原创 UVALive - 3602 DNA Consensus String
DNA Consensus StringTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescription Figure 1.DNA (Deoxyribonucleic Acid) is th
2014-11-14 00:33:38
433
原创 UVALive - 3213 Ancient Cipher
Ancient CipherTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionAncient Roman empire had a strong government system
2014-11-13 23:16:11
375
原创 UVA - 11039 Building designing
Building designingTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescription Building designing An a
2014-11-13 21:29:28
390
转载 欧拉函数
欧拉函数的定义:E(k)=([1,n-1]中与n互质的整数个数). 因为任意正整数都可以唯一表示成如下形式: k=p1^a1*p2^a2*……*pi^ai;(即分解质因数形式) 可以推出:E(k)=(p1-1)(p2-1)……(pi-1)*(p1^(a1-1))(p2^(a2-1))……(pi^(ai-1))
2014-11-13 10:24:31
328
原创 UVA - 11636 Hello World!（水题）
Hello World!Time Limit: 1000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem AHello World! Input: Standard Input
2014-11-13 00:48:06
441
原创 UVA - 11806 Cheerleaders
CheerleadersTime Limit: 2000MSMemory Limit: Unknown64bit IO Format: %lld & %lluSubmit StatusDescriptionCCheerleaders In most professional sp
2014-11-12 22:29:18
328
原创 UVA - 11401 Triangle Counting
Triangle CountingTime Limit: 1000MSMemory Limit: Unknown64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem GTriangle CountingInput: Standard InputOutpu
2014-11-12 22:04:36
302
原创 UVA - 11538 Chess Queen
11538 Chess QueenYou probably know how the game of chess is played and how chess queen operates. Two chess queensare in attacking position when they are on same row, column or diagonal of a chess
2014-11-12 00:39:27
317
原创 UVA - 10891 Game of Sum
Game of SumTime Limit: 3000MSMemory Limit: Unknown64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem EGame of SumInput File: e.inOutput: Standard Outpu
2014-11-11 21:43:45
336
原创 UVA - 10635 Prince and Princess
Prince and PrincessTime Limit: 3000MSMemory Limit: Unknown64bit IO Format: %lld & %lluSubmit StatusDescription Problem EPrince and PrincessInput: Standard In
2014-11-10 21:56:40
336
原创 UVALive - 3882 And Then There Was One（ac，但想不通）
And Then There Was OneTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionLet's play a stone removing game.Initiall
2014-11-10 20:45:50
391
原创 UVALive - 2678 Subsequence
SubsequenceTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionA sequence of N positive integers (10 N , each of them
2014-11-09 22:36:25
350
转载 lower_bound()返回值
函数lower_bound()在first和last中的前闭后开区间进行二分查找，返回大于或等于val的第一个元素位置。如果所有元素都小于val，则返回last的位置举例如下：一个数组number序列为：4,10,11,30,69,70,96,100.设要插入数字3,9,111.pos为要插入的位置的下标则pos = lower_bound( number, num
2014-11-09 20:41:14
457
原创 UVA - 11549 Calculator Conundrum
Calculator ConundrumTime Limit: 6000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem CCALCULATOR CONUNDRUMAlice
2014-11-09 10:33:18
310
原创 UVA - 11078 Open Credit System
Open Credit SystemTime Limit: 3000MSMemory Limit: Unknown64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem EOpen Credit SystemInput: Standard InputOut
2014-11-09 00:28:21
353
原创 UVA - 11462 Age Sort
11462 Age SortYou are given the ages (in years) of all people of a country with at least 1 year of age. You know thatno individual in that country lives for 100 or more years. Now, you are given a
2014-11-08 22:15:11
305
原创 UVALive - 3177 Beijing Guards
Beijing GuardsTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionBeijing was once surrounded by four rings of city w
2014-11-08 21:27:48
401
原创 UVALive - 3902 Network
NetworkTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionConsider a tree network with n nodes where the internal no
2014-11-08 17:32:05
410
原创 uva11520 Fill the Square
11520 Fill the SquareIn this problem, you have to draw a square using uppercase English Alphabets.To be more precise, you will be given a square grid with some empty blocks and others already lled
2014-11-07 13:22:21
352
原创 csu1030: 素数槽
1030: 素数槽Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 463 Solved: 154[Submit][Status][Web Board]Description 处于相邻的两个素数p和p + n之间的n - 1个连续的合数所组成的序列我们将其称为长度为n的素数槽。例如，‹24, 25, 26, 27
2014-11-06 23:07:03
571
原创 UVALive - 3971 Assemble
AssembleTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem A - AssembleTime limit: 2 secondsRecently you
2014-11-06 22:15:55
540
原创 UVA - 10795 A Different Task
A Different TaskTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescription A Different Task The
2014-11-06 11:21:08
280
原创 UVA - 11384 Help is needed for Dexter
Help is needed for DexterTime Limit: 3000MSMemory Limit: Unknown64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem HHelp is needed for DexterTime Limit:
2014-11-06 09:41:34
309
原创 UVA - 11210 Chinese Mahjong
Chinese MahjongTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem CChinese MahjongMahjong () is a ga
2014-11-06 09:30:43
430
原创 UVALive - 3401 Colored Cubes
Colored CubesTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionThere are several colored cubes. All of them are of
2014-11-04 22:57:00
574
原创 UVA - 11464 Even Parity
11464 Even ParityWe have a grid of size N N. Each cell of the grid initially contains a zero(0) or a one(1). The parityof a cell is the number of 1s surrounding that cell. A cell is surrounded by
2014-11-02 19:38:51
343
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人