[全排列]模板

    技术2022-07-12  85

    #include<iostream> #include<algorithm> using namespace std; int main() { int a[100]; int n; cin>>n; for(int i=0; i<n; i++) a[i]=i+1; sort(a+1,a+n+1); do { for(int i=1; i<=n; i++) cout<<char(a[i]+48)<<' '; cout<<endl; } while(next_permutation(a+1,a+n+1)); }
    Processed: 0.020, SQL: 9