Advertisement
wojiaocbj

Y

Jun 11th, 2022
142
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 0.43 KB | None | 0 0
  1. #include <stdio.h>
  2. int vis[10] = {0},result[10] = {0};
  3. int m,n;
  4. void dfs(int k){
  5.     int i;
  6.     if(k == m){
  7.         for(i = 0;i < m;i++){
  8.             printf("%d ",result[i]);
  9.         }
  10.         putchar('\n');
  11.         return;
  12.     }
  13.     else{
  14.         for(i = 1;i <= n;i++){
  15.             if(!vis[i]){
  16.                 vis[i] = 1;
  17.                 result[k] = i;
  18.                 dfs(k + 1);
  19.                 //result[k] = 0;
  20.                 vis[i] = 0;
  21.             }
  22.         }
  23.     }
  24. }
  25. int main(int argc,char **argv){
  26.     scanf("%d%d",&n,&m);
  27.     dfs(0);
  28.     return 0;
  29. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement