From dc11d51f5762a220d883ab4331d4d7be7eed96db Mon Sep 17 00:00:00 2001 From: dengjie <209192278@qq.com> Date: Thu, 3 Nov 2022 17:50:52 +0800 Subject: [PATCH] =?UTF-8?q?dengjie=20commit=20:=20=E5=B0=86=E4=BE=A7?= =?UTF-8?q?=E8=BE=B9=E6=A0=8F=E4=B8=8B=E7=AE=AD=E5=A4=B4=E5=8E=BB=E6=8E=89?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- docs/.vuepress/config.js | 11 ++--------- docs/.vuepress/styles/index.styl | 3 +++ docs/README.md | 2 +- docs/wiki/introduce/README.md | 4 ++-- 4 files changed, 8 insertions(+), 12 deletions(-) create mode 100644 docs/.vuepress/styles/index.styl diff --git a/docs/.vuepress/config.js b/docs/.vuepress/config.js index f73ab87..8d099fc 100644 --- a/docs/.vuepress/config.js +++ b/docs/.vuepress/config.js @@ -12,7 +12,7 @@ module.exports = { nav: [ {text: "首页", link: "/"}, - {text: "指南", link: "/wiki/"}, + {text: "指南", link: "/wiki/introduce/"}, // { // text: "选择语言", // items: [ @@ -34,14 +34,7 @@ module.exports = { title: '文档', collapsable: true, children: [ - '/wiki/', - { - title: '介绍', - collapsable: true, - children: [ - '/wiki/introduce/' - ] - } + '/wiki/introduce/' ] // 根据自己的需求来订,对应自己在docs下的文件夹名,默认首页是README.md }, { diff --git a/docs/.vuepress/styles/index.styl b/docs/.vuepress/styles/index.styl new file mode 100644 index 0000000..6097363 --- /dev/null +++ b/docs/.vuepress/styles/index.styl @@ -0,0 +1,3 @@ +.arrow { + display: none; +} \ No newline at end of file diff --git a/docs/README.md b/docs/README.md index 687a0d5..0b5c902 100644 --- a/docs/README.md +++ b/docs/README.md @@ -2,7 +2,7 @@ home: true heroImage: /logo.png actionText: 快速上手 → -actionLink: /wiki/ +actionLink: /wiki/introduce/ features: - title: 简洁至上 details: 以 Markdown 为中心的项目结构,以最少的配置帮助你专注于写作。 diff --git a/docs/wiki/introduce/README.md b/docs/wiki/introduce/README.md index 19f6be7..cea5716 100644 --- a/docs/wiki/introduce/README.md +++ b/docs/wiki/introduce/README.md @@ -1,5 +1,5 @@ -### 1001 害死人不偿命的(3n+1)猜想 (15分) - +### 介绍 +## 它是如何工作的? **卡拉兹(Callatz)猜想**: 对任何一个自然数n,如果它是偶数,那么把它砍掉一半;如果它是奇数,那么把(3n+1)砍掉一半。这样一直反复砍下去,最后一定在某一步得到n=1。卡拉兹在1950年的世界数学家大会上公布了这个猜想,传说当时耶鲁大学师生齐动员,拼命想证明这个貌似很傻很天真的命题,结果闹得学生们无心学业,一心只证(3n+1),以至于有人说这是一个阴谋,卡拉兹是在蓄意延缓美国数学界教学与科研的进展…… 我们今天的题目不是证明卡拉兹猜想,而是对给定的任一不超过1000的正整数n,简单地数一下,需要多少步(砍几下)才能得到n=1?