Bought a few years off and on the double chromosphere, don't know what to buy, then find a code friends send a C language program on the Internet, did some modification, now show interested friends to BBS, I basic programming isn't too understand, watching everyone's answer and learn, ha ha,
Before the program need to according to the analysis of the lottery number set and red of the ball, odd-even proportion, AC values, even number, with tail and so on, and then filter in the input program, generates a cp. TXT file filtering, of course there will be a lot of repeated number in this file, need a delete the same procedure to remove the same size, the source code online is very much also, go here, specific filter red ball code is as follows (vc + + 6), there is a part of the code is not used:
# include & lt; stdio.h>
# include & lt; stdlib.h>
# include & lt; string.h>
Int v [6], v1 [6], AcNum, SameEnd;
6,8,11,22,25,33 int ExistNum [6]={};
Int PreExistNum [6]=,8,21,25,26,30 {2};
Int PPreExistNum [6]=,20,23,26,27,32 {1};
Int AC [15]=,0,0,0,0,0,0,0,0,0,0,0,0,0,0 {0};
,10,10,10,10,10 int ExistModTen [6]={10};
Int ExistModFive [6]={5,5,5,5,5,5};
Int ExistModThree [6]=,3,3,3,3,3 {3};
,4,4,4,4,4 int ExistModFour [6]={4};
Int ExistModTwo [6]=,2,2,2,2,2 {2};
,10,10,10,10,10 int ModTen [6]={10};
Int ModFive [6]={5,5,5,5,5,5};
,4,4,4,4,4 int ModFour [6]={4};
Int ModThree [6]=,3,3,3,3,3 {3};
Int ModTwo [6]=,2,2,2,2,2 {2};
Int ExistFive [37] [6]={
,3,4,4,2,3 {0},
,0,1,2,0,2 {4},
,2,3,0,1,3 {1},
,2,4,0,2,0 {1},
,0,1,2,3,2 {2},
,2,4,0,2,4 {1},
,3,2,3,0,1 {1},
,2,0,0,1,2 {1},
,2,3,2,3,0 {1},
,1,3,2,0,2 {1},
,3,2,0,1,4 {1},
,0,1,1,4,0 {1},
,2,3,1,3,0 {1},
,0,2,3,4,0 {3},
,0,1,2,2,3 {4},
,3,0,2,3,4 {2},
,2,3,3,3,2 {1},
,4,4,2,0,3 {1},
,2,3,1,3,3 {1},
,3,2,3,4,2 {1},
,3,4,1,4,3 {1},
,1,4,0,4,3 {2},
,2,3,4,0,2 {3},
,0,1,0,4,2 {1},
,2,2,0,0,3 {1},
,0,4,0,3,2 {1},
,1,2,1,1,3 {0},
,2,1,0,4,0 {4},
,0,1,4,4,3 {1},
,3,0,1,4,3 {4},
,1,1,4,1,3 {2},
,4,0,2,3,4 {2},
,3,1,4,0,4 {2},
,0,3,3,4,0 {4},
,3,4,4,0,1 {4},
,2,0,2,0,2 {1},
,3,3,1,1,0 {0}
};
Int ExistThree [17] [6]={
,1,1,1,0,0 {0},
,0,2,0,2,0 {1},
,1,1,2,0,0 {1},
,2,0,0,2,0 {1},
,2,0,2,1,2 {1},
,2,2,2,1,1 {1},
,1,2,2,2,2 {0},
,1,2,2,1,2 {0},
,2,2,0,2,0 {2},
,0,2,2,2,0 {1},
,0,2,1,0,1 {2},
,0,0,1,2,0 {2},
,0,0,1,1,2 {2},
,2,1,0,1,1 {1},
,0,1,0,1,2 {1},
,2,2,0,2,1 {1},
,1,0,0,2,0 {2}
};
//int flag=0;
Int n [6]={33,33,33,33,33,33};
Int d [6] [33]={
,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33 {1},
,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33 {1},
,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33 {1},
,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33 {1},
,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33 {1},
,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33 {1},
};
Int I, j, i0, i1, i2, i3, i2, i5, s, t1, t2, t3, t4, RepNum, totalrows;
Char ln [100].
The FILE * f;
//determine whether a certain number val in a selected array
Int isExist (int val, int * a, int len)
{
If (val==* a)
{
return 1;
}
If (len & gt; 1)
{
Return isExist (val, a + 1, len - 1);
}
The else
{
return 0;
}
}
//judgment with tail number quantity function
Int isSameEndQty (int * a, int len)
{
//% 10 after using data in the array subscript of an array of values as x, y way, convenient and quick
Int y [10]={0};
Int I, j, sum;
Sum=0;
for (i=0; I & lt; Len. I++)
{
Y [10] a [I] % + +;
}
For (j=0; J & lt; 10; J++)
{
If (x, y [j] & gt; 1)
{
The sum +=y [j];
}
}
return sum;
}
//array and
Int SumData (int * array, int n)
{
int sum=0;
int m;
For (m=0; M & lt; n; M++)
{
The sum +=* array++;
}
return sum;
}
//for an odd number of values of an array of
Int SumModTwo (int * array, int n)
{
int sum=0;
int m;
For (m=0; M & lt; n; M++)
{
The sum +=* array++ % 2;
}
return sum;
}
//order tell the interval of two ball tail with poor function
Int CalStepEndNum (int * a, int n)
{
int i, j;
Int p [5], [5], g result1, result2;
Result1=0;
Result2=0;
For (I=1; I & lt; n; I++) {p/I - 1=(a + a [I]] [I - 1) % 10; G] [I - 1=abs (a [I] - [] I - 1 a) % 10; }
For (I=0; I & lt; N - 1; I++) {
For (j=I + 2; J & lt; N - 1; J++) {
If (p==p [j] [I]) {result1=1; }
If (g==g [j] [I]) {result2=1; }}}
If (result1==1 & amp; & Result2==0)
{return 1; }
Else if (result1==0 & amp; & Result2==1)
{return - 1; }
Else if (result1==0 & amp; & Result2==0)
{return 0; }
Else if (result1==1 & amp; & Result2==1)
{return 2; }
The else
{return 3; }
}
//for even number
Int CalContinueData (int * a, int n)
{
Int I, sum;
Sum=0;
For (I=1; I & lt; n; I++)
{
If (a [I] - a/I - 1==1)
{
sum++;
}
nullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnullnull
