diff options
| author | Richard Qin <richard.qin.001@gmail.com> | 2026-09-15 08:16:43 +0800 |
|---|---|---|
| committer | Richard Qin <richard.qin.001@gmail.com> | 2026-09-15 08:16:43 +0800 |
| commit | 4022e5c95210631e4aceb08eaf9d9071aa5aefc4 (patch) | |
| tree | a5922559836e45fb3459a3d070367912e1035b1a /tests/upload/full_permutation.sy | |
| download | rcc-4022e5c95210631e4aceb08eaf9d9071aa5aefc4.tar.gz rcc-4022e5c95210631e4aceb08eaf9d9071aa5aefc4.tar.xz | |
Diffstat (limited to 'tests/upload/full_permutation.sy')
| -rwxr-xr-x | tests/upload/full_permutation.sy | 45 |
1 files changed, 45 insertions, 0 deletions
diff --git a/tests/upload/full_permutation.sy b/tests/upload/full_permutation.sy new file mode 100755 index 0000000..96f701c --- /dev/null +++ b/tests/upload/full_permutation.sy @@ -0,0 +1,45 @@ +void permutation(int k, int n, int a[])
+{
+ int i = 0;
+ if (k == n - 1)
+ {
+ while(i<n) {
+ putint( a[i]);
+ putch(45);
+ i = i + 1；
+ }
+ putch(10);
+ }
+ else
+ {
+ i = k；
+ while(i<n) {
+ int temp = a[k];
+ a[k] = a[i];
+ a[i] = temp;
+ //交换后递归下一层
+ permutation(k + 1, n, a);
+ //保证每一层递归后保持上一层的顺序
+ temp = a[k];
+ a[k] = a[i];
+ a[i] = temp;
+ i = i + 1;
+ }
+ }
+}
+
+int main()
+
+{
+ int a[100];
+ int n;
+ int k;
+ int i = 0;
+ while (i < 100) {
+ a[i] = i + 1;
+ i = i + 1;
+ }
+ n = getint();
+ permutation(0, n, a);
+ return 0;
+}
\ No newline at end of file |