求两个正整数之间的最大公约数

最新推荐文章于 2020-12-13 17:38:04 发布

自知_冷暖

最新推荐文章于 2020-12-13 17:38:04 发布

阅读量396

点赞数

分类专栏： C

本文链接：https://blog.csdn.net/waynehustguan/article/details/37918593

版权

C 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

#include<stdio.h>
#include<stdlib.h>
void Compare(unsigned int *num_a, unsigned int *num_b);
unsigned int GetGCD(unsigned int num_a, unsigned int num_b);
int main()
{
	unsigned int num_a, num_b;//input integer a,b
	unsigned int num_gcd;//the remainder of each division
	printf("*******Get Greatest Common Divisor*******\n");
	printf("Please input positive integer:\na=");
	scanf("%d", &num_a);//input num_a firstly
	printf("b=");
	scanf("%d", &num_b);//input num_b secondly
	Compare(&num_a, &num_b);//compare num_a and num_b to ensure num_a is the large number
	num_gcd=GetGCD(num_a, num_b);
	printf("Greatest Common Divisor Between %d and %d is %d\n", num_a, num_b, num_gcd);
	return EXIT_SUCCESS;
}
void Compare(unsigned int *num_a, unsigned int *num_b)
{
	unsigned int temp;
	if (*num_a < *num_b)//if num_a is smaller than num_b, then change them
	{
		temp = *num_a;
		*num_a = *num_b;
		*num_b = temp;
	}
}
unsigned int GetGCD(unsigned int num_a, unsigned int num_b)
{
	unsigned int num_mod=1;
	num_mod = num_a %num_b;
	while (0 != num_mod)//judge whether the number is the GCD
	{
		num_a = num_b;
		num_b = num_mod;
		num_mod = num_a %num_b;
	}
	return num_b;
}