AcWing92. 递归实现指数型枚举
样例输入:
3
样例输出:
3
2
2 3
1
1 3
1 2
1 2 3
数据范围n在小于20的时候,大部分都是递归算法
#include<iostream>
using namespace std;
const int N = 20;
int st[N];
int n, k;
void dfs(int u)
{
if (u > n) {
for (int i = 1; i <= n; i++) {
if (st[i] == 1) {
cout << i << " ";
}
}
cout << endl;
return;
}
//选
st[u] = 1;
dfs(u + 1);
st[u] = 0;
//不选
st[u] = 2;
dfs(u + 1);
st[u] = 0;
}
int main()
{
cin >> n;
dfs(1);
return 0;
}
AcWing94. 递归实现排列型枚举
样例输入:
3
样例输出:
1 2 3
1 3 2
2 1 3
2 3 1
3 1 2
3 2 1
按字典序输出这个点不用多考虑,只要按从小到大的顺序枚举
#include<iostream>
using namespace std;
const int N = 12;
int n;
int st[N];
int used[N];//标记数组,1为标记表示改数字使用过
void dfs(int u, int sum)
{
if (sum > n) {
for (int i = 1; i <= n; i++) {
cout << st[i] << " ";
}
cout << endl;
return;
}
for (int i = 1; i <= n; i++) {
if (!used[i]) {
st[u] = i;
used[i] = 1;
dfs(u + 1, sum + 1);
st[u] = 0;
used[i] = 0;
}
}
}
int main()
{
cin >> n;
dfs(1, 1);//第一个参数表示从1这个数开始选,第二个参数表示在选第1个数
return 0;
}
AcWing93.递归实现组合型枚举
样例输入:
5 3
样例输出:
1 2 3
1 2 4
1 2 5
1 3 4
1 3 5
1 4 5
2 3 4
2 3 5
2 4 5
3 4 5
#include<iostream>
using namespace std;
int way[1010];
int m, n;
void dfs(int u, int start)
{
//一个剪枝,当前表示当前选的数加上全部后面没选的数也不满m个数,提前返回
if (u + n - start < m) {
return;
}
if (u == m + 1) {
for (int i = 1; i <= m; i++) {
cout << way[i]<<" ";
}
puts("");
return;
}
for (int i = start; i <= n; i++) {
way[u] = i;
dfs(u + 1, i + 1);
way[u] = 0;
}
}
int main()
{
cin >> n >> m;
dfs(1, 1);
return 0;
}
AcWing3248.放苹果
样例输入:
7 3
样例输出:
8
#include<iostream>
using namespace std;
int m, n;
int dfs(int u, int sum, int last)
{
if (u == n) {
if (sum == 0) {
return 1;
}
return 0;
}
int res = 0;
for (int i = last; i <= sum; i++) {
res += dfs(u + 1, sum - i, i);
}
return res;
}
int main()
{
while (cin >> m >> n) {
cout << dfs(0, m, 0) << endl;
}
return 0;
}
AcWing1208.翻硬币
样例输入:
**********
o****o****
样例输出:
5
#include<iostream>
#include<string>
using namespace std;
string st, ed;
void turn(int x)
{
if (st[x] == 'o') {
st[x] = '*';
}
else {
st[x] = 'o';
}
}
int main()
{
cin >> st >> ed;
int n = st.size();
int cnt = 0;
for (int i = 0; i < n; i++) {
if (st[i] != ed[i]) {
turn(i);
turn(i + 1);
cnt++;
}
}
cout << cnt << endl;
return 0;
}
AcWing95.费解的开关
样例输入:
3
00111
01011
10001
11010
11100
11101
11101
11110
11111
11111
01111
11111
11111
11111
11111
样例输出:
3
2
-1
枚举第一行的每种情况,第一行确定了,剩下的几行可以推出来
第一行有2^5种情况,这里用到了位运算,i>>j&1==1就改变这个开关,否则不变
#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
using namespace std;
const int N = 10;
char g[N][N], bp[N][N];
int dx[5] = { 0, -1, 0, 1, 0 }, dy[5] = { 0, 0, 1, 0, -1 };
void turn(int x, int y) {
for (int i = 0; i < 5; i++) {
int a = x + dx[i], b = y + dy[i];
if (a >= 0 && a < 5 && b >= 0 && b < 5) {
bp[a][b] ^= 1;
}
}
}
int main()
{
int t;
scanf("%d", &t);
while (t--) {
memset(g, 0, sizeof(g));
memset(bp, 0, sizeof(bp));
for (int i = 0; i < 5; i++) {
scanf("%s", g[i]);
}
int ans = 10;
for (int i = 0; i < 32; i++) {
int cnt = 0;
memcpy(bp, g, sizeof(g));
for (int j = 0; j < 5; j++) {
if (i >> j & 1) {
turn(0, j);
cnt++;
}
}
for (int j = 1; j <= 4; j++) {
for (int k = 0; k < 5; k++) {
if (bp[j- 1][k] == '0') {
turn(j, k);
cnt++;
}
}
}
bool flag = 1;
for (int j = 0; j < 5; j++) {
if (bp[4][j] == '0') {
flag = 0;
break;
}
}
if (flag) {
ans = min(ans, cnt);
}
}
if (ans > 6) {
cout << -1 << endl;
}
else {
cout << ans << endl;
}
}
return 0;
}