lint1.cpp

一些密码的程序

#include<stdio.h>
union mid
{ unsigned long lx;
  unsigned short sx[2];
}
unsigned short src[64],dst[64],quo[64],res[64],i,j,k,middle[64];
void add( unsigned short src[],unsigned short dst[],unsigned short res[]);
void mul( unsigned short src[],unsigned short dst[],unsigned short res[]);
void sub( unsigned short src[],unsigned short dst[],unsigned short res[]);
void div( unsigned short src[],unsigned short dst[],unsigned short res[]
unsigned short quo[]);
void mulby( unsigned short src,unsigned short dst[],unsigned short res[]);
void btd( unsigned short src[],unsigned short dst[],unsigned short res[]);
void dtb( unsigned short src[],unsigned short dst[],unsigned short res[]);
void genrand( unsigned short src[],unsigned short dst[],unsigned short res[]);

main()
{
}

void add( unsigned short src[],unsigned short dst[],unsigned short res[])
{ int i;
  mid y;
  y.lx=0;
  for(i=1;(i<=src[0]+1)||(i<=dst[0]+1);i++)
  { y.lx=dst[i]+src[i]+y.sx[1];
    res[i]=y.sx[0];
  }
  if(res[i--]==0) res[0]=i;
  else res[0]=i-1;
}

void mulby( unsigned short src,unsigned short dst[],unsigned short res[],int k)
{ int i;
  mid y;
  y.lx=0;
  for(i=1;i<=dst[0]+1;i++)
  { y.lx=dst[i]*src+y.sx[1];
    res[i]=y.sx[0];
  }
  if(res[i--]==0) res[0]=i;
  else res[0]=i-1;
}

void mul( unsigned short src[],unsigned short dst[],unsigned short res[]);
{  unsigned short i,midm[64];
   for(j=1;j<=src[0];j++)
   { for(i=0;i<64;i++)
       midm[i]=0;
     mulby(src[j],dst,midm);
     add(res,midm);
   }
}

void sub( unsigned short src[],unsigned short dst[],unsigned short res[])
{ int i;
  mid y;
  y.lx=0;
  for(i=1;i<=dst[0]+1;i++)
  { y.lx=dst[i]-src[i]+y.sx[0];
    res[i]=y.sx[0];
  }
  for(;res[i]==0;i--)
  ;
  res[0]=i;
}

void div( unsigned short src[],unsigned short dst[],unsigned short res[]
unsigned short quo[])
{ unsigned short i,j,q,midd1[64],midd2[64];
  mid y;
  for(i=0;i<=dst[i];i++)
    res[i]=dst[i];
  for(i=res[0]+1;i>res[0]+1;i--)
  { y.sx[1]=res[i];
    y.sx[0]=res[i-1];
    q=y.lx/src[src[0]];
    do
    { for(j=0;j<64;j++)
      midd2[j]=0;
      mulby(q,src,midd1,i-src[0]);
      sub(midd1,res,midd2);
      q--;
    }
    while(midd2[res[0]+1]!=0)
    quo[i-src[0]]=q+1;
    for(j=0;j<64;j++)
      res[j]=midd2[j];
  }
}