Lukujono

#include <iostream>
#include <vector>
using namespace std;

long long d[1010101];


long long o(int n){
  if (n<1010101) if (d[n]) return d[n];
  
  long long s=0;
  int i=2;
  for (; i<=n && n/i!=(n/(i+1)); ++i){
    s+=o(n/i);
  }
  for (int w=n/i; w>=1; --w){
    s+=o(w)*((n/w-n/(w+1)));
  }
  if (n<1010101) d[n]=s;
  return s;
}

int main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  d[1]=1;d[2]=1;d[3]=2;
  int n;
  cin >> n;
  cout << o(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