题意:https://www.luogu.com.cn/problem/AT_abc234_e
思路:我们枚举首位,枚举公差,用string存下当前的串,然后全部转数字存进set。
/*keep on going and never give up*/
#include<cstdio>
#include<iostream>
#include<queue>
#include<algorithm>
#include<set>
using namespace std;
#define int long long
typedef pair<int, int> pii;
#define lowbit(x) x&(-x)
#define endl '\n'
#define wk is zqx ta die
set<int> st;
void ini() {
for (int i = 1; i <= 9; i++) {
for (int j = -9; j <= 9; j++) {
int q = i;
string f;
for (int k = 0; k < 18; k++) {
f.push_back('0' + q);
st.insert(stoll(f));
q += j;
if (q < 0 || q > 9) {
break;
}
}
}
}
}
signed main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ini();
int x;
cin >> x;
cout << *st.lower_bound(x) << endl;
return 0;
}