![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM 水题
文章平均质量分 80
neoxuhaotian
爱技术,爱编程,努力的奋斗。。。
展开
-
zju1049题解
<br />题目:<br /> I Think I Need a HouseboatTime Limit: 1 Second Memory Limit: 32768 KB<br /> <br /> <br />Fred Mapper is considering purchasing some land in Louisiana to build his house on. In the process of investigating the land, he learned that th原创 2011-01-02 11:37:00 · 4194 阅读 · 1 评论 -
zju1037题解
题目: GridlandTime Limit: 1 Second Memory Limit: 32768 KBBackgroundFor years, computer scientists have been trying to find efficient solutions to different computing problems. For some of them efficient algorithms are already available, these are the原创 2011-01-02 10:46:00 · 1276 阅读 · 0 评论 -
zju1045题解
题目:HangOverTime Limit: 1 Second Memory Limit: 32768 KBHow far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (We're assuming that the cards must be perpendicular to the原创 2011-01-02 11:12:00 · 2799 阅读 · 1 评论 -
zju1058题解
<br />题目:<br />Currency ExchangeTime Limit: 1 Second Memory Limit: 32768 KBWhen Issac Bernand Miller takes a trip to another country, say to France, he exchanges his US dollars for French francs. The exchange rate is a real number such that when m原创 2011-01-02 13:33:00 · 753 阅读 · 0 评论 -
zju1067题解
题目:Color Me LessTime Limit: 1 Second Memory Limit: 32768 KBProblemA color reduction is a mapping from a set of discrete colors to a smaller one. The solution to this problem requires that you perform just such a mapping in a standard twenty-four bit原创 2011-01-02 13:48:00 · 689 阅读 · 0 评论 -
zju1078题解
<br />题目:<br />Palindrom NumbersTime Limit: 1 Second Memory Limit: 32768 KBStatement of the Problem<br />We say that a number is a palindrom if it is the sane when read from left to right or from right to left. For example, the number 75457 is a pal原创 2011-01-02 14:03:00 · 740 阅读 · 0 评论 -
zoj 1312解题报告
<br /> Prime CutsTime Limit: 1 Second Memory Limit: 32768 KB<br />A prime number is a counting number (1, 2, 3, ...) that is evenly divisible only by 1 and itself. In this problem you are to write a program that will cut some number of prime numbers原创 2011-02-01 12:33:00 · 1184 阅读 · 0 评论 -
poj 3641解题报告
Pseudoprime numbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3611 Accepted: 1285DescriptionFermat's theorem states that for any prime number p and for any integer a > 1, ap = a (mod p). That is, if we raise a to the pth power and divide by原创 2011-02-01 14:01:00 · 3031 阅读 · 0 评论