#ifdef _DEBUG #include "MyLib.h" #else #define main_B main #include "bits/stdc++.h" #include #define _USE_MATH_DEFINES #include #define FOR(i,s,e) for (int i = int(s); i < int(e); ++i) #define REP(i,e) FOR(i,0,e) #define INF (INT_MAX/2) #define EPS (1.0e-8) #define LINF (LONG_MAX/2) const int MGN = 8; const int ARY_SZ_MAX = 10000000; using namespace std; using ll = long long; using ull = unsigned long long; using vi = vector; using vvi = vector; using vvvi = vector; using vb = vector; using vvb = vector; using vvvb = vector; using vl = vector; using vvl = vector; using vd = vector; using vs = vector; using pii = pair; using pll = pair; // functions struct DSU { int N; vi dt; DSU(int n) : N(n), dt(n, -1) {} int root(int v){ if (dt[v] < 0) return v; return dt[v] = root(dt[v]); } bool unite(int x, int y) { x = root(x); y = root(y); if (x == y) return false; if (size(x) < size(y)) swap(x,y); dt[x] += dt[y]; dt[y] = x; return true; } int size(int v) {return -dt[root(v)];} }; #endif int main_B() { cin.tie(0); ios::sync_with_stdio(false); int N, P; cin >> N >> P; DSU un(N+1); FOR(i,2,N) { FOR(j,i+1,N+1) { if (j%i == 0) un.unite(j, i); } } int ans = 0; FOR(i,1,N+1) { if (un.root(i) == un.root(P)) ans++; } cout << ans << endl; return 0; }