poj 1003 叠板子

切个水题放松一下

#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <vector>
#include <set>
#include <cctype>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <map>
#include <queue>
#include <list>
#include <iomanip>
using namespace std;                                               
///
///
const int INF =  20000000;   
#define maxn 55   
#define max(a,b)(a>b?a:b)
///
char numArray[5];
double num1, num2, num3;
double num;
int main()
{
	///
	int i, j;
	while (1)
	{
		scanf("%s", numArray);
		if (numArray[0] == '0' && numArray[2] == '0' && numArray[3] == '0')
			break;
		num = 0;
		num1 = numArray[0] - '0';
		num2 = numArray[2] - '0';
		num3 = numArray[3] - '0';
		num = num1 + num2 / 10 + num3 / 100;
		int n = 2;
		double sigma = 1 / double((n));
		while (sigma < num)
		{
			n++;
			sigma += 1 / double(n);
		}
		printf("%d card(s)\n", n - 1);
	}
	///
    return 0;
}