yan

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

Alex and Karyn were at it again. The elementary school sisters were playing their favorite game to decide who gets to play on the computer next.The rules of the game are quite simple. Given p peop

Byteasar is addicted to the English letter 'q'. Now he comes across a stringS consisting of lowercase English letters.He wants to find all the continous substrings of S, which only contain t

章鱼哥没有日历Time limit per test: 1.0 secondsTime limit all tests: 5.0 secondsMemory limit: 256 megabytes一月到十二月，这种无聊的东西，对于章鱼哥这种神奇的生物来说，当然是没有意义的。对于章鱼哥来说，只有年和日，没有月。他只关心某一天是这一年的第几天。如果你要告诉

A: 二叉树结点公共祖先Submit Page    Time Limit: 1 Sec     Memory Limit: 128 Mb     Submitted: 9     Solved: 5    Description一个顺序存储的完全二叉树：             1          /     \        2      

DescriptionYou are in charge of a server that needs to run some submitted tasks on a first-come, first-served basis. Each day, you can dedicate the server to run these tasks for at most T minutes. G

输入一些仅由小写字母组成的单词。你的任务是统计有多少个单词是“酷”的，即每种字母出现的次数都不同。比如ada是酷的，因为a出现2次，d出现1次，而1和2不同。再比如，banana也是酷的，因为a出现3次，n出现2次，b出现1次。但是，bbacccd不是酷的，因为a和d出现的次数相同（均为1次）。Input输入包含不超过30组数据。每组数据第一行为单词个数n (1Ou

Problem A Time Limit : 3000/1000ms (Java/Other)   Memory Limit : 65535/32768K (Java/Other)Total Submission(s) : 504   Accepted Submission(s) : 99Font: Times New Roman | Verdana | Georgia Font

Problem C Time Limit : 3000/1000ms (Java/Other)   Memory Limit : 65535/32768K (Java/Other)Total Submission(s) : 167   Accepted Submission(s) : 64Font: Times New Roman | Verdana | Georgia Font

在一个奇怪的村子中，很多人的名字都很长，比如aaaaa, bbb and abababab。名字这么长，叫全名显然起来很不方便。所以村民之间一般只叫名字的前缀。比如叫'aaaaa'的时候可以只叫'aaa'，因为没有第二个人名字的前三个字母是'aaa'。不过你不能叫'a'，因为有两个人的名字都以'a'开头。村里的人都很聪明，他们总是用最短的称呼叫人。输入保证村里不会有一个人的名字是另外一个人名字

Given a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let’s say the phone catalogue listed these numbers:Emergency 911Alice 97 625 999B

DescriptionMr. Teacher老师班上一共有n个同学，编号为1到n。 在上课的时候Mr. Teacher要求同学们从左至右按1, 2, …, n的顺序坐成一排，这样每个同学的位置是固定的，谁没来上课就一目了然了。但是时间长了之后，Mr. Teacher发现坐得离得远的同学往往因为交流很少而逐渐变得生疏了，于是他决定重新安排同学们的座位，并且在新的座位安排中，任意两个相邻的同学

重复数Time limit per test: 1.0 secondsTime limit all tests: 1.0 secondsMemory limit: 256 megabytes有n个(1≤n≤1000) int类型的整数，统计其中重复出现次数最多的数。Input第 1 行：整数T(1≤T≤10)为问题数。第 2 行：整数n为第一个问

Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall.A blockhouse is a small castle th

This task is so easy that the description is omitted.Sample InputA numeronym is a number-based word.Most commonly, a numeronym is a word where a number is used to form anabbreviation (albeit n

The cows are thrilled because they've just learned about encrypting messages. They think they will be able to use secret messages to plot meetings with cows on other farms. Cows are not known for

DescriptionA krunched word has no vowels ("A", "E", "I", "O", and "U") and no repeated letters. Removing vowels and letters that appear twice or more from MISSISSIPPI yields MSP. In a krunched wor

DescriptionIn this problem, you will be given one or more integers in English. Your task is to translate these numbers into their integer representation. The numbers can range from negative 999,99

求螺旋矩阵下图是一个n = 4 时的螺旋矩阵。 #include #include #include #include #include #include #include using namespace std;int a[10005],b[10005][105];int main(){   int s,m,n,x,y;

判断是否是完全二叉树将一系列给定数字顺序插入一个初始为空的二叉搜索树（定义为左子树键值大，右子树键值小），你需要判断最后的树是否一棵完全二叉树，并且给出其层序遍历的结果。输入格式：输入第一行给出一个不超过20的正整数N；第二行给出N个互不相同的正整数，其间以空格分隔。输出格式：将输入的N个正整数顺序插入一个初始为空的二叉搜索树。在第一行中输出结果树的层序遍历结果，数字间以1个空

一个山头呼喊的声音可以被临近的山头同时听到。题目假设每个山头最多有两个能听到它的临近山头。给定任意一个发出原始信号的山头，本题请你找出这个信号最远能传达到的地方。输入格式：输入第一行给出3个正整数n、m和k，其中n（<=10000）是总的山头数（于是假设每个山头从1到n编号）。接下来的m行，每行给出2个不超过n的正整数，数字间用空格分开，分别代表可以听到彼此的两个山头的编号。这里保证每一对山...

Stockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst the stockbrokers to give your employer the tactical edge in the stock m

Pigeon SSNA want to build a tower with some wood walls. Let's describe the tower they want to make:A Tower can consist of different number of level.If a tower contain L levels then 1st level must

DescriptionJudge 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 goof

上次Gardon的迷宫城堡小希玩了很久（见Problem B），现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样，首先她认为所有的通道都应该是双向连通的，就是说如果有一个通道连通了房间A和B，那么既可以通过它从房间A走到房间B，也可以通过它从房间B走到房间A，为了提高难度，小希希望任意两个房间有且仅有一条路径可以相通（除非走了回头路）。小希现在把她的设计图给你，让你帮忙判断她的

A catenym is a pair of words separated by a period such that the last letter of the first word is the same as the last letter of the second. For example, the following are catenyms: dog.gophergoph