Sicily
文章平均质量分 71
夕阳-晨曦
这个作者很懒,什么都没留下…
展开
-
<Sicily>Fibonacci
一、题目描述In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn-1 + Fn-2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are:0, 1, 1, 2, 3, 5, 8, 13, 21, 34, …Given an intege原创 2016-06-07 23:12:04 · 798 阅读 · 1 评论 -
<Sicily>Catch the thief
一、题目描述A thief has robbed a bank in city 1 and he wants to go to city N. The police know that the thief will choose the shortest path to get to his destination. As there may be multiple shortest paths,原创 2016-06-16 13:23:17 · 975 阅读 · 0 评论 -
<Sicily>Brackets Matching
一、题目描述Let us define a regular brackets sequence in the following way:Empty sequence is a regular sequence.If S is a regular sequence, then (S) , [S] and {S} are both regular sequences.If A and B are原创 2016-06-16 10:02:18 · 851 阅读 · 0 评论 -
<Sicily>Polynomial
一、题目描述Given a polynomial and the value of the variable x, you task is to calculate the value of the polynomial.二、输入The first line of the input is a positive integer T. T is the number of test cases fol原创 2016-06-16 00:10:35 · 766 阅读 · 0 评论 -
<Sicily>Pythagorean Proposition
一、题目描述One day, WXYZ got a wooden stick, he wanted to split it into three sticks and make a right-angled triangle. You will be given the length of the stick, and your task is to help WXYZ to find all di原创 2016-06-15 23:42:36 · 626 阅读 · 0 评论 -
<Sicily> 生成字符串
一、题目描述假设一个字符串只由字符‘0’,‘1’,‘?’组成,其中字符‘?’表示该字符可由字符‘0’或‘1’替代。现有一些字符串,根据这些字符串生成所有可生成的字符串。如:{10,?1,0? }可生成{10,01,11,00}{101,001,?01}可生成{101,001}注意后一个例子中‘?01’并没有生成新的字符串。二、输入输入包含多组测试数据。每组数据的第一行是两个整数M,N(1≤M≤15,原创 2016-06-15 23:21:15 · 1654 阅读 · 0 评论 -
<Sicily>Threecolor problem
一、题目描述有红黄蓝3种颜色的n个珠子,师傅希望悟空把它们排成红色珠子在左,黄色珠子居中,蓝色珠子在右的一行,然后告诉师傅,从左数起,第m个珠子是什么颜色。众所周知,悟空是只猴子,他没有这个耐心,你帮帮他吧。二、输入输入第一行为一个整数t(0三、输出为每个测试用例单独一行输出指定的珠子颜色。 例如: 输入: 2 3 1 bry 4 3 rbyb 输出: r b四、解题思路这道原创 2016-06-13 23:21:35 · 820 阅读 · 0 评论 -
<Sicily>Prime Palindromes
一、题目描述The number 151 is a prime palindrome because it is both a prime number and a palindrome (it is the same number when read forward as backward). Write a program that finds all prime palindromes in原创 2016-06-13 22:52:08 · 854 阅读 · 0 评论 -
<Sicily>Greatest Common Divisors
一、题目描述A common divisor for two positive numbers is a number which both numbers are divisible by. It’s easy to calculate the greatest common divisor between tow numbers. But your teacher wants to give y原创 2016-06-13 23:13:00 · 799 阅读 · 0 评论 -
<Sicily> Longest Common Subsequence
一、题目描述Given a sequence A = < a1, a2, …, am >, let sequence B = < b1, b2, …, bk > be a subsequence of A if there exists a strictly increasing sequence ( i1 < i2 < i3 …, ik ) of indices of A such that fo原创 2016-06-16 09:51:03 · 502 阅读 · 0 评论 -
<Sicily>Funny Game
一、题目描述Two players, Singa and Suny, play, starting with two natural numbers. Singa, the first player, subtracts any positive multiple of the lesser of the two numbers from the greater of the two numbers原创 2016-06-10 10:50:20 · 990 阅读 · 2 评论 -
<Sicily>Pair
一、题目描述The N cities of Estiah are connected by N-1 roads. The roads are built in a way that it’s always possible to travel between any two cities.Now the king of Estiah wants to pair adjacent cities int原创 2016-06-09 23:03:19 · 1198 阅读 · 0 评论 -
<Sicily>Tiling a Grid With Dominoes
一、题目描述We wish to tile a grid 4 units high and N units long with rectangles (dominoes) 2 units by one unit (in either orientation). For example, the figure shows the five different ways that a grid 4 un原创 2016-06-09 16:53:20 · 1059 阅读 · 2 评论 -
<Sicily>Rails
一、题目描述There is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds were extremely limited that time. It was possible原创 2016-06-09 14:50:39 · 988 阅读 · 0 评论 -
<Sicily>数字反转
一、题目描述给定一个整数,请将该数各个位上数字反转得到一个新数。新数也应满足整数的常见形式,即除非给定的原数为零,否则反转后得到的新数的最高位数字不应为零(参见样例2)。二、输入输入共 1 行,一个整数N。-1,000,000,000 ≤ N≤ 1,000,000,000。三、输出输出共 1 行,一个整数,表示反转后的新数。例如: 输入:123 输出:321 输入:-380 输出:-83四、原创 2016-06-08 00:49:16 · 622 阅读 · 0 评论 -
<Sicily>Huffman coding
一、题目描述In computer science and information theory, a Huffman code is an optimal prefix code algorithm.In this exercise, please use Huffman coding to encode a given data.You should output the number of b原创 2016-06-08 00:33:37 · 1288 阅读 · 0 评论 -
<Sicily>Fibonacci 2
一、题目描述In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn-1 + Fn-2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are:0, 1, 1, 2, 3, 5, 8, 13, 21, 34, …Given an intege原创 2016-06-08 00:14:06 · 924 阅读 · 0 评论 -
<Sicily>Inversion Number(线段树求逆序数)
一、题目描述There is a permutation P with n integers from 1 to n. You have to calculate its inversion number, which is the number of pairs of Pi and Pj satisfying the following conditions: iPj. 二、输入The input原创 2016-06-16 17:03:10 · 721 阅读 · 0 评论