UniqueColor

摘要： Problem DescriptionYou are given two sequence {a1,a2,...,an} and {b1,b2,...,bn}. Both sequences are permutation of {1,2,...,n}. You are going to find ... 阅读全文

摘要： Problem DescriptionN people numbered from 1 to N are waiting in a bank for service. They all stand in a queue, but the queue never moves. It is lunch ... 阅读全文

摘要： Problem DescriptionLet L denote the number of 1s in integer D’s binary representation. Given two integers S1 and S2, we call D a WYH number if S1≤L≤S2... 阅读全文

摘要： 2.解题思路：本题利用欧拉回路存在条件解决。可以将所有的单词看做边，26个字母看做端点，那么本题其实就是问是否存在一条路径，可以到达所有出现过的字符端点。由于本题还要求了两个单词拼在一起的条件是前一个单词的右端点和本单词的左端点一样。所以这是一个有向图。根据结论：有向图的底图（忽略边的方向后的图）必... 阅读全文

摘要： DescriptionDrazil created a following problem about putting 1 × 2 tiles into an n × m grid:"There is a grid with some cells that are empty and some ce... 阅读全文

摘要： 给一个n个点m条边(2 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 #include 10 #include 11 #include 12 #include 13 #include 14 #in... 阅读全文

摘要： 时间限制:1000ms单点时限:1000ms内存限制:256MB描述This is the logo of PKUACM 2016. More specifically, the logo is generated as follows:1. Put four points A0(0,0), B0(... 阅读全文

摘要： DescriptionAfter a day trip with his friend Dick, Harry noticed a strange pattern of tiny holes in the door of his SUV. The local American Tire store ... 阅读全文

摘要： Problem DescriptionMr. West bought a new car! So he is travelling around the city.One day he comes to a vertical corner. The street he is currently in... 阅读全文

摘要： Problem DescriptionIn the Dark forest, there is a Fairy kingdom where all the spirits will go together and Celebrate the harvest every year. But there... 阅读全文