[类欧几里得算法 数论] BZOJ 3817 Sum

类欧的变形

 #include<cstdio> 
#include<cstdlib>
#include<algorithm>
#include<cstring>  
#include<cmath>  
using namespace std;  
typedef long long ll; 
 
inline char nc(){
	static char buf[100000],*p1=buf,*p2=buf;
	if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
	return *p1++;
}

inline void read(ll &x)
{
	char c=nc(),b=1;
	for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
	for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
} 

ll n,m; double t;

ll gcd(ll a,ll b){ return b?gcd(b,a%b):a; } 
 
inline ll Solve(ll n,ll a,ll b,ll c){  
	if (!n) 
		return 0;  
	ll g=gcd(gcd(a,b),c); a/=g,b/=g,c/=g;  
	ll k=(t*b+c)/a; 
	ll ret=n*(n+1)/2*k;
	c-=k*a; k=(t*b+c)/a*n;  
	ret+=n*k;
	ret-=Solve(k,b*b*m-c*c,a*b,-a*c);  
	return ret;
}  
int main(){
	freopen("t.in","r",stdin);
	freopen("t.out","w",stdout);
	ll T;
	read(T);  
	while (T--){  
		read(n); read(m); t=sqrt(m);  
		if ((ll)t==t) 
			printf("%lld\n",(m&1)?((n&1)?-1:0):n);  
		else 
			printf("%lld\n",n+(Solve(n,2,1,0)<<2)-(Solve(n,1,1,0)<<1));  
	} 
	return 0;  
}