From 72af0dedf9e18911da65b9a5c4906689e868d9fc Mon Sep 17 00:00:00 2001
From: Richard-Qin-X <richard.qin.001@gmail.com>
Date: Mon, 8 Jun 2026 17:10:31 +0800
Subject: [legacy] Add functional and performance test suites

---
 rcc-legacy/tests/upload/full_permutation.sy | 45 +++++++++++++++++++++++++++++
 1 file changed, 45 insertions(+)
 create mode 100755 rcc-legacy/tests/upload/full_permutation.sy

(limited to 'rcc-legacy/tests/upload/full_permutation.sy')

diff --git a/rcc-legacy/tests/upload/full_permutation.sy b/rcc-legacy/tests/upload/full_permutation.sy
new file mode 100755
index 0000000..96f701c
--- /dev/null
+++ b/rcc-legacy/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
-- 
cgit v1.2.3