UVa 10375 - Choose and divide
来源:互联网 发布:捡宝贝淘宝u站 编辑:程序博客网 时间:2024/05/19 09:14
唯一分解, 筛出素数即可。
int p, q, r, s;int e[maxn];void add_int(int n, int d) { for(int i = 0; i < 1229; i++) { while(!(n % primes[i])) { n /= primes[i]; e[i] += d; } if(n == 1) break; }}void add_fac(int n, int d) { for(int i = 1; i <= n; i++) add_int(i, d);}int main() { while(~scanf("%d%d%d%d", &p, &q, &r, &s)) { memset(e, 0, sizeof(e)); add_fac(p, 1); add_fac(q, -1); add_fac(p - q, -1); add_fac(r, -1); add_fac(s, 1); add_fac(r - s, 1); double ans = 1; for(int i = 0; i < 1229; i++) ans *= pow(primes[i], e[i]); printf("%.5f\n", ans); } return 0;}
0 0
- UVA 10375 - Choose and divide
- uva 10375 - Choose and divide
- UVA - 10375 Choose and divide
- UVa:10375 Choose and divide
- uva 10375 Choose and divide
- UVA 10375 Choose and divide
- Choose and divide - UVa 10375
- UVA - 10375 Choose and divide
- UVA - 10375 Choose and divide
- UVA - 10375 Choose and divide
- UVa 10375 - Choose and divide
- uva 10375 Choose and divide
- UVa 10375 Choose and divide
- UVA 10375 Choose and divide
- UVa 10375 - Choose and divide
- UVA - 10375 Choose and divide
- uva 10375Choose and divide
- UVA 10375 Choose and divide
- JAVA创建单例的5中常见方式及比较
- LeetCode OJ Pow(x, n)
- jdbC连接到数据库
- LeetCode OJ Merge k Sorted Lists
- mybatis报错java.lang.ClassCastException: java.lang.String cannot be cast to java.lang.Long
- UVa 10375 - Choose and divide
- 显隐转换,虚成员和抽象成员
- LeetCode OJ Remove Nth Node From End of List
- IOS7(新UI之自定义UITableViewCell)
- LeetCode OJ Rotate List
- UVa 10491 - Cows and Cars
- Javaweb学习笔记2—Tomcat和http协议
- hdu 4407 Sum (容斥原理)
- Arch Linux 简易打包指南