|
既然下面那个帖子里有人要sonsivri juvann的和谐版本,我就发一下造福吧
#include <stdlib.h>
#include <stdio.h>
static char asTable[] = "12020569031595942853997381615114499907649862923404988817922715553418382057863130"
"90186455873609335258146199157795260719418491995998673283213776396837207900161453"
"94178294936006671919157552224249424396156390966410329115909578096551465127991840"
"51057152559880154371097811020398275325667876035223369849416618110570147157786394"
"99737523785277937030956025701853182790003076547107563048843320869711573742380793"
"44503160762531771453544441183117818224971852635709182448998796203508335756172022"
"60339378587032813126780799005417734869115253706562370574409662217129026273207323"
"61492242913040528555372341033077577798064242024304882815210009146026538220696271"
"55202082274335001015294801198690117625951676366998171835575234880703719555742347"
"29408359520886166620257285375581307928258648728217370556619689895266201877681062"
"92008177923381358768284264124324314802821736745067206935076268953043459393750329"
"6636377575062473323992348288310773390527680200757984356";
void printHash(int iHash);
int main(int iArgc,char *asArg[])
{
int iHash = -1;
int iNdx = 0;
unsigned char bPrint = 0;
int iExit = 2;
for(iNdx=0;iNdx<iArgc;iNdx++)
{
if(!strcmp(asArg[iNdx],"swxc8"))
bPrint = 1;
if(!strcmp(asArg[iNdx],"-hash") && (iNdx+1)<iArgc)
iHash = atoi(asArg[iNdx+1]);
if(!strcmp(asArg[iNdx],"-licenseinfo"))
{
printf("Node Configuration\n");
iExit = 0;
break;
}
}
if(bPrint && iHash!=-1)
printHash(iHash);
return iExit;
}
void printHash(int iHash)
{
int iNdx = 0;
for(iNdx=0;iNdx<9;iNdx++)
{
int iPointer = iHash - (((((0x8c2f17d3L * (long long)iHash) >> 32) >> 9) - (iHash >> 0x1F)) * 0x3A7);
printf("%c",asTable[iPointer]);
iHash++;
}
}
刚拿到还没编译,要的人自便。不是我写的不要谢我 |
阿莫论坛20周年了!感谢大家的支持与爱护!!
一只鸟敢站在脆弱的枝条上歇脚,它依仗的不是枝条不会断,而是自己有翅膀,会飞。
|