hdu 5072 Coprime 容斥原理
2015-08-17 20:09
399 查看
Coprime
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1460 Accepted Submission(s): 571
Problem Description
There are n people standing in a line. Each of them has a unique id number.
Now the Ragnarok is coming. We should choose 3 people to defend the evil. As a group, the 3 people should be able to communicate. They are able to communicate if and only if their id numbers are pairwise coprime or pairwise not coprime. In other words, if their
id numbers are a, b, c, then they can communicate if and only if [(a, b) = (b, c) = (a, c) = 1] or [(a, b) ≠ 1 and (a, c) ≠ 1 and (b, c) ≠ 1], where (x, y) denotes the greatest common divisor of x and y.
We want to know how many 3-people-groups can be chosen from the n people.
Input
The first line contains an integer T (T ≤ 5), denoting the number of the test cases.
For each test case, the first line contains an integer n(3 ≤ n ≤ 105), denoting the number of people. The next line contains n distinct integers a1, a2, . . . , an(1 ≤ ai ≤ 105) separated by
a single space, where ai stands for the id number of the i-th person.
Output
For each test case, output the answer in a line.
Sample Input
1 5 1 3 9 10 2
Sample Output
4
Source
2014 Asia AnShan Regional Contest
求从n个数字中选出a,b,c三个数字,要么两两互质,要么两两不互质,求组合数。
那么解 = 所有组合数 - 互质和不互质同时存在的组合数
那么求出与a[i]不互质的数的个数,就能算出与a[i]互质的数的个数
求法:统计每个数字能做为那么数字的因素
对于一个数字,分解质因数,然后用容斥原理算出与这个数不互质的数的个数。
那么对于a[i],选择一个互质的数的情况*选择一个不互质的数的情况 = 得到的是不满足条件的且包含a[i]的情况。
由于对每个数字都进行处理,最后的结果是不满足情况的数量*2
#include<iostream> #include<cstdio> #include<vector> #include<cstring> using namespace std; #define ll long long #define maxn 100007 int check[maxn]; vector<int> prin[maxn]; int num[maxn]; void init(){ memset(check,0,sizeof(check)); for(int i = 2;i < maxn; i++){ if(check[i] == 0) { for(int j = i;j < maxn; j+=i){ check[j] = 1; prin[j].push_back(i); } } } } int main(){ init(); int n,t,u,s; scanf("%d",&t); while(t--){ scanf("%d",&n); memset(check,0,sizeof(check)); memset(num,0,sizeof(num)); for(int i = 0;i < n; i++){ scanf("%d",&check[i]); num[check[i]]++; } for(int i = 1;i < maxn; i++) for(int j = i+i; j < maxn; j+= i) num[i] += num[j]; ll res = 0,ans = 0; for(int i = 0;i < n; i++){ u = check[i]; res = 0,s = prin[u].size(); for(int j = 1;j < (1<<s); j++){ int v = 1,f = 0; for(int k = 0;k < s; k++){ if((1<<k)&j){ f++; v *= prin[u][k]; } } if(f&1) res += num[v]-1; else res -= num[v]-1; } if(res) ans += res*(n-res-1); } ans = 1ll*n*(n-1)*(n-2)/6-ans/2; printf("%I64d\n",ans); } return 0; }
相关文章推荐
- 阿里云不能启动docker
- 关闭iptables和SELINUX
- 【培训】Linux笔记 自学
- Jetty vs. Tomcat
- CentOS下使用yum安装配置和使用svn
- [图论训练]BZOJ 1624: [Usaco2008 Open] Clear And Present Danger 寻宝之路【floyd】
- tomcat 启动异常排查
- LINUX操作系统VIM的安装和配置
- linux找不到动态链接库 .so文件的解决方法
- Linux 指定运行时动态库路径
- 关于mongo的shell小贴士
- 在Parallels Desktop上安装Win8虚拟机
- Linux简单指令操作
- Docker容器关键词
- Hadoop 调试第一个MapReduce程序过程详细记录总结
- FTP定时批量下载文件(SHELL脚本及使用方法 )
- SQOOP
- linux(十一)
- linux date 快捷命令
- linux(十)