题目大意
题解
代码
#include<cstdio>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
typedef long long LL;
const LL mo=2;
int n,a,b;
LL f(LL a,LL b,LL c,LL n)
{
if (!a) return (n+1)*(b/c)%mo;
if (a>=c || b>=c)
{
LL sqr=(n&1) ?(n+1)/2*n :n/2*(n+1) ;
return (f(a%c,b%c,c,n)+(a/c)*sqr+(n+1)*(b/c))%mo;
} else
{
LL m=(a*n+b)/c;
return (m*n-f(c,c-b-1,a,m-1)+mo)%mo;
}
}
int T;
int main()
{
scanf("%d",&T);
while (T--)
{
scanf("%d %d %d",&n,&a,&b);
LL ans=0;
fd(x,62,0)
{
LL c=1ll<<x;
if (f(b,a,c,n-1)) ans+=c;
}
printf("%lld\n",ans);
}
}