Luogu3802 小魔女帕琪 (排列组合)
2024-09-08 03:28:26
注意除数为0情况
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define R(a,b,c) for(register int a = (b); a <= (c); ++ a)
#define nR(a,b,c) for(register int a = (b); a >= (c); -- a)
#define Max(a,b) ((a) > (b) ? (a) : (b))
#define Min(a,b) ((a) < (b) ? (a) : (b))
#define Fill(a,b) memset(a, b, sizeof(a))
#define Abs(a) ((a) < 0 ? -(a) : (a))
#define Swap(a,b) a^=b^=a^=b
#define ll long long
#define ON_DEBUG
#ifdef ON_DEBUG
#define D_e_Line printf("\n\n----------\n\n")
#define D_e(x) cout << #x << " = " << x << endl
#define Pause() system("pause")
#define FileOpen() freopen("in.txt","r",stdin);
#else
#define D_e_Line ;
#define D_e(x) ;
#define Pause() ;
#define FileOpen() ;
#endif
struct ios{
template<typename ATP>ios& operator >> (ATP &x){
x = 0; int f = 1; char c;
for(c = getchar(); c < '0' || c > '9'; c = getchar()) if(c == '-') f = -1;
while(c >= '0' && c <= '9') x = x * 10 + (c ^ '0'), c = getchar();
x*= f;
return *this;
}
}io;
using namespace std;
long long a[8];
int main(){
int n = 0;
R(i,1,7){
io >> a[i];
if(a[i] == 0){
printf("0.000");
return 0;
}
n += a[i];
}
double s = 1;
R(i,2,7) s *= i;
R(i,1,7){
s = s * (double)a[i] / (double)(n - i + 1);
}
printf("%.3lf", (double)s * (n - 6));
return 0;
}
最新文章
- Java 征途:行者的地图
- 家族/亲戚(relation)
- php日历
- 基于iSCSI的SQL Server 2012群集测试(二)--SQL群集安装后初始化配置测试
- Design Patterns
- python log 层次结构
- 水晶報表中小寫變大寫的函數-VB
- BZOJ2342: [Shoi2011]双倍回文
- Flask 学习 五 电子邮件
- 步步深入:MySQL架构总览->;查询执行流程->;SQL解析顺序(转)
- swiper 父级元素display:none 之bug
- EF连接MySql数据库
- python 5
- Keepalived系列一:Keepalived.conf 详解
- sql server数据库备份单个表的结构和数据生成脚本
- Scrum 5.0
- 【BZOJ4059】Non-boring sequences
- Swift 4.1 正式发布,新增更多泛型特性支持
- hdu3863找规律
- XML文件中关键字自动提示和不全配置