【打CF，学算法——三星级】CF Gym 100548K Last Denfence

最新推荐文章于 2018-08-15 13:35:16 发布

David_Jett

最新推荐文章于 2018-08-15 13:35:16 发布

阅读量1.2k

点赞数

分类专栏： CodeForces 编程题——数论/数学数学【打CF，学算法】文章标签：辗转相除法区域赛思维

本文链接：https://blog.csdn.net/David_Jett/article/details/46796489

版权

该博客介绍了如何利用辗转相除法来解决Codeforces（CF）比赛题目Last Defence。题目要求计算序列S中不同数值的数量，S由A和B定义，通过连续取绝对差值生成。博客提供了样例输入和输出，并解释了通过辗转相除法优化计算的方法，避免了模拟过程导致的超时问题。

摘要由CSDN通过智能技术生成

【CF简介】

提交链接：Last Denfence

题面：

Last Defence
Description
Given two integers A and B. Sequence S is defined as follow:
• S0 = A
• S1 = B
• Si = |Si−1 − Si−2| for i ≥ 2
Count the number of distinct numbers in S.
Input
The first line of the input gives the number of test cases, T. T test cases follow. T is about
100000.
Each test case consists of one line - two space-separated integers A, B. (0 ≤ A, B ≤ 1018).
Output
For each test case, output one line containing “Case #x: y”, where x is the test case
number (starting from 1) and y is the number of distinct number

最低0.47元/天解锁文章

David_Jett

关注

0
点赞
踩
1

收藏

觉得还不错? 一键收藏
0
评论
【打CF，学算法——三星级】CF Gym 100548K Last Denfence

题目链接：Last Denfence题面： Last DefenceDescription Given two integers A and B. Sequence S is defined as follow: • S0 = A • S1 = B • Si = |Si−1 − Si−2| for i ≥ 2 Count the
复制链接

扫一扫