其他

Attack the NEET PrincessTime Limit: 9 Seconds      Memory Limit:65536 KB Houraisan Kaguya (蓬萊山輝夜) is theNEET (not in education, employment or training) princess living in Eientei(永遠亭). She is an unemployed geek, who sits at home andsurfs the

Common SubsequenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20435 Accepted: 7752DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, ..., xm

Longest Ordered SubsequenceTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 15397 Accepted: 6552DescriptionA numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ...,

Normal 0 7.8 磅 0 2 false false false MicrosoftInternetExplorer4 PeriodTime Limit: 2000/1000 MS(Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 209    Accepted

Normal 0 7.8 磅 0 2 false false false MicrosoftInternetExplorer4 /* Style Definitions */

v/:* {behavior:url(#default#VML);}o/:* {behavior:url(#default#VML);}w/:* {behavior:url(#default#VML);}.shape {behavior:url(#default#VML);}-->PictureTime Limit: 6000/2000 MS(Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s):

JosephTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 27412 Accepted: 10260DescriptionThe Joseph's problem is notoriously known. For those who are not familiar with the original problem: from among n people, numbered 1, 2, . . ., n,

v/:* {behavior:url(#default#VML);}o/:* {behavior:url(#default#VML);}w/:* {behavior:url(#default#VML);}.shape {behavior:url(#default#VML);}--> Normal 0 7.8 磅 0 2 false false false

Place the RobotsTime Limit: 5 Seconds      Memory Limit:32768 KB Robert is a famous engineer. One day he was given a task by his boss. Thebackground of the task was the following:Given a map consisting of square blocks. There were three kinds of

v/:* {behavior:url(#default#VML);}o/:* {behavior:url(#default#VML);}w/:* {behavior:url(#default#VML);}.shape {behavior:url(#default#VML);}--> Normal 0 7.8 磅 0 2 false false false

Normal 0 7.8 磅 0 2 false false false MicrosoftInternetExplorer4 Sliding WindowTime Limit: 12000MS Memory Limit: 65536KTotal Submissions: 14169 Accepted: 3953Case Time Limit: 5000MSDescriptionAn

v/:* {behavior:url(#default#VML);}o/:* {behavior:url(#default#VML);}w/:* {behavior:url(#default#VML);}.shape {behavior:url(#default#VML);}-->Girls and BoysTime Limit: 10 Seconds      MemoryLimit: 32768 KB the second year of the university somebody

Normal 0 7.8 磅 0 2 false false false MicrosoftInternetExplorer4 classid="clsid:38481807-CA0E-42D2-BF39-B33AF135CC4D" id=ieooui>Big Event in HDUTime Limit: 10000/5000 MS(Java/Others)    Memory

Osaisen Choudai!Time Limit: 3 Seconds      Memory Limit:65536 KB A saisenbako (賽銭箱,offertory, or religious collection box) is situated in front of the hall ofHakurei Shrine. Hakurei Reimu (博麗霊夢), the miko ofHakurei Shrine, may ask the friends who

Normal 0 7.8 磅 0 2 false false false MicrosoftInternetExplorer4 Monkey and BananaTime Limit: 2000/1000 MS(Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s):

Normal 0 7.8 磅 0 2 false false false MicrosoftInternetExplorer4 Gift HuntingTime Limit: 6000/3000 MS(Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 349    Accepted

Normal 0 7.8 磅 0 2 false false false MicrosoftInternetExplorer4 Strategic GameTime Limit: 20000/10000 MS(Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s):

Knight MovesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1147    Accepted Submission(s): 721Problem DescriptionA friend of you is doing research on the Traveling Knight Problem (TKP) where

Normal 0 7.8 磅 0 2 false false false MicrosoftInternetExplorer4 /* Style Definitions */

3100.   Getting Gold Time Limit: 5.0 Seconds   Memory Limit: 65536KTotal Runs: 246   Accepted Runs: 142    Multiple test filesWe're building an old-school back-to-basics computer game. It's a very simple text based adventure game where you walk