Skip to content

S
skill_tree_algorithm

CSDN 技术社区 / skill_tree_algorithm

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

update exercises

上级 4c49dc90
隐藏空白更改
内联 并排
Showing with 432 addition and 11 deletion
data/1.算法初阶/1.蓝桥杯/第39级台阶/solution.md
浏览文件 @ cba017e9
...@@ -11,7 +11,11 @@ ...@@ -11,7 +11,11 @@
## aop ## aop
### before ### before
```cpp ```cpp
#include <iostream>
#define LEFT 0
#define RIGHT 1
using namespace std;
int stage[40][2];
``` ```
### after ### after
```cpp ```cpp
...@@ -20,21 +24,77 @@ ...@@ -20,21 +24,77 @@
## 答案 ## 答案
```cpp ```cpp
int main()
{
int i;
stage[1][LEFT] = 1;
stage[1][RIGHT] = 0;
stage[2][LEFT] = 1;
stage[2][RIGHT] = 1;
for (i = 3; i <= 39; i++)
{
stage[i][LEFT] = stage[i - 1][RIGHT] + stage[i - 2][RIGHT];
stage[i][RIGHT] = stage[i - 1][LEFT] + stage[i - 2][LEFT];
}
cout << stage[39][RIGHT] << endl;
return 0;
}
``` ```
## 选项 ## 选项
### A ### A
```cpp ```cpp
int main()
{
int i;
stage[1][LEFT] = 1;
stage[1][RIGHT] = 0;
stage[2][LEFT] = 1;
stage[2][RIGHT] = 1;
for (i = 3; i <= 39; i++)
{
stage[i][LEFT] = stage[i - 1][RIGHT] + stage[i - 2][RIGHT];
stage[i][RIGHT] = stage[i - 1][LEFT] + stage[i - 2][LEFT];
}
cout << stage[39][LEFT] << endl;
return 0;
}
``` ```
### B ### B
```cpp ```cpp
int main()
{
int i;
stage[1][LEFT] = 1;
stage[1][RIGHT] = 0;
stage[2][LEFT] = 1;
stage[2][RIGHT] = 1;
for (i = 3; i <= 39; i++)
{
stage[i][LEFT] = stage[i + 1][RIGHT] + stage[i - 1][RIGHT];
stage[i][RIGHT] = stage[i + 1][LEFT] + stage[i - 1][LEFT];
}
cout << stage[39][RIGHT] << endl;
return 0;
}
``` ```
### C ### C
```cpp ```cpp
int main()
{
int i;
stage[1][LEFT] = 1;
stage[1][RIGHT] = 0;
stage[2][LEFT] = 1;
stage[2][RIGHT] = 1;
for (i = 3; i <= 39; i++)
{
stage[i][LEFT] = stage[i + 1][RIGHT] + stage[i - 1][RIGHT];
stage[i][RIGHT] = stage[i + 1][LEFT] + stage[i - 1][LEFT];
}
cout << stage[39][LEFT] << endl;
return 0;
}
``` ```
data/1.算法初阶/1.蓝桥杯/第几个幸运数/solution.md
浏览文件 @ cba017e9
...@@ -16,7 +16,11 @@ x星的国王有个怪癖，他只喜欢数字3,5和7。 ...@@ -16,7 +16,11 @@ x星的国王有个怪癖，他只喜欢数字3,5和7。
## aop ## aop
### before ### before
```cpp ```cpp
#include <iostream>
#include <cmath>
#include <queue>
#include <set>
using namespace std;
``` ```
### after ### after
```cpp ```cpp
...@@ -25,21 +29,139 @@ x星的国王有个怪癖，他只喜欢数字3,5和7。 ...@@ -25,21 +29,139 @@ x星的国王有个怪癖，他只喜欢数字3,5和7。
## 答案 ## 答案
```cpp ```cpp
int main()
{
set<long long> st;
priority_queue<long long, vector<long long>, greater<long long>> pq;
const int ok[3] = {3, 5, 7};
st.insert(1);
pq.push(1);
int times = 0;
while (true)
{
long long lucky = pq.top();
pq.pop();
if (lucky == 59084709587505)
{ //49
cout << times << endl;
return 0;
}
times++;
for (int i = 0; i < 3; i++)
{
long long b = lucky * ok[i];
if (!st.count(b))
{
st.insert(b);
pq.push(b);
}
}
}
return 0;
}
``` ```
## 选项 ## 选项
### A ### A
```cpp ```cpp
int main()
{
set<long long> st;
priority_queue<long long, vector<long long>, greater<long long>> pq;
const int ok[3] = {3, 5, 7};
st.insert(1);
pq.push(1);
int times = 0;
while (true)
{
long long lucky = pq.top();
pq.pop();
if (lucky == 59084709587505)
{ //49
cout << times << endl;
return 0;
}
times++;
for (int i = 0; i < 3; i++)
{
long long b = lucky * ok[i + 1];
if (!st.count(b))
{
st.insert(b);
pq.push(b);
}
}
}
return 0;
}
``` ```
### B ### B
```cpp ```cpp
int main()
{
set<long long> st;
priority_queue<long long, vector<long long>, greater<long long>> pq;
const int ok[3] = {3, 5, 7};
st.insert(1);
pq.push(1);
int times = 0;
while (true)
{
long long lucky = pq.top();
pq.pop();
if (lucky == 59084709587505)
{ //49
cout << times << endl;
return 0;
}
times++;
for (int i = 0; i < 3; i++)
{
long long b = lucky * ok[i] + 1;
if (!st.count(b))
{
st.insert(b);
pq.push(b);
}
}
}
return 0;
}
``` ```
### C ### C
```cpp ```cpp
int main()
{
set<long long> st;
priority_queue<long long, vector<long long>, greater<long long>> pq;
const int ok[3] = {3, 5, 7};
st.insert(1);
pq.push(1);
int times = 0;
while (true)
{
long long lucky = pq.top();
pq.pop();
if (lucky == 59084709587505)
{ //49
cout << times << endl;
return 0;
}
times++;
for (int i = 0; i < 3; i++)
{
long long b = lucky + ok[i];
if (!st.count(b))
{
st.insert(b);
pq.push(b);
}
}
}
return 0;
}
``` ```
data/1.算法初阶/1.蓝桥杯/第几天/solution.cpp
浏览文件 @ cba017e9
...@@ -13,7 +13,7 @@ int main() ...@@ -13,7 +13,7 @@ int main()
if (is_leap(y)) //判断闰年 if (is_leap(y)) //判断闰年
{ {
for (int i = 0; i < (m - 1); i++) //记录1-（m-1）月天数 for (int i = 0; i < m; i++) //记录1-（m-1）月天数
{ {
ans += L_m_d[i]; ans += L_m_d[i];
} }
...@@ -21,7 +21,7 @@ int main() ...@@ -21,7 +21,7 @@ int main()
} }
else else
{ {
for (int i = 0; i < (m - 1); i++) for (int i = 0; i < m; i++)
{ {
ans += nonL_m_d[i]; ans += nonL_m_d[i];
} }
......
data/1.算法初阶/1.蓝桥杯/第几天/solution.md
浏览文件 @ cba017e9
...@@ -23,7 +23,12 @@ y m d ...@@ -23,7 +23,12 @@ y m d
## aop ## aop
### before ### before
```cpp ```cpp
#include <iostream>
using namespace std;
bool is_leap(int year)
{
return (year % 4 == 0 && year % 100 != 0) || year % 400 == 0;
}
``` ```
### after ### after
```cpp ```cpp
...@@ -32,21 +37,122 @@ y m d ...@@ -32,21 +37,122 @@ y m d
## 答案 ## 答案
```cpp ```cpp
int main()
{
int y, m, d, ans = 0;
cin >> y >> m >> d;
int L_m_d[12] = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int nonL_m_d[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
if (is_leap(y)) //判断闰年
{
for (int i = 0; i < (m - 1); i++) //记录1-（m-1）月天数
{
ans += L_m_d[i];
}
ans += d;
}
else
{
for (int i = 0; i < (m - 1); i++)
{
ans += nonL_m_d[i];
}
ans += d;
}
cout << ans << endl;
return 0;
}
``` ```
## 选项 ## 选项
### A ### A
```cpp ```cpp
int main()
{
int y, m, d, ans = 0;
cin >> y >> m >> d;
int L_m_d[12] = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int nonL_m_d[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
if (is_leap(y)) //判断闰年
{
for (int i = 0; i < m; i++) //记录1-（m-1）月天数
{
ans += L_m_d[i];
}
ans += d;
}
else
{
for (int i = 0; i < (m - 1); i++)
{
ans += nonL_m_d[i];
}
ans += d;
}
cout << ans << endl;
return 0;
}
``` ```
### B ### B
```cpp ```cpp
int main()
{
int y, m, d, ans = 0;
cin >> y >> m >> d;
int L_m_d[12] = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int nonL_m_d[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
if (is_leap(y)) //判断闰年
{
for (int i = 0; i < (m - 1); i++) //记录1-（m-1）月天数
{
ans += L_m_d[i];
}
ans += d;
}
else
{
for (int i = 0; i < m; i++)
{
ans += nonL_m_d[i];
}
ans += d;
}
cout << ans << endl;
return 0;
}
``` ```
### C ### C
```cpp ```cpp
int main()
{
int y, m, d, ans = 0;
cin >> y >> m >> d;
int L_m_d[12] = {31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int nonL_m_d[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
if (is_leap(y)) //判断闰年
{
for (int i = 0; i < m; i++) //记录1-（m-1）月天数
{
ans += L_m_d[i];
}
ans += d;
}
else
{
for (int i = 0; i < m; i++)
{
ans += nonL_m_d[i];
}
ans += d;
}
cout << ans << endl;
return 0;
}
``` ```
data/1.算法初阶/1.蓝桥杯/递增三元组/solution.md
浏览文件 @ cba017e9
...@@ -35,6 +35,15 @@ C = [C1, C2, ... CN]， ...@@ -35,6 +35,15 @@ C = [C1, C2, ... CN]，
## aop ## aop
### before ### before
```cpp ```cpp
#include <iostream>
#include <cstring>
using namespace std;
typedef long long LL;
const int N = 1e5 + 10;
int a[N], b[N], c[N], sa[N], sc[N], s[N];
``` ```
### after ### after
...@@ -44,21 +53,145 @@ C = [C1, C2, ... CN]， ...@@ -44,21 +53,145 @@ C = [C1, C2, ... CN]，
## 答案 ## 答案
```cpp ```cpp
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i], a[i]++;
for (int i = 0; i < n; i++)
cin >> b[i], b[i]++;
for (int i = 0; i < n; i++)
cin >> c[i], c[i]++;
for (int i = 0; i < n; i++)
s[a[i]]++;
for (int i = 1; i < N; i++)
s[i] += s[i - 1];
for (int i = 0; i < n; i++)
sa[i] = s[b[i] - 1];
memset(s, 0, sizeof s);
for (int i = 0; i < n; i++)
s[c[i]]++;
for (int i = 1; i < N; i++)
s[i] += s[i - 1];
for (int i = 0; i < n; i++)
sc[i] = s[N - 1] - s[b[i]];
LL res = 0;
for (int i = 0; i <= n; i++)
res += (LL)sa[i] * sc[i];
cout << res;
}
``` ```
## 选项 ## 选项
### A ### A
```cpp ```cpp
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i], a[i]++;
for (int i = 0; i < n; i++)
cin >> b[i], b[i]++;
for (int i = 0; i < n; i++)
cin >> c[i], c[i]++;
for (int i = 0; i < n; i++)
s[a[i]]++;
for (int i = 1; i < N; i++)
s[i] += s[i - 1];
for (int i = 0; i < n; i++)
sa[i] = s[b[i] - 1];
memset(s, 0, sizeof s);
for (int i = 0; i < n; i++)
s[c[i]]++;
for (int i = 1; i < N; i++)
s[i] += s[i - 1];
for (int i = 0; i < n; i++)
sc[i] = s[N] - s[b[i]];
LL res = 0;
for (int i = 0; i <= n; i++)
res += (LL)sa[i] * sc[i];
cout << res;
}
``` ```
### B ### B
```cpp ```cpp
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i], a[i]++;
for (int i = 0; i < n; i++)
cin >> b[i], b[i]++;
for (int i = 0; i < n; i++)
cin >> c[i], c[i]++;
for (int i = 0; i < n; i++)
s[a[i]]++;
for (int i = 1; i < N; i++)
s[i] += s[i - 1];
for (int i = 0; i < n; i++)
sa[i] = s[b[i] - 1];
memset(s, 0, sizeof s);
for (int i = 0; i < n; i++)
s[c[i]]++;
for (int i = 1; i < N; i++)
s[i] = s[i - 1];
for (int i = 0; i < n; i++)
sc[i] = s[N - 1] - s[b[i]];
LL res = 0;
for (int i = 0; i <= n; i++)
res += (LL)sa[i] * sc[i];
cout << res;
}
``` ```
### C ### C
```cpp ```cpp
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i], a[i]++;
for (int i = 0; i < n; i++)
cin >> b[i], b[i]++;
for (int i = 0; i < n; i++)
cin >> c[i], c[i]++;
for (int i = 0; i < n; i++)
s[a[i]]++;
for (int i = 1; i < N; i++)
s[i] += s[i - 1];
for (int i = 0; i < n; i++)
sa[i] = s[b[i] - 1];
memset(s, 0, sizeof s);
for (int i = 0; i < n; i++)
s[c[i]]++;
for (int i = 1; i < N; i++)
s[i] = s[i - 1];
for (int i = 0; i < n; i++)
sc[i] = s[N - 1] - s[b[i] - 1];
LL res = 0;
for (int i = 0; i <= n; i++)
res += (LL)sa[i] * sc[i];
cout << res;
}
``` ```
Markdown is supported
0% 或 .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑！
想要评论请 注册 或