----Gcd
文章平均质量分 75
_Occult_
物語が始まった
展开
-
HDU 5320 Fan Li
Description Fan Li (范蠡) was an ancient Chinese advisor in the state of Yue in the Spring and Autumn period. He is a successful militarist and a successful business man. He is one of the main charac原创 2016-09-11 20:33:42 · 470 阅读 · 0 评论 -
CodeForces 475D CGCDSSQ
Description Given a sequence of integers a1, ..., an and q queries x1, ..., xq on it. For each query xi you have to count the number of pairs (l, r)such that 1 ≤ l ≤ r ≤ n and gcd(al, al + 1, ...原创 2016-09-02 15:17:19 · 552 阅读 · 0 评论 -
POJ 3970 Party
Description The CEO of ACM (Association of Cryptographic Mavericks) organization has invited all of his teams to the annual all-hands meeting, being a very disciplined person, the CEO decided to gi原创 2016-09-02 13:54:21 · 623 阅读 · 0 评论 -
HDU 2504 又见GCD
Description 有三个正整数a,b,c(0 Input 第一行输入一个n,表示有n组测试数据,接下来的n行,每行输入两个正整数a,b。 Output 输出对应的c,每组测试数据占一行。 Sample Input 2 6 2 12 4 Sample Output 4 8 没什么好说原创 2016-09-02 13:46:58 · 350 阅读 · 0 评论 -
HDU 1788 Chinese remainder theorem again
Description 我知道部分同学最近在看中国剩余定理,就这个定理本身,还是比较简单的: 假设m1,m2,…,mk两两互素,则下面同余方程组: x≡a1(mod m1) x≡a2(mod m2) … x≡ak(mod mk) 在0 记Mi=M/mi(1 ei≡0(mod mj),j!=i ei≡1(mod mj),j=i 很显然,e1a1+e2a2+…原创 2016-09-01 21:59:44 · 385 阅读 · 0 评论 -
HDU 5381 The sum of gcd
Description You have an array ,the length of is Let Input There are multiple test cases. The first line of input contains an integer T, indicating the number of test cases. Fo原创 2016-09-02 18:11:14 · 529 阅读 · 0 评论 -
CSU 1803 2016
Description 给出正整数 n 和 m,统计满足以下条件的正整数对 (a,b) 的数量: 1. 1≤a≤n,1≤b≤m; 2. a×b 是 2016 的倍数。 Input 输入包含不超过 30 组数据。 每组数据包含两个整数 n,m原创 2016-09-03 21:48:25 · 491 阅读 · 0 评论