题目
思路
纯数学题,要学会转换,求1~num中1的个数,可以分别将num的各个位置1,然后将其他的位例举可能出现的数字累加,有的数字会重复,如111,110等等,我们发现重复的次数刚好是数字中1的个数,所以累加就行了,当然例举可能出现的数字要考虑不同的情况,要考虑当前置1的位为0,1,2的情况,其他位可能的数字都不相同
代码
#include <iostream>
#include <string>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<list>
#include<sstream>
#include<string.h>
#include<math.h>
using namespace std;
#define nmax 3000
#define inf 999999
inline long long getSum1(string num,int index){
stringstream s;
if (index == 0)
return 1;
for (int i = 0; i < index; ++i)
s << num[i];
long long ans;
s >> ans;
if (num[index] == '0')
{
ans -= 1;
}
return ans+1;
}
inline long long getSum2(string num, int index) {
int size = num.length() - 1 - index;
if (size == 0) {
return 1;
}
return 1LL*pow(10, size);
}
inline long long getSum3(string num, int index) {
int result1, result2;
if (index == 0)
result1 = 0;
else {
stringstream s1;
for (int i = 0; i < index; ++i)
s1 << num[i];
s1 >> result1;
}
int size = num.length() - 1 - index;
if (size == 0)
result2 = 0;
else {
stringstream s2;
for (int i = index+1; i < num.length(); ++i)
s2 << num[i];
s2 >> result2;
}
return (result1) * pow(10, size) + result2+1;
}
int main()
{
string num;
cin >> num;
long sum = 0;
for (int i = 0; i < num.length(); ++i) {
if (num[i] == '1')
sum+=getSum3(num,i);
else
sum += getSum1(num,i) * getSum2(num,i);
}
cout << sum;
return 0;
}