Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- double dp[60005][1005],n,eps = 0.0000001, ch, q;
- long long l,r,mid,ans,i,j,k,T;
- main(){
- cin>>k>>T;
- dp[0][0]= 1.0;
- for (i=1; i<=60000; i++)
- for (j=1; j<=k; j++)
- dp[i][j] = dp[i-1][j] * (double)j / k + dp[i-1][j-1] * (double)(k - (j-1)) / k;
- while (T--){
- cin>>q;
- l=1; r=60000; ans = r;
- ch = ((double)q - eps) / 2000.0;
- while (l<=r){
- mid = (l+r/2);
- if (dp[mid][k] >= ch) {
- ans = mid;
- r = mid-1;
- } else l = mid+1;
- }
- cout<<ans<<endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement