Ejemplo026.c File Reference

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <math.h>

Include dependency graph for Ejemplo026.c:

Go to the source code of this file.

Macros
#define	BIT(n)
#define	BIT_GET(x, n)
#define	BIT_SET(x, n)
#define	BIT_CLEAR(x, n)
#define	BIT_TOGGLE(x, n)
#define	BIT_WRITE(x, n, v)
#define	ES_PAR(x)
#define	N   50

Functions
int	main (int argc, char *argv[])

Macro Definition Documentation

BIT

#define BIT

(

n

)

Value:

(1<<(n))

Definition at line 6 of file Ejemplo026.c.

BIT_CLEAR

#define BIT_CLEAR	(		x,
			n )

Value:

((x) &= ~BIT(n))

Definition at line 9 of file Ejemplo026.c.

BIT_GET

#define BIT_GET	(		x,
			n )

Value:

((x) & BIT(n))

Definition at line 7 of file Ejemplo026.c.

BIT_SET

#define BIT_SET	(		x,
			n )

Value:

((x) |= BIT(n))

Definition at line 8 of file Ejemplo026.c.

BIT_TOGGLE

#define BIT_TOGGLE	(		x,
			n )

Value:

((x) ^= BIT(n))

Definition at line 10 of file Ejemplo026.c.

BIT_WRITE

#define BIT_WRITE	(		x,
			n,
			v )

Value:

((v)?BIT_SET(x,n):BIT_CLEAR(x,n))

Definition at line 11 of file Ejemplo026.c.

ES_PAR

#define ES_PAR

(

x

)

Value:

(!BIT_GET(x,0))

Definition at line 12 of file Ejemplo026.c.

N

#define N   50

Definition at line 13 of file Ejemplo026.c.

Function Documentation

main()

int main	(	int	argc,
		char *	argv[] )

Definition at line 15 of file Ejemplo026.c.

{
    char str[N], strP[N], strR[N], c, p, v;
    int i, j, k, l, nc, cc, cb, np, p2, p2f, cc2, cb2;
    srand(time(NULL));
    i = 0;
    do{
        c = getchar();
        str[i] = c;
        i++;
    }while(c!=10&&i<(N-1));
    nc = i-1;
    str[nc] = '\0';
    np = (int)(log2(nc+log2(nc)+1)+1);
    printf("NP = %d\n", np);
    printf("%s (%d, %d)\n", str, nc, np);
    for(i=0, j=0, p2=1; i<(nc+np); i++)
    {
        if((i+1)==p2)
        {
            strP[i] = 0;
            p2<<=1;
        }
        else
        {
            c = str[j++];
            strP[i] = c;
            for(k=0, p2f=1; k<np; k++)
            {
                if(p2f&(i+1))
                    strP[p2f-1]^=c;
                p2f<<=1;
            }
        }
    }
    strP[nc+np] = '\0';
    cc = rand()%(nc+np);
    cb = rand()%8;
    BIT_TOGGLE(strP[cc],cb);
    printf("%s\n", strP);
    for(i=0, j=0, l=0, p2=1; i<(nc+np); i++)
    {
        if((i+1)==p2)
        {
            strR[nc+1+l] = strP[i];
            l++;
            p2 <<= 1;
        }
        else
        {
            c = strP[i];
            strR[j++] = c;
            for(k=0, p2f=1; k<np; k++)
            {
                if(p2f&(i+1))
                    strR[nc+1+k]^=c;
                p2f<<=1;
            }
        }
    }
    strR[nc] = '\0';
    strR[nc+np+1] = '\0';
    printf("%s (%d, %d)\n", strR, cc, cb);
    for(i=0, cc2=0; i<np; i++)
    {
        printf("%d\t", strR[nc+1+i]);
        BIT_WRITE(cc2,i,strR[nc+1+i]);
        if(strR[nc+1+i])
            cb2 = log2(strR[nc+1+i]);
    }
    printf("(%d, %d)\n", cc2-1, cb2);
    BIT_TOGGLE(strP[cc2-1],cb2);
    printf("%s\n", strP);
    return 0;
}