代码改变世界

今日的我要超越昨日的我,明日的我要胜过今日的我;以创作出更好的代码为目标,不断地超越自己。...

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 st...

2017-10-05 21:10:30

阅读数:763

评论数:0

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 ...

2017-07-24 19:41:01

阅读数:794

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭