![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
UVA
wikioi_bai
时间并不会因为你的迷茫和迟疑而停留,就在你看这篇文章的同时,不知道有多少人在冥思苦想,在为算法废寝忘食,不知道有多少人在狂热地拍着代码,不知道又有多少提交一遍又一遍地刷新着OJ的status页面……
没有谁生来就是神牛,而千里之行,始于足下!
展开
-
UVA 1584
DescriptionSome DNA sequences exist in circular forms as in the following figure, which shows a circular sequence ``CGAGTCAGCT", that is, the last symbol ``T" in ``CGAGTCAGCT" is connected to th原创 2014-11-09 17:23:01 · 993 阅读 · 0 评论 -
UVA 10420 List of Conquests
DescriptionProblem BList of ConquestsInput: standard inputOutput: standard outputTime Limit: 2 secondsIn Act I, Leporello is telling Donna Elvira about his master's long list of conque原创 2015-02-15 10:21:48 · 465 阅读 · 0 评论 -
UVA 299 Train Swapping(冒泡排序)
DescriptionAt an old railway station, you may still encounter one of the last remaining ``train swappers''. A train swapper is an employee of the railroad, whose sole job it is to rearrange th原创 2015-02-15 17:09:05 · 523 阅读 · 0 评论 -
UVA 10474 Where is the Marble?
DescriptionRaju and Meena love to play with Marbles. They have got a lot of marbles with numbers written on them. At the beginning, Raju would place the marbles one after another in ascend原创 2015-02-15 12:18:21 · 564 阅读 · 0 评论 -
UVA 340 Master-Mind Hints
DescriptionMasterMind is a game for two players. One of them, Designer, selects a secret code. The other, Breaker, tries to break it. A code is no more than a row of colored dots. At the beginning原创 2015-02-15 09:17:44 · 510 阅读 · 0 评论 -
UVA 10010 Where's Waldorf?
StatisticLOGOUTwikioi_baiUVA - 10010Where's Waldorf?Time Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmitStatus Description原创 2014-11-23 11:33:00 · 605 阅读 · 0 评论 -
UVA 401 Palindromes 回文词
PalindromesTime Limit:3000MS Memory Limit:Unknown 64bit IO Format:%lld & %lluSubmit StatusDescriptionA regular palindrome is a string of numbers or letters原创 2014-11-17 20:53:28 · 457 阅读 · 0 评论 -
UVA 1586 分子量
一道有关字符串处理i的题目,很普通,只要注意下一个元素后面的数字的统计就行了,因为题目数 2原创 2014-11-11 20:12:10 · 999 阅读 · 0 评论 -
UVA 455 周期串
题目的意思很简单,但是调了我好久,有很多细节都没有发现,导致很多的错误输出。题目实际上就是让我们用暴力的方法枚举最小循环节,因为字符串的长度比较小,故使用暴力就足以,如果长度比较大的话,那就得考虑KMP来解决了。# include# include# includeusing namespace std;# define MAX 100char s[MAX];i原创 2014-11-12 15:46:36 · 726 阅读 · 0 评论 -
UVA 10340 子序列
水题一道,不涉及什么算法,注意s串和t串的输入原创 2014-11-12 16:58:32 · 490 阅读 · 0 评论 -
UVA 1583
一道很简单的打表题,看起来像是数学题,还在那里想原创 2014-11-08 23:51:47 · 713 阅读 · 0 评论 -
UVA 10887 Concatenation of Languages(字符串hash入门)
A - Concatenation of LanguagesTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status Practice UVA 10887Appoint description: System Crawler (2015-03-01)D原创 2015-03-01 12:07:01 · 534 阅读 · 0 评论