MaskRay

Home Archives Feeds TIL Presentations

2013

Aug 27

約瑟夫問題的兩個O(log n)解法

Popular

Tag Cloud

adc ai9 algorithm arm asc assebmly assembler automaton awesome bctf binary binutils bmc build system c c++ ccls cgc chroot clang clang-format codinsanity coffee script compiler compression computer security contest cpp csv ctf data structure debug defcon desktop docker elf emacs email emoji emscripten event expect ext4 fdpic feeds firmware floating point forensics fp freebsd game gcc gdb gentoo github glibc graph graph drawing gtk hacker culture hackerrank hanoi haskell hpc image inotify ipsec irc isc j javascript josephus problem jq kernel kythe ld leetcode libunwind linker linux lld lldb llvm lsp m68k makefile math maze mirror ml musl mutt n-body neovim network nginx nim nlp node.js noip notmuch npm ocaml offlineimap oi oj openwrt parallel parser generator perl powerpc presentation puzzle python qq radare2 regex regular expression reverse engineering review riscv router rtld ruby ructfe s390x sanitizer scheme search security sframe shell ssh stringology student festival puzzle suffix array suffix automaton summary suricata telegram telegramircd terminal tls travel traversal tree trendmicro udev unicode unix usb vim vpn vte wargame web analytics webqqircd website wechat wechatircd window manager windows x86 xbindkeys xmonad xz yanshi

Blogroll

BYVoid
fqj1994
ppwwyyxx

© 2026 MaskRay
Powered by Hexo

Home Archives Feeds TIL Presentations