Squares
题目链接: link.
题意:
给定一个n,找一对x,y满足以下条件:
1≤x,y≤N;
x^2-y是个完全平方数(可以是0);
找出有多少对x,y满足条件;
N<=1e12;
#include <bits/stdc++.h>
using namespace std;
const int mod=998244353;
int main()
{
long long n;
cin>>n;
long long sum=0;
for(long long i=1;i*i<=n;i++)
{
long long j=n/i;
long long s=j-i+1;
sum=sum+(s+1)/2%mod;
}
cout<<sum%mod<<endl;
return 0;
}