ACM-FOJ
ITAK
这个作者很懒,什么都没留下…
展开
-
FOJ Problem 2283 Tic-Tac-Toe(暴力枚举)——第八届福建省大学生程序设计竞赛-重现赛
传送门 Kim likes to play Tic-Tac-Toe.Given a current state, and now Kim is going to take his next move. Please tell Kim if he can win the game in next 2 moves if both player are clever enough.Here “next原创 2017-07-24 19:41:01 · 1314 阅读 · 0 评论 -
FZU Problem 1919 K-way Merging sort(大数+记忆化搜索)
传送门As we all known, merge sort is an O(nlogn) comparison-based sorting algorithm. The merge sort achieves its good runtime by a divide-and-conquer strategy, namely, that of halving the list being sorte原创 2017-10-05 21:10:30 · 1309 阅读 · 0 评论