每天作死一道题——1、2扑克牌魔术(趣题学算法)

不想打题，麻烦，感兴趣的可以去找书来看

#include <iostream>
#include <vector>
using namespace std;

int nun_card (double clong);

int main(){
    double longs;
    vector<double> vlongs;
    while (cin>>longs && longs!=0.00){
        vlongs.push_back(longs);
    }

    for (auto a : vlongs)
        cout << nun_card(a)<< "  card(s)" <<endl;
    return 0;
} 

int nun_card (double longs)
{
    double i=1.00;//if here is int,the val of clong will return 0;
    int num=0;
    double clong=0;
    while (clong<longs){
        clong=clong+1.00/(i+1);
        i++;
        num++;
        //cout<<1/(i+1);
    } 
    return num;    
}