Submission #3057642

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;


int main() {
  int N;
  cin >> N;
  string cur(N, '0');
  set< string > used;
  vector< string > ans;

  bool update = true;
  while(update) {
    update = false;
    used.emplace(cur);
    ans.push_back(cur);
    for(int i = 0; i < N; i++) {
      for(int j : {1, 9}) {
        string nxt = cur;
        nxt[i] = (nxt[i] - '0' + j) % 10 + '0';
        if(abs(nxt[i] - cur[i]) != 1) continue;
        if(used.count(nxt)) continue;
        update = true;
        cur = nxt;
        break;
      }
      if(update) break;
    }
  }
  cout << ans.size() - 1 << endl;
  for(auto &p : ans) {
    reverse(begin(p), end(p));
    cout << p << endl;
  }
}

Submission Info

Judge Result