joj acm_水题
kongming_acm
kongming_acm
展开
-
joj 1107: Factorial
1107: FactorialStatusIn/OutTIME LimitMEMORY LimitSubmit TimesSolved UsersJUDGE TYPEstdin/stdout3s8192K1421587StandardThe most important part of a GSM network i原创 2010-03-10 14:32:00 · 465 阅读 · 0 评论 -
hdu 2487 Ugly Windows 模拟题
Ugly Windows<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)<br />Total Submission(s): 286 Accepted Submission(s): 113<br /><br />Problem DescriptionSheryl works for a software company in the country of Brada. He原创 2010-09-22 15:36:00 · 856 阅读 · 0 评论 -
Message 模拟题
<br />Message<br />Asia - Taipei - 2008/2009 <br />PDF Submit Ranking <br /> <br /> <br />Astronomers have been looking for living beings in the outer planets. Recently the Hobble telescope has picked up binary (black and white) images from the Zkrets原创 2010-08-15 21:56:00 · 421 阅读 · 0 评论 -
Editor 字符串中是否有两个完全相同的子串-可重复
<br />3901 - Editor<br />Asia - Seoul - 2007/2008 <br />PDF Submit Ranking <br /> <br /><br /> <br />Mr. Kim is a professional programmer. Recently he wants to design a new editor which has as many functions as possible. Most editors support a simple s原创 2010-08-14 21:38:00 · 526 阅读 · 0 评论 -
hdu Single CPU, multi-tasking 模拟cpu题
Single CPU, multi-taskingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 103 Accepted Submission(s): 44Problem DescriptionTuntun is a big fan of Apple Inc. who owns almost all kinds of原创 2010-08-01 00:41:00 · 611 阅读 · 0 评论 -
1227: Encoder and Decoder
1227: Encoder and DecoderStatusIn/OutTIME LimitMEMORY LimitSubmit TimesSolved UsersJUDGE TYPEstdin/stdout3s8192K753289StandardBeing in charge of the computer d原创 2010-03-15 12:27:00 · 566 阅读 · 0 评论 -
1146: Word Reversal
1146: Word ReversalStatusIn/OutTIME LimitMEMORY LimitSubmit TimesSolved UsersJUDGE TYPEstdin/stdout3s8192K1941536StandardFor each list of words, output a line原创 2010-03-15 12:26:00 · 750 阅读 · 0 评论 -
1014: The Matrix
1014: The MatrixStatusIn/OutTIME LimitMEMORY LimitSubmit TimesSolved UsersJUDGE TYPEstdin/stdout3s8192K1888572StandardGiven a matrix of characters, and a list原创 2010-03-15 12:23:00 · 462 阅读 · 0 评论 -
1453: Adding Reversed Numbers
1453: Adding Reversed NumbersStatusIn/OutTIME LimitMEMORY LimitSubmit TimesSolved UsersJUDGE TYPEstdin/stdout3s8192K815260StandardThe Antique Comedians of Mali原创 2010-03-15 12:29:00 · 530 阅读 · 1 评论 -
1087: Undercut
1087: UndercutStatusIn/OutTIME LimitMEMORY LimitSubmit TimesSolved UsersJUDGE TYPEstdin/stdout3s8192K2264657StandardUndercut is a card game where two players eac原创 2010-03-15 12:25:00 · 674 阅读 · 2 评论 -
1013: Polynomial Multiplication
1013: Polynomial MultiplicationStatusIn/OutTIME LimitMEMORY LimitSubmit TimesSolved UsersJUDGE TYPEstdin/stdout3s8192K3900652StandardA polynomial is a sum of t原创 2010-03-13 19:23:00 · 473 阅读 · 0 评论 -
1027: Smith Numbers
1027: Smith NumbersStatusIn/OutTIME LimitMEMORY LimitSubmit TimesSolved UsersJUDGE TYPEstdin/stdout30s8192K2332568StandardWhile skimming his phone directory in原创 2010-03-13 19:23:00 · 392 阅读 · 0 评论 -
1815: The Smart Bunny
1815: The Smart BunnyStatusIn/OutTIME LimitMEMORY LimitSubmit TimesSolved UsersJUDGE TYPEstdin/stdout5s8192K481256Standard2nd JOJ Cup Online VContest Problem原创 2010-03-10 14:35:00 · 474 阅读 · 0 评论 -
joj 1551:Factorial Frequencies
1551: Factorial FrequenciesStatusIn/OutTIME LimitMEMORY LimitSubmit TimesSolved UsersJUDGE TYPEstdin/stdout3s8192K564211StandardIn an attempt to bolster her sa原创 2010-03-10 14:28:00 · 583 阅读 · 0 评论 -
joj 1026: The Staircases
1026: The StaircasesStatusIn/OutTIME LimitMEMORY LimitSubmit TimesSolved UsersJUDGE TYPEstdin/stdout3s8192K1415454StandardOne curious child has a set of N litt原创 2010-03-10 14:38:00 · 537 阅读 · 0 评论 -
sprintf 函数的用法
sprintf 将字串格式化。例如 int m; char c[100]; scanf("%d",&m); sprintf(c,"%d",m); 在头文件 #includestdio.h>中 语法: int sprintf(string format, mixed [args]...); 返回值:字符串长度(strlen) 1. 处理字符方向。-负号时表时从原创 2010-03-10 14:33:00 · 558 阅读 · 0 评论 -
pku 1068 Parencodings
ParencodingsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11249 Accepted: 6635<br />DescriptionLet S = s1 s2...s2n be a well-formed string of parentheses. S can be encoded in two different ways: <br />q By an integer sequence P = p1 p2...pn whe原创 2011-02-22 11:25:00 · 690 阅读 · 2 评论