## [ACM_ZJUT_1029]斐波那契数列

### Fibonacci数

Time Limit:1000MS Memory Limit:32768K

```5
6
7
8
9
40
```

```5
8
13
21
34
102334155
```

(阅读全文…)

## [ACM_HDU_1465]不容易系列之一（错排）

### 不容易系列之一

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8025 Accepted Submission(s): 3328

(阅读全文…)

## [ACM_HDU_2045]LELE的RPG难题

### 不容易系列之(3)—— LELE的RPG难题

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 15209 Accepted Submission(s): 6025

(阅读全文…)

## [ACM_HDU_1297]Children’s Queue

### Children’s Queue

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5660 Accepted Submission(s): 1755

#### Description

There are many students in PHT School. One day, the headmaster whose name is PigHeader wanted all students stand in a line. He prescribed that girl can not be in single. In other words, either no girl in the queue or more than one girl stands side by side. The case n=4 (n is the number of children) is like
FFFF, FFFM, MFFF, FFMM, MFFM, MMFF, MMMM
Here F stands for a girl and M stands for a boy. The total number of queue satisfied the headmaster’s needs is 7. Can you make a program to find the total number of queue with n children?

#### Input

There are multiple cases in this problem and ended by the EOF. In each case, there is only one integer n means the number of children (1<=n<=1000)

#### Output

For each test case, there is only one integer means the number of queue satisfied the headmaster’s needs.

(阅读全文…)

## [ACM_HDU_1005]Number Sequence

### Number Sequence

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 53991 Accepted Submission(s): 12146

#### Description

A number sequence is defined as follows:

f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.

Given A, B, and n, you are to calculate the value of f(n).

#### Input

The input consists of multiple test cases. Each test case contains 3 integers A, B and n on a single line (1 <= A, B <= 1000, 1 <= n <= 100,000,000). Three zeros signal the end of input and this test case is not to be processed.

#### Output

For each test case, print the value of f(n) on a single line.

(阅读全文…)