vocaloid01的博客

Time limit 10000 msMemory limit 262144 kB小Ho根据最近在密码学课上学习到的知识，开发出了一款hiho密码，这款密码的秘钥是这样生成的：对于一种有N个字母的语言，选择一个长度为M的单词；将组成这个单词的所有字母按照顺序不重复的写出（即遇到相同字母时跳过）；然后将字母表剩下的没有使用过的字母按照顺序在其后进行排列。如对于有5个字母的hiho语

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 each i (2 <

给出一个只由小写英文字符a,b,c...y,z组成的字符串S,求S中最长回文串的长度.回文就是正反读都是一样的字符串,如aba, abba等 Input 输入有多组case,不超过120组,每组输入为一行小写英文字符a,b,c…y,z组成的字符串S 两组case之间由空行隔开(该空行不用处理) 字符串长度len <= 110000 Output 每一行一

吉哥又想出了一个新的完美队形游戏！　　假设有n个人按顺序站在他的面前，他们的身高分别是h[1], h[2] ... h[n]，吉哥希望从中挑出一些人，让这些人形成一个新的队形，新的队形若满足以下三点要求，则就是新的完美队形：　　1、挑出的人保持原队形的相对顺序不变，且必须都是在原队形中连续的；　　2、左右对称，假设有m个人形成新的队形，则第1个人和第m个人身高相同，第2个人和第m-1个人身高相同

 题目描述    Apojacsleam喜欢数组。    他现在有一个n个元素的数组a，而他要对a[L]-a[R]进行M次操作：        操作一：将a[L]-a[R]内的元素都加上P        操作二：将a[L]-a[R]内的元素都减去P    最后询问a[l]-a[r]内的元素之和？    请认真看题干及输入描述。输入描述:输入共M+3行：第一...

Problem DescriptionLittle Q likes solving math problems very much. Unluckily, however, he does not have good spatial ability. Everytime he meets a 3D geometry problem, he will struggle to draw a pic...

基准时间限制：1 秒 空间限制：131072 KB 给出一个整数K和一个无序数组A，A的元素为N个互不相同的整数，找出数组A中所有和等于K的数对。例如K = 8，数组A：{-1,6,5,3,4,2,9,0,8}，所有和等于8的数对包括(-1,9)，(0,8)，(2,6)，(3,5)。 Input第1行：用空格隔开的2个数，K N，N为A数组的长度。(2 <= N <= 50000，-10^9 <=

Morgana is learning computer vision, and he likes cats, too. One day he wants to find the cat movement from a cat video. To do this, he extracts cat features in each frame. A cat feature is a two-dime...

Areversible primein any number system is a prime whose "reverse" in that number system is also a prime. For example in the decimal system 73 is a reversible prime because its reverse 37 is also a pr...

Given a tree, you are supposed to list all the leaves in the order of top down, and left to right.Input Specification:Each input file contains one test case. For each case, the first line gives a posit

KazaQ wears socks everyday.At the beginning, he has n pairs of socks numbered from 1 to n in his closets.Every morning, he puts on a pair of socks which has the smallest number in the closets.Every eve

Time limit 1000 ms Memory limit 32768 kB 今天的上机考试虽然有实时的Ranklist，但上面的排名只是根据完成的题数排序，没有考虑每题的分值，所以并不是最后的排名。给定录取分数线，请你写程序找出最后通过分数线的考生，并将他们的成绩按降序打印。Input 测试输入包含若干场考试的信息。每场考试信息的第1行给出考生人数N (

Time limit 1000 ms Memory limit 32768 kB统计给定文本文件中汉字的个数。Input 输入文件首先包含一个整数n，表示测试实例的个数，然后是n段文本。 Output 对于每一段文本，输出其中的汉字的个数，每个测试实例的输出占一行。Sample Input2WaHaHa! WaHaHa! 今年过节不说话要说只说普通话Wa

Time limit 1000 ms Memory limit 32768 kBRock-paper-scissors is a zero-sum hand game usually played between two people, in which each player simultaneously forms one of three shapes with an o

Time limit 1000 ms Memory limit 512000 kB 《Shui Hu Zhuan》，also 《Water Margin》was written by Shi Nai'an -- an writer of Yuan and Ming dynasty. 《Shui Hu Zhuan》is one of the Four Great Classic

Time limit 2000 ms Memory limit 262144 kBKefa decided to make some money doing business on the Internet for exactly n days. He knows that on the i-th day (1 ≤ i ≤ n) he makes ai money. Kefa

Time limit 1000 ms Memory limit 32768 kB The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the

ztr loves lucky numbers. Everybody knows that positive integers are lucky if their decimal representation doesn’t contain digits other than 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17,

体育老师小明要将自己班上的学生按顺序排队。他首先让学生按学号从小到大的顺序排成一排，学号小的排在前面，然后进行多次调整。一次调整小明可能让一位同学出队，向前或者向后移动一段距离后再插入队列。 　　例如，下面给出了一组移动的例子，例子中学生的人数为8人。 　　0）初始队列中学生的学号依次为1, 2, 3, 4, 5, 6, 7, 8； 　　1）第一次调整，命令为“3号同学向后移动2”，表示3号同