[SrdnlenCTF 23] Koenigsberg Writeup
As the name of the challenge suggests, we are dealing with graphs (https://en.wikipedia.org/wiki/Seven_Bridges_of_K%C3%B6nigsberg). There will probably be a graph implemented in some way inside the binary, and the goal will probably be to traverse each and every node only once. Reverse-engineering The challenge comes in the form of a x86_64 ELF binary, with symbols. The main function is pretty simple: undefined8 main(void) { int iVar1; size_t sVar2; long in_FS_OFFSET; char input [104]; long local_10; local_10 = *(long *)(in_FS_OFFSET + 0x28); setbuf(stdout,NULL); setbuf(stdin,NULL); puts("Send me the damn flag....