UniqueColor

摘要： Problem DescriptionDefine f(n) as the number of ways to perform n in format of the sum of some positive integers. For instance, when n=4, we have 4=1... 阅读全文

摘要： Problem DescriptionQueues and Priority Queues are data structures which are known to most computer scientists. The Queue occurs often in our daily lif... 阅读全文

摘要： Problem DescriptionZYB played a game named NumberBomb with his classmates in hiking:a host keeps a number in [1,N] in mind,then players guess a number... 阅读全文

摘要： Problem DescriptionAfter getting 600 scores in NOIP ZYB(ZJ−267) begins to work with biological questions.Now he give you a simple biological questions... 阅读全文

摘要： DescriptionWhile dad was at work, a little girl Tanya decided to play with dad's password to his secret database. Dad's password is a string consistin... 阅读全文

摘要： DescriptionYou are to write a program that tries to find an optimal coloring for a given graph. Colors are applied to the nodes of the graph and the o... 阅读全文

摘要： DescriptionIn 1976 the ``Four Color Map Theorem" was proven with the assistance of a computer. This theorem states that every map can be colored using... 阅读全文

摘要： DescriptionA thief is running away!We can consider the city where he locates as an undirected graph in which nodes stand for crosses and edges stand f... 阅读全文

摘要： Problem DescriptionDire wolves, also known as Dark wolves, are extraordinarily large and powerful wolves. Many, if not all, Dire Wolves appear to orig... 阅读全文

摘要： DescriptionThe cows are trying to become better athletes, so Bessie is running on a track for exactly N (1 ≤ N ≤ 10,000) minutes. During each minute, ... 阅读全文