摘要：
G -Dice (III)Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%lld & %lluDescriptionGiven a dice withnsides, you have to find the expected number ... 阅读全文
摘要：
A. Two SubstringsYou are given strings. Your task is to determine if the given stringscontains two non-overlapping substrings "AB" and "BA" (the subst... 阅读全文
摘要：
C -Race to 1 AgainTime Limit:2000MSMemory Limit:32768KB64bit IO Format:%lld & %lluDescriptionRimi learned a new thing about integers, which is - any p... 阅读全文
摘要：
B -Discovering GoldTime Limit:2000MSMemory Limit:32768KB64bit IO Format:%lld & %lluDescriptionYou are in a cave, a long cave! The cave can be represen... 阅读全文
摘要：
A -A Dangerous MazeTime Limit:2000MSMemory Limit:32768KB64bit IO Format:%lld & %lluDescriptionYou are in a maze; seeingndoors in front of you in begin... 阅读全文
摘要：
Secret Code问题描述The Sarcophagus itself is locked by a secret numerical code. When somebody wants to open it, he must know the code and set it exactly o... 阅读全文
摘要：
博客园数学公式首先：进入博客园>>管理>>选项>>启用数学公式支持使用：将公式写在中 '\''(' 此处填写公式内容 '\'')' ，去掉全部引号举例：‘\''(’a^{5}=a^{2}*a^{3}‘\'')’ 显示：\(a^{5}=a^{2}*a^{3}\) '\''('F_{n} = F_... 阅读全文
摘要：
转自：http://www.cnblogs.com/airwindow/p/4067902.html动态规划、分治法和贪心法都是利用求解子问题，而后利用子问题求解更上层问题，最终获得全局解决方案的方法。但是三者的应用场景和性质却存在着极大的不同：1.分治法很容易与动态规划问题混淆，但两者却有着本质上... 阅读全文
摘要：
Radar InstallationTime Limit:1000MSMemory Limit:10000KTotal Submissions:59563Accepted:13430DescriptionAssume the coasting is an infinite straight line... 阅读全文
摘要：
Cleaning ShiftsTime Limit:1000MSMemory Limit:65536KTotal Submissions:12874Accepted:3331DescriptionFarmer John is assigning some of his N (1 #include #... 阅读全文