摘要： [1537] Travel时间限制: 2000 ms　内存限制: 65535 K问题描述One time, group master organized nekoTeam to travel, he always send a person to toilet before arriving a scene, and the rest of the people continued to move forward.The scenes are numbered from 1 to n, nekoTeam was going from scene 1 to scene n.输入The first 阅读全文

摘要： [1532] New String时间限制: 2000 ms　内存限制: 65535 K问题描述Ceil so love the new string.If you can erase any character from the string, and use the remain character by any order to comprise the "new" , the string is the new string, otherwise not.Give you some string, you should help Ceil determine whe 阅读全文