1. 顺时针旋转数组
考点:二维数组索引的对应关系。
#include <string>
#include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;
int main()
{
int N;
cin >> N;
int f[12][12];
int res[12][12];
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
cin >> f[i][j];
int M;
cin >> M;
int op = M % 4;
switch (op)
{
case 0:
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
res[i][j] = f[i][j];
break;
case 1:
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
res[i][j] = f[N - 1 - j][i];
break;
case 2:
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
res[i][j] = f[N - 1 - i][N - 1 - j];
break;
case 3:
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
res[i][j] = f[j][N - 1 - i];
break;
default:
break;
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++)
cout << res[i][j] << " ";
cout << endl;
}
return 0;
}
2.分糖果
将n个无差别的糖果分给k个小朋友。输出分发,并枚举所有分法。
输入描述:
仅一行,包含两个整数n(0 <= n <= 10)和k(0 <= k <= 10)n表示糖果的数量,k表示小朋友。
输出描述:
第一行输出分法总数;
后续t行一次列出每种分发:每件礼物用字符‘*’表示,用字符‘|’(ascii码为124)分隔小朋友。
例如:
输入 3 2
输出
4
* * * |
* * | *
* | * *
| * * *
code:dfs
void dfs(vector<int>& v, int remain, int n, vector<string>& res, int last)
{
if (remain == 0)
{
string s;
for (int i = 0; i < v.size(); i++)
{
if (v[i] == 0) s += '*';
else s += "|*";
}
s = s.substr(0, s.size() - 1);
res.push_back(s);
return;
}
for (int i = last; i < v.size(); i++)
{
if (v[i] == 1) continue;
v[i] = 1;
dfs(v, remain - 1, n, res, i);
v[i] = 0;
}
}
int main()
{
int n = 3;
int k = 2;
vector<string> res;
vector<int> v(n + 1, 0);
dfs(v, k - 1, n, res, 0);
cout << "res";
return 0;
}