QOJ.ac

QOJ

时间限制: 1 s 内存限制: 256 MB 总分: 100

#10557. 最后防线

统计

给定两个整数 $A$ 和 $B$。序列 $S$ 定义如下:

  • $S_0 = A$
  • $S_1 = B$
  • $S_i = |S_{i-1} - S_{i-2}|$,其中 $i \geq 2$

计算序列 $S$ 中不同数字的个数。

输入格式

输入的第一行包含测试用例的数量 $T$。接下来有 $T$ 组测试用例。$T$ 大约为 $100000$。

每个测试用例包含一行,即两个用空格分隔的整数 $A$ 和 $B$ ($0 \leq A, B \leq 10^{18}$)。

输出格式

对于每个测试用例,输出一行 “Case #x: y”,其中 $x$ 是测试用例编号(从 1 开始),$y$ 是序列 $S$ 中不同数字的个数。

样例

样例输入 1

2
7 4
3 5

样例输出 1

Case #1: 6
Case #2: 5

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.