ZOJ Problem Set - 1045 HangOver
2013-09-04 10:55
459 查看
#include <stdio.h> int main() { float c; int i; while(scanf("%f",&c)!=EOF&&c) { float sum=0; for(i=2;sum<c;i++) { sum+=(1.0/i); } printf("%d card(s)\n",i-2); } return 0; }
简单不多说了
相关文章推荐
- ZOJ Problem Set - 1045 HangOver
- ZOJ Problem Set – 1045 HangOver
- ZOJ Problem Set - 1045||HangOver
- ZOJ Problem Set - 1045 & ZOJ Problem Set - 1048
- ZOJ Problem Set - 2727 List the Books
- ZOJ Problem Set - 1828 Fibonacci Numbers(大数相加)
- ZOJ Problem Set - 2913
- ZOJ Problem Set - 1078 Palindrom Numbers
- ZOJ Problem Set - 1201 Inversion
- ZOJ Problem Set - 3782 Ternary Calculation
- ZOJ Problem Set - 1037
- ZOJ Problem Set - 1151
- ZOJ Problem Set - 1061
- ZOJ Problem Set - 1117
- ZOJ Problem Set - 1003
- ZOJ Problem Set - 1649 Rescue BFS+优先队列
- ZOJ Problem Set - 1006
- ZOJ Problem Set - 2886 Look and Say
- ZOJ Problem Set–1383 Binary Numbers
- ZOJ Problem Set - 3812 牡丹江网络赛D题 状态压缩 背包