Lukujono

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
map<ll, ll> mem;
ll f(ll n) {
  if (mem.count(n)) return mem[n];
  ll res = 0;
  ll d = 1;
  for (; d*d < n; ++d) {
    ll mu = n / d - n / (d+1);
    res += mu * f(d);
  }
  ll dm = d-1;
  for (; d >= 2; --d) {
    if (n / d <= dm) continue;
    res += f(n / d);
  }
  mem[n] = res;
  return res;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long n;
  cin >> n;
  mem[0] = 0;
  mem[1] = 1;
  cout << f(n) << endl;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 1

Verdict: ACCEPTED

Test 7

Group: 1

Verdict: ACCEPTED

Test 8

Group: 1

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: ACCEPTED

Test 12

Group: 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: ACCEPTED

Test 14

Group: 2

Verdict: ACCEPTED

Test 15

Group: 2

Verdict: ACCEPTED

Test 16

Group: 2

Verdict: ACCEPTED

Test 17

Group: 3

Verdict: ACCEPTED

Test 18

Group: 3

Verdict: ACCEPTED

Test 19

Group: 3

Verdict: ACCEPTED

Test 20

Group: 3

Verdict: ACCEPTED

Test 21

Group: 3

Verdict: ACCEPTED

Test 22

Group: 3

Verdict: ACCEPTED

Test 23

Group: 3

Verdict: ACCEPTED

Test 24

Group: 3

Verdict: ACCEPTED