Lukujono

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define N 100001

unordered_map<int, ll> dp;
int deb = 0;

ll getU(int n) {
  ll sum = 0;
  if(dp.find(n) != dp.end()) return dp[n];
  ++deb;
  int lim = (int)sqrt(n);
  for(int i = 2; i <= n / lim; ++i) {
    sum += getU(n/i);
  }
  for(int i = 1; i < min(lim, n); ++i) {
    sum += getU(i) * (n / i - n / (i + 1));
  }
  dp[n] = sum;
  return sum;
}

int main() {
  // fill_n(dp, N, -1);
  dp[0] = 0;
  dp[1] = 1;
  int n;
  cin >> n;
  cout << getU(n) << "\n";
  return 0;
}

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