Dreamhack 리버싱 문제풀이: rev-basic-6

첫 번째 함수: (00007FF6F187302) 63 7C 77 7B F2 6B 6F C5 30 01 67 2B FE D7 AB 76 
                      (00007FF6F187303) CA 82 ...등등 (엄청 많음)

두 번째 함수: (00007FF6F187300) 00 4D 51 50 EF FB C3 CF 92 45 4D CF F5 04 40 50 
                      (00007FF6F187301) 43 63 

#include<stdio.h>
int main(void)
{
	int a, i, j;
	int arr_1[128]={0x63, 0x7C, 0x77, 0x7B, 0xF2, 0x6B, 0x6F, 0xC5,  0x30, 0x01, 0x67, 0x2B, 0xFE, 0xD7, 0xAB, 0x76,
        	0xCA ,0x82 ,0xC9 ,0x7D ,0xFA ,0x59 ,0x47 ,0xF0, 0xAD, 0xD4, 0xA2, 0xAF, 0x9C, 0xA4, 0x72, 0xC0,
        	0xB7, 0xFD, 0x93, 0x26, 0x36, 0x3F, 0xF7, 0xCC, 0x34, 0xA5, 0xE5, 0xF1, 0x71, 0xD8, 0x31, 0x15,
        	0x04, 0xC7, 0x23, 0xC3, 0x18, 0x96, 0x05, 0x9A, 0x07, 0x12, 0x80, 0xE2, 0xEB, 0x27, 0xB2, 0x75,
        	0x09, 0x83, 0x2C, 0x1A, 0x1B, 0x6E, 0x5A, 0xA0, 0x52, 0x3B, 0xD6, 0xB3, 0x29, 0xE3, 0x2F, 0x84,
        	0x53, 0xD1, 0x00, 0xED, 0x20, 0xFC, 0xB1, 0x5B, 0x6A, 0xCB, 0xBE, 0x39, 0x4A, 0x4C, 0x58, 0xCF,
        	0xD0, 0xEF, 0xAA, 0xFB, 0x43, 0x4D, 0x33, 0x85, 0x45, 0xF9, 0x02, 0x7F, 0x50, 0x3C, 0x9F, 0xA8,
        	0x51, 0xA3, 0x40, 0x8F, 0x92, 0x9D, 0x38, 0xF5, 0xBC, 0xB6, 0xDA, 0x21, 0x10, 0xFF, 0xF3, 0xD2}; 
	int arr_2[18]={0x00, 0x4D, 0x51, 0x50, 0xEF, 0xFB, 0xC3, 0xCF,  0x92, 0x45, 0x4D, 0xCF, 0xF5, 0x04, 0x40, 0x50, 0x43, 0x63};
	
	
	for(i=0;i<18;i++)
	{
		for(j=0; j<128;j++)
		{
			if(arr_1[j]==arr_2[i])
				printf("%c", j);
		}
	}
	
	return 0;

}

질문(⊙_⊙)？:
같은 경우에 j를 출력해야 하는지 arr_1[ j ]를 출력해야 하는지arr_2[ i ]를 출력해야 하는지
이번엔 세 개 다 해봐서 알았는데 그렇게 못 할 경우에는 어떻게 알 수 있을까?