小数化成最简式分数

最新推荐文章于 2022-11-21 19:57:42 发布

yurio7r

最新推荐文章于 2022-11-21 19:57:42 发布

阅读量1.3k

点赞数 1

文章标签：算法 acm

本文链接：https://blog.csdn.net/MrSiz/article/details/46417165

版权

Algorithm 专栏收录该内容

22 篇文章

订阅专栏

这道题是好久以前写的了。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<iomanip>
#include<algorithm>
#include<cctype>
#include<stack>
#include<queue>
#include<string>
#include<cstring>
#include<iomanip>
#include<set>
#include<vector>
using namespace std;
const int MAX = 20;
int gcd(int x, int y)
{
	return y == 0 ? x : gcd(y, x%y);
}
int main()
{
	char str1[MAX];
	int T;
	cin >> T;
	while (T--)
	{
		scanf("%s", &str1);
		int a = 0, b = 1;
		int length = strlen(str1) - 1;
		//cout << length << endl;
		for (int i =length; str1[i]!='.'; i--)
		{
			a += (str1[i] - '0')*b;
			//cout << a << endl;
			b *= 10;
		}
		int x = 0, y = 1, count = 0;
		for (int i = 0; str1[i] != '.'; i++)
		{
			count++;
		}
		for (int i = count-1; i >= 0; i--)
		{
			x += (str1[i] - '0')*y;
			y *= 10;
		}
		//cout << x << " " << y;
		// cout<<a<<" "<<b<<endl;
		int k = gcd(a, b);
		a /= k;
		b /= k;
		int c;
		if (x!=0)
		{
			c = b*x+ a;
			printf("%d/%d\n", c, b);
		}
		else
			printf("%d/%d\n", a, b);
	}
	return 0;
}