Skip to content

S
skill_tree_algorithm

CSDN 技术社区 / skill_tree_algorithm

通知 9
Star 8
Fork 1
S
skill_tree_algorithm
提交 88724d3b 编写于 作者: 每日一练社区's avatar 每日一练社区
浏览文件
操作

update exercises

上级 2eda9185
隐藏空白更改
内联 并排
Showing with 355 addition and 21 deletion
data/1.算法初阶/1.蓝桥杯/夺冠概率/solution.cpp
浏览文件 @ 88724d3b
...@@ -20,7 +20,7 @@ int main() ...@@ -20,7 +20,7 @@ int main()
{ {
if (j != i && k != i && j != k) if (j != i && k != i && j != k)
{ {
sum += rate[0][i] * rate[j][k]; sum += rate[0][i] * rate[j][k] * rate[0][j];
} }
} }
} }
......
data/1.算法初阶/1.蓝桥杯/方格分割/solution.cpp
浏览文件 @ 88724d3b
...@@ -2,37 +2,37 @@ ...@@ -2,37 +2,37 @@
using namespace std; using namespace std;
int ans; int ans;
int dire[][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}}; //代表4个方向,上下左右 int dire[][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
int vis[7][7]; //哪些点已被访问过 int vis[7][7];
void dfs(int x, int y) void dfs(int x, int y)
{ {
if (x == 0 || y == 0 || x == 6 || y == 6) if (x == 0 || y == 0 || x == 6 || y == 6)
{ //终止出口条件，当走到边缘的时候，符合题意 {
ans++; ans++;
return; return;
} }
//当前的点标注为已访问的点
vis[x][y] = 1; vis[x][y] = 1;
//对称的点也标注为已访问的点
vis[6 - x][6 - y] = 1; vis[6 - x][6 - y] = 1;
for (int k = 0; k < 4; k++) for (int k = 0; k < 4; k++)
{ {
int nx = x + dire[k][0]; //横坐标的增量 int nx = x + dire[k][0];
int ny = y + dire[k][1]; //纵坐标的增量 int ny = y + dire[k][1];
//新坐标
if (nx < 0 || nx > 6 || ny < 0 || ny > 6) if (nx < 0 || nx > 6 || ny < 0 || ny > 6)
continue; //越界，不符合 continue;
if (!vis[nx][ny]) if (!vis[nx][ny])
{ //若新的点未被访问过 {
dfs(nx, ny); //深搜 dfs(nx, ny);
} }
} }
vis[x][y] = 0; vis[x][y] = 0;
vis[6 - x][6 - y] = 0; //对称 vis[6 - x][6 - y] = 0;
} }
int main() int main()
{ {
dfs(3, 3); //初始点 dfs(3, 3);
cout << ans / 4 << endl; cout << ans / 4 << endl;
return 0; return 0;
} }
data/1.算法初阶/1.蓝桥杯/方格分割/solution.md
浏览文件 @ 88724d3b
...@@ -15,30 +15,140 @@ ...@@ -15,30 +15,140 @@
## aop ## aop
### before ### before
```cpp ```cpp
#include <iostream>
using namespace std;
int ans;
int dire[][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
int vis[7][7];
``` ```
### after ### after
```cpp ```cpp
int main()
{
dfs(3, 3);
cout << ans / 4 << endl;
return 0;
}
``` ```
## 答案 ## 答案
```cpp ```cpp
void dfs(int x, int y)
{
if (x == 0 || y == 0 || x == 6 || y == 6)
{
ans++;
return;
}
vis[x][y] = 1;
vis[6 - x][6 - y] = 1;
for (int k = 0; k < 4; k++)
{
int nx = x + dire[k][0];
int ny = y + dire[k][1];
if (nx < 0 || nx > 6 || ny < 0 || ny > 6)
continue;
if (!vis[nx][ny])
{
dfs(nx, ny);
}
}
vis[x][y] = 0;
vis[6 - x][6 - y] = 0;
}
``` ```
## 选项 ## 选项
### A ### A
```cpp ```cpp
void dfs(int x, int y)
{
if (x == 0 || y == 0 || x == 6 || y == 6)
{
ans++;
return;
}
vis[x][y] = 1;
vis[6 - x][6 - y] = 1;
for (int k = 0; k < 4; k++)
{
int nx = x + dire[k][0];
int ny = y + dire[k][1];
if (nx < 0 || nx > 6 || ny < 0 || ny > 6)
continue;
if (!vis[nx][ny])
{
dfs(nx - 1, ny - 1);
}
}
vis[x][y] = 0;
vis[6 - x][6 - y] = 0;
}
``` ```
### B ### B
```cpp ```cpp
void dfs(int x, int y)
{
if (x == 0 || y == 0 || x == 6 || y == 6)
{
ans++;
return;
}
vis[x][y] = 1;
vis[6 - x][6 - y] = 1;
for (int k = 0; k < 4; k++)
{
int nx = x + dire[k][0];
int ny = y + dire[k][1];
if (nx < 0 || nx > 6 || ny < 0 || ny > 6)
continue;
if (!vis[nx][ny])
{
dfs(nx + 1, ny + 1);
}
}
vis[x][y] = 0;
vis[6 - x][6 - y] = 0;
}
``` ```
### C ### C
```cpp ```cpp
void dfs(int x, int y)
{
if (x == 0 || y == 0 || x == 6 || y == 6)
{
ans++;
return;
}
vis[x][y] = 1;
vis[6 - x][6 - y] = 1;
for (int k = 0; k < 4; k++)
{
int nx = x + dire[k][0];
int ny = y + dire[k][1];
if (nx < 0 || nx > 6 || ny < 0 || ny > 6)
continue;
if (!vis[nx][ny])
{
dfs(nx, ny + 1);
}
}
vis[x][y] = 0;
vis[6 - x][6 - y] = 0;
}
``` ```
data/1.算法初阶/1.蓝桥杯/方程整数解/solution.md
浏览文件 @ 88724d3b
...@@ -25,7 +25,9 @@ No Solution ...@@ -25,7 +25,9 @@ No Solution
## aop ## aop
### before ### before
```cpp ```cpp
#include <iostream>
#include <cmath>
using namespace std;
``` ```
### after ### after
```cpp ```cpp
...@@ -34,21 +36,134 @@ No Solution ...@@ -34,21 +36,134 @@ No Solution
## 答案 ## 答案
```cpp ```cpp
int main()
{
int n;
bool flag = false;
while (cin >> n)
{
flag = false;
for (int i = 1; i <= sqrt(n); i++)
{
for (int j = i; j <= sqrt(n); j++)
{
for (int k = j; k <= sqrt(n); k++)
{
if (i * i + j * j + k * k == n)
{
cout << i << ' ' << j << ' ' << k << endl;
flag = true;
}
else if (i * i + j * j + k * k > n)
break;
}
}
}
if (!flag)
cout << "No Solution" << endl;
}
return 0;
}
``` ```
## 选项 ## 选项
### A ### A
```cpp ```cpp
int main()
{
int n;
bool flag = false;
while (cin >> n)
{
flag = false;
for (int i = 1; i <= n; i++)
{
for (int j = i; j <= n; j++)
{
for (int k = j; k <= n; k++)
{
if (i * i + j * j + k * k == n)
{
cout << i << ' ' << j << ' ' << k << endl;
flag = true;
}
else if (i * i + j * j + k * k > n)
break;
}
}
}
if (!flag)
cout << "No Solution" << endl;
}
return 0;
}
``` ```
### B ### B
```cpp ```cpp
int main()
{
int n;
bool flag = false;
while (cin >> n)
{
flag = false;
for (int i = 1; i < sqrt(n); i++)
{
for (int j = 1; j < sqrt(n); j++)
{
for (int k = 1; k < sqrt(n); k++)
{
if (i * i + j * j + k * k == n)
{
cout << i << ' ' << j << ' ' << k << endl;
flag = true;
}
else if (i * i + j * j + k * k > n)
break;
}
}
}
if (!flag)
cout << "No Solution" << endl;
}
return 0;
}
``` ```
### C ### C
```cpp ```cpp
int main()
{
int n;
bool flag = false;
while (cin >> n)
{
flag = false;
for (int i = 1; i <= sqrt(n); i++)
{
for (int j = 1; j <= sqrt(n); j++)
{
for (int k = j; k <= sqrt(n); k++)
{
if (i * i + j * j + k * k == n)
{
cout << i << ' ' << j << ' ' << k << endl;
flag = true;
}
else if (i * i + j * j + k * k > n)
break;
}
}
}
if (!flag)
cout << "No Solution" << endl;
}
return 0;
}
``` ```
data/1.算法初阶/1.蓝桥杯/翻硬币/solution.md
浏览文件 @ 88724d3b
...@@ -40,7 +40,8 @@ o****o**** ...@@ -40,7 +40,8 @@ o****o****
## aop ## aop
### before ### before
```cpp ```cpp
#include <bits/stdc++.h>
using namespace std;
``` ```
### after ### after
```cpp ```cpp
...@@ -49,21 +50,129 @@ o****o**** ...@@ -49,21 +50,129 @@ o****o****
## 答案 ## 答案
```cpp ```cpp
int main()
{
string a, b;
cin >> a >> b;
int a1 = a.size(), b1 = b.size(), ans = 0;
for (int i = 0; i < a1; i++)
{
if (a[i] == b[i])
{
continue;
}
else
{
ans++;
a[i] = b[i];
if (a[i + 1] == '*')
{
a[i + 1] = 'o';
}
else
{
a[i + 1] = '*';
}
}
}
cout << ans << endl;
return 0;
}
``` ```
## 选项 ## 选项
### A ### A
```cpp ```cpp
int main()
{
string a, b;
cin >> a >> b;
int a1 = a.size(), b1 = b.size(), ans = 0;
for (int i = 0; i < a1; i++)
{
if (a[i] == b[i])
{
continue;
}
else
{
ans++;
a[i] = b[i];
if (a[i + 1] == '*')
{
a[i] = 'o';
}
else
{
a[i] = '*';
}
}
}
cout << ans << endl;
return 0;
}
``` ```
### B ### B
```cpp ```cpp
int main()
{
string a, b;
cin >> a >> b;
int a1 = a.size(), b1 = b.size(), ans = 0;
for (int i = 0; i < a1; i++)
{
if (a[i] == b[i])
{
continue;
}
else
{
ans++;
a[i] = b[i];
if (a[i] == '*')
{
a[i + 1] = 'o';
}
else
{
a[i + 1] = '*';
}
}
}
cout << ans << endl;
return 0;
}
``` ```
### C ### C
```cpp ```cpp
int main()
{
string a, b;
cin >> a >> b;
int a1 = a.size(), b1 = b.size(), ans = 0;
for (int i = 0; i < a1; i++)
{
if (a[i] == b[i])
{
continue;
}
else
{
ans++;
a[i] = b[i];
if (a[i] == '*')
{
a[i + 1] = '*';
}
else
{
a[i + 1] = 'o';
}
}
}
cout << ans << endl;
return 0;
}
``` ```
Markdown is supported
0% 或 .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑！
想要评论请 注册 或