Gym - 101982B Coprime Integers（容斥原理）

#include<bits/stdc++.h> using namespace std; typedef long long ll; ll ans, p = 0, maxx, a, b, c, d; ll prim[10000007],num[10000005]; void dfs(ll x, ll sum, ll num) { if(num > maxx)return; if(

>>阅读原文<<