2017年07月_so_so_y

原创山东省第五届ACM省赛 Circle（高斯消元）

Problem DescriptionYou have been given a circle from 0 to n - 1. If you are currently at x, you will move to (x - 1) mod n or (x + 1) mod n with equal probability. Now we want to know the expected n...

2017-07-31 17:40:55 454

原创高斯消元学习总结

算法目的主要是用来求解线性方程组，根据方程组得出增广矩阵，对增广矩阵进行化简可得矩阵的秩，并可以根据秩的关系判断方程解的情况。算法主要思想1、线性代数中有关矩阵的化简（主要是初等行变换）：先根据矩阵初等行变换求解方程组 2x+y+z=16x+2y+z=−1−2x+2y+z=72x+y+z=1\\6x+2y+z=-1\\-2x+2y+z=7 先根据方程组表示出增广矩阵，化简 ⎡⎣⎢⎢26−2

2017-07-31 13:47:44 2269

原创 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 196

原创 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 308

原创 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 234

原创 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 681

原创 POJ 2947 Widget Factory(高斯消元)

DescriptionThe widget factory produces several different kinds of widgets. Each widget is carefully built by a skilled widgeteer. The time required to build a widget depends on its type: the simple wid

2017-07-26 21:25:43 421

原创 POJ 2065 SETI(高斯消元)

DescriptionFor some years, quite a lot of work has been put into listening to electromagnetic radio signals received from space, in order to understand what civilizations in distant galaxies might be t

2017-07-26 20:53:17 574

原创 POJ 1830 开关问题(高斯消元)

Description有N个相同的开关，每个开关都与某些开关有着联系，每当你打开或者关闭某个开关的时候，其他的与此开关相关联的开关也会相应地发生变化，即这些相联系的开关的状态如果原来为开就变为关，如果为关就变为开。你的目标是经过若干次开关操作后使得最后N个开关达到一个特定的状态。对于任意一个开关，最多只能进行一次开关操作。你的任务是，计算有多少种可以达到指定状态的方法。（不计开关操作的顺序）Inpu

2017-07-26 20:16:00 748

原创 POJ 1681 Painter's Problem(高斯消元)

DescriptionThere is a square wall which is made of n*n small square bricks. Some bricks are white while some bricks are yellow. Bob is a painter and he wants to paint all the bricks yellow. But there i

2017-07-26 20:08:05 492

原创 POJ 1222 EXTENDED LIGHTS OUT（高斯消元）

DescriptionIn an extended version of the game Lights Out, is a puzzle with 5 rows of 6 buttons each (the actual puzzle has 5 rows of 5 buttons each). Each button has a light. When a button is pressed,

2017-07-25 20:50:24 710

原创 HDU 4101Ali and Baba (bfs)

DescriptionThere is a rectangle area (with N rows and M columns) in front of Ali and Baba, each grid might be one of the following: 1. Empty area, represented by an integer 0. 2. A Stone, represented

2017-07-15 00:11:06 284

原创 hihocoder第158周非法二进制数（dp）

描述如果一个二进制数包含连续的两个1，我们就称这个二进制数是非法的。小Hi想知道在所有 n 位二进制数（一共有2n个）中，非法二进制数有多少个。例如对于 n = 3,有 011, 110, 111 三个非法二进制数。由于结果可能很大，你只需要输出模109+7的余数。输入一个整数 n (1 ≤ n ≤ 100)。输出n 位非法二进制数的数目模109+7的余

2017-07-10 19:04:55 625

原创 hihoCoder 第157周二进制小数

描述给定一个十进制小数X，判断X的二进制表示是否是有限确定的。例如0.5的二进制表示是0.1，0.75的二进制表示是0.11，0.3没有确定有限的二进制表示。输入第一行包含一个整数 T (1 ≤ T ≤ 10)，表示测试数据的组数。以下T行每行包含一个十进制小数 X (0 < X < 1)。 X一定是以"0."开头，小数部分不超过100位。输出对于每组输入，输出 X 的二进制表示或者NO(如

2017-07-02 16:48:01 452

so_so_y的博客