gcd function c 2b 2b

1ll gcd(ll a, ll b)
2{
3    if (b==0)return a;
4    return gcd(b, a % b);   
5}
6

1#include<iostream>
2using namespace std;
3long long gcd(long long a, long long b) 
4{ 
5    if (b == 0) 
6        return a; 
7    return gcd(b, a % b);  
8      
9} 
10int main()
11{
12	long long a,b;
13	cin>>a>>b;
14	cout<<gcd(a,b);
15}

1int gcd(int a, int b) 
2{ 
3    // Everything divides 0  
4    if (a == 0) 
5       return b; 
6    if (b == 0) 
7       return a; 
8    // base case 
9    if (a == b) 
10        return a; 
11    // a is greater 
12    if (a > b) 
13        return gcd(a-b, b); 
14    return gcd(a, b-a); 
15}

1#include<iostream>
2using namespace std;
3
4int euclid_gcd(int a, int b) {
5	if(a==0 || b==0) return 0;
6	int dividend = a;
7	int divisor = b;
8	while(divisor != 0){
9		int remainder = dividend%divisor;
10		dividend = divisor;
11		divisor = remainder;
12	}
13	return dividend;
14}
15
16int main()
17{
18	cout<<euclid_gcd(0,7)<<endl;
19	cout<<euclid_gcd(55,78)<<endl;
20	cout<<euclid_gcd(105,350)<<endl;
21	cout<<euclid_gcd(350,105)<<endl;
22	return 0;
23}

1#include <bits/stdc++.h>
2using namespace std;
3
4int gcd(int a,int b){
5    if(a==0){
6        return b;
7    }
8    if(b==0){
9        return a;
10    }
11
12    if(a==b){
13        return a;
14    }
15
16    int x=0;
17    int mx = INT_MIN;
18    int mi = min(a,b);
19    for(int i=2;i<=mi;i++){
20        if(a%i==0 and b%i==0){
21            mx = max(mx,i);
22        }
23    }
24
25    return mx;
26
27}
28
29int main() {
30    int a = 36;
31    int b = 60;
32    cout<<gcd(a,b);
33
34}
35