暴力
Wang_SF2015
这个作者很懒,什么都没留下…
展开
-
文章标题 HDU 5583:Kingdom of Black and White(暴力+代码实现能力)
Kingdom of Black and WhiteDescriptionIn the Kingdom of Black and White (KBW), there are two kinds of frogs: black frog and white frog. Now frogs are standing in a line, some of them are black, the oth原创 2016-08-08 08:51:34 · 486 阅读 · 0 评论 -
文章标题 HDU 5113 : Black And White (dfs+剪枝)
Black And WhiteDescriptionIn mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous regions, producing a figure called a map, n原创 2016-09-22 22:47:49 · 423 阅读 · 0 评论 -
文章标题 HDU 5578 :Friendship of Frog(暴力+map)
Friendship of FrogDescription frogs from different countries are standing in a line. Each country is represented by a lowercase letter. The distance between adjacent frogs (e.g. the and the frog,原创 2016-11-05 23:34:56 · 481 阅读 · 1 评论 -
文章标题 HDU 5533 : Dancing Stars on Me
Dancing Stars on MeDescriptionThe sky was brushed clean by the wind and the stars were cold in a black sky. What a wonderful night. You observed that, sometimes the stars can form a regular polygon in原创 2016-09-30 21:58:41 · 139 阅读 · 0 评论 -
文章标题 CSU 1756 :Prime
Prime如果a,b的最大公约数是1,说明a,b是一对互素的数,给定你n个数字,希望你找出互素的数的对数 Input第一行输入一个正整数T,表示数据组数 每组数据第一行输入一个正整数n,表示数字的个数(n<=10000) 接下来一行输入n个正整数,每个数字大小不超过1000。 Output输出互素的数的对数 Sample Input 1 4 10 9 6 35 Sample Out原创 2016-12-11 17:42:25 · 329 阅读 · 0 评论 -
文章标题 HDU 1016 : Prime Ring Problem (DFS)
Prime Ring ProblemA ring is compose of n circles as shown in diagram. Put natural number 1, 2, …, n into each circle separately, and the sum of numbers in two adjacent circles should be a prime. Note:原创 2017-01-08 23:38:00 · 262 阅读 · 0 评论 -
文章标题 CSU 1845: Sensor network (暴力LCA+kruskal思想)
1845: Sensor network链接 1845: Sensor network 题意: 给出一些传感器以及他们连接起来的网络,每个传感器都有其额 定电压,要求通过的电压只能高不能低。现在只能在一个传感器 上施加电压,然后问如果要使得网络中的每个点都能够有电,这 样的一个网络中各个传感器之间的极差最小是多少。 分析:很显然的,要使得网络中的每一个点都连通电,必须要连上n-1条边。然后原创 2017-04-19 17:07:26 · 179 阅读 · 0 评论 -
文章标题 coderforces 761C : Dasha and Password(贪心+暴力)
Dasha and PasswordAfter overcoming the stairs Dasha came to classes. She needed to write a password to begin her classes. The password is a string of length n which satisfies the following requirements原创 2017-02-02 15:36:39 · 774 阅读 · 0 评论 -
文章标题 Coderforces 908C New Year and Curling(暴力)
传送门 http://codeforces.com/problemset/problem/908/C 题意:在二维坐标系上有n个半径为r的圆,一开始在无穷远出的xi位置,然后按顺序每次有一个圆往y=0的方向移动,当碰到其他圆或者碰到y=0即停止,然后要我们求最后每个圆最后停止时的y坐标的位置,圆停止后就不再移动,即使被其他圆碰到。 分析:首先数据只有1000,所以直接暴力O(n2)求解,对于第i原创 2017-12-31 21:19:14 · 302 阅读 · 0 评论