A. Subtractions

最新推荐文章于 2022-10-09 20:56:48 发布

AlberTeslaWizard

最新推荐文章于 2022-10-09 20:56:48 发布

阅读量208

点赞数 1

CC 4.0 BY-SA版权

本文链接：https://blog.csdn.net/AlberTesla/article/details/114702184

本文介绍了一种算法，用于计算给定数对经过特定运算达到特定条件所需的步骤数。输入包含多个正整数对，输出为每对数字完成运算所需的总操作次数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

You’ve got two numbers. As long as they are both larger than zero, they go through the same operation: subtract the lesser number from the larger one. If they equal substract one number from the another. For example, one operation transforms pair (4,17) to pair (4,13), it transforms (5,5) to (0,5).

You’ve got some number of pairs (ai, bi). How many operations will be performed for each of them?

Input
The first line contains the number of pairs n (1 ≤ n ≤ 1000). Then follow n lines, each line contains a pair of positive integers ai, bi (1 ≤ ai, bi ≤ 109).

Output
Print the sought number of operations for each pair on a single line.

Examples
input
2
4 17
7 987654321

output
8
141093479

My Answer Code:

/*
	Author:Albert Tesla Wizard
	Time:2021/3/12 18:00
*/
#include<bits/stdc++.h>
using namespace std;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin>>t;
    while(t--)
    {
        int a,b,ans=0;
        cin>>a>>b;
        int Min=min(a,b);
        int Max=max(a,b);
        while(Max%Min!=0)
        {
            ans+=Max/Min;
            int temp=Min;
            Min=Max%Min;
            Max=temp;
        }
        ans+=Max/Min;
        cout<<ans<<'\n';
    }
    return 0;
}