hdoj1056简单题

来源:互联网 发布:apache embedded 编辑:程序博客网 时间:2024/06/11 06:03
#include<iostream>using namespace std;int main(){double m;double distance;int count;while(cin>>m && m != 0){count = 1;distance = 1.0 / 2;while(distance < m){count++;distance += 1.0 / (count + 1);}cout<<count<<" card(s)"<<endl;}}