| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 18903 | hu | 组合的输出 | C++ | Accepted | 2 MS | 244 KB | 386 | 2023-06-02 11:32:19 |
#include<bits/stdc++.h> using namespace std; int a[30]; int main() { int n, r; cin >> n >> r; for (int s = (1 << n) - 1; s >= 0; s--) { int cnt = 0; for (int i = 0; i < n; i++) { if(s & (1 << i)) { a[cnt++] = i; } } if(cnt == r) { for (int i = r - 1; i >= 0; i--) { printf("%3d", n - a[i]); } printf("\n"); } } return 0; }