3 条题解

  • 1
    @ 2024-2-2 16:58:54
    #include <bits/stdc++.h>
    using namespace std;
    int main(){
        int n,a[13];
        cin>>n;
        for(int i=1;i<=n;i++)cin>>a[i];
        sort(a+1,a+n+1);
        do{
            for(int i=1;i<=n;i++)cout<<a[i]<<' ';
            cout<<endl;
        }while(next_permutation(a+1,a+n+1));
        return 0;
    }
    
    
    • 0
      @ 2024-1-7 8:40:37
      #include <bits/stdc++.h>
      using namespace std;
      int main()
      {
          ios::sync_with_stdio(false);
          cin.tie(0);
          cout.tie(0);
          int n, a[15];
          cin >> n;
          for (int i = 1; i <= n; i++)
              cin >> a[i];
          sort (a + 1, a + n + 1);
          do
          {
              for (int i = 1; i <= n; i++)
                  cout << a[i] << " ";
              cout << endl;
          }while (next_permutation(a + 1, a + n + 1));
          return 0;
      }
      
      • -1
        @ 2023-12-23 13:30:34
        #include<bits/stdc++.h>
        using namespace std;
        int a[11];
        int main()
        {
            int n;cin >> n;
            for(int i=1;i<=n;i++)
                cin >> a[i];
            sort(a+1,a+n+1);
                for(int i=1;i<=n;i++)
                    cout << a[i] << " ";
                cout << "\n";
            while(next_permutation(a+1,a+n+1))
            {
               for(int i=1;i<=n;i++)
                    cout << a[i] << " ";
                cout << "\n";
            }
            return 0;
        }
        
        • 1

        信息

        ID
        620
        时间
        1000ms
        内存
        256MiB
        难度
        6
        标签
        递交数
        366
        已通过
        100
        上传者