Submission #305603

---

Source Code Expand

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>

using namespace std;
int a[10];
void dfs(int k ,int n){
    if(k == n +1){
        for(int k = 1; k <= n; k++)
            printf("%d", a[k]);
        puts("");
    }else {
        for(int i = 0; i <= 9; i++){
            a[k] = i;
            dfs(k+1, n);
        }



    }

}
int main(){
   // freopen("a.in", "r", stdin);
    //freopen("a.out", "w", stdout);
    int n;
    while(~scanf("%d", &n)){
        int s = 1;
        for(int i = 1; i <= n; i++)s *= 10;
        printf("%d\n", s-1);
        dfs(1, n);



    }





    return 0;
}

Submission Info

Judge Result