-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathA.cpp
110 lines (64 loc) · 2.48 KB
/
A.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
/**********************************************************************************************************************************************************************
__Bismillahir Rahmanir Rahim__
American International University Bangladesh (AIUB)
Hadiur Rahman Nabil
***********************************************************************************************************************************************************************/
#include <bits/stdc++.h>
using namespace std;
typedef long int li;
typedef long long ll;
typedef long double ld;
typedef vector <int> vi;
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mp make_pair
#define gcd(a,b) __gcd(a,b)
#define endl "\n"
const int mod = 1e5 + 10;
const double PI = 3.1415926535897932384626;
const int mod_2 = 998244353;
const int MAX=100005;
/**********************************************************************************************************************************************************************/
//Palindrome--
// for(int i=s.size()-1;i>=0;--i){s_rev.push_back(s[i]);} if(s==s_rev)
//sort
//(a.begin(), a.end());sort(b.begin(), b.end());if(a==b)
//Find_Last + Delete_Last--
//num%10 + num/10
//Fibonacci--
//for(int i=1;i<=N-2;i++){ num3=num1(1)+num2(2);num1=num2;num2=num3(Fibonacci);
void solve()
{
ll a,b;
cin>>a>>b;
ll count=0;
while(a>0 && b>0)
if(a>=b && a>0 && b>0)
{
count =count +(a/b);
a=a%b;
}
else if(a<b && a>0 &&b>0)
{
count=count+(b/a);
b=b%a;
}
cout<<count<<"\n";
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif
ll t;
cin>>t;
while(t--)
{
solve();
}
return 0;
}