Use FPC to program so that two positive integers are input and then output the least common multiple

<> method steps: 1. Open VC2010 (or other C language compilers), create a new project - select Win32 as the console application - name - OK.

2. Select Source File - Add - New Item.

3. Select C++ File - Naming. c- Add.

4. Enter the following procedures.

#include

int main()

int a,b,a,b;

int lol,lpl;

printf ("Enter two integers:");

scanf ("d%d",&a,&b);

a=a;b=b;

if(b)while((a %=b) &b %=a));

lol = a+b;

lpl = a*b/lol;

printf ("The least common multiple is: %d", lpl);

return 0;

5. Press the key Ctrl+F5 to start execution (without debugging), enter two integers separated by a space, and press Enter to get the least common multiple of the two integers.

#include

int main(void)

printf("%d", m * n / a);

return 0;

In the above **, a is the greatest common factor, and the multiplication of two numbers divided by a is the least common multiple.

*Tossing and dividing to find the greatest common divisor, the least common multiple * include

int main()

Run the results.

#include

#include

int zxgb(int a,int b)int main()

Prevent the input of 0printf("The least common multiple of %d and %d is: %d",a,b,zxgb(a,b));Upstairs here with a judgment statement is redundant.

return 0;}

There is a similar problem in the book, you follow the cat and the tiger.

#include

#include

int zxgb(int a,int b)int main()

Prevent the input of 0printf("The least common multiple of %d and %d is: %d",a,b,zxgb(a,b));Upstairs here with a judgment statement is redundant.

return 0;}

#include

#include

int function(int a,int b) *function to find the least common multiple*

return i;

int main()

while(m*n==0) to avoid entering 0 among the two numbers, and the least common multiple cannot be found.

printf("The least common multiple of %d and %d is: %d",m,n,function(m,n));

return 0;}

Hello, it's a little simpler, and I hope it can be adopted.

#include

int main()

m=i*j/n;

printf("%d",m);

return 0;}

The least common multiple is the product of two numbers divided by their greatest common divisor include

void main()

c=m*n/a;

printf("The least common multiple is: %d",c);}

with tossing and dividing;

int main()

printf("Maximum convention: %d",nn);

printf("Least common multiple: %d",m*n/nn);

elsereturn 0;}