UVA10325 The Lottery【GCD+LCM】

The Sports Association of Bangladesh is in great problem with their latest lottery ‘Jodi laiga Jai’. There are so many participants this time that they cannot manage all the numbers. In an urgent meeting they have decided that they will ignore some numbers. But how they will choose those unlucky numbers!!! Mr. NondoDulal who is very interested about historic problems proposed a scheme to get free from this problem.
    You may be interested to know how he has got this scheme. Recently he has read the Joseph’s problem.
    There are N tickets which are numbered from 1 to N. Mr. Nondo will choose M random numbers and then he will select those numbers which is divisible by at least one of those M numbers. The numbers which are not divisible by any of those M numbers will be considered for the lottery.
    As you know each number is divisible by 1. So Mr. Nondo will never select 1 as one of those M numbers. Now given N, M and M random numbers, you have to find out the number of tickets which will be considered for the lottery.
Input
Each input set starts with two Integers N (10 ≤ N < 2³¹) and M (1 ≤ M ≤ 15). The next line will contain M positive integers each of which is not greater than N.
    Input is terminated by EOF.
Output
Just print in a line out of N tickets how many will be considered for the lottery.
Sample Input
10 2
2 3
20 2
2 4
Sample Output
3
10

问题链接：UVA10325 The Lottery
问题简述：给定整数n和m，以及m个正整数，求1~n中不能被这m个数字整除的数的个数？
问题分析：数论问题，不解释。
程序说明：（略）
参考链接：（略）
题记：（略）

AC的C++语言程序如下：

/* UVA10325 The Lottery */#include <bits/stdc++.h>using namespace std;const int M = 15;
int a[M];inline long long LCM(long long a, long long b)
{return a / __gcd(a, b) * b;
}int main()
{int n, m;while (scanf("%d%d", &n, &m) == 2) {for (int i = 0; i < m; i++)scanf("%d", &a[i]);int e = 1 << m, ans = n;for (int i = 1; i < e; i++) {long long lcm = 1LL;int cnt = 0;for (int j = 0; j < m; j++)if (i & (1 << j)) {lcm = LCM(lcm, a[j]);cnt++;}if (cnt & 1) ans -= n / lcm;else ans += n / lcm;}printf("%d\n", ans);}return 0;
}

UVA10325 The Lottery【GCD+LCM】相关推荐

HDU2028 Lowest Common Multiple Plus【GCD+LCM】
Lowest Common Multiple Plus Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java ...
【CF1230E】Kamil and Making a Stream【GCD性质】【暴力vector】
传送门题意:给一棵带点权的有根树,求所有满足uuu是vvv的祖先的路径(u,v)(u,v)(u,v)的路径上所有点权的gcdgcdgcd的和模1e9+71e9+71e9+7. N≤100000N \ ...
jzoj2700-数字【数论,LCM】
正题 luogu题目链接:https://www.luogu.org/problemnew/show/P4193 题目大意定义一个函数D(x)D(x)D(x)和S(x)S(x)S(x),S(x)S( ...
【备战蓝桥】JavaB组算法小讲解——GCD和LCM
大家好,这里是祁十一!今天为大家整理了一下GCD和LCM的内容. 目录一.GCD(最大公约数) 1.定义 2.性质 3.代码实现 <1>Java自带函数 <2>辗转相除法二 ...
【HDU4497 GCD and LCM】
题意:已知l,g其中g=gcd(x,y,z),l=lcm(x,y,z),问有x,y,z多少种组合使得关系成立. 题解:已知x%g=y%g=z%g=0,l%x=l%y=l%z=0,所以l ...
GCD and LCM Aizu - 0005（辗转相除）+GCD LCM Inverse POJ - 2429（java或【Miller Rabin素数測试】+【Pollar Rho整数分解】）
题目:GCD and LCM Aizu - 0005 Write a program which computes the greatest common divisor (GCD) and the ...
【数论Day1】最大公约数（gcd）题目
20170529-3数论_gcd 题解: http://www.cnblogs.com/ljc20020730/p/6919116.html 日期序号题目名称输入文件名输出文件名时限内存 ...
【学习笔记】关于最大公约数(gcd)的定理
[学习笔记]关于最大公约数(gcd)的定理手动博客搬家: 本文发表于20181004 00:21:28, 原地址https://blog.csdn.net/suncongbo/article/det ...
【UOJ#33】【UR #2】树上GCD（长链剖分/根号分类讨论）
[UOJ#33][UR #2]树上GCD 求解树上两个点到lca的距离的最大公约数是k的对数首先我们很容易就想到莫比乌斯反演,那么利用倍数形式,我们只需要求解是i的倍数的对数. 考虑枚举lca,这个 ...

UVA10325 The Lottery【GCD+LCM】

UVA10325 The Lottery【GCD+LCM】相关推荐

最新文章

热门文章