c++ 排列组合算法，代码简单

#include <iostream.h>
#include<stdio.h>
#include <stdlib.h> 
#define MAX_NUM 26 //字母数字
int zuhe(char a[], int n, int m)
{   
 m = m > n ? n : m;
 int* order = new int[m+1];    
 for(int i=0; i<=m; i++)
  order[i] = i-1;            
 
 int count = 0;                                
 int k = m;
 bool flag = true;           
 while(order[0] == -1)
 {
  if(flag)                  
  {   
   for(i=1; i<=m; i++)                    
    cout << a[order[i]] << " ";
   cout << endl;
   count++;
   flag = false;
  }
  order[k]++;              
  if(order[k] == n)          
  {
   order[k--] = 0;
   continue;
  }      

  if(k < m)                  
  {
   order[++k] = order[k-1];
   continue;
  }  
  if(k == m)
   flag = true;
 }
 delete[] order;
 cout<<"共有"<<count<<"种组合"<<endl;
 return count;
}

int inPut_zuhe()
{
 char c;
 int Input_Num=0;   //数组的序号从0开始输入
 char Input[MAX_NUM];
 cout<<"请输入需要组合的个数   ";
 cin>>Input_Num;
 cout<<"请输入这"<<Input_Num<<"个数";
 for(int i=0;i<Input_Num;i++)
 { 
 if(c!=10)
 {
      c=getchar(); 
  Input[i]=c; 
 }
 }
 //cout<<"请输入要取排列的数";