穷举密码算法 .txt

要穷举组合的算法

void CreatePassword() 
{
#define PassWordMax 8//将生成密码的最大长度

char a[]="0123456789abcdefghijklmnopqrstuvwxyz";//可能的字符
long nDictCount=sizeof(a);//获得密码词典长度
char cPass[PassWordMax+2];//将生成的密码
long nMinL=1,nMaxL=3;//本例中密码长度从1-3
long Array[PassWordMax];//密码词典下标

ASSERT(nMinL<=nMaxL && nMaxL<=PassWordMax);//容错保证
long nLength=nMinL;
register long j,i=0;
BOOL bNext;
CStdioFile file;
file.Open("C:\\dict.txt",CFile::modeCreate|CFile::modeWrite);
while(nLength<=nMaxL)
{
for(i=0;i<PassWordMax;i++)
Array[i]=0;
bNext=TRUE;
while(bNext)
{
for(i=0;i<nLength;i++)
cPass[i]=a[Array[i]];
cPass[i]=?\0?;
file.WriteString(cPass);
file.WriteString("\n");
for(j=nLength-1;j>=0;j--)//密码指针进位
{ 
Array[j]++;
if(Array[j]!=nDictCount-1)break;
else 
{
Array[j]=0;
if(j==0)bNext=FALSE;
}
}

}
nLength++;
}
file.Close();
}