俯瞰风景

题目：“Oh God”, Lara Croft exclaims, “it’s one of these dumb riddles again!”In Tomb Raider XIV, Lara is, as ever, gunning her way through ancient Egyptian pyramids, prehistoric caves and medival hallwa

题意：题解：

题意：题解：

题意：有一个图上全是'.'，现在会放一些矩形上去，每个矩形都由'A'~'Z'组成，且不会重复，一些矩形会被另一些矩形覆盖，问位于最上方的不被覆盖的矩形是哪些，输出组成字母。按字典序输出，每个矩形长宽不少于3。题解：直接暴力，比较矩形的对应的长和宽是否相等，需要注意最上方矩形内部一定都是'.'。#include const int N = 105;char m[N][N];in

题意：有iPhone iPad iPod Apple这些词出现就输出MAI MAI MAI! 有Sony输出。。。题解：水题。#include #include #include using namespace std;string str; int main() { while (getline(cin, str)) { int len = str.length()

题意：有green red yellow blue四种颜色，把一个N*N的矩阵划分为N个区域，颜色相同且紧邻认为是同一个区域，构造一个N*N的矩阵，用GRYB表示。题解：构造矩形，找到构造规律就好了。。。可是好难QAQ。1和6特殊处理，2、3、4无解，剩下的用规律构造之。#include #include const int N = 105;char s[5] = "BGRY

题意：有个不完整的字符串，需要在字符串的?处填字母使字符串不会成为回文串且字典序最小，输出完整字符串。题解：思路是先把所有?替换成a，检验发现不是回文串就输出，如果只有一个?且位置在中间就输出'QwQ'，否则就把最后一个？换成b，如果最后一个？在中间，替换倒数第二个？为b，坑。。。#include #include const int N = 1005;char str[N];in

题意：读入一行字符串，16个字符输出一行内容，按格式输出16个字符的ascii码，不足16个字符补上空格，每行的开头是第k个字符的首地址，输出16进制数，每行最后要输出原字符，大写字母换为小写，小写换为大写。 题解：处理有点麻烦的字符串水题。#include <stdio.h>#include <string.h>const int N = 5000;char str[N];int main

题意：有一个字符串s，输出一个不同于s的所有子串的最小字典序串。 题解：因为字典序要最少，直接输出s最长连续A的数量加一个A。#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;const int N = 105;char str[N];int main() { int t;

题解：这道题非常让我想xxxxxx， 开始时想了很多情况

题目：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 problem that all codes are in b

Figure 1.DNA (Deoxyribonucleic Acid) is the molecule which contains the genetic instructions. It consists of four different nucleotides, namely Adenine, Thymine, Guanine, and Cytosine as shown in Figu

题解：模拟+栈（存放运算符）。#include #include #include #include #include using namespace std;const int N = 30;int flag[N], now[N], value;void init() { value = 0; memset(flag, 0, sizeof(flag));

题目：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 understand the problem first!So the

题目：Text-processing tools like awk and sed allow you to automatically perform a sequence of editing operations based on a ｓcript. For this problem we consider the specific case in which we want to

题目：

题目："Machines take me by surprise with great frequency." Alan TuringYour boss has just unearthed a roll of old computer tapes. The tapes have holes in them and might contain some sort of useful i

题目：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 the string is rea

题目：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 of letters in the grid. A w

题意：一个字符串包含小写字母和’.’，化简是把两个连续的’.’化为一个’.’，现在操作是 a b，把位置a上的字符替换成b后，问多少步才能化简结束。 题解：先把初始字符串需要的步数计算出来，然后分情况加或减或不变。#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int N =