| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 19097 |
2016-02-18T06:26:35 Z |
Namnamseo |
맛있는 과자 (kriii3_A) |
C++14 |
|
0 ms |
1216 KB |
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;
ll combi[50][50];
void bc(){
combi[0][0]=1;
int i,j;
for(i=1;i<=40;++i){
combi[i][0]=combi[i][i]=1;
for(j=1;j<i;++j) combi[i][j]=combi[i-1][j-1]+combi[i-1][j];
}
}
typedef pair<double,ll> pd;
pd asdf[50];
int main()
{
bc();
int a,b,n;
ll k;
scanf("%d%d%d%lld",&a,&b,&n,&k);
double r1=2*log(a)-log(a*a+b*b);
double r2=2*log(b)-log(a*a+b*b);
double s0=log(a)+log(b)-log(2);
int i;
for(i=0; i<=n; ++i){
asdf[i]={r1*i + r2*(n-i), combi[n][i]};
}
sort(asdf,asdf+n+1,greater<pd>());
ll ind=0;
for(i=0; i<=n; ++i){
ind += asdf[i].second;
if(k<=ind){
printf("%.10f\n",asdf[i].first + s0);
break;
}
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 21 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 22 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 23 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 24 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 25 |
Correct |
0 ms |
1216 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 21 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 22 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 23 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 24 |
Correct |
0 ms |
1216 KB |
Output is correct |
| 25 |
Correct |
0 ms |
1216 KB |
Output is correct |
