HDU 5768 Lucky7 中国剩余定理+状压+容斥+快速乘法
来源:互联网 发布:excel2013数据分级显示 编辑:程序博客网 时间:2024/06/05 08:22
Lucky7
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1550 Accepted Submission(s): 577
Problem Description
When ?? was born, seven crows flew in and stopped beside him. In its childhood, ?? had been unfortunately fall into the sea. While it was dying, seven dolphins arched its body and sent it back to the shore. It is said that ?? used to surrounded by 7 candles when he faced a extremely difficult problem, and always solve it in seven minutes.
?? once wrote an autobiography, which mentioned something about himself. In his book, it said seven is his favorite number and he thinks that a number can be divisible by seven can bring him good luck. On the other hand, ?? abhors some other prime numbers and thinks a number x divided by pi which is one of these prime numbers with a given remainder ai will bring him bad luck. In this case, many of his lucky numbers are sullied because they can be divisible by 7 and also has a remainder of ai when it is divided by the prime number pi.
Now give you a pair of x and y, and N pairs of ai and pi, please find out how many numbers between x and y can bring ?? good luck.
?? once wrote an autobiography, which mentioned something about himself. In his book, it said seven is his favorite number and he thinks that a number can be divisible by seven can bring him good luck. On the other hand, ?? abhors some other prime numbers and thinks a number x divided by pi which is one of these prime numbers with a given remainder ai will bring him bad luck. In this case, many of his lucky numbers are sullied because they can be divisible by 7 and also has a remainder of ai when it is divided by the prime number pi.
Now give you a pair of x and y, and N pairs of ai and pi, please find out how many numbers between x and y can bring ?? good luck.
Input
On the first line there is an integer T(T≤20) representing the number of test cases.
Each test case starts with three integers three intergers n, x, y(0<=n<=15,0<x<y<1018 ) on a line where n is the number of pirmes.
Following on n lines each contains two integers pi, ai where pi is the pirme and ?? abhors the numbers have a remainder of ai when they are divided by pi.
It is guranteed that all the pi are distinct and pi!=7.
It is also guaranteed that p1*p2*…*pn<=1018 and 0<ai<pi<=105 for every i∈(1…n).
Each test case starts with three integers three intergers n, x, y(0<=n<=15,0<x<y<
Following on n lines each contains two integers pi, ai where pi is the pirme and ?? abhors the numbers have a remainder of ai when they are divided by pi.
It is guranteed that all the pi are distinct and pi!=7.
It is also guaranteed that p1*p2*…*pn<=
Output
For each test case, first output "Case #x: ",x=1,2,3...., then output the correct answer on a line.
Sample Input
22 1 1003 25 30 1 100
Sample Output
Case #1: 7Case #2: 14HintFor Case 1: 7,21,42,49,70,84,91 are the seven numbers.For Case2: 7,14,21,28,35,42,49,56,63,70,77,84,91,98 are the fourteen numbers.
Author
FZU
Source
2016 Multi-University Training Contest 4
Recommend
wange2014 | We have carefully selected several similar problems for you: 5932 5931 5930 5928 5925
求l,r范围是7的倍数 并且满足一些同余方程的数有几个。
因为n只有15个,很快想到了用容斥来做。
然后对所有的可能,跑中国剩余定理就行了
#include <bits/stdc++.h>using namespace std;#define N 20#define LL long longLL a[N], m[N];int s[N], n;LL extend_Euclid(LL a, LL b, LL &x, LL &y){ if(b==0) { x = 1; y = 0; return a; } LL r = extend_Euclid(b, a%b, y, x); y -= a/b*x; return r;}LL gao(LL x, LL r, LL p){ return (x-r)/p;}LL mult(LL a, LL k, LL m){ LL res = 0; while(k) { if(k & 1LL) res = (res + a) % m; k >>= 1; a = (a << 1) % m; } return res;}LL China(LL l, LL r){ LL M = 1, ans = 0; for (int i = 0; i <= n; ++i) if(s[i]) { M *= m[i]; } for(int i = 0; i <= n; i++) if(s[i]) { LL Nn = M/m[i]; LL x, y; extend_Euclid(Nn, m[i], x, y); x = (x%m[i] + m[i]) % m[i]; ans = ((ans+mult(a[i]*Nn%M, x, M))%M + M) % M ; } LL ret = gao(r+M, ans, M) - gao(l-1+M, ans, M); return ret;}int main(){ int T, o = 0; scanf("%d", &T); while(T--) { LL l, r; scanf("%d%lld%lld", &n, &l, &r); memset(s, 0, sizeof(s)); m[n] = 7; a[n] = 0; s[n] = 1; for(int i = 0; i < n; i++) scanf("%lld%lld", &m[i], &a[i]); LL ans = 0; int all = 1 << n; for(int i = 0; i < all; i++) { int t = i, k = 0; for(int j = 0; j < n; j++) { s[j] = t & 1; t >>= 1; k += s[j]; } k = k & 1 ? -1 : 1; ans += 1LL * k * China(l, r); } printf("Case #%d: %lld\n", ++o, ans); } return 0;}
0 0
- HDU 5768 Lucky7 中国剩余定理+状压+容斥+快速乘法
- 【中国剩余定理】【容斥原理】【快速乘法】【数论】HDU 5768 Lucky7
- HDU 5768Lucky7(多校第四场)容斥+中国剩余定理(扩展欧几里德求逆元的)+快速乘法
- HDU 5768 (Lucky7 中国剩余定理+容斥原理)
- HDU-5768-Lucky7(中国剩余定理+容斥)
- HDU 5768Lucky7-中国剩余定理+容斥原理
- HDU 5768 Lucky7(中国剩余定理+容斥原理)
- hdu 5768 Lucky7 容斥原理 中国剩余定理
- HDU 5768 Lucky7 数论 中国剩余定理
- HDU 5768 Lucky7 中国剩余定理
- HDU-5768-Lucky7-中国剩余定律+容斥
- HDU5768 Lucky7[中国剩余定理+容斥定理]
- hdu5768 Lucky7 中国剩余定理 + 容斥原理
- HDU5768:Lucky7(中国剩余定理 & 容斥)
- HDU 5768 Lucky7(2016 Multi-University Training Contest 4 -1005)——中国剩余定理 + 容斥原理
- HDU 5768 (中国剩余定理 容斥)
- HDU 5768(中国剩余定理+容斥定理)
- (中国剩余定理模版)hdoj 5768 Lucky7
- BeanUtils入门
- 【UE4学习】15_UE4读取CSV文件并使用
- 01-JNI-基础
- 枚举类型
- 阿里一面总结
- HDU 5768 Lucky7 中国剩余定理+状压+容斥+快速乘法
- 逆向过程中全局变量和局部变量的识别
- HDU 5924 Mr. Frog’s Problem(想看证明的来)——2016CCPC东北地区大学生程序设计竞赛 - 重现赛
- 图的广度优先搜索与深度优先搜索
- MATLAB数组乘方
- selenium:1.关于安装selenium的坑
- 短路保护、过载保护、零压保护的概念
- 关于全排列 next_permutation() 函数的用法
- 椭圆滤波器与巴特沃斯、切比雪夫的比较和实现