- 全排列
正解
- 2025-2-16 14:37:40 @
#include <bits/stdc++.h> using namespace std; long long n,a[1000010]; bool cmp(int a,int b) { return a>b; } int main() { cin>>n; for(int i=1;i<=n;i++) { cin>>a[i]; } sort(a+1,a+n+1,cmp); do { for(int i=1;i<=n;i++) { cout<<a[i]<<" "; } cout<<endl; }while(prev_permutation(a+1,a+n+1)); return 0; }
0 comments
No comments so far...
Information
- ID
- 1555
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 8
- Tags
- # Submissions
- 405
- Accepted
- 5
- Uploaded By