Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- /* Period parameters */
- #define N 624
- #define M 397
- #define MATRIX_A 0x9908b0dfUL /* constant vector a */
- #define UPPER_MASK 0x80000000UL /* most significant w-r bits */
- #define LOWER_MASK 0x7fffffffUL /* least significant r bits */
- static unsigned long mt[N]; /* the array for the state vector */
- static int mti=N+1; /* mti==N+1 means mt[N] is not initialized */
- /* initializes mt[N] with a seed */
- void init_genrand(unsigned long s)
- {
- mt[0]= s & 0xffffffffUL;
- for (mti=1; mti<N; mti++) {
- mt[mti] =
- (1812433253UL * (mt[mti-1] ^ (mt[mti-1] >> 30)) + mti);
- /* See Knuth TAOCP Vol2. 3rd Ed. P.106 for multiplier. */
- /* In the previous versions, MSBs of the seed affect */
- /* only MSBs of the array mt[]. */
- /* 2002/01/09 modified by Makoto Matsumoto */
- mt[mti] &= 0xffffffffUL;
- /* for >32 bit machines */
- }
- }
- /* initialize by an array with array-length */
- /* init_key is the array for initializing keys */
- /* key_length is its length */
- /* slight change for C++, 2004/2/26 */
- void init_by_array(unsigned long init_key[], int key_length)
- {
- int i, j, k;
- init_genrand(19650218UL);
- i=1; j=0;
- k = (N>key_length ? N : key_length);
- for (; k; k--) {
- mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1664525UL))
- + init_key[j] + j; /* non linear */
- mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
- i++; j++;
- if (i>=N) { mt[0] = mt[N-1]; i=1; }
- if (j>=key_length) j=0;
- }
- for (k=N-1; k; k--) {
- mt[i] = (mt[i] ^ ((mt[i-1] ^ (mt[i-1] >> 30)) * 1566083941UL))
- - i; /* non linear */
- mt[i] &= 0xffffffffUL; /* for WORDSIZE > 32 machines */
- i++;
- if (i>=N) { mt[0] = mt[N-1]; i=1; }
- }
- mt[0] = 0x80000000UL; /* MSB is 1; assuring non-zero initial array */
- }
- /* generates a random number on [0,0xffffffff]-interval */
- unsigned long genrand_int32(void)
- {
- unsigned long y;
- static unsigned long mag01[2]={0x0UL, MATRIX_A};
- /* mag01[x] = x * MATRIX_A for x=0,1 */
- if (mti >= N) { /* generate N words at one time */
- int kk;
- if (mti == N+1) /* if init_genrand() has not been called, */
- init_genrand(5489UL); /* a default initial seed is used */
- for (kk=0;kk<N-M;kk++) {
- y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
- mt[kk] = mt[kk+M] ^ (y >> 1) ^ mag01[y & 0x1UL];
- }
- for (;kk<N-1;kk++) {
- y = (mt[kk]&UPPER_MASK)|(mt[kk+1]&LOWER_MASK);
- mt[kk] = mt[kk+(M-N)] ^ (y >> 1) ^ mag01[y & 0x1UL];
- }
- y = (mt[N-1]&UPPER_MASK)|(mt[0]&LOWER_MASK);
- mt[N-1] = mt[M-1] ^ (y >> 1) ^ mag01[y & 0x1UL];
- mti = 0;
- }
- y = mt[mti++];
- /* Tempering */
- y ^= (y >> 11);
- y ^= (y << 7) & 0x9d2c5680UL;
- y ^= (y << 15) & 0xefc60000UL;
- y ^= (y >> 18);
- return y;
- }
- int main(void)
- {
- unsigned long init[4]={0x123, 0x234, 0x345, 0x456}, length=4;
- init_by_array(init, length);
- float antalganger=0,T,i=0,s1=0,s2=0,s3=0,s4=0,s5=0,s6=0;
- char E;
- while (i!=1)
- {
- T=genrand_int32()%25+97;
- E=T;
- /*printf("%c",E);*/
- if(E==102)
- {
- T=genrand_int32()%25+97;
- E=T;
- antalganger++;
- s1++;
- if(E==108)
- {
- T=genrand_int32()%25+97;
- E=T;
- antalganger++;
- s2++;
- if(E==117)
- {
- T=genrand_int32()%25+97;
- E=T;
- antalganger++;
- s3++;
- if(E==102)
- {
- T=genrand_int32()%25+97;
- E=T;
- antalganger++;
- s4++;
- if(E==102)
- {
- T=genrand_int32()%25+97;
- E=T;
- antalganger++;
- s5++;
- if(E==101)
- {
- T=genrand_int32()%25+97;
- E=T;
- antalganger++;
- s6++;
- printf("%c",E);
- if(E==116)
- {
- T=genrand_int32()%25+97;
- E=T;
- antalganger++;
- goto utanfor;
- }
- }
- }
- }
- }
- }
- }
- antalganger++;
- }
- utanfor:
- printf("Grattis! fluffet skrevs efter %d ganger",antalganger);
- printf("\n Steg 1-6 uppnaddes %d , %d , %d , %d , %d respektive %d ganger",s1,s2,s3,s4,s5,s6);
- return 0;
- }
Add Comment
Please, Sign In to add comment