咸鱼の小窝

Time limit: 3.000 secondsDescriptionSome 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”

题目链接：UVa 201 SquaresDescription： A children’s board game consists of a square array of dots that contains lines connecting some of the pairs of adjacent dots. One part of the game requires that the

题目链接： UVA-815 Description： To enable homebuyers to estimate the cost of flood insurance, a real-estate firm provides clients with the elevation of each 10-meter by 10-meter square of land in regions wh

题目链接： UVa 202Description: The decimal expansion of the fraction 1/33 is 0.03, where the 03 is used to indicate that the cycle 03 repeats indefinitely with no intervening digits. In fact, the decima

题目链接：UVa 10325 The Lottery Description： The Sports Association of Bangladesh is in great problem with their latest lottery ‘Jodi laiga Jai’. There are so many participants this time that they cannot

题目链接：UVa 11806 Cheerleaders Description： In most professional sporting events, cheerleaders play a major role in entertaining the spectators. Their roles are substantial during breaks and prior to s

题目链接：点击打开链接紫书116页AC代码：#include #include #include #include #include #include #include #include #include using namespace std;#define ALL(x) x.begin(),x.end()#define INS(x) inserter(x, x

题目链接：UVa 1605 Building for UN Description：The United Nations has decided to build a new headquarters in Saint Petersburg, Russia. It will have a form of a rectangular parallelepiped and will consist of

题目链接：UVa 120 Stacks of FlapjacksDescription：Stacks and Queues are often considered the bread and butter of data structures and find use in architecture, parsing, operating systems, and discrete event s

题目链接：UVa 12412A Typical Homework(a.k.a Shi Xiong Bang Bang Mang)Hi, I am an undergraduate student in institute of foreign languages. As you know, C programming is a required course in our univer

题目链接：点击打开链接练习set的用法，可参考紫书112页AC代码：#include #include #include #include #include #include #include #include using namespace std;set dict; //string集合int main(){ string s, buf; w

题目：点击打开链接紫书110页小技巧：输入的四种指令，找到其共同点会使代码简单多AC代码：#include #include #include #include #include #include using namespace std;const int maxn = 30;int n;vector pile[maxn];void find_block(i

题目链接：点击打开链接公式挺好推的，注意一下枚举的范围即可详见紫书183页AC代码：#include #include #include #include #include using namespace std;int a[10005][5];int main(){ int k, ans, tem, i; while(~scanf("%d",&k)

题目链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=163（因为格式的原因 贴过来看起来很不舒服 所以直接发链接了，中文版可参考紫书57页习题3-5）思路很清晰就是简单地模拟一下，根据它的指令来做就好了。输入注意一下。AC代码：#incl

题目看这里~题意：懒得写了 想看的话可以找紫书58页习题3-7 或者 参考别人的博客（刚开始还以为是在给定的DNA中选出一个，但看样例怎么也不动，再看时才发现是构造一个新的DNA序列这也没什么好讲的 认真读题然后注意一下小细节（已用//注释出来AC代码：#include #include #include #include #include using namespace

题目传送门：UVa 455 周期串 翻译可参照紫书57页习题3-4题意：给定一个字符串 求出它的最小循环周期AC代码：#include #include #include #include #include using namespace std;char s[105];int main(){ int n, i, j, len; while(~scanf

AC代码：

题目链接：点击打开链接题目大意及思路等参照紫书79-81页，也有代码。AC代码：#include #include #include #include #include using namespace std;int n, lena, lens, lefta;int win, lose, chance;char a[105], s[105];void guess(c

题目链接：map的用法，参考紫书114页AC代码：#include #include #include #include #include #include #include using namespace std;map cnt;vector words;string repr(const string& s)//把每个单词“标准化”{ string

题目链接：点击打开链接参照紫书118页AC代码：#include #include #include #include #include #include #include using namespace std;const int maxn = 1005;int main(){ int t, cou = 0; while(~scanf("%d",&

题目链接：点击打开链接参照紫书120页AC代码：#include #include #include #include #include #include #include #include using namespace std;typedef long long LL;const int coeff[3] = {2, 3, 5};int main(){

题目链接：点击打开链接中文翻译见紫书182页一开始暴力想到了10个for循环，接着看了看书，5个就够了，写了会感觉好low啊。写完后有bug，debug时感觉好熟悉，突然想到了第二章的习题2-6，果断把5个for循环删掉，改为用一个for从1234到49385循环（abcde / fghij= N， N最小为2，只要循环到98765/2+1就行 ）。这里判断数字是否重复用到了字符数组，

PROBLEM C Morse Mismatches Input file: morse.inSamuel F. B. Morse is best known for the coding scheme that carries his name. Morse code is still used in international radio communication. The coding