题意
给你一个正整数N,找出有多少个整数对(x,y),满足如下条件,答案对998244353取模
- 1 <= N <= 1012
- 1<= x,y <=N.
- x*x-y是一个完全平方数.(此处0也是完全平方数)
思路
x2 - y = z2
x2 - z2 = y
(x - z)(x + z) = y
设 l = x - z, r = x + z
由题意知z >= 0,
又由上式可知, 1 <= l <= sqrt(n),l <= r <= n / l 。同时,r 与 l 同奇偶。
则,枚举l ,求出r的个数累加即为所求。
#include<cstdio>
#include<queue>
#include<set>
#include<cstdlib>
#include<string.h>
#include<string>
#include<iostream>
#include<cmath>
#include<map>
#include<algorithm>
#define endl "\n"
#define IOS ios::sync_with_stdio(0), cin.tie(0),cout.tie(0)
#define ft first
#define sd second
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ll long long int
#define mt(a,b) memset(a, b, sizeof a)
//#define int long long
const double PI = acos(-1.0);
const int inf = 0x3f3f3f3f;
const int INF = 0x7fffffff;
using namespace std;
const int N = 2e5 + 7, M = 1e6;
int main()
{
IOS;
ll n; cin >> n;
ll ans = 0;
ll m = sqrt(n);
for (int i = 1; i <= m; i++)//这里若为 i * i <= n,注意要定义为ll型,否则会溢出
{
ll l = i, r = n / i;//注意r的数据溢出,防止爆int
if (l & 1)
{
if (r & 1) r++;//保证l,r异号,则奇数个数即为区间长度的一半
ans = (ans + (r - l + 1) / 2) % 998244353;
}
else
{
if ((r & 1) == 0) r++;//同上
ans = (ans + (r - l + 1) / 2) % 998244353;
}
}
cout << ans << endl;
return 0;
}