~Love() - 博客园

找单词

摘要：找单词Time Limit : 1000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 1Accepted Submission(s) : 1Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem Description假设有x1个字母A， x2个字母B,..... x26个字母Z，同时假设字母A的价值为1，字母B的价值为2,..... 字母Z的价值为26。那么，对于给定的字母，可以找到多少价值 2 int a[7500], 阅读全文

posted @ 2013-09-22 17:22 ~Love() 阅读(303) 评论(1) 推荐(1)

今年暑假不AC

摘要：今年暑假不ACTime Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 1Accepted Submission(s) : 1Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem Description“今年暑假不AC？”“是的。”“那你干什么呢？”“看世界杯呀，笨蛋！”“@#$%^&*%...”确实如此，世界杯来了，球迷的节日也来了，估计很多ACMer也会抛开电脑，奔向电视了。作为球迷，一阅读全文

posted @ 2013-09-22 09:01 ~Love() 阅读(208) 评论(0) 推荐(0)

Rightmost Digit

摘要： Rightmost DigitTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25969Accepted Submission(s): 9982Problem DescriptionGiven a positive integer N, you should output the most right digit of N^N.InputThe input contains several test cases. The first line 阅读全文

posted @ 2013-09-21 23:09 ~Love() 阅读(225) 评论(0) 推荐(0)

Text Reverse

摘要： Text ReverseTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13524Accepted Submission(s): 5161Problem DescriptionIgnatius likes to write words in reverse way. Given a single line of text which is written by Ignatius, you should reverse all the words 阅读全文

posted @ 2013-09-21 22:19 ~Love() 阅读(306) 评论(0) 推荐(0)

A. Difference Row

摘要： A. Difference Rowtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou want to arrangenintegersa1, a2, ..., anin some order in a row. Let's define the value of an arrangement as the sum of differences between all pairs of adjacent integers.More 阅读全文

posted @ 2013-09-21 14:20 ~Love() 阅读(221) 评论(0) 推荐(0)

B. Fixed Points

摘要： B. Fixed Pointstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA permutation of lengthnis an integer sequence such that each integer from 0 to(n - 1)appears exactly once in it. For example, sequence[0, 2, 1]is a permutation of length 3 while both 阅读全文

posted @ 2013-09-21 13:53 ~Love() 阅读(252) 评论(0) 推荐(0)

命运

摘要：命运Time Limit : 2000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 20Accepted Submission(s) : 2Font:Times New Roman|... 阅读全文

posted @ 2013-09-20 11:47 ~Love() 阅读(210) 评论(0) 推荐(0)

Climbing Worm

摘要： Climbing WormTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10217Accepted Submission(s): 6761Problem DescriptionAn inch worm is at the bottom of a well n inches deep. It has enough energy to climb u inches every minute, but then has to rest a minu 阅读全文

posted @ 2013-09-19 22:34 ~Love() 阅读(207) 评论(0) 推荐(0)

大学感想

摘要：写下下面这段些话勉励下自己，并以此共勉吧。今天是我进入大学后的第397天，已经在这个学校度过两个中秋，现在真的想家，特别是现在一个人的时候，之前好多年没有过这种感觉。一年说长也长，说短也短，当你回头看时你就会觉得它很短。这一年你要问我学到什么了，说实话，除了觉得自学能力提升了点之外，其他的真没学到什么。要是问有什么变化，貌似除了身体变差了之外其他也没啥大的变化。对于学习成绩方面算不上满意，不过也谈不上郁闷。或许我大学是从大一下才算真正开始的。如果说大一上当时同届同学的是在黑暗中摸索，那么我连摸索都没有摸索，脑子里根本没这个概念，觉得在寝室打打电脑，到饭点就订餐送到寝室，是件很幸福的事。大一上不阅读全文

posted @ 2013-09-19 20:02 ~Love() 阅读(238) 评论(0) 推荐(0)

Constructing Roads

摘要： Constructing RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11481Accepted Submission(s): 4312Problem DescriptionThere are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to 阅读全文

posted @ 2013-09-18 19:09 ~Love() 阅读(182) 评论(0) 推荐(0)

找单词