結果
| 問題 | No.574 正多面体サイコロ |
| ユーザー |
 smiken_61
|
| 提出日時 | 2018-03-05 22:54:09 |
| 言語 | C++11（廃止可能性あり） (gcc 13.3.0) |
| 結果 |
AC
|
| 実行時間 | 2 ms / 2,000 ms |
| コード長 | 12,511 bytes |
| コンパイル時間 | 1,441 ms |
| コンパイル使用メモリ | 163,824 KB |
| 実行使用メモリ | 6,944 KB |
| 最終ジャッジ日時 | 2024-09-13 19:26:06 |
| 合計ジャッジ時間 | 2,424 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 20 |
ソースコード
#include <bits/stdc++.h>#include<iostream>#include<cstdio>#include<vector>#include<queue>#include<map>#include<cstring>#include<string>#include <math.h>#include<algorithm>// #include <boost/multiprecision/cpp_int.hpp>#include<functional>#define int long long#define inf 1000000007#define pa pair<int,int>#define ll long long#define pal pair<double,double>#define ppap pair<pa,int>#define ssa pair<string,int>#define mp make_pair#define pb push_back#define EPS (1e-10)#define equals(a,b) (fabs((a)-(b))<EPS)int dx[4]={0,-1,0,1};int dy[4]={1,0,-1,0};using namespace std;class pa3{public:int x,y,z;pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}bool operator < (const pa3 &p) const{if(x!=p.x) return x<p.x;if(y!=p.y) return y<p.y;return z<p.z;//return x != p.x ? x<p.x: y<p.y;}bool operator > (const pa3 &p) const{if(x!=p.x) return x>p.x;if(y!=p.y) return y>p.y;return z>p.z;//return x != p.x ? x<p.x: y<p.y;}bool operator == (const pa3 &p) const{return x==p.x && y==p.y && z==p.z;}bool operator != (const pa3 &p) const{return !( x==p.x && y==p.y && z==p.z);}};class pa4{public:double x;int y,z,w;pa4(double x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}bool operator < (const pa4 &p) const{if(x!=p.x) return x<p.x;if(y!=p.y) return y<p.y;if(z!=p.z)return z<p.z;return w<p.w;//return x != p.x ? x<p.x: y<p.y;}bool operator > (const pa4 &p) const{if(x!=p.x) return x>p.x;if(y!=p.y) return y>p.y;if(z!=p.z)return z>p.z;return w>p.w;//return x != p.x ? x<p.x: y<p.y;}bool operator == (const pa4 &p) const{return x==p.x && y==p.y && z==p.z &&w==p.w;}};class pa2{public:int x,y;pa2(int x=0,int y=0):x(x),y(y) {}pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}bool operator < (const pa2 &p) const{return x != p.x ? x<p.x: y<p.y;}bool operator > (const pa2 &p) const{return x != p.x ? x>p.x: y>p.y;}bool operator == (const pa2 &p) const{return abs(x-p.x)==0 && abs(y-p.y)==0;}bool operator != (const pa2 &p) const{return !(abs(x-p.x)==0 && abs(y-p.y)==0);}};#define ppa pair<int,pas>class Point{public:double x,y;Point(double x=0,double y=0):x(x),y(y) {}Point operator + (Point p) {return Point(x+p.x,y+p.y);}Point operator - (Point p) {return Point(x-p.x,y-p.y);}Point operator * (double a) {return Point(x*a,y*a);}Point operator / (double a) {return Point(x/a,y/a);}double absv() {return sqrt(norm());}double norm() {return x*x+y*y;}bool operator < (const Point &p) const{return x != p.x ? x<p.x: y<p.y;}bool operator == (const Point &p) const{return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;}};typedef Point Vector;#define pl pair<int,pas>struct Segment{Point p1,p2;};double dot(Vector a,Vector b){return a.x*b.x+a.y*b.y;}double cross(Vector a,Vector b){return a.x*b.y-a.y*b.x;}bool parareru(Point a,Point b,Point c,Point d){// if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;return abs(cross(a-b,d-c))<EPS;}double distance_ls_p(Point a, Point b, Point c) {if ( dot(b-a, c-a) < EPS ) return (c-a).absv();if ( dot(a-b, c-b) < EPS ) return (c-b).absv();return abs(cross(b-a, c-a)) / (b-a).absv();}bool is_intersected_ls(Segment a,Segment b) {if(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;if(parareru((a.p2),(a.p1),(a.p1),(b.p2))&¶reru((a.p2),(a.p1),(a.p1),(b.p1))){// cout<<"sss"<<endl;if(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;if(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;if(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;if(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;return false;}else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );}double segment_dis(Segment a,Segment b){if(is_intersected_ls(a,b))return 0;double r=distance_ls_p(a.p1, a.p2, b.p1);r=min(r,distance_ls_p(a.p1, a.p2, b.p2));r=min(r,distance_ls_p(b.p1, b.p2, a.p2));r=min(r,distance_ls_p(b.p1, b.p2, a.p1));return r;}Point intersection_ls(Segment a, Segment b) {Point ba = b.p2-b.p1;double d1 = abs(cross(ba, a.p1-b.p1));double d2 = abs(cross(ba, a.p2-b.p1));double t = d1 / (d1 + d2);return a.p1 + (a.p2-a.p1) * t;}string itos( int i ) {ostringstream s ;s << i ;return s.str() ;}int gcd(int v,int b){if(v>b) return gcd(b,v);if(v==b) return b;if(b%v==0) return v;return gcd(v,b%v);}double distans(double x1,double y1,double x2,double y2){double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);return sqrt(rr);}// int pr[2000010];// int inv[2000010];int beki(int wa,int rr,int warukazu){if(rr==0) return 1%warukazu;if(rr==1) return wa%warukazu;if(rr%2==1) return (beki(wa,rr-1,warukazu)*wa)%warukazu;int zx=beki(wa,rr/2,warukazu);return (zx*zx)%warukazu;}double bekid(double w,int r){if(r==0) return 1.0;if(r==1) return w;if(r%2) return bekid(w,r-1)*w;double f=bekid(w,r/2);return f*f;}/*int comb(int nn,int rr){int r=pr[nn]*inv[rr];r%=inf;r*=inv[nn-rr];r%=inf;return r;}void gya(int ert){pr[0]=1;for(int i=1;i<ert;i++){pr[i]=(pr[i-1]*i)%inf;}for(int i=0;i<ert;i++) inv[i]=beki(pr[i],inf-2,inf);}*///priority_queue<pa3,vector<pa3>,greater<pa3>> pq;//sort(ve.begin(),ve.end(),greater<int>());//----------------kokomade tenpure------------//vector<double> ans(100000000),ans2(100000000);int t[60],a[60],b[60];double dp[110][110];signed main(){int n,f,k;cin>>f>>n>>k;double rui[30],g[30];for(int i=f;i>=1;i--){for(int j=0;j<105;j++)for(int l=0;l<=105;l++)dp[j][l]=0;dp[0][0]=1.0;for(int j=0;j<=n-1;j++)for(int l=0;l<=j;l++){dp[j+1][l]+=dp[j][l]*(1.0-(f-i+1.0)/f);dp[j+1][l+1]=dp[j][l]*((f-i+1.0)/f);}double fg=0;for(int l=k;l<=n;l++)fg+=dp[n][l];// cout<<fg<<endl;rui[i]=fg;}g[f]=rui[f];for(int i=f-1;i>=1;i--)g[i]=rui[i]-rui[i+1];double ans=0;for(int i=1;i<=f;i++){ans+=(i*1.0)*g[i];// cout<<g[i]<<endl;}printf("%.10lf\n",ans);// cout<<ans<<endl;return 0;}