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/sysy_lvX/digui2.sy | |
| download | rcc-master.tar.gz rcc-master.tar.xz | |
Diffstat (limited to 'tests/sysy_lvX/digui2.sy')
| -rw-r--r-- | tests/sysy_lvX/digui2.sy | 42 |
1 files changed, 42 insertions, 0 deletions
diff --git a/tests/sysy_lvX/digui2.sy b/tests/sysy_lvX/digui2.sy new file mode 100644 index 0000000..6d05666 --- /dev/null +++ b/tests/sysy_lvX/digui2.sy @@ -0,0 +1,42 @@ +int n;
+int a[10];
+int v[10];
+
+void DFS(int p)
+{
+ int i=0;
+ if(p==n){//边界
+ putarray(n, a);
+ putch(10);
+ return;
+ }
+ while (i<n) { //枚举0->n-1(实际是1->n)这些数 v[i]标志这个数是否被访问过
+ if(v[i]==1) {
+ i = i+1;
+ continue;
+ }
+ v[i]=1;
+ a[p]=i;//p代表位置 每次给一个位置找值
+ DFS(p+1);
+ v[i]=0;//回溯
+ i = i+1;
+ }
+}
+
+int main()
+{
+ int i;
+ while(1){
+ n = getint();
+ if(n==0) {
+ break;
+ }
+ i=0;
+ while (i<10){
+ v[i]=0;
+ i=i+1;
+ }
+ DFS(0);
+ }
+ return 0;
+}
|