海岛Blog

FibonacciTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7554 Accepted Submission(s): 3572Problem Description2007年到来了。经过2006年一年的修炼，数学神童zouyu终于把0到100000000的Fibonacci数列(f[0]=0,f[1]=1;f[i] = f[i-

Your goal in this problem is to divide a certain integer n by another integer m until n = 1, obtaining a sequence of numbers. Lets call a[i] each number of this sequence, and let’s say it has k numbers (i.e. you must do k − 1 succesive divisions to reach n

Professors are very motivated when they have to travel abroad for a conference (of course, if fees are paid by the university), but they don’t have the same attitude when the moment to grade exams arrives.    Professor Lazy, Ph.D., has

World Cup NoiseTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 23379 Accepted: 10359DescriptionBackground“KO-RE-A, KO-RE-A” shout 54.000 happy football fans after their team has reach...

Let’s define another number sequence, given by the following function:f(0) = af(1) = bf(n) = f(n − 1) + f(n − 2), n > 1  When a = 0 and b = 1, this sequence gives the Fibonacci Sequence. Ch...

SumsetsTime Limit: 2000MS   Memory Limit: 200000K Total Submissions: 23695   Accepted: 9112 DescriptionFarmer John commanded his cows to search for different sets of numbers that s...

A look-and-say sequence is a sequence of integers, expressed in decimal notation, where each sucessive term is generated by describing the previous one.    For instance, if x 1 (t...

Every person has its own numbers that he considers lucky. Usually the numbers are fixed like 3 or 7 and do not depend on anything. This lucky number model seems to be very primitive for John, so he de...

Given n, there can be n! circular arrangement of the numbers 0 to n − 1.    Lets represent every permutation as P1 P2 P3 . . . Pn!    SOP(Pk) = sum of product...

Shri Dattathreya Ramachandra Kaprekar was an Indian mathematician, whose name is associated with a number of concepts in number theory. He was born in Dahanu, near Mumbai, in India. Even as a small ch...

The famous mathematician Hardy relates the following episode with the (now also famous) Indian mathematician Ramanujan:I remember once going to see him when he was ill at Putney. I had ridden in taxi...

Solomon Golomb’s self–describing sequence 〈f(1), f(2), f(3), . . .〉 is the only nondecreasing sequence of positive integers with the property that it contains exactly f(k) occurrences of k for each k....

A fraction h/k is called a proper fraction if it lies between 0 and 1 and if h and k have no common factors. For any natural number n ≥ 1, the Farey sequence of order n, Fn, is the sequence of all pro...

Suppose we put two panes of glass back-to-back. How many ways an are there for light rays to pass through or be reflected after changing direction n times? Following figure shows the situations when t...

The Fibonacci numbers (0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ...) are defined by the recurrence:    F0 = 0    F1 = 1    Fi = Fi−1 + Fi−2 for i > 1Write a program which calculates Mn = Fn mod 2^m for...

Given a range [a, b], you are to find the summation of all the odd integers in this range. For example, the summation of all the odd integers in the range [3, 9] is 3 + 5 + 7 + 9 = 24.InputThere can b...

 the Sum of Cube Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3394    Accepted Submission(s): 1424  Problem DescriptionA range...

Simple calculationsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6934 Accepted: 3442DescriptionThere is a sequence of n+2 elements a0, a1, ..., an+1 (n <= 3000, -1000 <= ai <=1000...

There is a sequence of n + 2 elements a0, a1, . . . , an+1 (n ≤ 3000; −1000 ≤ ai ≤ 1000). It is known thatfor each i = 1, 2, . . . , n. You are given a0, an+1, c1, . . . , cn. Write a program which ca...

斐波那契数列时间限制: 1000ms 内存限制: 65536KB问题描述“斐波那契数列”的发明者，是意大利数学家列昂纳多?斐波那契（生于公元1170年，籍贯大概是比萨，卒于1240年后）。他还被人称作“比萨的列昂纳多”。1202年，他撰写了《珠算原理》一书。斐波那契数列衍生于《珠算原理》中的一道题目：某人把一对兔子放入一个四面被高墙围住的地方。假设每对兔子每月能生下一对小兔，而每对新生小兔从第二个...

Heritage from fatherTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 6899    Accepted Submission(s): 2584Problem DescriptionFamous Harry Potter,...

Revenge of FibonacciTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1302    Accepted Submission(s): 617Problem DescriptionIn mathematical terms,...

The i'th Fibonacci number f(i) is recursively defined in the following way: • f(0) = 0 and f(1) = 1 • f(i + 2) = f(i + 1) + f(i) forevery i ≥ 0 Your task is to compute some values of this...

Fibonacci NumbersTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2897    Accepted Submission(s): 1215Problem DescriptionThe Fibonacci sequence i...

B. Jzzhu and Sequencestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputJzzhu has invented a kind of sequences, they meet the following property:You ...