自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+

残阳止水

ACM算法

  • 博客(13)
  • 收藏
  • 关注

原创 Killer Names(HDU 6143)

> 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 originated from the Wookiee home planet of Kashyyyk as the sole offspring of two Jed

2017-08-18 15:53:07 395

原创 Hybrid Crystals(HDU 6140)

> 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 were found on scattered planets across the galaxy. They were used by the Jedi an

2017-08-18 10:04:24 296

原创 Euler theorem(HDU 6124)

HazelFan is given two positive integers a,b, and he wants to calculate amodb. But now he forgets the value of b and only remember the value of a, please tell him the number of different possible results.

2017-08-16 19:30:48 397

原创 Just do it(HDU 6129)

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 equals to the XOR value of a1,...,ai. He will repeat it for m times, please tell h

2017-08-16 19:21:17 252

原创 Gameia(HDU 6105)

Alice and Bob are playing a game called 'Gameia ? Gameia !'. The game goes like this :0. There is a tree with all node unpainted initial.1. Because Bob is the VIP player, so Bob has K chances to make a small change on the tree any time during the game if

2017-08-12 10:39:21 412

原创 Kirinriki(HDU 6103)

We define the distance of two strings A and B with same length n isdisA,B=∑i=0n−1|Ai−Bn−1−i|The difference between the two characters is defined as the difference in ASCII.You should find the maximum length of two non-overlapping substrings in given str

2017-08-11 19:40:47 419

原创 Rikka with Graph(HDU 6090)

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 n nodes and m edges, we can define the distance between (i,j) (dist(i,j)) as the

2017-08-10 10:21:34 178

原创 Rikka with Competition(HDU 609)

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:A wrestling match will be held tomorrow. n players will take part in it. The ith player’s strength point is ai.

2017-08-09 10:35:16 435

原创 Rikka with Subset(HDU 6092)

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 their sum is m. Then for each subset S of A, Yuta calculates the sum of S. Now,

2017-08-09 09:54:05 254

原创 Matching In Multiplication(HDU 6073)

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 independent sets) such that every edge connects a vertex in U to one in V. Vertex sets U an

2017-08-08 10:50:56 215

原创 RXD and dividing(HDU 6060)

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,6,…n into k parts S1,S2,S3,…Sk,where ⋃Si={2,3,…,n} and for all different i,j , we can c

2017-08-03 10:00:44 287

原创 RXD's date(HDU 6066)

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 hot temperature. Due to this fact, they would not come out if it is higher than

2017-08-01 21:14:29 443

原创 RXD and math(HDU 6063 快速幂)

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(otherwise)p1,p2,p3…pk are different prime numbers

2017-08-01 21:09:09 911 7

空空如也

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除