题目详情 - fibonacci数列(二)

ID: 245

远端评测题

1000ms

128MiB

尝试: 0

已通过: 0

难度: (无)

上传者:

Hydro

In the Fibonacci integer sequence, F₀ = 0, F₁ = 1, and F_n = F_n_{− 1} + F_n_{− 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, …

An alternative formula for the Fibonacci sequence is

Given an integer n, your goal is to compute the last 4 digits of F_n.

Hint

As a reminder, matrix multiplication is associative, and the product of two 2 × 2 matrices is given by

Also, note that raising any 2 × 2 matrix to the 0th power gives the identity matrix:

Input

The input test file will contain multiple test cases. Each test case consists of a single line containing n (where 0 ≤ n ≤ 1,000,000,000). The end-of-file is denoted by a single line containing the number −1.

Output

For each test case, print the last four digits of Fn. If the last four digits of Fn are all zeros, print ‘0’; otherwise, omit any leading zeros (i.e., print Fn mod 10000).

Sample Input

Sample Output

0
34
6875

HINT

Source

NYOJ

#P1244. fibonacci数列(二)

fibonacci数列(二)

Input

Output

Sample Input

Sample Output

HINT

Source

统计

状态

开发

支持

#P1244. fibonacci数列(二)

fibonacci数列(二)

Input

Output

Sample Input

Sample Output

HINT

Source

统计

状态

开发

支持

还没有账户？

登录