约分最简分式

六颗牙.

已于 2023-09-24 16:37:26 修改

阅读量66

点赞数

分类专栏：循环文章标签： java 算法开发语言

于 2023-09-24 16:35:26 首次发布

本文链接：https://blog.csdn.net/qq_52809382/article/details/133243386

版权

循环专栏收录该内容

4 篇文章

订阅专栏

#include<stdio.h>
int main()
{
	int dividend, divisor;
	scanf_s("%d/%d", &dividend,&divisor);
	int a = dividend,b=divisor;
	while (b != 0) {
		int t;
		t = a % b;
		a = b;
		b = t;
	}
	printf("%d/%d\n", dividend/a,divisor/a);
	return 0;
}

//先利用了辗转相除法先求最大公约数再约分
#include<stdio.h>
int main()
{
   int dividend, divisor;
   scanf_s("%d/%d", &dividend,&divisor);
   int a = dividend,b=divisor;
   while (b != 0) {
       int t;
       t = a % b;
       a = b;
       b = t;
   }
   printf("%d/%d\n", dividend/a,divisor/a);
   return 0;
}