0
点赞
收藏
分享

微信扫一扫

悬挂纸牌算法

一叶随风_c94d 2022-03-18 阅读 41
#include <stdio.h>

int compute_cards_number(double L)
{
	int n = 1;
	double sum = 0.5;
	while (sum < L)
	{
		n++;
		sum += 1.0 / (n + 1);
	}
	return n;
}

int main()
{
	double L;
	scanf("%lf", &L);
	printf("L的值为:%lf\n", L);
	while (L != 0)
	{
		int n = compute_cards_number(L);
		printf("%d cards(s)\n", n);
		scanf("%lf", &L);
	}
	return 0;
}
举报

相关推荐

0 条评论