| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 192681 | my_dream666 | 全排列问题 | C++ | Accepted | 100 | 18 MS | 188 KB | 312 | 2025-04-15 23:34:21 |
#include<cstdio> #include<algorithm> using namespace std; int a[10]; int main() { int n; int ans=0; scanf("%d",&n); for(int i=1;i<=n;i++) a[i]=i; do { for(int i=1;i<=n;i++) printf("%d",a[i]); printf("\n"); ans++; }while(next_permutation(a+1,a+1+n)); printf("%d",ans); return 0; }