Submission #305597

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <complex>
#include <set>
#include <vector>
#include <stack>
#include <tuple>
#include <algorithm>
#include <cassert>
#include <cstring>
#include <queue>
#include <string>
#include <map>

using namespace std;
typedef long long ll;
const int MD = 10100;
int c[6][MD];

int main() {
    int n;
    cin >> n;
    int d = 1;
    for (int i = 0; i < n; i++) {
        d *= 10;
    }
    int r = d;
    cout << r-1 << endl;
    int b = 1;
    int y = 0;
    for (int k = 0; k < n; k++) {
        for (int i = 0; i < d; i++) {
            for (int j = 0; j < 10; j++) {
                for (int x = 0; x < b; x++) {
                    c[k][i*b*10+j*b+x] = (y+j)%10;
                }
            }
            y = (y+9)+10;
        }
        d /= 10;
        b *= 10;
    }
    for (int i = 0; i < r; i++) {
        string s = "";
        for (int j = 0; j < n; j++) {
            s += '0'+c[j][i];
        }
        cout << s << endl;
    }
    return 0;
}

Submission Info

Judge Result