1 solutions

  • 0
    @ 2025-11-5 16:31:27

    C++ :

    #include<bits/stdc++.h>
    using namespace std;
    int n,m;
    int main()
    {
    	cin>>n>>m;
    	cout<<n/__gcd(n,m)*__gcd(n,m)*m/__gcd(n,m);
       return 0;
    }
    
    

    Pascal :

    var m,n,a,b,r:integer;
    begin  
      readln(a,b);  
      m:=a;  
      n:=b;  
      r:=m mod n; 
      while r<>0 do 
      begin  
        m:=n;    
        n:=r;   
        r:=m mod n; 
      end; 
    writeln(a * b div n);
    end.
    
    • 1

    Information

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