hacker.org

I had a basic plan of attack with Euler Totient function and Chinese Remainder Theorem, but I was too lazy to code it, so I eventually found https://github.com/sasdf/ctf/tree/06ef8 ... v/bigmaffs.

7 years later, I've finally solved it. I hated the challenge, but love the site.

thanks, i was too lazy to guess it

I would be happy if I knew what "->" means.

I had a problem with second o, I thought it was i or t.

log in twice

I'm pretty much sure I know correct answer, but there are so many possibilities to enter it.
Two questions.
Is it really in the form of x-x-x?
Does order matter? Is c-g-e different from g-e-c?

The Web Application Hacker's Handbook looks like reasonable choice. I haven't read it but from contents it looks like it covers most common vulnerabilities.
But, if you know every language you listed you can go pretty far with a bit of thinking.

omg I thought it was impossible. Luckily you don't need to know all notes to guess the answer.
And there is one note that have two names: H and B, you should use B.

ups. wrong place. that was about melody.

hi these challenges are so much fun, i enjoy them very much. I solved 69 challenges in less than 24h so it's possible for human. If it weren't for crypto (which is pita) I probably would have more interesting challenges available. Now I see less than 5 easily solvable so probably I'll be stuck for a...