QOJ.ac

QOJ

Límite de tiempo: 1 s Límite de memoria: 256 MB Puntuación total: 100

#2062. 斐波那契方程

Estadísticas

Bison Mike 选择了三个连续的斐波那契数:$F_n, F_{n+1}$ 和 $F_{n+2}$,将它们打乱顺序后分别作为二次方程 $Ax^2 + Bx + C = 0$ 中的系数 $A, B$ 和 $C$。

现在 Mike 想知道该方程不同实根的个数。请帮他找出答案。

输入格式

输入的第一行包含三个整数 $i, j$ 和 $k$ ($0 \le i, j, k \le 10^9$),它们是斐波那契数列的下标,其中 $A = F_i, B = F_j, C = F_k$。保证 $i, j, k$ 两两不同,且这三个整数中最大值与最小值的差为 $2$。

输出格式

输出一个整数,表示方程不同实根的个数。

样例

样例输入 1

1 2 0

样例输出 1

2

样例输入 2

1 0 2

样例输出 2

0

说明

斐波那契数列的生成规则:

$$F_0 = 0$$ $$F_1 = 1$$ $$F_i = F_{i-1} + F_{i-2}, \text{其中 } i > 1$$

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.