Submission #5,947

2023-10-06 09:05:10

cpp17

Accepted 40/40

3ms

3960 KiB

#include <bits/stdc++.h>
using namespace std;
#define f(i,k,n) for(int i=k; i<n; i++)
#define ll long long
const int inf = INT_MAX;

void solve()
{
    string n;
    cin>>n;
    int l=n.length();
    int c=0;
    f(i,0,l)    c+=n[i]-'0';
    if(n[0]!='1' && c==n[0]-'0')   c+=9*(l-1);
    c+=(9*l*(l-1))>>1;
    cout<<c;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin>>t;
    while(t--)  solve();
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	40/40
		1	Accepted	0/0	3ms	1832 KiB
		2	Accepted	0/0	2ms	2020 KiB
		3	Accepted	0/0	2ms	2252 KiB
		4	Accepted	2/2	3ms	2440 KiB
		5	Accepted	2/2	3ms	2652 KiB
		6	Accepted	2/2	3ms	2868 KiB
		7	Accepted	2/2	2ms	2952 KiB
		8	Accepted	2/2	2ms	3080 KiB
		9	Accepted	2/2	3ms	3164 KiB
		10	Accepted	2/2	2ms	3168 KiB
		11	Accepted	4/4	3ms	3292 KiB
		12	Accepted	4/4	3ms	3524 KiB
		13	Accepted	2/2	3ms	3520 KiB
		14	Accepted	2/2	3ms	3752 KiB
		15	Accepted	2/2	2ms	3712 KiB
		16	Accepted	2/2	2ms	3696 KiB
		17	Accepted	2/2	3ms	3960 KiB
		18	Accepted	2/2	2ms	3908 KiB
		19	Accepted	3/3	3ms	3912 KiB
		20	Accepted	3/3	2ms	3908 KiB