Submission #305593

---

Source Code Expand

#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_DEPRECATE

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <fstream>
#include <iterator>
#include <bitset>

using namespace std;

typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;

#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)(c).size())
#define ten(x) ((int)1e##x)

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

int main(){
	int n; cin >> n;
	int _n = n;
	int x = 1;
	while (_n--) x *= 10;
	vector<string> vs;
	FOR(i, x) {
		string s;
		int y = i;
		FOR(j, n) {
			int cur = y % 10;
			int upper = y / 10 % 2;
			if (upper) cur = 9 - cur;
			s.push_back('0' + cur);
			y /= 10;
		}
		reverse(s.begin(), s.end());
		vs.push_back(s);
	}
	printf("%d\n", sz(vs) - 1);
	for (auto& a : vs) {
		printf("%s\n", a.c_str());
	}
}

Submission Info

Judge Result