#include<iostream>
using namespace std;int Count(int n){int count = 0;//1的个数int CurrentPosition = 1;//当前位int LowerNum = 0;//低位数字int CurrNum = 0;//当前位数字int HigherNum = 0;//高位数字while(n / CurrentPosition != 0){LowerNum = n - (n / CurrentPosition) * CurrentPosition;//低位数字
        CurrNum = (n / CurrentPosition) % 10;//当前位数字
        HigherNum = n / (CurrentPosition * 10);//高位数字if(CurrNum == 0)//如果为0,出现1的次数由高位决定
        {count += HigherNum * CurrentPosition;//等于高位数字 * 当前位数
        }else if(CurrNum == 1)//如果为1,出现1的次数由高位和低位决定
        {count += HigherNum * CurrentPosition + LowerNum + 1;//高位数字 * 当前位数 + 低位数字 + 1
        }else//如果大于1,出现1的次数由高位决定
        {count += (HigherNum + 1) * CurrentPosition;//（高位数字+1）* 当前位数
        }CurrentPosition *= 10;//前移一位
    }return count;
}void main()
{int a;cout << "请输入一个正整数：";cin >> a;cout << a;cout << "从1到该数字出现的1的次数为：" << Count(a) << endl;for (int i = 0; i < 4294967295 ; i++){if( Count(i) == i){cout << i << "  ";}}
}

#include<iostream>
using namespace std;int Count(int n){int count = 0;//1的个数int CurrentPosition = 1;//当前位int LowerNum = 0;//低位数字int CurrNum = 0;//当前位数字int HigherNum = 0;//高位数字while(n / CurrentPosition != 0){LowerNum = n - (n / CurrentPosition) * CurrentPosition;//低位数字
        CurrNum = (n / CurrentPosition) % 10;//当前位数字
        HigherNum = n / (CurrentPosition * 10);//高位数字if(CurrNum == 0)//如果为0,出现1的次数由高位决定
        {count += HigherNum * CurrentPosition;//等于高位数字 * 当前位数
        }else if(CurrNum == 1)//如果为1,出现1的次数由高位和低位决定
        {count += HigherNum * CurrentPosition + LowerNum + 1;//高位数字 * 当前位数 + 低位数字 + 1
        }else//如果大于1,出现1的次数由高位决定
        {count += (HigherNum + 1) * CurrentPosition;//（高位数字+1）* 当前位数
        }CurrentPosition *= 10;//前移一位
    }return count;
}inline unsigned count_digits(unsigned long long num)
{unsigned long long n = 1;unsigned ret = 0;while (n <= num) { n *= 10; ++ret; }return ret;
}void get_nums()
{unsigned long long x = 1e11 - 1, y;unsigned count = 0;unsigned idx = 0;while (true){++count;y = Count(x);if (x < y) {//x在1到10时，均不满足x<y,所以x>10，下面的k值肯定大于0    unsigned k = count_digits(x) - 1;x -= (y - x - 1)/k + 1; }else if (x > y) { x = y; } else{cout<< ++idx << ": " << x << endl;//break;--x;if (x == 0) break;} }
}void main()
{int a;cout << "请输入一个正整数：";cin >> a;cout << a;cout << "从1到该数字出现的1的次数为：" << Count(a) << endl;cout << "整数与次数相同的有以下这些，最大值为第一个数：";get_nums();
}