CRC 算法代码

#include<iostream>using namespace std;const int        N=3;const int        BITSIZE=64;const int        P[N+1]={1,1,0,1};        //P为生成多项式void main(void){int        bit[BITSIZE]={0},len,i,j;char        ch;cout<<"Input the bit size:";cin>>len;cout<<"Input the bit code:";for(i=0;i<len;i++){cin>>ch;bit[i]=ch-'0';}for(i=0;i<len;i++){if(bit[i]==0)continue;for(j=1;j<=N;j++)bit[i+j]=(bit[i+j]+P[j]==1);}cout<<"The FCS is:";for(i=len;i<len+N;i++)cout<<bit[i];cin>>len;system("pause");}