Codeforces Round 942 (Div. 2) D2. Reverse Card (Hard Version)

题目

题解：

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
#define lson p << 1
#define rson p << 1 | 1
#define ll long long
#define pii pair<int, int>
#define ld long double
const int maxn = 1e6 + 5, inf = 1e18, maxm = 4e4 + 5, base = 37;
const int N = 2e6;
const int mod = 1e9 + 7;
// const int mod = 998244353;
// const __int128 mod = 212370440130137957LL;
int n, m;int qpow(int a, int b){int res = 1;while(b){if(b & 1) res = res * a % mod;a = a * a % mod;b >>= 1;}return res;
}
//long long ? maxn ? n? m?
void solve(){ll res = 0;int k;cin >> n >> m;vector<int> a(n + 1);// for(int i = 1; i <= n; i++){// 	cin >> a[i];// }for(int p = 1; p * p <= n; p++){for(int q = 1; q * q <= m; q++){int g = __gcd(p, q);if(g != 1) continue;res += min(n / p, m / q) / (p + q);}}cout << res << '\n';
}signed main(){ios::sync_with_stdio(0);cin.tie(0);cout << fixed << setprecision(9);int T = 1;cin >> T;while (T--){solve();}return 0;
}