#include<stdio.h>
int Judge(int n, int m)
{
for (int i = 2; i <= (n > m ? m : n); i++)
if (n%i == 0 && m%i == 0)return 0;
return 1;
}
int main()
{
double n1, m1, n2, m2, K;
int n, m, cnt = 0;
scanf("%lf/%lf %lf/%lf %lf", &n1, &m1, &n2, &m2, &K);
n1 *= K / m1; n2 *= K / m2;
m = K;
if (n1 > n2)
{
double temp = n1;n1 = n2; n2 = temp;
}
for (n = (int)n1 + 1; n < n2; n++)
if (Judge(n, m) == 1)
cnt++;
for (n = (int)n1 + 1; n < n2; n++)
if (Judge(n, m) == 1)
{
printf("%d/%d", n, m), cnt--;
if (cnt != 0)printf(" ");
}
return 0;
}
代码实现:#include&lt;stdio.h&gt;int Judge(int n, int m){ for (int i = 2; i &lt;= (n &gt; m ? m : n); i++) if (n%i == 0 &amp;&amp; m%i == 0)return 0; return 1;}int main(){ double n1, m1, n2, m...