不慌不忙、不急不躁

Problem B: Andy's First DictionaryTime limit: 3 secondsAndy, 8, has a dream - he wants to produce his very own dictionary. This is not an easy task for him, as the number of

Ancient Roman empire had a strong government system with various departments, including a secret service department. Important documents were sent between provinces and the capital in encrypted form t

题目链接：fzu 1913 Easy Comparison题目大意：给出一个字符串，计算与它按照字典序排序排列后的字符串有多少个位置不同。解题思路：水体，sort一下，然后遍历一遍就好。#include #include #include using namespace std;const int N = 105;char str[N], tmp

题目连接：Codeforces 385B Bear and Strings题目大意：给出一个字符串，问说该字符串中有多少个子串包含“bear”。解题思路：遍历，每次找到“bear”，就用该串前面个字符数x，以及该串后面的字符数y，ans += （x+1）*（y+1）- 前一个“bear”所在位置的字符串（重复的）#include #include #incl

DEL command It is required to find out whether it is possible to delete given files from MS-DOS directory executing the DEL command of MS-DOS operation system only once. There are no n

题目链接：uva 1314 - Hidden Password题目大意：给定一个字符串，求该字符串的最小表示法。解题思路：以两个指针交替移动，逐个比较，直到比较出大小后转移起始位置。#include #include #include using namespace std;const int maxn = 1e5+5;int N;char s[maxn];

题目链接：zoj 3817 Chinese Knot题目大意：给出四个字符串，对应着同心结的四条边，现在给定一个目标串，可以从任意节点开始移动，问是否可以匹配目标串。解题思路：用hash将四个字符串的正序和逆序处理出来，然后dfs枚举，每次保留起始位置和移动方向即可。#include #include #include #include using namespace

Broken Keyboard (a.k.a. Beiju Text)You're typing a long text with a broken keyboard. Well it's not so badly broken. The only problem with the keyboard is that sometimes the "home" key or the "

题目链接：uva 475 - Wild Thing题目大意：给定一个字符串的通配，然后给定一些字符集，问说有哪些字符满足匹配，如果没有一个字符串匹配的话，当前这组数据就任何东西也不输出，包括换行。解题思路：递归去匹配即可，注意∗，∗∗∗这种数据。#include #include #include using namespace std;const int maxn =

题目链接：uva 282 - Rename题目大意：给定一个命令行的重命名命令，最多包含一个‘*’，然后给定一些文件名，将该命令转换成若干个执行命令。解题思路：因为最多一个‘*’，所以直接开头结尾匹配掉，再处理中间的即可。#include #include #include #include #include #include using namespace st

题目链接：uva 257 - Palinwords题目大意：判定一个字符串是否有两个互相不为子串的回文串为子串。解题思路：枚举长度为3和4的字符串，然后将每个字符串映射成一个hash值。#include #include #include #include using namespace std;const int maxn = 500;char word[m

题目链接：poj 2408 Anagram Groups题目大意：给定若干个字符串，将其分组，按照组成元素相同为一组，输出数量最多的前5组，每组按照字典序输出所有字符串。数量相同的输出字典序较小的一组。解题思路：将所有的字符串统计字符后hash，排序之后确定每组的个数并且确定一组中字典序最小的字符串。根据个数以及字符串对组进行排序。#include #incl

题目链接：hdu 2609 How many题目大意：给出n，表示有n个有01组成的字符串，每个字符串都代表一个项链，那么该字符串就是一个环状的结构，题目要求计算说给出的字符串中有几种不同的项链。解题思路：将每个字符串转换成最小串，然后放在set里面去重。#include #include #include #include #include usi

题目链接：hdu 5371 Hotaru's problem#include #include #include #include #include using namespace std;typedef pair pii;typedef set::iterator iter;const int maxn = 100005 * 2;int N, A[maxn];

题目链接：hdu 5340 Three Palindromes用manachar处理一下，分别找出所有包括起始位置和终止位置的回文串，然后枚举第一个串和第三个串，判断中间剩下的是否是回文。#include #include #include #include using namespace std;typedef pair pii;const int maxn

题目链接：hdu 5442 Favorite Donut正序逆序分别做一遍最小表示法，但是因为逆序求出最小表示法下标对应的是为最大值，所以我们用kmp求出循环节长度，然后用下标取模即可。#include #include #include #include #include #include #include using namespace std;con

题目链接：Codeforces 496B Secret Combination代码#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn = 1005;int N;char S[maxn], T[maxn], F[maxn];int miniexpress(char*

All in AllInput: standard inputOutput: standard outputTime Limit: 2 secondsMemory Limit: 32 MBYou have devised a new encryption technique which encodes a message by inserting between its cha

题目连接：620 - Cellular Structure题目大意：给出一个细胞群， 判断该细胞的可能是由哪一种生长方式的到的， 输出该生长方式的最后一种生长种类， "SIMPLE" -----------------------由 空 生成 ‘A'"FULLY-GROWN" ----------------在 原细胞群(不能为空)的后面 加上  ’AB'MUTAN

题目连接：http://www.rqnoj.cn/Problem_51.html解题思路：一次读入一个字符，对每个字符进行处理，注意的是获胜的条件除了一方到达21 或11 球之外，还有需要超过两球，就是说20：21不算分出胜负，20：22才算。#include #include #include const int N = 10005;int main() { char

Immediate Decodability An encoding of a set of symbols is said to be immediately decodable if no code for one symbol is the prefix of a code for another symbol. We will assume for this

Where's Waldorf? Given a m by n grid of letters, ( ), and a list of words, find the location in the grid at which the word can be found. A word matches a straight, uninterrupted line o

Excuses, Excuses! Judge Ito is having a problem with people subpoenaed for jury duty giving rather lame excuses in order to avoid serving. In order to reduce the amount of time require

Palindromes A regular palindrome is a string of numbers or letters that is the same forward as backward. For example, the string "ABCDEDCBA"is a palindrome because it is the same when

Automatic PoetryInput: standard inputOutput: standard outputTime Limit: 2 secondsMemory Limit: 32 MB “Oh God”, Lara Croft exclaims, “it’s one of these dumb riddles again!” In Tomb

Artificial Intelligence? Physics teachers in high school often think that problems given as text are more demanding than pure computations. After all, the pupils have to read and under

Evaluating Simple C Expressions The task in this problem is to evaluate a sequence of simple C expressions, buy you need not know C to solve the problem! Each of the expressions will a

Decode the tapeTime Limit: 1 second"Machines take me by surprise with great frequency."Alan TuringYour boss has just unearthed a roll of old computer tapes. T

Automatic EditingSource file:autoedit.{c, cpp, java, pas}Input file:autoedit.inOutput file:autoedit.outText-processing tools like awk and sed allow you to aut

题目连接：hdu 3068 最长回文解题思路：通过manachar算法求最长回文子串，如果用遍历的话绝对超时。#include #include const int N = 220005;int rad[N];char string[N], tmpstr[N];int max(int a, int b) { return a > b ? a : b;

题目连接：http://www.rqnoj.cn/Problem_144.html补充题意：就是给出n个字符串，输出字典序排在第m个字符串。解题思路：借助string和sort。#include #include #include using namespace std;const int N = 10005;int main() { string str[N];

题目连接：http://www.rqnoj.cn/Problem_399.html解题思路：对字符串中出现的字符逐一统计，找到最大值和最小值。#include #include const int N = 105;const int M = 26;bool isPrime(int cur) { for (int i = 2; i < cur; i++) if (cur

L-system A D0L (Deterministic Lindenmayer system without interaction) system consists of a finite set  of symbols (the alphabet), a finite set P of productions and a starting string

题目连接：http://www.rqnoj.cn/Problem_137.html解题思路：模拟，水题一道，看代码。#include #include const int N = 10;const int r[] = {1, 2, 3, 0};const int l[] = {3, 0, 1, 2};int n;char order[N];int main() {

题目连接：http://www.rqnoj.cn/Problem_224.html解题思路：将对应按键存成常量数组。#include #include const int sign[] = {1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 1, 2, 3, 4};const int N = 205;

题目连接：http://www.rqnoj.cn/Problem_516.html解题思路：分类考虑一下。1、第一个'+'不用输出；2、系数为1不输出；3、幂为1不输出；4、系数为0整项不输出。#include #include #include const int N = 105;int main() { int n, num[N]; whil

题目链接：uva 719 - Glass Beads题目大意：给定一个字符串，求最小表示法。解题思路：最小表示法。#include #include #include using namespace std;const int maxn = 1e4+5;char s[maxn];int main () { int cas; scanf("%d