C/C++
文章平均质量分 86
zkzqzzz
德玛西亚!
展开
-
Victor and String
题目描述Victor loves to play with string. He thinks a string is charming as the string is a palindromic string. Victor wants to play $n$ times. Each time he will do one of following four operation原创 2017-12-18 11:26:25 · 12029 阅读 · 0 评论 -
病毒侵袭持续中
题目描述小t非常感谢大家帮忙解决了他的上一个问题。然而病毒侵袭持续中。在小t的不懈努力下,他发现了网路中的“万恶之源”。这是一个庞大的病毒网站,他有着好多好多的病毒,但是这个网站包含的病毒很奇怪,这些病毒的特征码很短,而且只包含“英文大写字符”。当然小t好想好想为民除害,但是小t从来不打没有准备的战争。知己知彼,百战不殆,小t首先要做的是知道这个病毒网站特征:包含多少不同的病毒,每种病毒出原创 2017-12-15 09:49:39 · 12445 阅读 · 0 评论 -
Wireless Password
题目描述Liyuan lives in a old apartment. One day, he suddenly found that there was a wireless network in the building. Liyuan did not know the password of the network, but he got some important inform原创 2017-12-15 09:47:58 · 11705 阅读 · 0 评论 -
考研路茫茫――单词情结
背单词,始终是复习英语的重要环节。在荒废了3年大学生涯后,Lele也终于要开始背单词了。 一天,Lele在某本单词书上看到了一个根据词根来背单词的方法。比如"ab",放在单词前一般表示"相反,变坏,离去"等。 于是Lele想,如果背了N个词根,那这些词根到底会不会在单词里出现呢。更确切的描述是:长度不超过L,只由小写字母组成的,至少包含一个词根的单词,一共可能有多少个呢?这里就不考虑单原创 2017-12-15 09:44:49 · 10946 阅读 · 0 评论 -
Going Home
题目描述On a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to an adjacent point. For each little man, yo原创 2017-12-23 16:42:38 · 12009 阅读 · 0 评论 -
Drainage Ditches
题目描述Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to regrow.原创 2017-12-23 16:41:38 · 11102 阅读 · 0 评论 -
Cashier Employment
题目描述A supermarket in Tehran is open 24 hours a day every day and needs a number of cashiers to fit its need. The supermarket manager has hired you to help him, solve his problem. The problem is th原创 2017-12-23 16:40:29 · 11146 阅读 · 0 评论 -
Minimum Transport Cost
题目描述These are N cities in Spring country. Between each pair of cities there may be one transportation track or none. Now there is some cargo that should be delivered from one city to another. The原创 2017-12-23 16:38:49 · 12744 阅读 · 0 评论 -
Intervals
题目描述You are given n closed, integer intervals [ai, bi] and n integers c1, ..., cn. Write a program that: > reads the number of intervals, their endpoints and integers c1, ..., cn from the原创 2017-12-23 16:36:50 · 9753 阅读 · 0 评论 -
最长回文
题目描述给出一个只由小写英文字符a,b,c...y,z组成的字符串S,求S中最长回文串的长度. 回文就是正反读都是一样的字符串,如aba, abba等输入描述:输入有多组case,不超过120组,每组输入为一行小写英文字符a,b,c...y,z组成的字符串S 两组case之间由空行隔开(该空行不用处理) 字符串长度len 输出描述:每一行一个整数x,对原创 2017-12-15 09:52:19 · 11448 阅读 · 0 评论 -
Count the string
题目描述It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-empty prefixes of this string. For example:原创 2017-12-15 09:56:48 · 10885 阅读 · 0 评论 -
Boring counting
题目描述035 now faced a tough problem,his english teacher gives him a string,which consists with n lower case letter,he must figure out how many substrings appear at least twice,moreover,such apearanc原创 2017-12-15 09:59:35 · 12768 阅读 · 0 评论 -
Reincarnation
题目描述Now you are back,and have a task to do: Given you a string s consist of lower-case English letters only,denote f(s) as the number of distinct sub-string of s. And you have some query,each原创 2017-12-18 11:25:07 · 10879 阅读 · 0 评论 -
女友的考验
题目描述 终于放寒假了,小明要和女朋友一起去看电影。这天,女朋友想给小明一个考验,在小明正准备出发的时候,女朋友告诉他,她在电影院等他,小明过来的路线必须满足给定的规则: 1、假设小明在的位置是1号点,女朋友在的位置是n号点,则他们之间有n-2个点可以走,小明每次走的时候只能走到比当前所在点编号大的位置; 2、小明来的时候不能按一定的顺序经过某些地方。比如,如果女朋友告诉原创 2017-12-18 11:22:16 · 10962 阅读 · 0 评论 -
str2int
题目描述In this problem, you are given several strings that contain only digits from '0' to '9', inclusive. An example is shown below. 101 123 The set S of strings is consists of the N strings原创 2017-12-18 11:20:31 · 14048 阅读 · 0 评论 -
Good Article Good sentence
题目描述In middle school, teachers used to encourage us to pick up pretty sentences so that we could apply those sentences in our own articles. One of my classmates ZengXiao Xian, wanted to get senten原创 2017-12-18 11:19:16 · 11072 阅读 · 0 评论 -
Dynamic Lover
题目描述As a famous person with universal love, changing girlfriend too often makes me harassment because I can't keep their name in mind timely. To remember who is my lover now, I buy a magic passwor原创 2017-12-15 10:18:23 · 13964 阅读 · 0 评论 -
GRE Words
题目描述Recently George is preparing for the Graduate Record Examinations (GRE for short). Obviously the most important thing is reciting the words. Now George is working on a word list containing N原创 2017-12-15 10:14:01 · 11788 阅读 · 0 评论 -
Cyclic Nacklace
题目描述CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are only 99.9 yuan left. he is too distressed and thinking abou原创 2017-12-15 10:06:33 · 11000 阅读 · 0 评论 -
Best Reward
题目描述After an uphill battle, General Li won a great victory. Now the head of state decide to reward him with honor and treasures for his great exploit. One of these treasures is a necklace made原创 2017-12-15 10:04:37 · 12635 阅读 · 0 评论 -
确定比赛名次
题目描述有N个比赛队(1输入描述:输入有若干组,每组中的第一行为二个数N(1<=N<=500),M;其中N表示队伍的个数,M表示接着有M行的输入数据。接下来的M行数据中,每行也有两个整数P1,P2表示即P1队赢了P2队。 输出描述:给出一个符合要求的排名。输出时队伍号之间有空格,最后一名后面没有空格。 其他说明:符合条件的排名可能不是唯原创 2017-12-23 16:35:17 · 10622 阅读 · 0 评论 -
迷宫城堡
题目描述为了训练小希的方向感,Gardon建立了一座大城堡,里面有N个房间(N输入描述:输入包含多组数据,输入的第一行有两个数:N和M,接下来的M行每行有两个数a和b,表示了一条通道可以从A房间来到B房间。文件最后以两个0结束。 输出描述:对于输入的每组数据,如果任意两个房间都是相互连接的,输出"Yes",否则输出"No"。 示例原创 2017-12-23 16:32:40 · 12227 阅读 · 0 评论 -
Equations
题目描述Consider equations having the following form: a*x1^2+b*x2^2+c*x3^2+d*x4^2=0 a, b, c, d are integers from the interval [-50,50] and any of them cannot be 0. It is consider a solution原创 2017-11-30 09:15:08 · 16119 阅读 · 0 评论 -
Longest Common Substring
题目描述Given two strings, you have to tell the length of the Longest Common Substring of them. For example: str1 = banana str2 = cianaic So the Longest Common Substring is "ana", and the原创 2017-11-30 09:13:48 · 28619 阅读 · 0 评论 -
Period
题目描述For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is, for ea原创 2017-11-30 09:12:10 · 30613 阅读 · 0 评论 -
全文检索
题目描述我们大家经常用google检索信息,但是检索信息的程序是很困难编写的;现在请你编写一个简单的全文检索程序。 问题的描述是这样的:给定一个信息流文件,信息完全有数字组成,数字个数不超过60000个,但也不少于60个;再给定一个关键字集合,其中关键字个数不超过10000个,每个关键字的信息数字不超过60个,但也不少于5个;两个不同的关键字的前4个数字是不相同的;由于流文件太长,已经原创 2017-11-30 09:10:29 · 29137 阅读 · 0 评论 -
统计难题
题目描述Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀). 输入描述:输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统计的单词,一个空行代表单词表的结束.第二部分是一连串的提问,每行一个提问,每个提问都原创 2017-11-30 09:05:31 · 12290 阅读 · 0 评论 -
最大连续子序列
给定K个整数的序列{ N1, N2, ..., NK },其任意连续子序列可表示为{ Ni, Ni+1, ..., Nj },其中 1 例如给定序列{ -2, 11, -4, 13, -5, -2 },其最大连续子序列为{ 11, -4, 13 },最大和 为20。 在今年的数据结构考卷中,要求编写程序得到最大和,现在增加一个要求,即还需要输出该 子序列的第一个和最后一个元素。原创 2017-11-30 09:02:31 · 12057 阅读 · 0 评论 -
Common Sequence
A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence Z = is a subsequence of X if there exists a strictly incr原创 2017-11-30 08:59:51 · 12732 阅读 · 0 评论 -
数组中的逆序对
题目描述:在数组中的两个数字,如果前面一个数字大于后面的数字,则这两个数字组成一个逆序对。输入一个数组,求出这个数组中的逆序对的总数。输入:每个测试案例包括两行:第一行包含一个整数n,表示数组中的元素个数。其中1 第二行包含n个整数,每个数组均为int类型。输出:对应每个测试案例,输出一个整数,表示数组中的逆序对的总数。样例输入:47 5转载 2017-11-04 10:44:13 · 11075 阅读 · 2 评论 -
Nested Dolls
题目描述Dilworth is the world’s most prominent collector of Russian nested dolls: he literally has thousands of them! You know, the wooden hollow dolls of different sizes of which the smallest doll is原创 2017-11-30 09:16:43 · 24455 阅读 · 1 评论 -
Oulipo
题目描述The French author Georges Perec (1936�1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book: Tout avait Pair normal, m原创 2017-11-30 09:18:56 · 17180 阅读 · 0 评论 -
Max Num
Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14. The fi原创 2017-11-30 08:56:29 · 13723 阅读 · 0 评论 -
How Many Tables
题目描述Today is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each原创 2017-12-23 16:30:49 · 11438 阅读 · 0 评论 -
Air Raid
题目描述Consider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and walking through town's streets原创 2017-12-23 16:28:05 · 10975 阅读 · 0 评论 -
Machine Schedule
题目描述As we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Scheduling problems differ widely in the nature of the constrai原创 2017-12-23 16:26:30 · 11803 阅读 · 0 评论 -
Keywords Search
In the modern time, Search engine came into the life of everybody likeGoogle, Baidu, etc.Wiskey also wants to bring this feature to his image retrieval system. Every image have a long descriptio原创 2017-12-06 09:14:28 · 12921 阅读 · 0 评论 -
魔咒字典
哈利波特在魔法学校的必修课之一就是学习魔咒。据说魔法世界有100000种不同的魔咒,哈利很难全部记住,但是为了对抗强敌,他必须在危急时刻能够调用任何一个需要的魔咒,所以他需要你的帮助。 给你一部魔咒词典。当哈利听到一个魔咒时,你的程序必须告诉他那个魔咒的功能;当哈利需要某个功能但不知道该用什么魔咒时,你的程序要替他找到相应的魔咒。如果他要的魔咒不在词典中,就输出“what?” 输入原创 2017-12-06 09:08:56 · 12361 阅读 · 0 评论 -
Number Sequence
Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1],b[2], ...... , b[M] (1 Your task is to find a number K which make a[K] = b[1], a[K + 1] = b[2],...... , a[K + M - 1] = b[M]. If the原创 2017-12-06 08:49:11 · 11618 阅读 · 0 评论 -
Play on Words
题目描述Some of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no other way to open the doors, the puzzle is v原创 2017-12-20 20:15:10 · 10710 阅读 · 0 评论