关闭

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...
阅读(484) 评论(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 2 moves if both player are clever enough.Here “next...
阅读(547) 评论(0)
    个人资料
    • 访问:448613次
    • 积分:10698
    • 等级:
    • 排名:第1620名
    • 原创:633篇
    • 转载:5篇
    • 译文:0篇
    • 评论:89条
    博客专栏