C语言检索两个数是否有2以上公因数(作为分子分母时是否可化简)的方法

本篇博客探讨如何使用C语言解决一个问题:给定整数N(2<=N<=20)和0.5<M<=1的实数M,输出所有分母不大于N且值不大于M的真分数,同时检查并避免输出不可约分的相同值。输入为整数N和双精度浮点数M,输出按照分母从小到大,相同分母时分子小的在前,最后以' '结束。
摘要由CSDN通过智能技术生成

例题

giving an integer N (2<=N<=20) and a real number M (0.5 < M <= 1), output all proper fractions whose numerator is less than N ,and denominator is equal to or less than N, and value is equal to or less than M.
input: an integer N, a real number M in the type of double, in one line seperated by blank space.
output: proper fractions, each occupies a line. The proper fractions with smaller denominators are in the front.
Between two different fractions with same denominator, the one whose numerator is smaller comes first. There is a ‘\n’
after the final fraction number.

#include<stdio.h>
int main() {
    int length = 0;
    int i, j;
    
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值