moectf2020 write up for Frank,永远滴神
这道题要我们统计所有文本文件中字符串FrankNB!
的出现次数~
直接用Java写轻松些,以及偷懒没写高级的字符串匹配算法(毕竟不会像OI那样TLEwwwwww)
1 | import java.util.*; |
得到205232次
base64编码即得flag> <
1 | moectf{MjA1MjMy} |
moectf2020 write up for Frank,永远滴神
http://meteorpursuer.github.io/2020/11/13/moectf 2020 write up for frk,yyds/
# Related Post
1.RWCTF2023体验赛 write up for Digging into kernel 3
2.utctf2021 write up for 2Smol
3.minilctf2020 write up for easycpp
4.moectf2020 write up for baby canary
5.moectf2020 write up for baby migration
6.GWCTF 2019 write up for xxor
7.dmctf2020 write up for re4
8.moectf2020 write up for rop2
1.RWCTF2023体验赛 write up for Digging into kernel 3
2.utctf2021 write up for 2Smol
3.minilctf2020 write up for easycpp
4.moectf2020 write up for baby canary
5.moectf2020 write up for baby migration
6.GWCTF 2019 write up for xxor
7.dmctf2020 write up for re4
8.moectf2020 write up for rop2