高斯消元法
hncu__lz
既然坚持了这么久,就要坚持到最后~
展开
-
poj 1753 Flip Game (枚举+高斯消元法)
Description Flip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each piece is lying原创 2017-03-08 12:03:31 · 258 阅读 · 0 评论 -
poj 1830 开关问题(高斯消元法)
Description 有N个相同的开关,每个开关都与某些开关有着联系,每当你打开或者关闭某个开关的时候,其他的与此开关相关联的开关也会相应地发生变化,即这些相联系的开关的状态如果原来为开就变为关,如果为关就变为开。你的目标是经过若干次开关操作后使得最后N个开关达到一个特定的状态。对于任意一个开关,最多只能进行一次开关操作。你的任务是,计算有多少种可以达到指定状态的方法。(不计开关操作的顺序原创 2017-03-08 20:15:32 · 235 阅读 · 0 评论 -
高斯消元法模板
//这里提供下自己写的还算满意的求解整数线性方程组的模板(浮点数类似,就不提供了)~~ /* 用于求整数解得方程组. */ #include #include #include using namespace std; const int maxn = 105; int equ, var; // 有equ个方程,var个变元。增广阵行数为equ, 分别为0到equ - 1,列数为var +转载 2017-03-06 21:40:04 · 262 阅读 · 0 评论 -
poj 3185 The Water Bowls (高斯消元法)
Description The cows have a line of 20 water bowls from which they drink. The bowls can be either right-side-up (properly oriented to serve refreshing cool water) or upside-down (a position which h原创 2017-03-08 21:52:12 · 309 阅读 · 0 评论 -
poj 2947 Widget Factory (高斯消元法,解模线性方程组)
Description The 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 simpl原创 2017-03-09 21:45:22 · 218 阅读 · 0 评论 -
poj 1222 EXTENDED LIGHTS OUT (高斯消元法)
Description In 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 pres原创 2017-03-06 21:35:37 · 340 阅读 · 0 评论 -
poj 1681 Painter's Problem(高斯消元法)
Description There 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 th原创 2017-03-07 20:24:36 · 280 阅读 · 0 评论