bool f(unsigned char x)
{
	if (x & 0x80) return 1;
	return 0;
}

1)
	mov al, [esp+4]
	or al, al
	sets al
	ret

2)
	mov al, [esp+4]
	movzx eax, al
	cmp eax, 0x80
	setz al
	ret

3)
	mov eax, [esp+4]
	and eax, 0x80
	setnz al
	ret

4)
	mov eax, [esp+4]
	mov ebx, 1
	shl ebx, 31
	movsx eax, al
	and eax, ebx
	cmp eax, 0
	je ret0
	mov al, 1
	ret
ret0:
	mov al, 0
	ret

	mov ax, 13h
	int 10h

	xor eax, eax
	mov ecx, 32
label:
	ror ebx, 1
	rcl eax, 1
loop label

	fldz
	fldpi
	fmul
	fld [esp+4]
	fcomp st(1)
	fnstsw ax
	test ah, 0x41
	setz al

                           P: SETB P1.0
                              LCALL DELAY
                              CLR P1.0               
                              RETI 
                       DELAY: MOV R7,#04H
                       AGAIN: DJNZ R7,AGAIN
                              RET

                           MOV R0,#1000H
                           MOV R1,#2000H
                           MOVX A,@R0
                           XCH A,@R1

name="Israel";
ch=name.charAt(3);

<marquee direction="right" width="20%" scrollamount="20">
	HELLO
</marquee>

unsigned f(unsigned long val) {
    unsigned long temp, g = 0, b = 0x8000, bs = 15;
    do {
        if (val >= (temp = (((g << 1) + b)<<bs--))) {
           g += b;
           val -= temp;
        }
    } while (b >>= 1);
    return g;
}

x^=(x^=(x^=(x^=(x^=(x)>>1)>>2)>>4)>>8)>>16

unsigned int f(unsigned int x)
{
	unsigned int i = 0xCAFEBABE;
	while (i--) {x = (x/8)+(x%8); }
	return x;
}

function GetBestNextPosition:
	Input:
		CurrentPosition of type PositionType
		ResidualDepth, BestMark, WorstMark of type Integer
	Output:
		BestNextPosition of type PositionType
		CurrentPositionMark of type Integer
	Local Variables:
		BestPositionSoFar, Position of type PositionType
		Mark of type Integer
	Body:
		if ResidualDepth = 0 or GameEnded(CurrentPosition):
			return:
				BestNextPosition = None
				CurrentPositionMark = EvaluatePosition(CurrentPosition)
		
		for each Position in NextPositions(CurrentPosition):
			????
			if (Mark > BestMark):
				BestPositionSoFar = Position
				BeskMark = Mark
			if (Mark < Worst):
				return:
					BestNextPosition = BestPositionSoFar
					CurrentPositionMark = BestMark

		return:
			BestNextPosition = BestPositionSoFar
			CurrentPositionMark = BestMark

x = m & -m;
m += x;
y = m & -m;
m |= (y/x - 1) >> 1;

#define A(x) ((x)+(x))
#define B(x) (2*(x))

class A {
	unsigned char* bufA;
public:
	A() {
		bufA = new char[100];
	}
	~A() {
		delete[] bufA;
	}
};

class B {
	unsigned char* bufB;
public:
	B() {
		bufB = new char[100];
	}
	~B() {
		delete[] bufB;
	}
};

#include <string.h>
int main()
{
	int* ptr = new int [3.7];
	ptr = NULL;
	delete ptr;
	return 2;	
}

class UberMathenCalculater
{
public:
	virtual int Add(int a, int b);
	static int Mul(int a, int b);
private:
	int Sub(int a, int b);
	static int Div(int a, int b);
};

int what (int a, int b)
{
	int x = 0;
	for (int i = 0; i < 32; i++)
		x += (a & (1 << i)) + (b & (1 << i));
	return x;
}

char Str[N * 8 +1] = "";
char Str2 = "Codeguru";
for(int i = 0; i < N; i++)
{
	strcat(str,str2);
}

foreach(string str in months)
   Console.WriteLine(str + "\n ");

#define PRINT(x,y) cout << hex << x << y;
void f()
{
   int x = 1;
   int y = 2;
   PRINT(x << 5, y << 2)
}

given x, it is easy to compute y
given y, it is hard to compute x such that f(x)=y
given x, it is hard to find x' such that f(x)=f(x')

int f(int a, int b)
{
	if (b > a) return 1 + f(a+1, b);
	else if (a > b) return f(a-1, b) + 1;
	else return 0;	
}

int f(unsigned int x, unsigned char n)
{
	return ((((x)-~0UL/255*(n))&~(x)&~0UL/255*128) != 0)
}