356\u3002\u3002\u3002
\u5b9e\u9645\u4e0a\u6c42\u7684\u5c31\u662fN\u7684\u6392\u5217\u4e2d\u591a\u5c11\u4e2a\u6392\u5217\u53ea\u6709K\u4e2a\u4e0d\u5728\u4f4d\u7f6e\u4e0a\u3002\u3002
\u90a3\u4e48\u7b54\u6848\u5c31\u662fC(N,K)*D(N-K)\u3002\u3002D\u662f\u9519\u6392\u3002\u3002\u9519\u6392\u4e0d\u77e5\u9053\u8005\u53ef\u4ee5google\u4e4b\u3002\u3002
\u4f46\u662f\u9ad8\u7cbe\u5341\u5206BT\u3002\u3002\u5b9e\u9645\u4e0a\u6211\u600e\u4e48\u4f1a\u6ca1\u65f6\u95f4\u5199\u6a21\u62df\u9898\u5462\uff1f\u90fd\u662f\u683d\u5728\u8fd9\u9898\u4e0a\u4e86\u3002\u3002555
\u4e0d\u8fc7\u603b\u7b97\u662f\u5728\u6bd4\u8d5b\u7ed3\u675f\u524d\u8fc7\u4e86\u3002\u3002
\u7531\u4e8e\u8f93\u51fa\u5c45\u7136\u662f\u8981\u7528\u4e0d\u53ef\u7ea6\u5206\u6570\u3002\u3002\u83ab\u975e\u8981\u5199\u4e00\u4e2a\u9ad8\u7cbe\u5ea6\u6b27\u51e0\u91cc\u5f97\u7b97\u6cd5\u5417\uff1f\u5929\u963f\u3002\u3002
\u5982\u679c\u4f60\u771f\u53bb\u5199\u90a3\u4f60\u5c31\u50bb\u4e86\u3002\u3002\u3002
\u7b54\u6848\u662fD(n-k)\/((n-k)!(k)!)
\u6362\u53e5\u8bdd\u8bf4\u516c\u7ea6\u6570\u7684\u7d20\u56e0\u5b50\u300a\uff1d100\u3002\u3002\u3002
\u90a3\u4e48\u4e00\u4e2a\u4e2a\u5316\u5c31OK\u4e86\u3002\u3002
\u4e0d\u8fc7\u7a0b\u5e8f\u8fd8\u662f\u5f88\u957f\u3002\u3002\u597d\u7fa1\u6155JAVA\u963f\u3002\u3002\u81ea\u5e26\u9ad8\u7cbe\u5ea6\u8fd0\u7b97\u529f\u80fd\u7684\u3002\u3002
#include<iostream>
#include<cstring>
#define REP(i,n) for(int i=0;i<n;i++)
using namespace std;
const int maxn=110;
int Prime[]=
{2,3,5,7,11,
13,17,19,23,29
,31,37,41,43,47
,53,59,61,67,71
,73,79,83,89,97};
const int ps=25;
int N,K;
struct Num
{
int P;
Num(){memset(P,0,sizeof(P));}
void mult(int a)
{
for(int i=0;i<ps;i++)
{
if(a==1) break;
while(a%Prime[i]==0)
a\/=Prime[i],P[i]++;
}
}
void divide(int a)
{
for(int i=0;i<ps;i++)
{
if(a==1) break;
while(a%Prime[i]==0)
a\/=Prime[i],P[i]–;
}
}
};
const int maxlen=200;
struct BigNum
{
int Q[maxlen],last;
BigNum(int x=0)
{memset(Q,0,sizeof(Q));Q[0]=x;last=0;}
int operator[](int v) const
{return Q[v];}
int& operator[](int v)
{return Q[v];}
BigNum operator+(const BigNum&x)
{
BigNum now;now.last=max(last,x.last);
int d=0;
for(int i=0;i<=now.last;i++)
{
d+=Q[i]+x[i];
now[i]=d%10;
d\/=10;
}
while(d)
{
now[++now.last]=d%10;
d\/=10;
}
return now;
}
void operator*=(int x)
{
int d=0;
for(int i=0;i<=last;i++)
{
d+=Q[i]*x;
Q[i]=d%10;
d\/=10;
}
while(d>0)
{
Q[++last]=d%10;
d\/=10;
}
}
BigNum operator*(const BigNum&x)
{
BigNum now;now.last=x.last+last;
memset(now.Q,0,sizeof(Q));
for(int i=0;i<=last;i++)
for(int j=0;j<=x.last;j++)
now[i+j]+=Q[i]*x[j];
int d=0;
for(int i=0;i<=now.last;i++)
{
d+=now[i];
now[i]=d%10;
d\/=10;
}
while(d)
{
now[++now.last]=d%10;
d\/=10;
}
}
int Mod(int x)
{
int d=0;
for(int i=last;i>=0;i–)
{
d*=10;
d+=Q[i];
d%=x;
}
return d;
}
void Divide(int x)
{
int rest=0;
for(int i=last;i>=0;i–)
{
rest=rest*10+Q[i];
Q[i]=rest\/x;
rest%=x;
}
while(Q[last]==0)
last–;
}
void operator=(const BigNum&x)
{
last=x.last;
memmove(Q,x.Q,sizeof(Q));
}
void show()
{
for(int i=last;i>=0;i–)
cout<<Q[i];
}
};
BigNum Get(Num x)
{
BigNum now(1);
for(int i=0;i<ps;i++)
{
for(int j=0;j<x.P[i];j++)
now*=Prime[i];
}
return now;
}
BigNum D[maxn];
void CalD(int n)
{
D[0][0]=1;D[1][0]=0;
for(int i=2;i<=n;i++)
{
D[i]=D[i-1]+D[i-2];
D[i]*=(i-1);
}
}
Num C;
int main()
{
cin>>K>>N;
if(N-K==1)
{
cout<<0<<endl;
return 0;
}
CalD(N-K);
for(int i=1;i<=K;i++)
C.mult(i);
for(int i=1;i<=N-K;i++)
C.mult(i);
BigNum left,right;
left=D[N-K];
for(int i=0;i<ps;i++)
{
while(left.Mod(Prime[i])==0&&C.P[i]>0)
left.Divide(Prime[i]),C.P[i]–;
}
right=Get(C);
left.show();cout<<"\/";right.show();
}
357\u3002\u3002\u3002\u597d\u65e0\u804a\u7684\u6c34\u9898\u963f\u3002\u3002\u8981\u662f\u80fd\u8df3\u660e\u663e\u4e00\u5f00\u59cb\u5c31\u8df3\u3002\u3002
\u7136\u540e\u679a\u4e3e\u6bcf\u4e2a\u5f00\u59cbUP or DOWN\u7684\u70b9\u7b97\u7b54\u6848\u3002\u3002\u3002
Code\u3002\u3002\u3002
#include<iostream>
#define REP(i,n) for(int i=0;i<n;i++)
using namespace std;
const int inf=~0U>>2;
bool Digit[10]={0};
bool UP,DOWN,FLY;
int dist[100],s,t;
void init()
{
cin>>Digit[1]>>Digit[2]>>Digit[3]>>UP>>
Digit[4]>>Digit[5]>>Digit[6]>>DOWN>>
Digit[7]>>Digit[8]>>Digit[9]>>FLY>>Digit[0];
}
void renew(int&x,int c)
{
x=min(x,c);
}
void Fly()
{
for(int i=0;i<10;i++)
for(int j=0;j<10;j++)
if(Digit[i]&&Digit[j])
renew(dist[i*10+j],3);
}
void Go(int j)
{
int c=dist[j];
if(UP)
renew(dist[(j+1)%100],c+1);
if(DOWN)
renew(dist[(j+99)%100],c+1);
}
int main()
{
init();cin>>s>>t;
REP(i,100) dist[i]=inf;
dist[s]=0;
if(FLY)
Fly();
for(int i=0;i<10;i++)
if(Digit[i])
renew(dist[i],1);
int ans=dist[t];
for(int i=0;i<100;i++)
if(dist[i]!=inf)
{
if(UP)
renew(ans,(t-i+100)%100+dist[i]);
if(DOWN)
renew(ans,(i-t+100)%100+dist[i]);
}
if(ans==inf)
cout<<-1<<endl;
else
cout<<ans<<endl;
} <\/p>\n","protected":false},"excerpt":{"rendered":"
356\u3002\u3002\u3002\u5b9e\u9645\u4e0a\u6c42\u7684\u5c31\u662fN\u7684\u6392\u5217\u4e2d\u591a\u5c11\u4e2a\u6392\u5217\u53ea\u6709K\u4e2a\u4e0d\u5728\u4f4d\u7f6e\u4e0a\u3002\u3002\u90a3\u4e48\u7b54\u6848\u5c31\u662fC(N,K)*D(N-K)\u3002\u3002D\u662f\u9519\u6392\u3002\u3002\u9519\u6392\u4e0d\u77e5\u9053\u8005\u53ef\u4ee5google\u4e4b\u3002\u3002\u4f46\u662f\u9ad8\u7cbe\u5341\u5206BT\u3002\u3002\u5b9e\u9645\u4e0a\u6211\u600e\u4e48\u4f1a\u6ca1\u65f6\u95f4\u5199\u6a21\u62df\u9898\u5462\uff1f\u90fd\u662f\u683d\u5728\u8fd9\u9898\u4e0a\u4e86\u3002\u3002555\u4e0d\u8fc7\u603b\u7b97\u662f\u5728\u6bd4\u8d5b\u7ed3\u675f\u524d\u8fc7\u4e86\u3002\u3002\u7531\u4e8e\u8f93\u51fa\u5c45\u7136\u662f\u8981\u7528\u4e0d\u53ef\u7ea6\u5206\u6570\u3002\u3002\u83ab\u975e\u8981\u5199\u4e00\u4e2a\u9ad8\u7cbe\u5ea6\u6b27\u51e0\u91cc\u5f97\u7b97\u6cd5\u5417\uff1f\u5929\u963f\u3002\u3002\u5982\u679c\u4f60\u771f\u53bb\u5199\u90a3\u4f60\u5c31\u50bb\u4e86\u3002\u3002\u3002\u7b54\u6848\u662fD(n-k)\/((n-k)!(k)!)\u6362\u53e5\u8bdd\u8bf4\u516c\u7ea6\u6570\u7684\u7d20\u56e0\u5b50\u300a\uff1d100\u3002\u3002\u3002\u90a3\u4e48\u4e00\u4e2a\u4e2a\u5316\u5c31OK\u4e86\u3002\u3002\u4e0d\u8fc7\u7a0b\u5e8f\u8fd8\u662f\u5f88\u957f\u3002\u3002\u597d\u7fa1\u6155JAVA\u963f\u3002\u3002\u81ea\u5e26\u9ad8\u7cbe\u5ea6\u8fd0\u7b97\u529f\u80fd\u7684\u3002\u3002#include<iostream>#include<cstring>#define REP(i,n) for(int i=0;i<n;i++)using namespace std;const int maxn=110;int Prime[]={2,3,5,7,11, 13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97};const int ps=25;int N,K;struct Num{ int P; Num(){memset(P,0,sizeof(P));} void mult(int a) { for(int i=0;i<ps;i++) { if(a==1) break; while(a%Prime[i]==0) a\/=Prime[i],P[i]++; } } void divide(int a) { for(int i=0;i<ps;i++) { if(a==1) break; while(a%Prime[i]==0) a\/=Prime[i],P[i]–; } } };const int maxlen=200;struct BigNum{ int Q[maxlen],last; BigNum(int x=0) {memset(Q,0,sizeof(Q));Q[0]=x;last=0;} int operator[](int v) […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[10],"tags":[],"jetpack_featured_media_url":"","_links":{"self":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/25"}],"collection":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=25"}],"version-history":[{"count":0,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=\/wp\/v2\/posts\/25\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=25"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=25"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.shuizilong.com\/wjmzbmr\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=25"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}