纯组合数学题,由于数据规模很小(最大只有十二),这里先把0-12的组合数和阶乘全部都算出来再直接读取,这样效率应该是很高的。
求组合数还有一个高效率的算法,求c(m,n)能达到O(log2n),是用位运算做的。
Accepted | 1202 | C | 00:00.00 | 388K |
#include<stdio.h>
int c[13][13 ];
int m[13 ];
void solve(int n)
{
int i,cnt[12] = {0},arr[12],sum = 0,ans = 1 ;
for (i = 0; i < n; i++ )
{
scanf("%d",& arr[i]);
sum += arr[i];
cnt[arr[i]]++ ;
}
for (i = 0; i < n; sum -= arr[i++ ])
ans *= c[arr[i]][sum];
for (i = 0; i < 12; i++ )
if (cnt[i] > 1) ans /= m[cnt[i]];
printf("%d/n" ,ans);
}
void calc()
{
int i,j;
for (i = 0; i < 13; i++ )
for (j = i; j < 13; j++ )
if (i == 0) c[i][j] = 1 ;
else if (j == 0) c[i][j] = 0 ;
else if (i > j / 2) c[i][j] = c[j - i][j];
else c[i][j] = c[i -1][j - 1] + c[i][j - 1 ];
}
void calc1()
{
int i;
m[0] = 1 ;
for (i = 1; i < 13; i++) m[i] = i * m[i - 1 ];
}
void main()
{
#ifndef ONLINE_JUDGE
freopen("1202.txt","r" ,stdin);
#endif
int n;
calc();
calc1();
while (scanf("%d",&n) != EOF)
solve(n);
#ifndef ONLINE_JUDGE
fclose(stdin);
#endif
}
int c[13][13 ];
int m[13 ];
void solve(int n)
{
int i,cnt[12] = {0},arr[12],sum = 0,ans = 1 ;
for (i = 0; i < n; i++ )
{
scanf("%d",& arr[i]);
sum += arr[i];
cnt[arr[i]]++ ;
}
for (i = 0; i < n; sum -= arr[i++ ])
ans *= c[arr[i]][sum];
for (i = 0; i < 12; i++ )
if (cnt[i] > 1) ans /= m[cnt[i]];
printf("%d/n" ,ans);
}
void calc()
{
int i,j;
for (i = 0; i < 13; i++ )
for (j = i; j < 13; j++ )
if (i == 0) c[i][j] = 1 ;
else if (j == 0) c[i][j] = 0 ;
else if (i > j / 2) c[i][j] = c[j - i][j];
else c[i][j] = c[i -1][j - 1] + c[i][j - 1 ];
}
void calc1()
{
int i;
m[0] = 1 ;
for (i = 1; i < 13; i++) m[i] = i * m[i - 1 ];
}
void main()
{
#ifndef ONLINE_JUDGE
freopen("1202.txt","r" ,stdin);
#endif
int n;
calc();
calc1();
while (scanf("%d",&n) != EOF)
solve(n);
#ifndef ONLINE_JUDGE
fclose(stdin);
#endif
}