1646E - Power Board - CodeForces Solution

               //  ॐ
#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define ld long double
typedef pair<int,int>       pii;
typedef vector<ll> vll;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<ll>>;
#define pb              push_back 
#define Sort(a)         sort(a.begin(),a.end())
#define ff                  first
#define ss                  second 
const int N = 2e3 +10;
const ll f = 2e18 + 7;

void solve(){
    ll n,m;
    cin>>n>>m;
    vi vis(n+1,0);
    ll ans=1,ct=0;
    vll dp(21,0);
    vll used(3e7,0);
    set<ll> st;

    for (ll i = 1; i < 21; ++i)
    {
        for (ll j = 1; j <= m; ++j)
            if(!used[i*j]) used[i*j]=1,ct++;
        dp[i]=ct;
    }

    for (ll i = 2; i <= n; ++i)
    {
        if(vis[i]) continue;
        vis[i]=1;
        ll ct=1,t=i;
        while(1){
            t*=i;
            if(t>n) break;
            ct++,vis[t]=1;
        }
        ans+=dp[ct];
    }
    cout<<ans;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t=1;
    // cin>>t;
    while(t--)
        solve();

    return 0;
}