26 扫雷游戏 普及-
#include <bits/stdc++.h>
using namespace std;
int main(){
int m,n;
cin>>m>>n;
char x[m+2][n+2];
for(int i=1;i<=m;i++){
for(int j=1;j<=n;j++)
cin>>x[i][j];
}
for(int i=1;i<=m;i++){
for(int j=1;j<=n;j++){
if(x[i][j]=='*')
cout<<"*";
else{
int chans=0;
if(x[i-1][j-1]=='*')
chans++;
if(x[i-1][j]=='*')
chans++;
if(x[i-1][j+1]=='*')
chans++;
if(x[i][j-1]=='*')
chans++;
if(x[i][j+1]=='*')
chans++;
if(x[i+1][j-1]=='*')
chans++;
if(x[i+1][j]=='*')
chans++;
if(x[i+1][j+1]=='*')
chans++;
cout<<chans;
}
}
cout<<endl;
}
return 0;
}
27 工作分配 普及/提高-
#include <bits/stdc++.h>
using namespace std;
const int N = 21;
int n,m,c[N][N];
bool vis[N];
int ans=INT_MAX;
void dfs(int k, int sum){
if(k>n){
ans=min(sum, ans);
return;
}
for(int i=1;i<=n;i++){
if(!vis[i]){
vis[i]=true;
dfs(k+1,sum+c[k][i]);
vis[i]=false;
}
}
}
int main(){
freopen("work.in","r",stdin);
freopen("work.out","w",stdout);
cin>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
scanf("%d", &c[i][j]);
dfs(1,0);
cout<<ans;
return 0;
}
28 逃离迷宫 普及-
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int sx[8] = {0, 0, 1, 1, 1, -1, -1, -1};
int sy[8] = {1, -1, 0, 1, -1, 0, 1, -1};
int n, ans = 0;
int a[100][100], b[100][100];
void dfs(int s, int t)
{
int x, y;
if (s == 1 && t == n)
{
ans++;
return;
}
for (int i = 0; i < 8; i++)
{
x = s + sx[i];
y = t + sy[i];
if (x > 0 && y > 0 && x <= n && y <= n && a[x][y] == 0 && b[x][y] == 0)
{
b[x][y] = 1;
dfs(x, y);
b[x][y] = 0;
}
}
return;
}
int main()
{
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
cin >> a[i][j];
memset(b, 0, sizeof(b));
b[1][1] = 1;
dfs(1, 1);
cout << ans;
return 0;
}
29 卡片排列 普及/提高-
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <stdio.h>
using namespace std;
int main()
{
int a[5], t[5], tag = 0, sum = 0;
while (cin >> a[0] >> a[1] >> a[2] >> a[3])
{
for (int i = 0; i < 4; i++)
for (int j = 0; j < 4 - i - 1; j++)
{
if (a[j] > a[j + 1])
{
t[i] = a[j];
a[j] = a[j + 1];
a[j + 1] = t[i];
}
}
if (a[0] == 0 && a[1] == 0 && a[2] == 0 && a[3] == 0)
break;
if (tag)
printf("\n");
tag = 1;
int flag = 1, tmp;
do
{
if (a[0] == 0)
continue;
if (flag)
{
printf("%d%d%d%d", a[0], a[1], a[2], a[3]);
flag = 0;
}
else if (tmp == a[0])
printf(" %d%d%d%d", a[0], a[1], a[2], a[3]);
else
printf("\n%d%d%d%d", a[0], a[1], a[2], a[3]);
tmp = a[0];
} while (next_permutation(a, a + 4));
printf("");
break;
}
return 0;
}
30 子集和 普及/提高-
#include <iostream>
#define N 10005
using namespace std;
long long n, m, a[N], i, j, k, ans, cnt, x, he;
int main()
{
cin >> n >> m;
for (i = 0; i < n; i++)
{
cin >> x;
a[i] = x;
he += x;
if (x == m)
{
cout << "YES";
return 0;
}
}
for (j = 0; j < n; j++)
{
cnt = a[j];
if (he - a[j] == m)
{
cout << "YES";
return 0;
}
for (k = 0; k != j && k < n; k++)
{
ans = a[j] + a[k];
if (ans == m)
{
cout << "YES";
return 0;
}
if (he - ans == m)
{
cout << "YES";
return 0;
}
cnt += a[k];
if (cnt == m)
{
cout << "YES";
return 0;
}
if (he - cnt == m)
{
cout << "YES";
return 0;
}
}
cnt = ans = 0;
}
cout << "NO";
return 0;
}