poj 1003 [离线预处理 + 二分]

最新推荐文章于 2019-04-25 00:10:36 发布

aclay

最新推荐文章于 2019-04-25 00:10:36 发布

阅读量526

点赞数

分类专栏： icpc总论

本文链接：https://blog.csdn.net/aclay/article/details/8263202

版权

icpc总论专栏收录该内容

68 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <iterator>
#include <algorithm>
#define MID(x,y) ( ( x + y ) >> 1 )
#define L(x) ( x << 1 )
#define R(x) ( x << 1 | 1 )
#define BUG puts("here!!!");
#define STOP system("pause");

using namespace std;
const int N = 300;
const double norm = 0.00000001;

int zero(double x) {
	if(x < -norm) return -1;
	return x > norm;
}

int main() {
	double len[N];
	int total;
	len[0] = 0.0;
	for(total = 1; zero(len[total-1] - 5.20) <= 0; total++) { 
		len[total] = len[total - 1] + 1.0 / double(total + 1);
	}
	double x;
	while(cin >> x, zero(x)) {
		int l, r;
		l = 0, r = total;
		while(l <= r) {
			int mid = MID(l, r);
			if(zero(len[mid] - x) <= 0) {
				l = mid + 1;
			}
			else r = mid - 1;
		}
		cout << r + 1 << " card(s)" << endl;
	}
	return 0;
}