1062. 最简分数(20)

通过逐个判断，满足公约数等于1就行

#include<cstdio>
#include<iostream>
using namespace std;
int gcd(int a,int b){
	return b==0?a:gcd(b,a%b);
}
int main()
{
	int n1,m1,n2,m2,k;
	//freopen("1062.txt","r",stdin);
	scanf("%d/%d %d/%d %d",&n1,&m1,&n2,&m2,&k);
	if(n1*m2>n2*m1)
	{
		swap(n1,n2);swap(m1,m2);
	}
	int num=1;
	bool flag=false;
	while(n1*k>=m1*num)	num++;
	while(n1*k<m1*num&&m2*num<n2*k){
		if(gcd(num,k)==1){
			printf("%s%d/%d",flag==true?" ":"",num,k);
			flag=true;
		}
		num++;
	}
	return 0;
}