#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n , res = 0 ;
cin >> n;
for(long long i = 1 ; i <= n ; i *= 10)
{
long long carry = i * 10;
res += (n / carry) * i + min(max(n % carry - i + 1 , 0ll) , i);
}
cout << res ;
return 0;
}
PAT 甲级1049 Counting Ones (30分)
最新推荐文章于 2024-07-09 22:37:42 发布