U E D R , A S I H C RSS

이영호/지뢰찾기

.
Reverse Engineering
coder .

:
: 2 만들 .
Crack: , Inline Patch 1 료.


coder C . (마 M$ .)

--------------------------------  --------------------------------
int func(int limit)
{
	int num = (int)rand();
	return num%limit;
}

//  
// srand(GetTickCount()); 를   .
main_func()
{
...

	int base = 0x1E;	//  (30) <-  main_func().
	int height = 0x10;	//  (16)
	int count = 0x0A;	// (10)
	int map[height][base] = {0x0f, };	// 눈 x는 뒤 y ..  0x0f   0x80
	int ret_base, ret_height;

	do {
		ret_base = func(base)++;
		ret_height = func(height)++;

		if(map[ret_height][ret_base] == 0x80)
			continue;

		map[ret_height][ret_base] = 0x80;

		count--;
	} while(count);

...
}
// map 배 DS:1005340 
--------------------------------  --------------------------------


..~ (http://ssrnet.snu.ac.kr/~leedw) ~? --1002
~ 맞~! 를 16마리 -0- --
Reverse 듯; --1002
Valid XHTML 1.0! Valid CSS! powered by MoniWiki
last modified 2021-02-07 05:30:32
Processing time 0.0103 sec