Submission #305619

---

Source Code Expand

#include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(),(x).rend()
#define sz(x) ((int)(x).size())
#define REP(i,b,n) for(int i=(int)(b);i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define repsz(i,v) rep(i,sz(v))
#define eb emplace_back
#define mt make_tuple
#define aur auto&
#define bit(n) (1LL<<(n))
using namespace std;
typedef long long ll;
//#define int long long
static const int INF = 1<<25;
static const double EPS = 1e-5;
template<class T>bool chmin(T&a,const T&b){if(a<=b)return false;a=b;return true;}
template<class T>bool chmax(T&a,const T&b){if(a>=b)return false;a=b;return true;}

bool solve(){
    int n; cin >> n;
    cout << string(n, '9') << endl;

    int K = 1;
    rep(_, n) K *= 10;
    vector<vector<int>> res(K, vector<int>(n));
    rep(i, K){
        int t = 1;
        rep(j, n){
            int now = i / t;
            if(now % 20 < 10) res[i][j] = now % 10;
            else res[i][j] = 9 - now % 10;
            t *= 10;
        }
    }
    for(aur x : res){
        reverse(all(x));
        for(aur t : x) cout << t;
        cout << endl;
    }
    return true;
}
signed main(){
    //cin.tie(0);
    //ios_base::sync_with_stdio(0);
    cout.setf(ios::fixed); cout.precision(10);
    solve();
    return 0;
}
// vim:set foldmethod=marker commentstring=//%s:

Submission Info

Judge Result