59442023-10-06 08:48:04mmatedSzámjegy keveréscpp17Wrong answer 32/403ms4764 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';
    c+=1+(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;
}
SubtaskSumTestVerdictTimeMemory
base32/40
1Accepted0/03ms1832 KiB
2Accepted0/03ms2176 KiB
3Accepted0/02ms2200 KiB
4Accepted2/23ms2388 KiB
5Accepted2/23ms2488 KiB
6Accepted2/23ms2704 KiB
7Accepted2/23ms2924 KiB
8Accepted2/23ms3140 KiB
9Accepted2/23ms3360 KiB
10Accepted2/23ms3848 KiB
11Accepted4/42ms3772 KiB
12Wrong answer0/42ms3776 KiB
13Accepted2/22ms3868 KiB
14Accepted2/23ms4204 KiB
15Accepted2/23ms4196 KiB
16Wrong answer0/22ms4156 KiB
17Wrong answer0/23ms4172 KiB
18Accepted2/23ms4488 KiB
19Accepted3/33ms4596 KiB
20Accepted3/33ms4764 KiB