Submission #5,946

2023-10-06 09:03:41

cpp17

Wrong answer 34/40

3ms

4444 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+=(n[0]-'1')*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	34/40
		1	Accepted	0/0	3ms	1828 KiB
		2	Accepted	0/0	3ms	2056 KiB
		3	Accepted	0/0	2ms	2268 KiB
		4	Accepted	2/2	2ms	2320 KiB
		5	Accepted	2/2	2ms	2320 KiB
		6	Accepted	2/2	2ms	2316 KiB
		7	Accepted	2/2	3ms	2448 KiB
		8	Accepted	2/2	3ms	2664 KiB
		9	Accepted	2/2	2ms	2752 KiB
		10	Accepted	2/2	2ms	2980 KiB
		11	Accepted	4/4	3ms	3092 KiB
		12	Wrong answer	0/4	3ms	3296 KiB
		13	Accepted	2/2	3ms	3664 KiB
		14	Accepted	2/2	2ms	3740 KiB
		15	Accepted	2/2	3ms	3992 KiB
		16	Accepted	2/2	2ms	3820 KiB
		17	Wrong answer	0/2	3ms	4080 KiB
		18	Accepted	2/2	3ms	4296 KiB
		19	Accepted	3/3	2ms	4360 KiB
		20	Accepted	3/3	3ms	4444 KiB