مضرب مشترک

Question

مضرب مشترک

سوال

الگوریتمی بنویسید که دو عدد صحیح و مثبت n و m دریافت و بزرگترین مقسوم و علیه مشترک و کوچکترین مضرب آن ها را چاپ کند.

در حال بررسی 0

انجمن ACM و الگوریتم Ali 5 سال 3 پاسخ ها 751 دیده شده 1

درباره Ali

پاسخ ها ( ۳ )

ارسال یک پاسخ

سوال قبلی

سوال بعدی

behinazare · Answer 1 · ۱۳۹۹-۰۸-۱۰

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ConsoleApplication1
{
    class Program
    {
        static void Main(string[] args)
        {
            Console.Write("Please enter number1:");
            int num1 = Convert.ToInt32(Console.ReadLine());
            Console.Write("Please enter number2:");
            int num2 = Convert.ToInt32(Console.ReadLine());
            bmm(num1, num2);
            kmm(num1, num2);
        }
        static void bmm(int a, int b)
        {
            while (true)
            {
                int temp = 0;
                if (b == 0) break;

                temp = a % b;
                a = b;
                b = temp;
            }
            Console.WriteLine("B.M.M do adad vared shode barabar ast ba :{0}", a);
        }
        static void kmm(int a, int b)
        {

            int max;
            if (a > b) max = a;
            else max = b;
            while (true)
            {

                if (max % a == 0 && max % b == 0) break;
                else ++max;
            }
            Console.WriteLine("K.M.M do adad vared shode barabar ast ba:{0}", max);
        }
    }
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

namespace ConsoleApplication1

{

class Program

{

static void Main(string[] args)

{

Console.Write("Please enter number1:");

int num1 = Convert.ToInt32(Console.ReadLine());

Console.Write("Please enter number2:");

int num2 = Convert.ToInt32(Console.ReadLine());

bmm(num1, num2);

kmm(num1, num2);

}

static void bmm(int a, int b)

{

while (true)

{

int temp = 0;

if (b == 0) break;

temp = a % b;

a = b;

b = temp;

}

Console.WriteLine("B.M.M do adad vared shode barabar ast ba :{0}", a);

}

static void kmm(int a, int b)

{

int max;

if (a > b) max = a;

else max = b;

while (true)

{

if (max % a == 0 && max % b == 0) break;

else ++max;

}

Console.WriteLine("K.M.M do adad vared shode barabar ast ba:{0}", max);

}

behinazare · Answer 2 · ۱۳۹۹-۰۸-۱۰

#include <iostream>
#include <conio.h>
using namespace std;
void bmm(int num1,int num2);
void kmm(int a,int b);
int main(int argc, char** argv) {
	cout<<"Please Enter num1:";
	int num1,num2;
	cin>>num1;
	cout<<"Please Enter num2:";
	cin>>num2;
	bmm(num1,num2);
	cout<<endl;
	kmm(num1,num2);
	return 0;
}
void bmm(int a,int b){
	while(true){
		int temp=0;
		if(b == 0) break;
		
		temp = a%b;
		a = b;
		b = temp;
	}
	cout<<"B.M.M do adad vared shode barabar ast ba :"<<a;
}
void kmm(int a,int b) {
	
	int max;	
	if(a > b) max = a;
	else max = b;
	while(true){
		
		if(max % a == 0 && max % b == 0) break;
		else ++max;
	}
	cout<<"K.M.M do adad vared shode barabar ast ba :"<<max;
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

#include <iostream>

#include <conio.h>

using namespace std;

void bmm(int num1,int num2);

void kmm(int a,int b);

int main(int argc, char** argv) {

cout<<"Please Enter num1:";

int num1,num2;

cin>>num1;

cout<<"Please Enter num2:";

cin>>num2;

bmm(num1,num2);

cout<<endl;

kmm(num1,num2);

return 0;

}

void bmm(int a,int b){

while(true){

int temp=0;

if(b == 0) break;

temp = a%b;

a = b;

b = temp;

}

cout<<"B.M.M do adad vared shode barabar ast ba :"<<a;

}

void kmm(int a,int b) {

int max;

if(a > b) max = a;

else max = b;

while(true){

if(max % a == 0 && max % b == 0) break;

else ++max;

}

cout<<"K.M.M do adad vared shode barabar ast ba :"<<max;

}

فاطمه گلشنی پایدار · Answer 3 · ۱۳۹۸-۱۰-۲۹

using System;
using System.Collections;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace BeMimMimKeMimMim
{
    class Program
    {
        static void Main(string[] args)
        {
            bool flag = false;
            Console.Write("1_ adad vared konid: ");
            int num1 = int.Parse(Console.ReadLine());
            Console.Write("2_ adad vared konid: ");
            int num2 = int.Parse(Console.ReadLine());
            ArrayList b1 = new ArrayList();
            ArrayList b2 = new ArrayList();
            ArrayList k1 = new ArrayList();
            ArrayList k2 = new ArrayList();
            int bmm = 0, kmm = 0;
            for (int i = 1; i <= num1; i++)
            {
                if (num1 % i == 0)
                {
                    b1.Add(i);
                }
            }
            for (int i = 1; i <= num2; i++)
            {
                if (num2 % i == 0)
                {
                    b2.Add(i);
                }
            }
            foreach (var item1 in b1)
            {
                foreach (var item2 in b2)
                {
                    if ((int)item1 == (int)item2)
                    {
                        if ((int)item1 > bmm) bmm = (int)item1;
                    }
                }
            }
            Console.WriteLine("beMimMim = {0}", bmm);
            for (int i = 1; i < num1 * num2; i++)
            {
                k1.Add(num1 * i);
                k2.Add(num2 * i);
            }
            foreach (var item1 in k1)
            {
                foreach (var item2 in k2)
                {
                    if (((int)item1 == (int)item2) && flag == false)
                    {
                        kmm = (int)item1;
                        flag = true;
                    }
                }
            }
            Console.WriteLine("keMimMim = {0}", kmm);
        }
    }
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

using System;

using System.Collections;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

namespace BeMimMimKeMimMim

{

class Program

{

static void Main(string[] args)

{

bool flag = false;

Console.Write("1_ adad vared konid: ");

int num1 = int.Parse(Console.ReadLine());

Console.Write("2_ adad vared konid: ");

int num2 = int.Parse(Console.ReadLine());

ArrayList b1 = new ArrayList();

ArrayList b2 = new ArrayList();

ArrayList k1 = new ArrayList();

ArrayList k2 = new ArrayList();

int bmm = 0, kmm = 0;

for (int i = 1; i <= num1; i++)

{

if (num1 % i == 0)

{

b1.Add(i);

}

for (int i = 1; i <= num2; i++)

{

if (num2 % i == 0)

{

b2.Add(i);

}

foreach (var item1 in b1)

{

foreach (var item2 in b2)

{

if ((int)item1 == (int)item2)

{

if ((int)item1 > bmm) bmm = (int)item1;

}

Console.WriteLine("beMimMim = {0}", bmm);

for (int i = 1; i < num1 * num2; i++)

{

k1.Add(num1 * i);

k2.Add(num2 * i);

}

foreach (var item1 in k1)

{

foreach (var item2 in k2)

{

if (((int)item1 == (int)item2) && flag == false)

{

kmm = (int)item1;

flag = true;

}

Console.WriteLine("keMimMim = {0}", kmm);

}