| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 191913 | CBCode | 全排列问题 | C++ | Accepted | 100 | 13 MS | 244 KB | 513 | 2025-03-17 20:24:49 |
#include<bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> a; for(int i = 1; i <= n; i++) { a.push_back(i); } do { for(int i = 0; i < n; i++) { cout << a[i]; } cout << '\n'; } while(next_permutation(a.begin(),a.end())); auto fac = [](int n) { int res = 1; for(int i = 1; i <= n; i++) { res *= i; } return res; }; cout << fac(n) << '\n'; }