Submission #70031586
Source Code Expand
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
ll f(ll x){
string x_str = to_string(x);
ll ret = 0;
for(char c : x_str) ret += c - '0';
return ret;
}
map<ll, ll> memo;
ll A(ll i){
if(i == 0) return 1;
if(memo.find(i) != memo.end()) return memo[i];
ll ret = 0;
for(int j = 0; j < i; j++) ret += f(A(j));
memo[i] = ret;
return ret;
}
int main(){
ll n;
cin >> n;
cout << A(n) << endl;
}
Submission Info
| Submission Time | |
|---|---|
| Task | B - Sum of Digits Sequence |
| User | sakimori_coder |
| Language | C++ 20 (gcc 12.2) |
| Score | 200 |
| Code Size | 495 Byte |
| Status | AC |
| Exec Time | 1 ms |
| Memory | 3660 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 200 / 200 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample00.txt, sample01.txt |
| All | sample00.txt, sample01.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| sample00.txt | AC | 1 ms | 3576 KiB |
| sample01.txt | AC | 1 ms | 3512 KiB |
| testcase00.txt | AC | 1 ms | 3500 KiB |
| testcase01.txt | AC | 1 ms | 3552 KiB |
| testcase02.txt | AC | 1 ms | 3564 KiB |
| testcase03.txt | AC | 1 ms | 3660 KiB |
| testcase04.txt | AC | 1 ms | 3600 KiB |
| testcase05.txt | AC | 1 ms | 3516 KiB |
| testcase06.txt | AC | 1 ms | 3660 KiB |
| testcase07.txt | AC | 1 ms | 3500 KiB |
| testcase08.txt | AC | 1 ms | 3564 KiB |
| testcase09.txt | AC | 1 ms | 3508 KiB |
| testcase10.txt | AC | 1 ms | 3556 KiB |
| testcase11.txt | AC | 1 ms | 3536 KiB |