随笔分类 - 1-7 HDU
摘要:Problem Description This is a simple problem. The teacher gives Bob a list of problems about GCD (Greatest Common Divisor). After studying some of the
阅读全文
摘要:Problem Description Alice is planning her travel route in a beautiful valley. In this valley, there are N lakes, and M rivers linking these lakes. Ali
阅读全文
摘要:Problem Description Do you like painting? Little D doesn't like painting, especially messy color paintings. Now Little B is painting. To prevent him f
阅读全文
摘要:Problem Description An undirected graph is a graph in which the nodes are connected by undirected arcs. An undirected arc is an edge that has no arrow
阅读全文
摘要:Problem Description There are N cities in our country, and M one way roads connecting them. Now Little Tom wants to make several cyclic tours, which s
阅读全文
摘要:Problem Description In the modern time, Search engine came into the life of everybody like Google, Baidu, etc. Wiskey also wants to bring this feature
阅读全文
摘要:Problem Description Given 5 integers: a, b, c, d, k, you're to find x in a...b, y in c...d that GCD(x, y) = k. GCD(x, y) means the greatest common div
阅读全文
摘要:Problem Description Do you think this is a strange problem name? That is because you don't know its full name 'Good Good Study and Day Day Up!". Very
阅读全文
摘要:Problem Description Little A is an astronomy lover, and he has found that the sky was so beautiful! So he is counting stars now! There are n stars in
阅读全文
摘要:Problem Description Hzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For each step he
阅读全文

浙公网安备 33010602011771号