Never give in.

Preface欧几里得算法，就是辗转相除法。 gcd(i,j)=gcd(j,i%j)定义定义函数 F(a,b,c,n)=∑i=0n⌊ai+bc⌋F(a,b,c,n)=\sum\limits_{i=0}^n \lfloor {ai+b\over c}\rfloor推导一波显然当a≥ca\geq c或者b≥cb\geq c时，F(a,b,c,n)=∑i=0n(⌊(amodc)i+(bmodc)c⌋+

Description 给出n,r 求∑i=1n(−1)⌊ir√⌋∑i=1n(−1)⌊ir⌋\Large \sum\limits_{i=1}^{n}(-1)^{\lfloor i\sqrt r\rfloor} T组数据 T,r<=10000,n<=10^9 Solution 转化式子 (−1)a=1−2×(amod2)(−1)a=1−2×(amod2)(-1)^a=1...