测试通过的：
int main()
{
int i, j, k, l, m, n, o, p,X=0;
int R=0, d[6], f[6],c[33], e[33], N1,N2,N3,N4,N5,N6,nKN[7];
int S=0, Z=0,AC,xh,xhr,xr[7],nUM[7],jsg=0,dsg=0;
int CS[13],LH[13];
int a[30][6]=
{
{5,7,10,14,17,25},{5,8,10,15,23,26},{3,7,13,23,27,30},{7,13,17,26,32,33},{10,11,13,16,19,30},{10,19,20,21,23,32},
{2,5,11,26,30,32},{1,2,14,23,28,29},{8,12,20,22,30,33},{2,15,19,24,31,32},{4,10,16,23,28,30},{6,11,18,20,25,30},
{3,5,12,18,21,23},{1,2,9,10,21,31},{4,5,23,26,31,32},{1,3,12,20,21,29},{9,16,17,18,22,27},{5,10,16,19,23,28},
{1,13,15,17,20,30},{9,18,19,25,28,31},{1,9,14,16,28,32},{5,7,12,14,15,20},{2,9,16,21,30,31},{1,11,13,25,32,33},
{4,5,6,25,29,30},{11,15,18,21,27,29},{2,8,12,18,24,28},{4,9,11,20,32,33},{4,8,12,17,20,30},{11,12,13,18,23,32}
};
for(k=0;k<=32;k++)
{c[k]=0;
for(i=0;i<=29;i++)
{
for(j=0;j<=5;j++)
{
if(a[j]==k+1)
c[k]++;//c[k]=c[k]+1;
}
}
}
int b[5][6];
for(i=0;i<=4;i++)
{
for(j=0;j<=5;j++)
{ nUM[j+1]=a[29][j];
b[j]=a[i+25][j];
}
}
for(k=0;k<=32;k++)
{e[k]=0;
for(i=0;i<=4;i++)
{
for(j=0;j<=5;j++)
{
if(b[j]==k+1)
e[k]=e[k]+1;
}
}
};
int RMG,LMG,MaxJJ;//,bh[7],nM,ncs[7],come=0;
for(i=0;i<=16;i++)
{
d[0]=c;f[0]=e;N1=i+1;nKN[1]=i+1;
for(j=1;j<=19;j++)
{
d[1]=c[j];f[1]=e[j];N2=j+1;nKN[2]=j+1;//continue;
for(k=3;k<=24;k++)
{
d[2]=c[k];f[2]=e[k];N3=k+1;nKN[3]=k+1;
for(l=4;l<=29;l++)
{
d[3]=c[l];f[3]=e[l];N4=l+1;nKN[4]=l+1;
for(m=10;m<=31;m++)
{
d[4]=c[m];f[4]=e[m];N5=m+1;nKN[5]=m+1;
for(n=15;n<=32;n++)
{
d[5]=c[n];f[5]=e[n];N6=n+1;nKN[6]=n+1;
for(o=0;o<=12;o++)
{
CS[o]=0;LH[o]=0;
}
Z=nKN[1]+nKN[2]+nKN[3]+nKN[4]+nKN[5]+nKN[6];
R=d[0]+d[1]+d[2]+d[3]+d[4]+d[5];//最后30期统计的次数和值
X=f[0]+f[1]+f[2]+f[3]+f[4]+f[5];//最后5期统计的次数和值
for(o=0;o<=12;o++)
for(p=0;p<=5;p++)
{if(d[p]==o) CS[o]=CS[o]+1;
if(f[p]==o) LH[o]=LH[o]+1;}
int mc[6]={0,0,0,0,0,0},lc[6]={0,0,0,0,0,0};
for(p=0;p<=12;p++)
{
if(CS[p]>=1)
{ mc[1]=mc[1]*10+p; }
if(CS[p]>=2)
{ mc[2]=mc[2]*10+p; }
if(CS[p]>=3)
{ mc[3]=mc[3]*10+p; }
if(LH[p]>=1)
{ lc[1]=lc[1]*10+p; }
if(LH[p]>=2)
{ lc[2]=lc[2]*10+p; }
if(LH[p]>=3)
{ lc[3]=lc[3]*10+p; }
};
if((R==25||R==27||R==33)&&N1<N2&&N2<N3&&N3<N4&&N4<N5&&N5<N6&&(Z==88||Z==94||Z==100||Z==66)&&(X==5||X==7)&&
(N1==1||N1==3||N1==5||N1==6)&&(N6==22||N6==24||N6==26||N6==27||N6==28||Z==31)&&(N2<11))
{
if((CS[2]+CS[4])>=1&&CS[7]==0&&CS[8]>=1&&CS[9]<=1&&CS[2]<=2&&CS[6]>=1&&CS[5]<=2&&CS[6]<=3&&CS[4]<=1&&
(CS[2]>=2||CS[5]==2||CS[6]>=2)&&LH[0]>=2&&LH[0]<=3&&LH[1]>=1&&LH[1]<=2&&(LH[2]+CS[3])>=1)
{
printf("HQ预测:%d %d %d %d %d %d ", nKN[1],nKN[2],nKN[3],nKN[4],nKN[5],nKN[6]);//预测的红球1 8 19 20 22 24
printf(" ");
printf("R:%d ",R);//和值//645822=27
//printf("R:%d%d%d%d%d%d ",d[0],d[1],d[2],d[3],d[4],d[5]);//645822
printf("X:%d ",X);//和值//020201=5
//printf("X:%d%d%d%d%d%d ",f[0],f[1],f[2],f[3],f[4],f[5]);//020201*/
printf(" mc:%d %d %d ",mc[1],mc[2],mc[3]);
printf("lc:%d %d %d ",lc[1],lc[2],lc[3]);
cout<<"\n";
S++;
}
}
}
}
}
}
}
}
printf("预测注数=%d ",S);
cout<<"\n";
}
本站相关链接
