![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
2017暑期多校训练
文章平均质量分 91
皮科克
这个作者很懒,什么都没留下…
展开
-
HDU 6055 Regular polygon【几何】
题目来戳呀 和poj2002也是很类似的~poj2002Problem DescriptionOn a two-dimensional plane, give you n integer points. Your task is to figure out how many different regular polygon these points can make.InputThe input原创 2017-07-30 16:35:25 · 251 阅读 · 0 评论 -
HDU 6127 Hard challenge【极角排序】
题目来戳呀Problem DescriptionThere are n points on the plane, and the ith points has a value vali, and its coordinate is (xi,yi). It is guaranteed that no two points have the same coordinate, and no two poi原创 2017-08-18 20:19:34 · 308 阅读 · 0 评论 -
HDU 6129 Just do it【杨辉三角】
题目来戳呀 Problem Description There is a nonnegative integer sequence a1…n of length n. HazelFan wants to do a type of transformation called prefix-XOR, which means a1…n changes into b1…n, where bi eq...原创 2017-08-18 21:05:35 · 346 阅读 · 0 评论 -
HDU 6060 RXD and dividing
题目来戳呀Problem DescriptionRXD 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,6,…n in原创 2017-08-12 09:54:53 · 160 阅读 · 0 评论 -
HDU 6097 Mindis【计算几何】
题目来戳呀Problem DescriptionThe center coordinate of the circle C is O, the coordinate of O is (0,0) , and the radius is r. P and Q are two points not outside the circle, and PO = QO. You need to find a原创 2017-08-14 09:59:12 · 309 阅读 · 0 评论 -
HDU 6059 Kanade's trio【字典树】
题目来戳呀Problem DescriptionGive you an array A[1..n],you need to calculate how many tuples (i,j,k) satisfy that (i<j<k) and (AiA_i xor AjA_j )< (AjA_j xor AkA_k) There are T test cases.1≤T≤201≤∑n≤5∗1050≤原创 2017-08-10 23:49:27 · 275 阅读 · 0 评论 -
HDU 6034 Balala Power!【贪心】
Problem Description Talented Mr.Tang has n strings consisting of only lower case characters. He wants to charge them with Balala Power (he could change each character ranged from a to z into each numb原创 2017-07-26 15:58:28 · 315 阅读 · 0 评论 -
HDU 6063 RXD and math【快速幂】【打表找规律】
题目来戳呀Problem DescriptionRXD is a good mathematician. One day he wants to calculate: output the answer module 10^9+7. 1≤n,k≤10^18 μ(n)=1(n=1)μ(n)=(−1)k(n=p1p2…pk)μ(n)=0(otherwise)p1,p2,p3…pk are dif原创 2017-08-14 16:25:22 · 285 阅读 · 0 评论 -
HDU 6078 Wavel Sequence【动态规划】
题目来戳呀Problem DescriptionHave 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原创 2017-08-14 17:05:23 · 278 阅读 · 0 评论 -
HDU 6070 Dirt Ratio【分数规划】【线段树】
题目来戳呀Problem DescriptionIn 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 X problems d原创 2017-08-15 11:00:19 · 224 阅读 · 0 评论 -
HDU 6140 Hybrid Crystals【思维】
题目来戳呀Problem Description Kyber crystals, also called the living crystal or simply the kyber, and known as kaiburr crystals in ancient times, were rare, Force-attuned crystals that grew in nature and原创 2017-08-18 17:25:35 · 328 阅读 · 0 评论 -
HDU 6143 Killer Names【容斥定理】【排列组合】
题目来戳呀Problem Description Galen Marek, codenamed Starkiller, was a male Human apprentice of the Sith Lord Darth Vader. A powerful Force-user who lived during the era of the Galactic Empire, Marek orig原创 2017-08-18 10:20:07 · 431 阅读 · 0 评论 -
HDU 6098 Inversion【思维】
题目来戳呀Problem DescriptionGive an array A, the index starts from 1. Now we want to know Bi=maxi∤jAj , i≥2.InputThe first line of the input gives the number of test cases T; T test cases follow. Each ca原创 2017-08-11 09:28:15 · 233 阅读 · 0 评论 -
HDU 6045 Is Derek lying?【思维】
题目来戳呀Problem DescriptionDerek and Alfia are good friends.Derek is Chinese,and Alfia is Austrian.This summer holiday,they both participate in the summer camp of Borussia Dortmund.During the summer camp,原创 2017-07-29 22:59:44 · 387 阅读 · 0 评论 -
HDU 6038 Function【思维】
题目来戳呀Problem DescriptionYou are given a permutation a from 0 to n−1 and a permutation b from 0 to m−1.Define that the domain of function f is the set of integers from 0 to n−1, and the range of it is t原创 2017-07-29 09:08:55 · 381 阅读 · 0 评论 -
HDU 6047 Maximum Sequence【贪心】
题目来戳呀Problem DescriptionSteph is extremely obsessed with “sequence problems” that are usually seen on magazines: Given the sequence 11, 23, 30, 35, what is the next number? Steph always finds them too原创 2017-07-30 23:45:56 · 211 阅读 · 0 评论 -
HDU 6058 Kanade's sum
Problem Description Give you an array A[1..n]of length n. Let f(l,r,k) be the k-th largest element of A[l..r]. Specially , f(l,r,k)=0 if r−l+1 Input There is only one integer T on first line. F原创 2017-08-08 09:00:43 · 171 阅读 · 0 评论 -
HDU 6053 TrickGCD 【容斥定理】【莫比乌斯函数】
Problem DescriptionYou are given an array A , and Zhu wants to know there are how many different array B satisfy the following conditions? 1≤Bi≤Ai For each pair( l , r ) (1≤l≤r≤n) , gcd(bl,bl+1…br)≥2 I原创 2017-08-01 19:39:48 · 451 阅读 · 0 评论 -
HDU 6069 Counting Divisors【素数筛】【约数个数定理】
题目来戳呀Problem DescriptionIn 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 problem, given l,r原创 2017-08-09 23:23:41 · 425 阅读 · 0 评论 -
HDU 6050 Funny Function
题目来戳呀InputThere is one integer T in the first line. The next T lines,each line includes two integers N and M . 1<=T<=10000,1<=N,M<2^63.OutputFor each given N and M,print the answer in a single line.S原创 2017-08-03 15:40:36 · 171 阅读 · 0 评论 -
HDU 6052 To my boyfriend【思维】
题目来戳呀Problem DescriptionDear LiaoI never forget the moment I met with you. You carefully asked me: “I have a very difficult problem. Can you teach me?”. I replied with a smile, “of course”. You replied原创 2017-08-03 20:05:34 · 431 阅读 · 0 评论 -
HDU 6106 Classes【简单思维】
题目来戳呀Problem DescriptionThe school set up three elective courses, assuming that these courses are A, B, C. N classes of students enrolled in these courses. Now the school wants to count the number of原创 2017-08-10 22:58:35 · 244 阅读 · 0 评论 -
HDU 6130 Kolakoski【找规律】
题目来戳呀Problem DescriptionThis is Kolakosiki sequence: 1,2,2,1,1,2,1,2,2,1,2,2,1,1,2,1,1,2,2,1……. This sequence consists of 1 and 2, and its first term equals 1. Besides, if you see adjacent and equal te原创 2017-08-15 20:20:43 · 951 阅读 · 0 评论