1003-Hangover

#include<iostream>
using namespace std;
double jisuan(double a)
{
double sum=0;
for(double i=2;i<=a+1;i++)
{
sum=sum+double(1/i);
}
return sum;
}
int main()
{
	double a;
	cin>>a;
	while(a!=0)
	{
	if(0<=a<0.5)
		cout<<1<<" "<<"card(s)"<<endl;
	 else
	 	for(int i=1;i>=0;i++)
	 		if(jisuan(i)>=a)
	 		{
	 			cout<<i<<" "<<"card(s)"<<endl;
	 			break;
	 		}
	cin>>a;
    }
	return 0;
 }

  

时间: 2024-12-22 22:19:49

1003-Hangover的相关文章

poj 1003:Hangover(水题,数学模拟)

Hangover Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 99450   Accepted: 48213 Description How far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (We're as

POJ 1003 Hangover&amp;&amp;NYOJ 156 Hangover【数学题】

计算1+1/2+1/3+++1/n Hangover Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 104558   Accepted: 50926 Description How far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a car

[POJ] #1003# Hangover : 浮点数运算

一. 题目 Hangover Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 116593   Accepted: 56886 Description How far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (W

poj 1003 Hangover

#include <iostream> using namespace std; int main() { double len; while(cin >> len && len) { double sum = 0.0; double i = 1.0; int n = 2; while(sum < len) { sum += i/n; ++n; } cout << n-2 << " card(s)" <<

POJ做题笔记:1000,1004,1003

1000 A+B Problem 题目大意:输入两个数a和b,输出他们的和. 代码: #include <stdio.h> int main() { int a, b; while (scanf("%d%d" , &a, &b) != EOF) { printf("%d\n", a + b); } return 0; } 1004 Financial Management 题目大意:告诉你Larry的12个月的工资,求这12个月的工资的平

Hangover

POJ - 1003 Hangover           Description How far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (We're assuming that the cards must be perpendicular to the table.) With

北大ACM题库习题分类与简介(转载)

在百度文库上找到的,不知是哪位大牛整理的,真的很不错! zz题 目分类 Posted by fishhead at 2007-01-13 12:44:58.0 -------------------------------------------------------------------------------- acm.pku.edu.cn 1. 排序 1423, 1694, 1723, 1727, 1763, 1788, 1828, 1838, 1840, 2201, 2376, 23

POJ百道水题列表

以下是poj百道水题,新手可以考虑从这里刷起 搜索1002 Fire Net1004 Anagrams by Stack1005 Jugs1008 Gnome Tetravex1091 Knight Moves1101 Gamblers1204 Additive equations 1221 Risk1230 Legendary Pokemon1249 Pushing Boxes 1364 Machine Schedule1368 BOAT1406 Jungle Roads1411 Annive

ACM训练方案-POJ题目分类

ACM训练方案-POJ题目分类 博客分类: 算法 ACM online Judge 中国: 浙江大学(ZJU):http://acm.zju.edu.cn/ 北京大学(PKU):http://acm.pku.edu.cn/JudgeOnline/ 杭州电子科技大学(HDU):http://acm.hdu.edu.cn/ 中国科技大学(USTC):http://acm.ustc.edu.cn/ 北京航天航空大学(BUAA)http://acm.buaa.edu.cn/oj/index.php 南京

POJ题目Java代码(一)

POJ 1001 Exponentiation import java.math.BigDecimal; import java.util.Scanner; public class Poj1001 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while(sc.hasNext()){ BigDecimal bigDecimal = new BigDecimal(sc.next())