Scribd Logo
Upload

Welcome to Scribd!

  • Usind Tran Condition

    Uploaded by

    Aashu Singh
    15 views1 page
    This C++ program asks the user to input two numbers, stores them as n1 and n2. It then finds the lowest common multiple (LCM) of n1 and n2 by initializing l as the larger of n1 and n2. The program uses a while loop to increment l until it is divisible by both n1 and n2, at which point it prints the LCM and breaks from the loop.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C++ program asks the user to input two numbers, stores them as n1 and n2. It then finds the lowest common multiple (LCM) of n1 and n2 by initializing l as the larger of n1 and n2. The program uses a while loop to increment l until it is divisible by both n1 and n2, at which point it prints the LCM and breaks from the loop.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    15 views1 page

    Usind Tran Condition

    Uploaded by

    Aashu Singh
    This C++ program asks the user to input two numbers, stores them as n1 and n2. It then finds the lowest common multiple (LCM) of n1 and n2 by initializing l as the larger of n1 and n2. The program uses a while loop to increment l until it is divisible by both n1 and n2, at which point it prints the LCM and breaks from the loop.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    of 1

    #include <iostream>

    using namespace std;

    int main()
    {
    int n1,n2,l;
    cout<<"Enter the value of n1 and n2 :"<<endl;
    cin>>n1>>n2;

    l=(n1>n2)?n1:n2;

    while(true)
    {
    if(l%n1==0&&l%n2==0)
    {
    cout<<"LCM of "<<n1<<" and "<<n2<<" is = "<<l<<endl;
    break;
    }
    ++l;
    }
    }

    You might also like