UVA10325 The Lottery(容斥原理)
来源:互联网 发布:面向对象编程原则 编辑:程序博客网 时间:2024/05/29 05:55
题意:
给n,m,和m个数(k1~km)。求1~n中有多少个数不是(k1~km)中任意一数的倍数。
题解:
容斥模板题。反面考虑,a的倍数有n/a个;既是a,也是b的倍数,即lcm(a,b)的倍数有n/lcm(a,b)个。是a,b,c的倍数,即lcm(a,b,c)的倍数有n/lcm(a,b,c)个。
#include<iostream>#include<cstdio>#include<algorithm>using namespace std;typedef long long LL;LL a[20],m;LL n,ans; LL lcm(LL a,LL b){ return a/__gcd(a,b)*b;} void dfs(int c,int cur,int i,LL ans1) //dfs(c,1,i,0,1);{ if(cur==c+1) { if(c&1) ans-=n/ans1; else ans+=n/ans1; return; } for(;i<m;i++) { dfs(c,cur+1,i+1,lcm(ans1,a[i])); }} int main(){ while(cin>>n>>m) { for(int i=0;i<m;i++) scanf("%lld",&a[i]); ans=n; for(int c=1;c<=m;c++) dfs(c,1,0,1); printf("%lld\n",ans); }}
The Lottery
Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu
Submit Status
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^31) 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(容斥原理)
- UVa10325 - The Lottery(容斥原理)
- UVA10325:The Lottery (容斥)
- UVA10325--- The Lottery (容斥)
- UVA10325--- The Lottery (容斥)
- UVa10325 - The Lottery(容斥+最小公倍数)
- 【UVA10325】The Lottery——简单容斥定理
- uva 10325 The Lottery(组合数学-容斥原理)
- UVA 10325 The Lottery(容斥原理)
- UVA 10325 The Lottery(容斥原理)
- UVA 10325 The Lottery( 容斥原理)
- UVa 10325 The Lottery 容斥原理
- UVA 10325 - The Lottery ( 容斥 )
- uva 10325 The Lottery 枚举子集+容斥原理
- The Lottery uva+容斥原理+求最小公倍数(多个数)
- UVA 10325 The Lottery (组合数学,容斥原理,二进制枚举)
- uva 10325 The Lottery (容斥原理)dfs枚举 或二进制枚举
- UVA10325(容斥定理)
- GCD
- hihocoder 1089:403 Forbidden
- 初级cnn研究辅助:python的matplotlib显示图片 之 按钮和触发事件
- ResultSet总结
- ACM刷题之HDU————最少拦截系统(贪心)
- UVA10325 The Lottery(容斥原理)
- Static block(class initializer)
- 设计模式之迭代器模式
- Android学习(15) --在外部存储读写数据相关
- 前两年做了个三维重建程序
- java abstract类和interface的区别,精辟!
- Java注解
- Android学习(16) --获取sd卡剩余容量的代码
- hdu4059 The Boss on Mars(差分+容斥原理)