-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathindex.html
More file actions
168 lines (160 loc) · 48.5 KB
/
index.html
File metadata and controls
168 lines (160 loc) · 48.5 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
<!DOCTYPE html><html lang="zh-CN" data-theme="light"><head><meta charset="UTF-8"><meta http-equiv="X-UA-Compatible" content="IE=edge"><meta name="viewport" content="width=device-width,initial-scale=1"><title>HBUACM - 河北大学程序设计训练营</title><meta name="description" content="2024河北大学程序设计训练营"><meta name="author" content="HBU"><meta name="copyright" content="HBU"><meta name="format-detection" content="telephone=no"><link rel="shortcut icon" href="/img/favicon.png"><link rel="canonical" href="http://hbuacm.github.io/"><meta http-equiv="Cache-Control" content="no-transform"><meta http-equiv="Cache-Control" content="no-siteapp"><link rel="preconnect" href="//cdn.jsdelivr.net"/><link rel="preconnect" href="//fonts.googleapis.com" crossorigin="crossorigin"/><link rel="preconnect" href="//busuanzi.ibruce.info"/><meta property="og:type" content="website"><meta property="og:title" content="HBUACM"><meta property="og:url" content="http://hbuacm.github.io/"><meta property="og:site_name" content="HBUACM"><meta property="og:description" content="2024河北大学程序设计训练营"><meta property="og:image" content="http://hbuacm.github.io/img/avatar.png"><meta property="article:published_time" content="2025-09-04T14:32:27.986Z"><meta property="article:modified_time" content="2025-09-04T14:32:27.986Z"><meta name="twitter:card" content="summary"><script>var activateDarkMode = function () {
document.documentElement.setAttribute('data-theme', 'dark')
if (document.querySelector('meta[name="theme-color"]') !== null) {
document.querySelector('meta[name="theme-color"]').setAttribute('content', '#000')
}
}
var activateLightMode = function () {
document.documentElement.setAttribute('data-theme', 'light')
if (document.querySelector('meta[name="theme-color"]') !== null) {
document.querySelector('meta[name="theme-color"]').setAttribute('content', '#fff')
}
}
var getCookies = function (name) {
const value = `; ${document.cookie}`
const parts = value.split(`; ${name}=`)
if (parts.length === 2) return parts.pop().split(';').shift()
}
var autoChangeMode = 'false'
var t = getCookies('theme')
if (autoChangeMode === '1') {
var isDarkMode = window.matchMedia('(prefers-color-scheme: dark)').matches
var isLightMode = window.matchMedia('(prefers-color-scheme: light)').matches
var isNotSpecified = window.matchMedia('(prefers-color-scheme: no-preference)').matches
var hasNoSupport = !isDarkMode && !isLightMode && !isNotSpecified
if (t === undefined) {
if (isLightMode) activateLightMode()
else if (isDarkMode) activateDarkMode()
else if (isNotSpecified || hasNoSupport) {
console.log('You specified no preference for a color scheme or your browser does not support it. I Schedule dark mode during night time.')
var now = new Date()
var hour = now.getHours()
var isNight = hour <= 6 || hour >= 18
isNight ? activateDarkMode() : activateLightMode()
}
window.matchMedia('(prefers-color-scheme: dark)').addListener(function (e) {
if (Cookies.get('theme') === undefined) {
e.matches ? activateDarkMode() : activateLightMode()
}
})
} else if (t === 'light') activateLightMode()
else activateDarkMode()
} else if (autoChangeMode === '2') {
now = new Date()
hour = now.getHours()
isNight = hour <= 6 || hour >= 18
if (t === undefined) isNight ? activateDarkMode() : activateLightMode()
else if (t === 'light') activateLightMode()
else activateDarkMode()
} else {
if (t === 'dark') activateDarkMode()
else if (t === 'light') activateLightMode()
}</script><link rel="stylesheet" href="/css/index.css"><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/@fortawesome/fontawesome-free/css/all.min.css"><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/@fancyapps/fancybox@latest/dist/jquery.fancybox.min.css"><link rel="stylesheet" href="https://fonts.googleapis.com/css?family=Titillium+Web&display=swap"><script>var GLOBAL_CONFIG = {
root: '/',
algolia: undefined,
localSearch: undefined,
translate: {"defaultEncoding":2,"translateDelay":0,"msgToTraditionalChinese":"繁","msgToSimplifiedChinese":"簡"},
copy: {
success: '复制成功',
error: '复制错误',
noSupport: '浏览器不支持'
},
bookmark: {
message_prev: '按',
message_next: '键将本页加入书签'
},
runtime_unit: '天',
runtime: true,
copyright: undefined,
ClickShowText: {"text":"C++,二叉树,String,图,堆,栈,队列,头秃,AC,WA","fontSize":"15px"},
medium_zoom: false,
fancybox: true,
Snackbar: undefined,
justifiedGallery: {
js: 'https://cdn.jsdelivr.net/npm/justifiedGallery/dist/js/jquery.justifiedGallery.min.js',
css: 'https://cdn.jsdelivr.net/npm/justifiedGallery/dist/css/justifiedGallery.min.css'
},
baiduPush: false,
highlightCopy: true,
highlightLang: true,
isPhotoFigcaption: false,
islazyload: true,
isanchor: false
}</script><script>var GLOBAL_CONFIG_SITE = {
isPost: false,
isHome: true,
isHighlightShrink: false,
isSidebar: false
}</script><noscript><style>
#nav {
opacity: 1
}
.justified-gallery img{
opacity: 1
}
</style></noscript><meta name="generator" content="Hexo 4.2.1"></head><body><canvas class="fireworks"></canvas><div id="mobile-sidebar"><div id="menu_mask"></div><div id="mobile-sidebar-menus"><div class="mobile_author_icon"><img class="avatar-img" src="/img/avatar.png" onerror="onerror=null;src='/img/friend_404.gif'" alt="avatar"/></div><div class="mobile_post_data"><div class="mobile_data_item is-center"><div class="mobile_data_link"><a href="/archives/"><div class="headline">文章</div><div class="length_num">351</div></a></div></div><div class="mobile_data_item is-center"> <div class="mobile_data_link"><a href="/tags/"><div class="headline">标签</div><div class="length_num">151</div></a></div></div><div class="mobile_data_item is-center"> <div class="mobile_data_link"><a href="/categories/"><div class="headline">分类</div><div class="length_num">74</div></a></div></div></div><hr/><div class="menus_items"><div class="menus_item"><a class="site-page" href="/"><i class="fa-fw fas fa-home"></i><span> 主页</span></a></div><div class="menus_item"><a class="site-page" href="/guestbook"><i class="fa-fw fas fa-message"></i><span> 留言板</span></a></div><div class="menus_item"><a class="site-page" href="/archives/"><i class="fa-fw fas fa-archive"></i><span> 时间轴</span></a></div><div class="menus_item"><a class="site-page" href="/tags/"><i class="fa-fw fas fa-tags"></i><span> 标签</span></a></div><div class="menus_item"><a class="site-page" href="/categories/"><i class="fa-fw fas fa-folder-open"></i><span> 分类</span></a></div><div class="menus_item"><a class="site-page"><i class="fa-fw fas fa-list"></i><span> 列表</span><i class="fas fa-chevron-down menus-expand"></i></a><ul class="menus_item_child"><li><a class="site-page" href="/music/"><i class="fa-fw fas fa-music"></i><span> Music</span></a></li><li><a class="site-page" href="/movies/"><i class="fa-fw fas fa-video"></i><span> Movie</span></a></li></ul></div><div class="menus_item"><a class="site-page" href="/link/"><i class="fa-fw fas fa-link"></i><span> 链接</span></a></div><div class="menus_item"><a class="site-page" href="/about/"><i class="fa-fw fas fa-heart"></i><span> 关于</span></a></div></div></div></div><div id="body-wrap"><header class="full_page" id="page-header" style="background-image: url(/images/Training_Camp_Cove.png)"><nav id="nav"><span class="pull-left" id="blog_name"><a class="blog_title" id="site-name" href="/">HBUACM</a></span><span class="pull-right menus"><div class="menus_items"><div class="menus_item"><a class="site-page" href="/"><i class="fa-fw fas fa-home"></i><span> 主页</span></a></div><div class="menus_item"><a class="site-page" href="/guestbook"><i class="fa-fw fas fa-message"></i><span> 留言板</span></a></div><div class="menus_item"><a class="site-page" href="/archives/"><i class="fa-fw fas fa-archive"></i><span> 时间轴</span></a></div><div class="menus_item"><a class="site-page" href="/tags/"><i class="fa-fw fas fa-tags"></i><span> 标签</span></a></div><div class="menus_item"><a class="site-page" href="/categories/"><i class="fa-fw fas fa-folder-open"></i><span> 分类</span></a></div><div class="menus_item"><a class="site-page"><i class="fa-fw fas fa-list"></i><span> 列表</span><i class="fas fa-chevron-down menus-expand"></i></a><ul class="menus_item_child"><li><a class="site-page" href="/music/"><i class="fa-fw fas fa-music"></i><span> Music</span></a></li><li><a class="site-page" href="/movies/"><i class="fa-fw fas fa-video"></i><span> Movie</span></a></li></ul></div><div class="menus_item"><a class="site-page" href="/link/"><i class="fa-fw fas fa-link"></i><span> 链接</span></a></div><div class="menus_item"><a class="site-page" href="/about/"><i class="fa-fw fas fa-heart"></i><span> 关于</span></a></div></div><span class="toggle-menu close"><a class="site-page"><i class="fas fa-bars fa-fw"></i></a></span></span></nav><div id="site-info"><h1 id="site_title">HBUACM</h1><div id="site_subtitle"><span id="subtitle"></span></div><div id="site_social_icons"><a class="social-icon" href="https://github.com/hbuacm" target="_blank" title="Github"><i class="fab fa-github"></i></a><a class="social-icon" href="mailto:1076998404@qq.com" target="_blank" title="Email"><i class="fas fa-envelope"></i></a><a class="social-icon" href="https://www.nowcoder.com/study/live/425" target="_blank" title="nowcode"><i class="fab fa-youtube-play"></i></a></div></div><div id="scroll_down"><i class="fas fa-angle-down scroll-down-effects"></i></div></header><main class="layout_page" id="content-inner"><div class="recent-posts" id="recent-posts"><div class="recent-post-item"><div class="post_cover left_radius"><a href="/2025/01/14/2025%E5%AF%92%E5%81%87%E6%96%B0%E7%94%9F%E8%90%A5%E7%AC%AC%E4%B8%80%E6%AC%A1%E8%AE%AD%E7%BB%83/" title="2025寒假新生营第一次训练"> <img class="post_bg" data-src="/images/tran1.png" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="2025寒假新生营第一次训练"></a></div><div class="recent-post-info"><a class="article-title" href="/2025/01/14/2025%E5%AF%92%E5%81%87%E6%96%B0%E7%94%9F%E8%90%A5%E7%AC%AC%E4%B8%80%E6%AC%A1%E8%AE%AD%E7%BB%83/" title="2025寒假新生营第一次训练">2025寒假新生营第一次训练</a><div class="article-meta-wrap"><time class="post-meta__date" title="发表于 2025-01-14 20:00:00"><i class="far fa-calendar-alt"></i>2025-01-14</time><span class="article-meta"><span class="article-meta__separator">|</span><i class="fas fa-inbox article-meta__icon"></i><a class="article-meta__categories" href="/categories/2025%E5%AF%92%E5%81%87%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E7%9F%A5%E8%A1%8C%E6%96%B0%E7%94%9F%E8%AE%AD%E7%BB%83%E8%90%A5/">2025寒假程序设计知行新生训练营</a><i class="fas fa-angle-right"></i><a class="article-meta__categories" href="/categories/2025%E5%AF%92%E5%81%87%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E7%9F%A5%E8%A1%8C%E6%96%B0%E7%94%9F%E8%AE%AD%E7%BB%83%E8%90%A5/%E7%AC%AC%E4%B8%80%E6%AC%A1%E8%AE%AD%E7%BB%83/">第一次训练</a></span></div><div class="content">7-1 A + B ?简单输入输出
123456789101112#include <bits/stdc++.h>using namespace std;int main(){ int n,a,b; cin>>n; for(int i=1;i<=n;i++){ cin>>a>>b; cout<<a+b<<endl; } return 0;}
7-2 鸡兔同笼问题典型数学解方程问题
x+y=a
2x+4y=b
y=(b-2a)/2 , x=a-(b-2a)/2;
12345678910#include <bits/stdc++.h>using namespace std;int main(){ int a,b; cin>>a>>b; cout<<"The number of hens is ...</div></div></div><div class="recent-post-item"><div class="post_cover right_radius"><a href="/2025/01/11/2025%E5%AF%92%E5%81%87%E6%96%B0%E7%94%9F%E8%90%A5%E5%BC%80%E8%90%A5%E6%B5%8B%E8%AF%95/" title="2025寒假新生营开营测试"> <img class="post_bg" data-src="/images/2025%E5%AF%92%E5%81%87%E8%AE%AD%E7%BB%83%E8%90%A5%E5%BC%80%E8%90%A5%E6%B5%8B%E8%AF%95.png" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="2025寒假新生营开营测试"></a></div><div class="recent-post-info"><a class="article-title" href="/2025/01/11/2025%E5%AF%92%E5%81%87%E6%96%B0%E7%94%9F%E8%90%A5%E5%BC%80%E8%90%A5%E6%B5%8B%E8%AF%95/" title="2025寒假新生营开营测试">2025寒假新生营开营测试</a><div class="article-meta-wrap"><time class="post-meta__date" title="发表于 2025-01-11 21:30:00"><i class="far fa-calendar-alt"></i>2025-01-11</time><span class="article-meta"><span class="article-meta__separator">|</span><i class="fas fa-inbox article-meta__icon"></i><a class="article-meta__categories" href="/categories/2025%E5%AF%92%E5%81%87%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E7%9F%A5%E8%A1%8C%E6%96%B0%E7%94%9F%E8%AE%AD%E7%BB%83%E8%90%A5/">2025寒假程序设计知行新生训练营</a><i class="fas fa-angle-right"></i><a class="article-meta__categories" href="/categories/2025%E5%AF%92%E5%81%87%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E7%9F%A5%E8%A1%8C%E6%96%B0%E7%94%9F%E8%AE%AD%E7%BB%83%E8%90%A5/%E5%BC%80%E8%90%A5%E6%B5%8B%E8%AF%95/">开营测试</a></span></div><div class="content">7-1 建校日期直接输出2025-01-11
12345#include<iostream>using namespace std;int main(){ cout << "1921-10-18" << "\n"; //相当于c语言printf("1921-10-18\n");}
7-2 精准打击很简单就是计算圆面积，需要注意保留两位小数（输出时只输出小数点后两位）
123456789#include<iostream>#define PII 3.14using namespace std;double R,S;int main(){ cin >> R; S = R*R*PII; printf("%.2lf",S);}
7-3 小孩子才做选择，大人全都要有题意可知：
假设两个盲盒中的狗粮或储蓄盒容量分别为c1，c2
阿汪只会在两个盲盒之间选择1个有狗粮且狗粮最多的一个。则让阿汪选能吃到的狗粮 A=max(0,c1,c2)
铲屎官会两个盲盒都要，则铲屎官全都要能 ...</div></div></div><div class="recent-post-item"><div class="post_cover left_radius"><a href="/2024/08/10/2024%E6%9A%91%E5%81%87%E8%AE%AD%E7%BB%83week3/" title="2024暑假知行进阶营第三周题解"> <img class="post_bg" data-src="/images/week3.jpg" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="2024暑假知行进阶营第三周题解"></a></div><div class="recent-post-info"><a class="article-title" href="/2024/08/10/2024%E6%9A%91%E5%81%87%E8%AE%AD%E7%BB%83week3/" title="2024暑假知行进阶营第三周题解">2024暑假知行进阶营第三周题解</a><div class="article-meta-wrap"><time class="post-meta__date" title="发表于 2024-08-10 21:30:00"><i class="far fa-calendar-alt"></i>2024-08-10</time><span class="article-meta"><span class="article-meta__separator">|</span><i class="fas fa-inbox article-meta__icon"></i><a class="article-meta__categories" href="/categories/2024%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/">2024程序设计训练营</a><i class="fas fa-angle-right"></i><a class="article-meta__categories" href="/categories/2024%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/%E7%AC%AC3%E5%91%A8-%E7%AE%97%E6%B3%95%E8%BF%9B%E9%98%B6/">第3周 算法进阶</a></span></div><div class="content">7-1123456789101112131415161718192021222324252627#include <iostream>#include <cstring>using namespace std;const int N = 510 , MAX = 1e9 ;int n;int a[N][N] ,f[N][N] ; int main () { cin >> n ; for (int i = 1 ; i <= n ; i ++ ) for (int j = 1 ; j <= i ; j ++ ) cin >> a[i][j] ; for (int i = 0 ; i <= n ; i++) for (int j = 0 ; j <= i + 1 ; j ++ ) f[i][j] = -MAX ; f[1][1] = a[1][1]; for (int i = 2 ; i <= n ; i + ...</div></div></div><div class="recent-post-item"><div class="post_cover right_radius"><a href="/2024/08/03/2024%E6%9A%91%E5%81%87%E8%AE%AD%E7%BB%83week2/" title="2024暑假知行进阶营第二周题解"> <img class="post_bg" data-src="/images/week2.png" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="2024暑假知行进阶营第二周题解"></a></div><div class="recent-post-info"><a class="article-title" href="/2024/08/03/2024%E6%9A%91%E5%81%87%E8%AE%AD%E7%BB%83week2/" title="2024暑假知行进阶营第二周题解">2024暑假知行进阶营第二周题解</a><div class="article-meta-wrap"><time class="post-meta__date" title="发表于 2024-08-03 21:30:00"><i class="far fa-calendar-alt"></i>2024-08-03</time><span class="article-meta"><span class="article-meta__separator">|</span><i class="fas fa-inbox article-meta__icon"></i><a class="article-meta__categories" href="/categories/2024%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/">2024程序设计训练营</a><i class="fas fa-angle-right"></i><a class="article-meta__categories" href="/categories/2024%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/%E7%AC%AC2%E5%91%A8-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E8%BF%9B%E9%98%B6%E4%B8%8E%E7%AE%97%E6%B3%95%E5%9F%BA%E7%A1%80/">第2周 数据结构进阶与算法基础</a></span></div><div class="content">7-1村村通用并查集将有道路的城市连通起来，最后检查有多少个连通分量，需要的道路数就是连通分量数-1。
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253#include<bits/stdc++.h>using namespace std;int fa[1010];int find(int x){ if(fa[x]==x) return fa[x]; else { fa[x]=find(fa[x]); return fa[x]; }}void merge(int a,int b){ int a1=find(a); int b1=find(b); if(a1!=b1) { fa[a1]=b1; }}int main(){ int n,m ...</div></div></div><div class="recent-post-item"><div class="post_cover left_radius"><a href="/2024/07/27/2024%E6%9A%91%E5%81%87%E8%AE%AD%E7%BB%83week1/" title="2024暑假知行进阶营第一周题解"> <img class="post_bg" data-src="/images/2022week1.jpeg" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="2024暑假知行进阶营第一周题解"></a></div><div class="recent-post-info"><a class="article-title" href="/2024/07/27/2024%E6%9A%91%E5%81%87%E8%AE%AD%E7%BB%83week1/" title="2024暑假知行进阶营第一周题解">2024暑假知行进阶营第一周题解</a><div class="article-meta-wrap"><time class="post-meta__date" title="发表于 2024-07-27 21:30:00"><i class="far fa-calendar-alt"></i>2024-07-27</time><span class="article-meta"><span class="article-meta__separator">|</span><i class="fas fa-inbox article-meta__icon"></i><a class="article-meta__categories" href="/categories/2024%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/">2024程序设计训练营</a><i class="fas fa-angle-right"></i><a class="article-meta__categories" href="/categories/2024%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/%E7%AC%AC1%E5%91%A8-%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%B7%A9%E5%9B%BA/">第1周 数据结构巩固</a></span></div><div class="content">*7-1入度与出度 *选定数据结构后分别用两个数组记录出度和入度即可。
7-2 图的存储—邻接表根据题意读入数据建立邻接表，按要求输出即可。
12345678910111213141516171819202122232425#include <iostream>#include <cstdio>#include <vector>using namespace std;vector <int> gr[20];int main() { int n, m, s; cin >> n >> m >> s; for(int i = 1; i <= m; ++i) { int u, v; cin >> u >> v; gr[u].push_back(v); if(!s) gr[v].push_back(u); } for(int i = 1; i <= n; ++i) { cout << i-1 << ":" ...</div></div></div><div class="recent-post-item"><div class="post_cover right_radius"><a href="/2023/08/17/20238week5/" title="2023暑假知行进阶营第五周题解"> <img class="post_bg" data-src="/images/week5hs.png" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="2023暑假知行进阶营第五周题解"></a></div><div class="recent-post-info"><a class="article-title" href="/2023/08/17/20238week5/" title="2023暑假知行进阶营第五周题解">2023暑假知行进阶营第五周题解</a><div class="article-meta-wrap"><time class="post-meta__date" title="发表于 2023-08-17 13:46:25"><i class="far fa-calendar-alt"></i>2023-08-17</time><span class="article-meta"><span class="article-meta__separator">|</span><i class="fas fa-inbox article-meta__icon"></i><a class="article-meta__categories" href="/categories/2023%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/">2023程序设计训练营</a><i class="fas fa-angle-right"></i><a class="article-meta__categories" href="/categories/2023%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/%E7%AC%AC5%E5%91%A8-%E5%9B%9E%E6%BA%AF/">第5周 回溯</a></span></div><div class="content">7-1 图的先深搜索朴素的 DFS
12345678910111213141516171819202122232425262728293031323334353637383940#include<bitsdc++.h>using namespace std;int head[11];bool vis[11];int n,m,a,cnt,t;struct edge{ int to; int last;}e[51];void add(int x,int y){ cnt++; e[cnt].to=y; e[cnt].last=head[x]; head[x]=cnt;}void dfs(int k){ if(t==n) return; vis[k]=true; t++; cout<<k<<" "; for(int i=head[k];i>=1;i=e[i].last){ if(!vis[e[i].to]) dfs(e[i].to);  ...</div></div></div><div class="recent-post-item"><div class="post_cover left_radius"><a href="/2023/08/06/20238week4/" title="2023暑假知行进阶营第四周题解"> <img class="post_bg" data-src="/images/week4.jpg" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="2023暑假知行进阶营第四周题解"></a></div><div class="recent-post-info"><a class="article-title" href="/2023/08/06/20238week4/" title="2023暑假知行进阶营第四周题解">2023暑假知行进阶营第四周题解</a><div class="article-meta-wrap"><time class="post-meta__date" title="发表于 2023-08-06 13:46:25"><i class="far fa-calendar-alt"></i>2023-08-06</time><span class="article-meta"><span class="article-meta__separator">|</span><i class="fas fa-inbox article-meta__icon"></i><a class="article-meta__categories" href="/categories/2023%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/">2023程序设计训练营</a><i class="fas fa-angle-right"></i><a class="article-meta__categories" href="/categories/2023%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/%E7%AC%AC4%E5%91%A8-%E6%A0%91%E3%80%81%E5%9B%BE%E7%9A%84%E6%B7%B1%E5%85%A5/">第4周 树、图的深入</a></span></div><div class="content">第四周题解7-1 根据后续和中序遍历输出先序遍历利用数组保存树的后序遍历和中序遍历，根据后续遍历和中序遍历的特点还原树，并根据先序遍历的顺序，即根左右，利用函数递归输出打印，注意输出格式的正确性。
1234567891011121314151617181920212223#include<bits/stdc++.h>using namespace std;const int N = 40;typedef long long LL;int in[N], last[N];int n;void pre(int root, int s, int e) //root：当前子树的根节点；s:中序遍历的起始位置；e:中序遍历的终止位置{ if(s > e) return; //边界 int idx = s; while(in[idx] != last[root]) idx++; //找到root位于中序遍历中的下标idx cout << " " << last[root]; pre(root - (e - idx) - ...</div></div></div><div class="recent-post-item"><div class="post_cover right_radius"><a href="/2023/07/29/20237week3/" title="2023暑假知行进阶营第三周题解"> <img class="post_bg" data-src="/images/week3.jpeg" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="2023暑假知行进阶营第三周题解"></a></div><div class="recent-post-info"><a class="article-title" href="/2023/07/29/20237week3/" title="2023暑假知行进阶营第三周题解">2023暑假知行进阶营第三周题解</a><div class="article-meta-wrap"><time class="post-meta__date" title="发表于 2023-07-29 13:46:25"><i class="far fa-calendar-alt"></i>2023-07-29</time><span class="article-meta"><span class="article-meta__separator">|</span><i class="fas fa-inbox article-meta__icon"></i><a class="article-meta__categories" href="/categories/2023%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/">2023程序设计训练营</a><i class="fas fa-angle-right"></i><a class="article-meta__categories" href="/categories/2023%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/%E7%AC%AC3%E5%91%A8-%E6%A0%91%E3%80%81%E5%9B%BE/">第3周 树、图</a></span></div><div class="content">markdown 文章内容
7-1词典这道题用map写很快的，有些同学是用字符串数组遍历查找做的，数据量大的话会超时，建议大家好好学一下c++，很好用。
1234567891011121314151617181920#include <iostream>#include <map>using namespace std;int main(){ int n,m; cin>>n>>m; map<string,string>mp; while(n--){ string s1,s2; cin>>s1>>s2; mp[s2]=s1; } while(m--){ string s; cin>>s; if(mp.count(s)) cout<<mp[s]<<endl; else cout<< ...</div></div></div><div class="recent-post-item"><div class="post_cover left_radius"><a href="/2023/07/22/20237week2/" title="2023暑假知行进阶营第二周题解"> <img class="post_bg" data-src="/images/week2.png" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="2023暑假知行进阶营第二周题解"></a></div><div class="recent-post-info"><a class="article-title" href="/2023/07/22/20237week2/" title="2023暑假知行进阶营第二周题解">2023暑假知行进阶营第二周题解</a><div class="article-meta-wrap"><time class="post-meta__date" title="发表于 2023-07-22 13:46:25"><i class="far fa-calendar-alt"></i>2023-07-22</time><span class="article-meta"><span class="article-meta__separator">|</span><i class="fas fa-inbox article-meta__icon"></i><a class="article-meta__categories" href="/categories/2023%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/">2023程序设计训练营</a><i class="fas fa-angle-right"></i><a class="article-meta__categories" href="/categories/2023%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/%E7%AC%AC2%E5%91%A8-%E6%A0%88%E3%80%81%E9%98%9F%E5%88%97/">第2周 栈、队列</a></span></div><div class="content">markdown 文章内容
7-1 计算阶乘和
求的是前n项的阶乘和，阶乘可以递归方式定义：0!=1，n!=(n-1)!×n
1234567891011121314151617181920212223242526272829const int N = 15;int f[N];//全局变量int solve(int i) { f[i] = i * f[i - 1]; return f[i];}int main() { f[0] = 1; int n; cin >> n; int sum = 0; for (int i = 1; i <= n; i++) { sum += solve(i); } cout << sum;
7-2 求两个一元多项式的和
利用map。
map可以直接查找键值对。把指数当做键，因为不同指数惟一的，系数当做值。
map默认按照键值升序排列，题目输入是按指数降序，计算过程按指数有序。最后输出结果时要再按指数降序输出，可以利用rbegin()，rend()（还可以 ...</div></div></div><div class="recent-post-item"><div class="post_cover right_radius"><a href="/2023/07/16/20237week1/" title="2023暑假知行进阶营第一周题解"> <img class="post_bg" data-src="/images/2022week1.jpeg" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="2023暑假知行进阶营第一周题解"></a></div><div class="recent-post-info"><a class="article-title" href="/2023/07/16/20237week1/" title="2023暑假知行进阶营第一周题解">2023暑假知行进阶营第一周题解</a><div class="article-meta-wrap"><time class="post-meta__date" title="发表于 2023-07-16 13:46:25"><i class="far fa-calendar-alt"></i>2023-07-16</time><span class="article-meta"><span class="article-meta__separator">|</span><i class="fas fa-inbox article-meta__icon"></i><a class="article-meta__categories" href="/categories/2023%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/">2023程序设计训练营</a><i class="fas fa-angle-right"></i><a class="article-meta__categories" href="/categories/2023%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/%E7%AC%AC1%E5%91%A8-c-stl/">第1周 c++ stl</a></span></div><div class="content">1:__gcd函数显然可以直接调用__gcd(a, b)这个函数返回a,b的最大公因数， 而最小公倍数=a * b / __gcd(a, b);
12int a, b; cin >> a >> b;cout << __gcd(a, b) << ' ' << a * b / __gcd(a, b);
1-2 素数判断显然只需要处理出1e5之内的素数，然后相邻判断是否差为2即可
1234567891011121314int n; cin >> n;vector<int> v;for (int i = 2; i <= n; i ++ ) { bool fg = true; for (int j = 2; j <= sqrt(i); j ++ ) if(i % j == 0) fg = false; if(fg) v.pb(i);}int cnt = 0;for (int i = 1; i < v.size(); i ++ ) ...</div></div></div><nav id="pagination"><div class="pagination"><span class="page-number current">1</span><a class="page-number" href="/page/2/">2</a><span class="space">…</span><a class="page-number" href="/page/36/">36</a><a class="extend next" rel="next" href="/page/2/"><i class="fas fa-chevron-right fa-fw"></i></a></div></nav></div><div class="aside_content" id="aside_content"><div class="card-widget card-info"><div class="card-content"><div class="card-info-avatar is-center"><img class="avatar-img" src="/img/avatar.png" onerror="this.onerror=null;this.src='/img/friend_404.gif'" alt="avatar"/><div class="author-info__name">HBU</div><div class="author-info__description">2024河北大学程序设计训练营</div></div><div class="card-info-data"><div class="card-info-data-item is-center"><a href="/archives"><div class="headline">文章</div><div class="length_num">351</div></a></div><div class="card-info-data-item is-center"> <a href="/tags"><div class="headline">标签</div><div class="length_num">151</div></a></div><div class="card-info-data-item is-center"> <a href="/categories"><div class="headline">分类</div><div class="length_num">74</div></a></div></div><div class="card-info-bookmark is-center"><button class="button--animated" id="bookmark-it" title="加入书签"><i class="fas fa-bookmark"></i><span>加入书签</span></button></div><div class="card-info-social-icons is-center"><a class="social-icon" href="https://github.com/hbuacm" target="_blank" title="Github"><i class="fab fa-github"></i></a><a class="social-icon" href="mailto:1076998404@qq.com" target="_blank" title="Email"><i class="fas fa-envelope"></i></a><a class="social-icon" href="https://www.nowcoder.com/study/live/425" target="_blank" title="nowcode"><i class="fab fa-youtube-play"></i></a></div></div></div><div class="card-widget card-announcement"><div class="card-content"><div class="item-headline"><i class="fas fa-bullhorn card-announcement-animation"></i><span>公告</span></div><div class="announcement_content">2023暑假知行进阶营开始招生啦! </br>QQ群号码 2023暑假知行进阶营:875104634</div></div></div><div class="card-widget card-recent-post"><div class="card-content"><div class="item-headline"><i class="fas fa-history"></i><span>最新文章</span></div><div class="aside-recent-item"><div class="aside-recent-post"><a href="/2025/01/14/2025%E5%AF%92%E5%81%87%E6%96%B0%E7%94%9F%E8%90%A5%E7%AC%AC%E4%B8%80%E6%AC%A1%E8%AE%AD%E7%BB%83/"><div class="aside-post-cover"><img class="aside-post-bg" data-src="/images/tran1.png" onerror="this.onerror=null;this.src='/img/404.jpg'" title="2025寒假新生营第一次训练" alt="2025寒假新生营第一次训练"/></div><div class="aside-post-title"><div class="aside-post_title" href="/2025/01/14/2025%E5%AF%92%E5%81%87%E6%96%B0%E7%94%9F%E8%90%A5%E7%AC%AC%E4%B8%80%E6%AC%A1%E8%AE%AD%E7%BB%83/" title="2025寒假新生营第一次训练">2025寒假新生营第一次训练</div><time class="aside-post_meta post-meta__date" title="发表于 2025-01-14 20:00:00">2025-01-14</time></div></a></div><div class="aside-recent-post"><a href="/2025/01/11/2025%E5%AF%92%E5%81%87%E6%96%B0%E7%94%9F%E8%90%A5%E5%BC%80%E8%90%A5%E6%B5%8B%E8%AF%95/"><div class="aside-post-cover"><img class="aside-post-bg" data-src="/images/2025%E5%AF%92%E5%81%87%E8%AE%AD%E7%BB%83%E8%90%A5%E5%BC%80%E8%90%A5%E6%B5%8B%E8%AF%95.png" onerror="this.onerror=null;this.src='/img/404.jpg'" title="2025寒假新生营开营测试" alt="2025寒假新生营开营测试"/></div><div class="aside-post-title"><div class="aside-post_title" href="/2025/01/11/2025%E5%AF%92%E5%81%87%E6%96%B0%E7%94%9F%E8%90%A5%E5%BC%80%E8%90%A5%E6%B5%8B%E8%AF%95/" title="2025寒假新生营开营测试">2025寒假新生营开营测试</div><time class="aside-post_meta post-meta__date" title="发表于 2025-01-11 21:30:00">2025-01-11</time></div></a></div><div class="aside-recent-post"><a href="/2024/08/10/2024%E6%9A%91%E5%81%87%E8%AE%AD%E7%BB%83week3/"><div class="aside-post-cover"><img class="aside-post-bg" data-src="/images/week3.jpg" onerror="this.onerror=null;this.src='/img/404.jpg'" title="2024暑假知行进阶营第三周题解" alt="2024暑假知行进阶营第三周题解"/></div><div class="aside-post-title"><div class="aside-post_title" href="/2024/08/10/2024%E6%9A%91%E5%81%87%E8%AE%AD%E7%BB%83week3/" title="2024暑假知行进阶营第三周题解">2024暑假知行进阶营第三周题解</div><time class="aside-post_meta post-meta__date" title="发表于 2024-08-10 21:30:00">2024-08-10</time></div></a></div><div class="aside-recent-post"><a href="/2024/08/03/2024%E6%9A%91%E5%81%87%E8%AE%AD%E7%BB%83week2/"><div class="aside-post-cover"><img class="aside-post-bg" data-src="/images/week2.png" onerror="this.onerror=null;this.src='/img/404.jpg'" title="2024暑假知行进阶营第二周题解" alt="2024暑假知行进阶营第二周题解"/></div><div class="aside-post-title"><div class="aside-post_title" href="/2024/08/03/2024%E6%9A%91%E5%81%87%E8%AE%AD%E7%BB%83week2/" title="2024暑假知行进阶营第二周题解">2024暑假知行进阶营第二周题解</div><time class="aside-post_meta post-meta__date" title="发表于 2024-08-03 21:30:00">2024-08-03</time></div></a></div><div class="aside-recent-post"><a href="/2024/07/27/2024%E6%9A%91%E5%81%87%E8%AE%AD%E7%BB%83week1/"><div class="aside-post-cover"><img class="aside-post-bg" data-src="/images/2022week1.jpeg" onerror="this.onerror=null;this.src='/img/404.jpg'" title="2024暑假知行进阶营第一周题解" alt="2024暑假知行进阶营第一周题解"/></div><div class="aside-post-title"><div class="aside-post_title" href="/2024/07/27/2024%E6%9A%91%E5%81%87%E8%AE%AD%E7%BB%83week1/" title="2024暑假知行进阶营第一周题解">2024暑假知行进阶营第一周题解</div><time class="aside-post_meta post-meta__date" title="发表于 2024-07-27 21:30:00">2024-07-27</time></div></a></div></div></div></div><div class="card-widget card-categories"><div class="card-content"><div class="item-headline"><i class="fas fa-folder-open"></i><span>分类</span></div><ul class="card-category-list">
<li class="card-category-list-item "><a class="card-category-list-link" href="/categories/2020%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/"><span class="card-category-list-name">2020程序设计训练营</span><span class="card-category-list-count">34</span></a></li><ul class="card-category-list child"><li class="card-category-list-item "><a class="card-category-list-link" href="/categories/2020%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/%E7%AC%AC0%E5%91%A8-c-stl/"><span class="card-category-list-name">第0周 c++ stl</span><span class="card-category-list-count">5</span></a></li><li class="card-category-list-item "><a class="card-category-list-link" href="/categories/2020%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/%E7%AC%AC1%E5%91%A8-%E5%88%9D%E7%BA%A7%E7%AE%97%E6%B3%95/"><span class="card-category-list-name">第1周 初级算法</span><span class="card-category-list-count">7</span></a></li><li class="card-category-list-item "><a class="card-category-list-link" href="/categories/2020%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/%E7%AC%AC2%E5%91%A8-%E6%95%B0%E5%AD%A6%E6%A8%A1%E6%8B%9F/"><span class="card-category-list-name">第2周 数学模拟</span><span class="card-category-list-count">7</span></a></li><li class="card-category-list-item "><a class="card-category-list-link" href="/categories/2020%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/%E7%AC%AC3%E5%91%A8-%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/"><span class="card-category-list-name">第3周 动态规划</span><span class="card-category-list-count">6</span></a></li><li class="card-category-list-item "><a class="card-category-list-link" href="/categories/2020%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/%E7%AC%AC4%E5%91%A8-%E5%9B%BE/"><span class="card-category-list-name">第4周 图</span><span class="card-category-list-count">1</span></a></li><li class="card-category-list-item "><a class="card-category-list-link" href="/categories/2020%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/%E7%AC%AC4%E5%91%A8-%E6%A0%91/"><span class="card-category-list-name">第4周 树</span><span class="card-category-list-count">2</span></a></li><li class="card-category-list-item "><a class="card-category-list-link" href="/categories/2020%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AE%AD%E7%BB%83%E8%90%A5/%E7%AC%AC5%E5%91%A8-%E5%9B%BE/"><span class="card-category-list-name">第5周 图</span><span class="card-category-list-count">1</span></a></li></ul>
<li class="card-category-list-item more is-center"><a class="card-category-list-link-more" href="/categories">
<span>查看更多</span><i class="fas fa-angle-right"></i></a></li>
</ul></div></div><div class="card-widget card-tags"><div class="card-content"><div class="item-headline"><i class="fas fa-tags"></i><span>标签</span></div><div class="card-tag-cloud"><a href="/tags/%E6%9D%82%E7%B3%85/" style="font-size: 22px; color: #99a9bf">-杂糅</a> <a href="/tags/%E6%A0%88/" style="font-size: 20px; color: #99a4b2">-栈</a> <a href="/tags/%E6%A0%88-%E9%98%9F%E5%88%97/" style="font-size: 16px; color: #999">-栈 队列</a> <a href="/tags/%E9%93%BE%E8%A1%A8/" style="font-size: 16px; color: #999">-链表</a> <a href="/tags/%E9%98%9F%E5%88%97/" style="font-size: 18px; color: #999ea6">-队列</a> <a href="/tags/1-1-%E4%BA%A4%E6%8D%A2%E4%B8%A4%E4%B8%AA%E5%AD%97%E7%AC%A6%E4%B8%B2/" style="font-size: 16px; color: #999">1-1 交换两个字符串</a> <a href="/tags/1-2-2017Final-%E5%9C%86%E5%91%A8%E7%8E%87%E5%B1%B1/" style="font-size: 16px; color: #999">1-2 2017Final 圆周率山</a> <a href="/tags/1-3-%E8%8B%B1%E6%96%87%E5%AD%97%E6%AF%8D/" style="font-size: 16px; color: #999">1-3 英文字母</a> <a href="/tags/1-4-%E7%BB%A9%E7%82%B9%E8%AE%A1%E7%AE%97/" style="font-size: 16px; color: #999">1-4 绩点计算</a> <a href="/tags/1-5-%E7%BA%A6%E7%91%9F%E5%A4%AB%E7%8E%AF/" style="font-size: 16px; color: #999">1-5 约瑟夫环</a> <a href="/tags/1-7-%E4%B8%A4%E4%B8%AA%E6%9C%89%E5%BA%8F%E5%8D%95%E9%93%BE%E8%A1%A8%E6%B1%82%E5%B7%AE%E9%9B%86/" style="font-size: 16px; color: #999">1-7 两个有序单链表求差集</a> <a href="/tags/7-1-%E4%B9%A6%E5%8F%B7%E5%88%A4%E6%96%AD%E4%B8%8E%E7%BA%A0%E9%94%99/" style="font-size: 16px; color: #999">7-1 书号判断与纠错</a> <a href="/tags/7-1-%E5%88%97%E5%87%BA%E5%8F%B6%E7%BB%93%E7%82%B9-%E9%A2%98%E8%A7%A3/" style="font-size: 16px; color: #999">7-1 列出叶结点 题解</a> <a href="/tags/7-1-%E5%AD%90%E9%9B%86%E5%92%8C%E9%97%AE%E9%A2%98-%E9%A2%98%E8%A7%A3/" style="font-size: 16px; color: #999">7-1 子集和问题 题解</a> <a href="/tags/7-1-%E6%9C%80%E5%A4%A7%E5%85%AC%E7%BA%A6%E6%95%B0%E5%92%8C%E6%9C%80%E5%B0%8F%E5%85%AC%E5%80%8D%E6%95%B0-%E9%A2%98%E8%A7%A3/" style="font-size: 16px; color: #999">7-1 最大公约数和最小公倍数 题解</a> <a href="/tags/7-1-%E6%B5%AA%E6%BC%AB%E4%BE%A7%E5%BD%B1-%E9%A2%98%E8%A7%A3/" style="font-size: 16px; color: #999">7-1 浪漫侧影 题解</a> <a href="/tags/7-2-h0039-%E5%B9%B3%E6%96%B9%E6%95%B0-%E9%A2%98%E8%A7%A3/" style="font-size: 16px; color: #999">7-2 h0039. 平方数 题解</a> <a href="/tags/7-2-%E5%8D%8A%E6%95%B0%E9%9B%86-%E9%A2%98%E8%A7%A3/" style="font-size: 16px; color: #999">7-2 半数集 题解</a> <a href="/tags/7-2-%E5%AE%8C%E5%85%A8%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86-%E9%A2%98%E8%A7%A3/" style="font-size: 16px; color: #999">7-2 完全二叉树的层序遍历 题解</a> <a href="/tags/7-2-%E5%B9%B6%E6%9F%A5%E9%9B%86%E3%80%90%E6%A8%A1%E6%9D%BF%E3%80%91-%E9%A2%98%E8%A7%A3/" style="font-size: 16px; color: #999">7-2 并查集【模板】 题解</a> <a href="/tags/7-3-%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%81%8D%E5%8E%86%EF%BC%81%EF%BC%88%E7%AE%80%E5%8D%95%EF%BC%89-%E9%A2%98%E8%A7%A3/" style="font-size: 16px; color: #999">7-3 二叉树的遍历！（简单） 题解</a> <a href="/tags/7-3-%E6%89%BE%E9%9B%B6%E9%92%B1-%E9%A2%98%E8%A7%A3/" style="font-size: 16px; color: #999">7-3 找零钱 题解</a> <a href="/tags/7-3-%E7%B4%A0%E6%95%B0%E5%AF%B9%E7%8C%9C%E6%83%B3-%E9%A2%98%E8%A7%A3/" style="font-size: 16px; color: #999">7-3 素数对猜想 题解</a> <a href="/tags/7-3-%E9%83%A8%E8%90%BD-%E9%A2%98%E8%A7%A3/" style="font-size: 16px; color: #999">7-3 部落 题解</a> <a href="/tags/7-4-%E5%B7%A5%E4%BD%9C%E5%88%86%E9%85%8D%E9%97%AE%E9%A2%98-%E9%A2%98%E8%A7%A3/" style="font-size: 16px; color: #999">7-4 工作分配问题 题解</a> <a href="/tags/7-4-%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84%E4%B9%8BDijkstra-%E9%A2%98%E8%A7%A3/" style="font-size: 16px; color: #999">7-4 最短路径之Dijkstra 题解</a> <a href="/tags/7-4-%E8%BF%98%E5%8E%9F%E4%BA%8C%E5%8F%89%E6%A0%91/" style="font-size: 16px; color: #999">7-4 还原二叉树</a> <a href="/tags/7-4-%E9%9B%86%E5%90%88%E7%9B%B8%E4%BC%BC%E5%BA%A6-%E9%A2%98%E8%A7%A3/" style="font-size: 16px; color: #999">7-4 集合相似度 题解</a> <a href="/tags/7-5-3824%E7%BB%8F%E5%85%B8%E6%B8%B8%E6%88%8F-%E9%A2%98%E8%A7%A3/" style="font-size: 16px; color: #999">7-5 3824经典游戏 题解</a> <a href="/tags/7-5-%E5%9B%BE%E7%9A%84%E5%AD%98%E5%82%A8/" style="font-size: 16px; color: #999">7-5 图的存储</a> <a href="/tags/7-5-%E6%9C%80%E7%9F%AD%E8%B7%AF%E5%BE%84%E7%AE%97%E6%B3%95-Floyd-Warshall-%E9%A2%98%E8%A7%A3/" style="font-size: 16px; color: #999">7-5 最短路径算法(Floyd-Warshall) 题解</a> <a href="/tags/7-5-%E6%A0%91%E7%A7%8D%E7%BB%9F%E8%AE%A1-%E9%A2%98%E8%A7%A3/" style="font-size: 16px; color: #999">7-5 树种统计 题解</a> <a href="/tags/7-6-%E5%88%97%E5%87%BA%E8%BF%9E%E9%80%9A%E9%9B%86/" style="font-size: 16px; color: #999">7-6 列出连通集</a> <a href="/tags/7-6-%E5%93%88%E5%88%A9%C2%B7%E6%B3%A2%E7%89%B9%E7%9A%84%E8%80%83%E8%AF%95-%E9%A2%98%E8%A7%A3/" style="font-size: 16px; color: #999">7-6 哈利·波特的考试 题解</a> <a href="/tags/7-6-%E7%82%B9%E8%B5%9E%E7%8B%82%E9%AD%94-%E9%A2%98%E8%A7%A3/" style="font-size: 16px; color: #999">7-6 点赞狂魔 题解</a> <a href="/tags/7-7-%E5%85%AC%E8%B7%AF%E6%9D%91%E6%9D%91%E9%80%9A-%E9%A2%98%E8%A7%A3/" style="font-size: 16px; color: #999">7-7 公路村村通 题解</a> <a href="/tags/7-7-%E5%93%A5%E5%B0%BC%E6%96%AF%E5%A0%A1%E7%9A%84%E2%80%9C%E4%B8%83%E6%A1%A5%E9%97%AE%E9%A2%98%E2%80%9D/" style="font-size: 16px; color: #999">7-7 哥尼斯堡的“七桥问题”</a> <a href="/tags/7-7-%E5%A4%A9%E6%A2%AF%E8%B5%9B%E5%BA%A7%E4%BD%8D%E5%88%86%E9%85%8D-%E9%A2%98%E8%A7%A3/" style="font-size: 16px; color: #999">7-7 天梯赛座位分配 题解</a> <a href="/tags/7-8-%E6%97%85%E6%B8%B8%E8%A7%84%E5%88%92/" style="font-size: 16px; color: #999">7-8 旅游规划</a> <a href="/tags/A-B-%E9%A2%98%E8%A7%A3/" style="font-size: 16px; color: #999">A+B 题解</a></div></div></div><div class="card-widget card-archives"><div class="card-content"><div class="item-headline"><i class="fas fa-archive"></i><span>归档</span></div><ul class="card-archive-list"><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2025/01/"><span class="card-archive-list-date">一月 2025</span><span class="card-archive-list-count">2</span></a></li><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2024/08/"><span class="card-archive-list-date">八月 2024</span><span class="card-archive-list-count">2</span></a></li><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2024/07/"><span class="card-archive-list-date">七月 2024</span><span class="card-archive-list-count">1</span></a></li><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2023/08/"><span class="card-archive-list-date">八月 2023</span><span class="card-archive-list-count">2</span></a></li><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2023/07/"><span class="card-archive-list-date">七月 2023</span><span class="card-archive-list-count">3</span></a></li><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2023/01/"><span class="card-archive-list-date">一月 2023</span><span class="card-archive-list-count">13</span></a></li><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2022/08/"><span class="card-archive-list-date">八月 2022</span><span class="card-archive-list-count">5</span></a></li><li class="card-archive-list-item"><a class="card-archive-list-link" href="/archives/2022/07/"><span class="card-archive-list-date">七月 2022</span><span class="card-archive-list-count">42</span></a></li><li class="card-archive-list-item more is-center"><a class="card-archive-list-link-more" href="/archives">
<span>查看更多</span><i class="fas fa-angle-right" ></i></a></li></ul></div></div><div class="card-widget card-webinfo"><div class="card-content"><div class="item-headline"><i class="fas fa-chart-line"></i><span>网站资讯</span></div><div class="webinfo"><div class="webinfo-item"><div class="webinfo-article-name">文章数目 :</div><div class="webinfo-article-count">351</div></div><div class="webinfo-item"><div class="webinfo-runtime-name">已运行时间 :</div><div class="webinfo-runtime-count" id="webinfo-runtime-count"> </div></div><div class="webinfo-item"> <div class="webinfo-site-uv-name">本站访客数 :</div><div class="webinfo-site-uv-count" id="busuanzi_value_site_uv"></div></div><div class="webinfo-item"><div class="webinfo-site-name">本站总访问量 :</div><div class="webinfo-site-pv-count" id="busuanzi_value_site_pv"></div></div></div></div></div></div></main><footer id="footer" data-type="color"><div id="footer-wrap"><div class="copyright">©2020 - 2025 By HBU</div><div class="framework-info"><span>驱动 </span><a href="https://hexo.io" target="_blank" rel="noopener"><span>Hexo</span></a><span class="footer-separator">|</span><span>主题 </span><a href="https://github.com/jerryc127/hexo-theme-butterfly" target="_blank" rel="noopener"><span>Butterfly</span></a></div></div></footer></div><section class="rightside" id="rightside"><div id="rightside-config-hide"><button class="translate_chn_to_cht" id="translateLink" title="简繁转换">繁</button><button id="darkmode" title="浅色和深色模式转换"><i class="fas fa-adjust"></i></button></div><div id="rightside-config-show"><button id="rightside_config" title="设置"><i class="fas fa-cog"></i></button><button id="go-up" title="回到顶部"><i class="fas fa-arrow-up"></i></button></div></section><script src="https://cdn.jsdelivr.net/npm/jquery@latest/dist/jquery.min.js"></script><script src="/js/utils.js"></script><script src="/js/main.js"></script><script src="/js/tw_cn.js"></script><script src="https://cdn.jsdelivr.net/npm/@fancyapps/fancybox@latest/dist/jquery.fancybox.min.js"></script><script src="https://cdn.jsdelivr.net/npm/animejs@latest/anime.min.js"></script><script src="/js/third-party/fireworks.js"></script><script src="/js/third-party/activate-power-mode.js"></script><script>POWERMODE.colorful = true;
POWERMODE.shake = true;
document.body.addEventListener('input', POWERMODE);
</script><script async src="//busuanzi.ibruce.info/busuanzi/2.3/busuanzi.pure.mini.js"></script><script src="https://cdn.jsdelivr.net/npm/instant.page/instantpage.min.js" type="module" defer></script><script src="https://cdn.jsdelivr.net/npm/vanilla-lazyload/dist/lazyload.iife.min.js" async></script><script src="/js/third-party/click_heart.js"></script><script src="/js/third-party/ClickShowText.js"></script><script src="https://cdn.jsdelivr.net/npm/typed.js"></script><script>var subtitleType = function () {
var subtitleEffect = true
fetch('https://v1.hitokoto.cn')
.then(function (res) {
return res.json()
})
.then(function (data) {
if (subtitleEffect) {
var from = '出自 ' + data.from
var sub = "今日事,今日畢".length == 0 ? new Array() : "今日事,今日畢".split(',')
var both = sub.unshift(data.hitokoto, from)
var typed = new Typed('#subtitle', {
strings: sub,
startDelay: 300,
typeSpeed: 150,
loop: true,
backSpeed: 50,
})
} else {
document.getElementById('subtitle').innerHTML = data.hitokoto
}
})
.catch(function (err) {
console.error(err)
})
}
window.addEventListener('load', subtitleType)
</script></body></html>