CSES - Datatähti 2015 loppu - Results
Submission details
Task:Lukujono
Sender:PT
Submission time:2015-01-29 14:39:19
Language:C++
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED16
#2ACCEPTED34
#3ACCEPTED50
Test results
testverdicttimegroup
#1ACCEPTED0.06 s1details
#2ACCEPTED0.08 s1details
#3ACCEPTED0.07 s1details
#4ACCEPTED0.06 s1details
#5ACCEPTED0.06 s1details
#6ACCEPTED0.07 s1details
#7ACCEPTED0.06 s1details
#8ACCEPTED0.06 s1details
#9ACCEPTED0.06 s2details
#10ACCEPTED0.07 s2details
#11ACCEPTED0.06 s2details
#12ACCEPTED0.06 s2details
#13ACCEPTED0.05 s2details
#14ACCEPTED0.06 s2details
#15ACCEPTED0.06 s2details
#16ACCEPTED0.06 s2details
#17ACCEPTED1.34 s3details
#18ACCEPTED1.56 s3details
#19ACCEPTED1.06 s3details
#20ACCEPTED1.63 s3details
#21ACCEPTED1.35 s3details
#22ACCEPTED1.63 s3details
#23ACCEPTED1.07 s3details
#24ACCEPTED1.66 s3details

Code

#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 details

Test 1

Group: 1

Verdict: ACCEPTED

input
542

correct output
11942

user output
11942

Test 2

Group: 1

Verdict: ACCEPTED

input
929

correct output
29913

user output
29913

Test 3

Group: 1

Verdict: ACCEPTED

input
801

correct output
23460

user output
23460

Test 4

Group: 1

Verdict: ACCEPTED

input
935

correct output
30006

user output
30006

Test 5

Group: 1

Verdict: ACCEPTED

input
998

correct output
33766

user output
33766

Test 6

Group: 1

Verdict: ACCEPTED

input
942

correct output
30490

user output
30490

Test 7

Group: 1

Verdict: ACCEPTED

input
736

correct output
20285

user output
20285

Test 8

Group: 1

Verdict: ACCEPTED

input
930

correct output
29975

user output
29975

Test 9

Group: 2

Verdict: ACCEPTED

input
95404

correct output
90172356

user output
90172356

Test 10

Group: 2

Verdict: ACCEPTED

input
98060

correct output
94687572

user output
94687572

Test 11

Group: 2

Verdict: ACCEPTED

input
69495

correct output
52308390

user output
52308390

Test 12

Group: 2

Verdict: ACCEPTED

input
92197

correct output
85306979

user output
85306979

Test 13

Group: 2

Verdict: ACCEPTED

input
53418

correct output
32957881

user output
32957881

Test 14

Group: 2

Verdict: ACCEPTED

input
97377

correct output
93859995

user output
93859995

Test 15

Group: 2

Verdict: ACCEPTED

input
68065

correct output
50223001

user output
50223001

Test 16

Group: 2

Verdict: ACCEPTED

input
95463

correct output
90201672

user output
90201672

Test 17

Group: 3

Verdict: ACCEPTED

input
74323456

correct output
8975396101231

user output
8975396101231

Test 18

Group: 3

Verdict: ACCEPTED

input
92132055

correct output
13006378374515

user output
13006378374515

Test 19

Group: 3

Verdict: ACCEPTED

input
55135704

correct output
5354656932672

user output
5354656932672

Test 20

Group: 3

Verdict: ACCEPTED

input
98613338

correct output
14631125716007

user output
14631125716007

Test 21

Group: 3

Verdict: ACCEPTED

input
75558302

correct output
9238208186405

user output
9238208186405

Test 22

Group: 3

Verdict: ACCEPTED

input
94968034

correct output
13713914468591

user output
13713914468591

Test 23

Group: 3

Verdict: ACCEPTED

input
52163652

correct output
4858985762438

user output
4858985762438

Test 24

Group: 3

Verdict: ACCEPTED

input
94830583

correct output
13674294022172

user output
13674294022172