POJ 1003求Hangover解题报告——【PKU ACM】

#include<iostream>
using namespace std;
int main(){
float length,temp;
int maxNum(0);
while(cin>>length){
while(length>0){
++maxNum;
temp=1.0f/(maxNum+1);
length-=temp;
}
if(maxNum!=0){
cout<<maxNum<<" card(s)"<<endl;
maxNum=0;
}
else
break;
}
return 0;
}