好运来 题解

题目在主页，如有出错请指出

include <bits/stdc++.h>

using namespace std;

int nextlucky(int n)
{
if (n < 1) return 1;
vector < int > lucky;
for (int i = 1; i <= 9; i++)
{
long long num = i;
lucky.push_back(num);
while (num <= INT_MAX / 10)
{
num *= 10;
lucky.push_back(num);
}
}
sort(lucky.begin(), lucky.end());
for (int i = 0; i < lucky.size(); i++)
if (lucky[i] > n) return lucky[i];
}

int main()
{
int n;
scanf("%d", &n);
cout << nextlucky(n) - n << endl;
return 0;
}