** NEXT PERMUTATION(全排列生成算法)：** <Excerpt in index | 首页摘要> <The rest of contents | 余下全文> Next PermutationTime Limit: 1000 MS Memory Lim ...

** LEYNI, LOLI AND TOASTS：** <Excerpt in index | 首页摘要> <The rest of contents | 余下全文> Leyni, LOLI and ToastsTime Limit: 1000 MS Memory ...

** A SIMPLE PROBLEM WITH INTEGERS(区间更新)：** <Excerpt in index | 首页摘要> <The rest of contents | 余下全文> A Simple Problem with IntegersTime Lim ...

** MARSHAL'S CONFUSION II：** <Excerpt in index | 首页摘要> <The rest of contents | 余下全文> Marshal’s confusion IITime Limit: 1000 MS Memory ...

** MARSHAL'S CONFUSION III（快速幂）：** <Excerpt in index | 首页摘要> <The rest of contents | 余下全文> Marshal’s Confusion IIITime Limit: 3000 MS ...

** 两种筛素数的方法：** <Excerpt in index | 首页摘要> <The rest of contents | 余下全文> Code12345678910111213141516171819202122232425262728293031323334353 ...

** JAVA基础部分：** <Excerpt in index | 首页摘要> <The rest of contents | 余下全文> Code12345678910111213141516171819202122232425262728293031323334353 ...

** JIAOZHU AND WAR3：** <Excerpt in index | 首页摘要> <The rest of contents | 余下全文> JiaoZhu and WAR3Time Limit: 5000 MS Memory Limit: 65536 ...

** COUNTLESS CANDIES：** <Excerpt in index | 首页摘要> <The rest of contents | 余下全文> Countless CandiesTime Limit: 1000 MS Memory Limit: 102 ...

** FIRE MAZE(广度优先搜索)：** <Excerpt in index | 首页摘要> <The rest of contents | 余下全文> Fire MazeTime Limit: 1000 MS Memory Limit: 32768 KTota ...