哈哈,虽然是一道字符串水题,可是拿到一个1A还是很开心的! 题意就是给一些keywords(子串)和Excuse(母串),然后输出包含keywords最多的Excuse,如果相等的话,按任意顺序全部输出即可. 解题时有几点需要注意: 1.一个keyword可能在Excuse里重复多次. 2.每个keyword的左右两端必须是行首或行尾或不是字母的字符. 3.Excuse里貌似是不区分大小写的,所以读入所有的Excuse后需要再memcpy一份,把那份用来全部转化为大写或小写,原来的那份作输出用.…

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 required listening to goofy excuses, Judge Ito has asked that you write a program that will…

Description 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 required listening to goofy excuses, Judge Ito has asked that you write a progr…

https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=65 题意:输出不包含两个相邻的重复子串. 思路:这就跟八皇后问题是一样的,注意判断子串是否相同就可以了. #include<iostream> using namespace std; int n, l; ]; int flag; int cnt; void dfs(int cu…

题目链接 题目大意: 给出n,l:要求按特定格式输出由前l个大写字母构成的按字母表排列的第n个没有连续重复子串的字符串以及该字符串长度. 此题是一道dfs递归回溯的基础题,难点在于对当前字符串是否有连续重复子串的判断,具体做法是这样的,以长度为对象枚举以新添进字符为尾巴的子串,看是否重复. 但是我还是有一点疑问,为什么我将这段代码做出下列改动,就会Runtime error! #include <cstdio> ]; int n, L, cnt;//cnt记录已经生成的合法字符串的个数 int…

简单字符串. #include <cstdio> #include <cstring> #define MAXLEN 105 #define MAXN 25 char keys[MAXN][MAXN]; char lines[MAXN][MAXLEN]; int nums[MAXN]; int main() { ; int n, m, max; int i, j, k, v; char tmp[MAXLEN]; while (scanf("%d %d",&…

解题报告 题意: 找包括单词最多的串.有多个按顺序输出 思路: 字典树爆. #include <cstdio> #include <cstring> #include <iostream> using namespace std; int k,e,num[100],cnt; struct node { int v; node *next[26]; }; node *newnode() { node *p=new node; p->v=0; int i; for(i…

白书一:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=64609#overview 注意UVA没有PE之类的,如果PE了显示WA. UVA401:Palindromes #include <iostream> #include <cstdio> #include <cstring> #include <cstdlib> #include <algorithm> using namesp…

题目 Volume 0. Getting Started 开始10055 - Hashmat the Brave Warrior 10071 - Back to High School Physics 10300 - Ecological Premium 458 - The Decoder 494 - Kindergarten Counting Game 414 - Machined Surfaces 490 - Rotating Sentences 445 - Marvelous Mazes…

10361 - Automatic Poetry #include <iostream> #include <string> #include <cstdio> #include <cstdlib> #include <cstring> #include <cctype> #include <algorithm> #include <fstream> using namespace std; int n; ],…