1062. 最简分数(20)

#include<stdio.h>int find_min(int i, int k){  int c;  while(k!=0)  {    c = i%k;    i = k;    k = c;  }  return i;}int main(){  int N1,M1,N2,M2,K,flag=0;  double x,y,z,temp;  scanf("%d/%d %d/%d %d",&N1,&M1,&N2,&M2,&K);  x = (double)N1/M1;  y = (double)N2/M2;  if(x>y)  {    temp = x;    x = y;    y = temp;  }  for(int i=1; i<K; i++)  {    z = (double)i/K;    if(z>x && z<y)    {      if(find_min(i,K)==1)      {        if(flag==1)          printf(" %d/%d",i,K);        else        {          flag = 1;          printf("%d/%d",i,K);        }      }    }  }  return 0;}