recursion

Jump to bottom Edit New page

phonism edited this page Sep 15, 2020 · 3 revisions

题目选讲

费解的开关 ⭐⭐
- 题意：给5*5个灯，初始状态亮着或者关闭，每次可以更改一个灯及其上下左右的灯的状态，问最少需要基本，可以打开所有的灯
- 题解：枚举第一排灯的操作，共有1<<5，那么第一排操作确定后，仍然灭的灯，只能去操作第二排相应位置的灯，同理所有的操作都是确定，最终判断是否是全亮就ok
- 代码：https://github.com/phonism/notes/blob/master/AlgorithmQuestions/BlueBook/CH0201.cpp

Success is like being pregnant, everybody congratulates you, but nobody knows how many times your were fucked before you got there.