关闭

hdu 6200 mustedge mustedge mustedge

Problem Description Give an connected undirected graph with n nodes and m edges, (n,m≤105) which has no selfloops or multiple edges initially.  Now we have q operations (q≤105):     ⋅1 u...
阅读(48) 评论(0)

hdu 6209 The Intersection

Problem Description A given coefficient K leads an intersection of two curves f(x) and gK(x). In the first quadrant, the curve f is a monotone increasing function that f(x)=x−−√. The curve ...
阅读(336) 评论(2)

2017多校训练Contest5: 1008 Rikka with Subset hdu6092

Problem Description As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them: Yuta has n positive A1−An and ...
阅读(66) 评论(0)

2017多校训练Contest5: 1006 Rikka with Graph hdu6090

Problem Description As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them: For an undirected graph G with...
阅读(52) 评论(0)

2017多校训练Contest5: 1001 Rikka with Candies hdu6085

Problem Description As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them: There are n children and m ki...
阅读(68) 评论(0)

2017多校训练Contest4: 1007 Matching In Multiplication hdu6073

Problem Description In the mathematical discipline of graph theory, a bipartite graph is a graph whose vertices can be divided into two disjoint sets U and V (that is, U and V are each independ...
阅读(48) 评论(0)

2017多校训练Contest4: 1005 Lazy Running hdu6071

Problem Description In HDU, you have to run along the campus for 24 times, or you will fail in PE. According to the rule, you must keep your speed, and your running distance should not be less than...
阅读(154) 评论(0)

2017多校训练Contest4: 1004 Dirt Ratio hdu6070

Problem Description In ACM/ICPC contest, the ''Dirt Ratio'' of a team is calculated in the following way. First let's ignore all the problems the team didn't pass, assume the team passed Xproblems ...
阅读(60) 评论(0)

2017多校训练Contest4: 1003 Counting Divisors hdu6069

Problem Description In mathematics, the function d(n) denotes the number of divisors of positive integer n. For example, d(12)=6 because 1,2,3,4,6,12 are all 12's divisors. In this prob...
阅读(44) 评论(0)

2017多校训练Contest4: 1012 Wavel Sequence hdu6078

Problem Description Have you ever seen the wave? It's a wonderful view of nature. Little Q is attracted to such wonderful thing, he even likes everything that looks like wave. Formally, he defines ...
阅读(78) 评论(0)

2017多校训练Contest4: 1011 Time To Get Up hdu6077

Problem Description Little Q's clock is alarming! It's time to get up now! However, after reading the time on the clock, Little Q lies down and starts sleeping again. Well, he has 5 alarms, and i...
阅读(39) 评论(0)

2017多校训练Contest4: 1009 Questionnaire hdu6075

Problem Description In order to get better results in official ACM/ICPC contests, the team leader comes up with a questionnaire. He asked everyone in the team whether to have more training....
阅读(54) 评论(0)

2017多校训练Contest3: 1011 RXD's date hdu6066

Problem Description As we all know that RXD is a life winner, therefore he always goes out, dating with his female friends. Nevertheless, it is a pity that his female friends don't like extremely ...
阅读(63) 评论(0)

2017多校训练Contest3: 1008 RXD and math hdu6063

RXD is a good mathematician. One day he wants to calculate: ∑i=1nkμ2(i)×⌊nki−−−√⌋ output the answer module 109+7. 1≤n,k≤1018 μ(n)=1(n=1) μ(n)=(−1)k(n=p1p2…pk) μ(n)=0(other...
阅读(56) 评论(0)

2017多校训练Contest3: 1005 RXD and dividing hdu6060

Problem Description RXD has a tree T, with the size of n. Each edge has a cost. Define f(S) as the the cost of the minimal Steiner Tree of the set S on tree T.  he wants to divide 2,3,4,5...
阅读(63) 评论(0)
405条 共27页1 2 3 4 5 ... 下一页 尾页
    个人资料
    • 访问:176457次
    • 积分:5627
    • 等级:
    • 排名:第4885名
    • 原创:402篇
    • 转载:1篇
    • 译文:0篇
    • 评论:25条
    文章分类
    最新评论