拓展gcd
doggyzheng
初二蒟蒻一枚
展开
-
拓展gcd
void gcd(int a,int b) { int x1,y1; if ((a==1)&&(b==0)) { x=1;y=0; return; } gcd(b,a%b); x1=x; y1=y; x=y1; y=x1-(a/b)*y1; }原创 2017-12-28 19:00:10 · 221 阅读 · 0 评论 -
JZOJ5796. 2018.08.10【2018提高组】模拟A组&省选 划分(二项式反演容斥+拓展GCD)
description有mmm个数a[1..m]a[1..m]a[1..m],对于a[i]a[i]a[i],我们可以知道∑k∗a[i]i=(k−1)∗a[i]+1x[i](k∗a[i]<=n)∑i=(k−1)∗a[i]+1k∗a[i]x[i](k∗a[i]<=n)\sum_{i=(k-1)*a[i]+1}^{k*a[i]} x[i](k*a[i]x[i]x[i]x[i]...原创 2018-08-10 21:17:16 · 240 阅读 · 0 评论