POJ 2773 Happy 2006 (分解质因数+容斥+二分 或 欧几里德算法应用)
来源:互联网 发布:三国志13优化修改器 编辑:程序博客网 时间:2024/05/10 20:12
Happy 2006
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 10309 Accepted: 3566
Description
Two positive integers are said to be relatively prime to each other if the Great Common Divisor (GCD) is 1. For instance, 1, 3, 5, 7, 9...are all relatively prime to 2006.
Now your job is easy: for the given integer m, find the K-th element which is relatively prime to m when these elements are sorted in ascending order.
Now your job is easy: for the given integer m, find the K-th element which is relatively prime to m when these elements are sorted in ascending order.
Input
The input contains multiple test cases. For each test case, it contains two integers m (1 <= m <= 1000000), K (1 <= K <= 100000000).
Output
Output the K-th element in a single line.
Sample Input
2006 12006 22006 3
Sample Output
135
Source
POJ Monthly--2006.03.26,static
题目链接:http://poj.org/problem?id=2773
题目大意:求第k个与m互质的数
题目分析:两种方法,主流方法是分解质因数+二分+容斥,0ms过,先对m分解质因数,然后二分,二分时用容斥计算1到当前数字与m不互质的数的个数,然后用m减,就是与m互质的数的个数。
第二种方法利用了欧几里德算法,gcd(a, b) = gcd(b, a % b),令a = km + i,b = m则有:
gcd(km + i, m) = gcd(i, m),说明与m互质的数对m取模有周期性,因此设小于m且与m互质的数有cnt个,第i个为ai,则第m*cnt+i个为m*cnt+ai,其次要注意k整除cnt的时候,取到的实际上是a[cnt]而不是a[0],这个方法跑了2400ms+
题目链接:http://poj.org/problem?id=2773
题目大意:求第k个与m互质的数
题目分析:两种方法,主流方法是分解质因数+二分+容斥,0ms过,先对m分解质因数,然后二分,二分时用容斥计算1到当前数字与m不互质的数的个数,然后用m减,就是与m互质的数的个数。
#include <cstdio>#include <cstring>#define ll long longint const MAX = 1e6 + 6;int fac[MAX];int n, k, cnt;ll sum;void get_Factor(int x){ cnt = 0; for(int i = 2; i <= x; i++) { if(x % i == 0) fac[cnt ++] = i; while(x % i == 0) x /= i; } if(x > 1) fac[cnt ++] = x;}void DFS(int pos, int num, ll cur, ll x){ if(pos == cnt) { if(cur == 1) return; if(num & 1) sum += x / cur; else sum -= x / cur; return; } DFS(pos + 1, num, cur, x); DFS(pos + 1, num + 1, cur * fac[pos], x); return;}ll cal(ll mid){ sum = 0; DFS(0, 0, 1, mid); return sum;}int main(){ while(scanf("%d %d", &n, &k) != EOF) { get_Factor(n); ll l = 0, r = 1e17, mid; while(l <= r) { mid = (l + r) >> 1; if(mid - cal(mid) < k) l = mid + 1; else r = mid - 1; } printf("%lld\n", l); }}
第二种方法利用了欧几里德算法,gcd(a, b) = gcd(b, a % b),令a = km + i,b = m则有:
gcd(km + i, m) = gcd(i, m),说明与m互质的数对m取模有周期性,因此设小于m且与m互质的数有cnt个,第i个为ai,则第m*cnt+i个为m*cnt+ai,其次要注意k整除cnt的时候,取到的实际上是a[cnt]而不是a[0],这个方法跑了2400ms+
#include <cstdio>int const MAX = 1e6 + 5;int a[MAX];int gcd(int a, int b){ while(b) { int tmp = a; a = b; b = tmp % b; } return a;}int main(){ int m, k; while(scanf("%d %d", &m, &k) != EOF) { if(k == 1) { printf("1\n"); continue; } if(m == 1) { printf("%d\n", k); continue; } int cnt = 1; for(int i = 1; i <= m; i++) if(gcd(i, m) == 1) a[cnt ++] = i; cnt --; if(k % cnt == 0) printf("%d\n", (k / cnt - 1) * m + a[cnt]); else printf("%d\n", (k / cnt) * m + a[k % cnt]); }}
0 0
- POJ 2773 Happy 2006 (分解质因数+容斥+二分 或 欧几里德算法应用)
- POJ 2773 Happy 2006 解题报告(容斥原理+质因数分解)
- POJ 2773 Happy 2006 二分+容斥
- POJ 2773 Happy 2006 (二分+容斥)
- POJ 2773 Happy 2006 二分+容斥原理
- POJ 2773 Happy 2006 【数论,容斥原理+二分】
- [二分+容斥原理] poj 2773 Happy 2006
- poj 2773 Happy 2006(容斥原理+二分)
- [POJ 2773]Happy 2006(容斥原理+二分查找)
- POJ 2773 Happy 2006 (二分答案+容斥)
- POJ 2773 Happy 2006 (容斥原理+二分)
- POJ 2773Happy 2006 二分+容斥(入门
- POJ 2773 Happy 2006(二分+容斥)
- poj 2773 Happy 2006 容斥原理+筛素数+二分
- POJ 2773 Happy 2006(容斥原理+二分)
- poj 2773 Happy 2006(容斥+二分)
- POJ-2773 Happy 2006(容斥,二分,dfs)
- POJ 2773 Happy 2006 容斥定理+二分
- UML类图实例
- Codeforces 7B
- A008-drawable资源
- java核心技术 卷一 第2-3章 安装java开发工具箱和 java的基本程序设计结构
- iOS开发时读取plist文件创建和读取的方法
- POJ 2773 Happy 2006 (分解质因数+容斥+二分 或 欧几里德算法应用)
- eclipse下修改包名
- 巧用Loadrunner自动关联
- 运营商渗透测试John the ripper
- html5新增的常用元素
- 二叉树的镜像
- scala学习之:ListBuffer、ArrayBuffer、Queue、Stack的操作代码实战
- hdu 1878 欧拉回路(简单欧拉回路)
- RubyGem默认源安装太慢,修改国内淘宝源