Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- int vis[10] = {0},result[10] = {0};
- int m,n;
- void dfs(int k){
- int i;
- if(k == m){
- for(i = 0;i < m;i++){
- printf("%d ",result[i]);
- }
- putchar('\n');
- return;
- }
- else{
- for(i = 1;i <= n;i++){
- if(!vis[i]){
- vis[i] = 1;
- result[k] = i;
- dfs(k + 1);
- //result[k] = 0;
- vis[i] = 0;
- }
- }
- }
- }
- int main(int argc,char **argv){
- scanf("%d%d",&n,&m);
- dfs(0);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement