YOONGI

Halloween treats   Every year there is the same problem at Halloween: Each neighbour is only willing to give a certain total number of sweets on that day, no matter how many children call on him, so...

链接：https://ac.nowcoder.com/acm/contest/879/A 来源：牛客网 你在一个有 n 个城市的国家中行走，城市从 1 到 n 依次编号 任意两个城市之间都有一条双向道路可以通行，且你可以花一天的时间从当前所在的城市到达任意一个别的城市 由于你比较闲的无聊，所以你不会连续两天都呆在同一个城市，也就是说每天你所在的城市都不相同（这句话的意思是，对于相邻的两天，你...

Eight The 15-puzzle has been around for over 100 years; even if you don't know it by that name, you've seen it. It is constructed with 15 sliding tiles, each with a number from 1 to 15 on it, and all...