3 Thuat Toan Sinh

//(DO NOT OPEN): https://www.youtube.com/watch?v=iik25wqIuFo
#include<bits/stdc++.h>
using namespace std;

int SinhXauNhiPhan(){
    int t; cin >> t;
    while(t--){
        int n; cin >> n;
        int X[n];
        //INIT();
        for(int i = 1; i<=n; i++){
            X[i]=0;
        }
        bool OK = true;
        while(OK){
            //RESULT();
            for(int i = 1; i<=n; i++){
                cout << X[i];
            }
            cout << endl;
            int i = n;
            while(i>0&&X[i]==1){
                X[i]=0;
                i--;
            }
            if(i>0){
                X[i]=1;
            }else{
                OK=false;
            }
        }
    }

    return 0;
}
int SinhHoanVi(){
    int t; cin >> t;
    while(t--){
        int n; cin >> n;
        int X[n];
        //INIT();
        for(int i = 1; i<=n; i++){
            X[i]=i;
        }
        bool OK = true;
        while(OK){
            //RESULT();
            for(int i = 1; i<=n; i++){
                cout << X[i];
            }
            cout << endl;
            int j = n-1;
            while(j>0&&X[j]>X[j+1]){
                j--;
            }
            if(j>0){
                int k = n;
                while(X[j]>X[k]){
                    k--;
                }
                int temp = X[j]; X[j] = X[k]; X[k] = temp;
                int r = j + 1, s = n;
                while(r<=s){
                    int temp2 = X[r]; X[r] = X[s]; X[s] = temp2;
                    r++; s--;
                }
            }else{
                OK=false;
            }
        }
    }

    return 0;
}

int SinhToHop(){
    int t; cin >> t;
    while(t--){
        int n,k; cin >> n >> k;
        int X[n];
        //INIT();
        for(int i = 1; i<=k; i++){
            X[i]=i;
        }
        bool OK = true;
        while(OK){
            //RESULT();
            for(int i = 1; i<=k; i++){
                cout << X[i];
            }
            cout << endl;
            int i = k;
            while(i>0&&X[i]==n-k+i){
                i--;
            }
            if(i>0){
                X[i] = X[i]+1;
                for(int j = i+1; j <=k; j++){
                    X[j] = X[i]+j-i;
                }
            }else{
                OK=false;
            }
        }
    }

    return 0;
}