1 solutions

  • 0
    @ 2025-11-5 19:44:03

    C++ :

    #include<iostream>
    using namespace std;
    
    
    int  gcd(int a,int b)
    {
        if(a==0) return b;
        if(b==0) return a;
        else return gcd(b%a,a);
    }
    
    int main()
    {
        int n,m;
    
        while(cin>>n>>m)
        {
            cout<<gcd(n,m)<<endl;
        }
        return 0;
    }
    
    

    Java :

    import java.io.*;
    import java.util.*;
    import java.math.BigInteger;
    public class Main{
    	static int gcd(int a,int b){
    		if(a%b==0)return b;
    		return gcd(b,a%b);
    	}
    	public static void main(String[] args){
    		Scanner cin=new Scanner(System.in);
    		while(cin.hasNext()){
    			int a=cin.nextInt();
    			int b=cin.nextInt();
    			if(a==0)
    				System.out.println(b);
    			else if(b==0)
    				System.out.println(a);
    			else
    				System.out.println(gcd(a,b));
    		}
    	}
    }
    
    • 1

    Information

    ID
    19606
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By