#if !__INCLUDE_LEVEL__ #include __FILE__ /* divisor(n) 入力:整数 n 出力:nのすべての約数 計算量:O(√n) */ vector divisor(long long n) { vector ret; for (long long i = 1; i * i <= n; i++) { if (n % i == 0) { ret.push_back(i); if (i * i != n) ret.push_back(n / i); } } sort(ret.begin(), ret.end()); // 昇順に並べる return ret; } void solve(){ ll N,K; cin>>N>>K; vector n = divisor(N); set S; rep(i,sz(n)){ if(n[i]+K<=N)S.insert(n[i]+K); } cout< #include using namespace std; using namespace atcoder; #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #define FOR(i,l,r) for(int i=(l);i<(r);++i) #define rep(i,n) FOR(i,0,n) using ll = long long; using ull = unsigned long long; using pii = pair; using pll = pair; using vi = vector; using vs = vector; using vll = vector; #define pf push_front #define pb push_back #define mp make_pair #define fi first #define se second #define sz(x) ((int)x.size()) #define pqueue priority_queue #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() int dx[4] = {1, 0, -1, 0}; int dy[4] = {0, 1, 0, -1}; #define INF (1<<30)-1 #define INFLL (1LL<<60)-1 #define pcnt __builtin_popcount #define bit(n) (1LL<<(n)) #define UNIQUE(v) v.erase(unique(v.begin(),v.end()),v.end()); template void out(T vec){for(int c:vec)cout< bool chmax(T &a,const T& b){if(a bool chmin(T &a,const T& b){if(a>b){a=b;return true;}return false;} void solve(); // const int mod = ; // using mint = modint998244353; // using mint = modint1000000007; #ifdef LOCAL # include # define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else # define debug(...) (static_cast(0)) #endif int main(){ cin.tie(0); ios::sync_with_stdio(0); cout<