Multi-University Training
so_so_y
start to record bugs <- so hard so brave
展开
-
HDU 6034 Balala Power!(多校1)
Problem DescriptionTalented 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 number原创 2017-07-29 21:03:04 · 207 阅读 · 0 评论 -
HDU 6038 Function (多校1)
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 the se原创 2017-07-28 20:20:38 · 319 阅读 · 0 评论 -
HDU 6055 Regular polygon(几何数学)(多校2)
Problem 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 file consists of several tes原创 2017-07-28 09:48:28 · 691 阅读 · 0 评论 -
HDU 6143 Killer Names 组合数+(容斥/第二类Stirling数)
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 originate原创 2017-08-18 10:45:54 · 307 阅读 · 0 评论 -
HDU 6058 Kanade's sum(多校3)
Problem DescriptionGive 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+1InputThere is only one integer T on first line.For each test原创 2017-08-06 20:57:44 · 234 阅读 · 0 评论 -
HDU 6069 Counting Divisors(多校4)
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 and原创 2017-08-07 12:27:29 · 420 阅读 · 0 评论 -
HDU 6047 Maximum Sequence(多校2)
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 easy原创 2017-07-28 16:20:29 · 246 阅读 · 0 评论