CodeForces 768 D Jon and Orbs (概率dp)

D. Jon and Orbs

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Jon Snow is on the lookout for some orbs required to defeat the white walkers. There are k different types of orbs and he needs at least one of each. One orb spawns daily at the base of a Weirwood tree north of the wall. The probability of this orb being of any kind is equal. As the north of wall is full of dangers, he wants to know the minimum number of days he should wait before sending a ranger to collect the orbs such that the probability of him getting at least one of each kind of orb is at least , where ε < 10 - 7.

To better prepare himself, he wants to know the answer for q different values of pi. Since he is busy designing the battle strategy with Sam, he asks you for your help.

Input

First line consists of two space separated integers k, q (1 ≤ k, q ≤ 1000) — number of different kinds of orbs and number of queries respectively.

Each of the next q lines contain a single integer pi (1 ≤ pi ≤ 1000) — i-th query.

Output

Output q lines. On i-th of them output single integer — answer for i-th query.

Examples

input

1 1
1

output

1

input

2 2
1
2

output

2
2

http://codeforces.com/problemset/problem/768/D

题目大意：

有k件物品   每天可以随机选取k件中的一件   概率相同    现在问选取k件不同的物品的的概率>p/2000.0  最少需要多少天

分析：

每天有两种情况    1、选取的是之前选过的的一种    2、选取的是之前没有选过的     概率dp

AC代码：

#include <bits/stdc++.h>
using namespace std;
double dp[15050][1000];
int main (){
	int k,q;
	while (scanf ("%d%d",&k,&q)!=EOF){
		dp[0][0]=1;
		for (int i=1;i<=15000;i++){
			for (int j=1;j<=k;j++){
				dp[i][j]+=dp[i-1][j]*(j*1.0/k);
				dp[i][j]+=dp[i-1][j-1]*((k-j+1)*1.0/k);
			}
		}
		int p;
		while (q--){
			scanf ("%d",&p);
			for (int i=1;i<=15000;i++){
				if (dp[i][k]>p*1.0/2000.0){
					printf ("%d\n",i);
					break;
				}
			}
		}
	}
	return 0;
}