w7-12-学生-第六讲 函数2.zip
资源内容介绍
w7-12-学生-第六讲 函数2.zip <link href="/image.php?url=https://csdnimg.cn/release/download_crawler_static/css/base.min.css" rel="stylesheet"/><link href="/image.php?url=https://csdnimg.cn/release/download_crawler_static/css/fancy.min.css" rel="stylesheet"/><link href="/image.php?url=https://csdnimg.cn/release/download_crawler_static/89913668/raw.css" rel="stylesheet"/><div id="sidebar" style="display: none"><div id="outline"></div></div><div class="pf w0 h0" data-page-no="1" id="pf1"><div class="pc pc1 w0 h0"><img alt="" class="bi x0 y0 w1 h1" src="/image.php?url=https://csdnimg.cn/release/download_crawler_static/89913668/bg1.jpg"/><div class="c x0 y1 w2 h0"><div class="t m0 x1 h2 y2 ff1 fs0 fc0 sc0 ls0 ws0">函数进阶和练习</div><div class="t m0 x2 h3 y3 ff2 fs1 fc0 sc0 ls0 ws0">中山大学计算机学院</div></div></div><div class="pi" data-data='{"ctm":[1.000000,0.000000,0.000000,1.000000,0.000000,0.000000]}'></div></div><div id="pf2" class="pf w0 h0" data-page-no="2"><div class="pc pc2 w0 h0"><img class="bi x0 y0 w1 h1" alt="" src="/image.php?url=https://csdnimg.cn/release/download_crawler_static/89913668/bg2.jpg"><div class="c x0 y1 w2 h0"><div class="t m0 x3 h4 y4 ff3 fs2 fc1 sc0 ls1 ws0">01</div><div class="t m0 x3 h4 y5 ff3 fs2 fc1 sc0 ls1 ws0">02</div><div class="t m0 x3 h4 y6 ff3 fs2 fc1 sc0 ls1 ws0">03</div><div class="t m0 x3 h4 y7 ff3 fs2 fc1 sc0 ls1 ws0">04</div><div class="t m0 x3 h4 y8 ff3 fs2 fc1 sc0 ls1 ws0">05</div><div class="t m0 x4 h5 y9 ff4 fs3 fc1 sc0 ls0 ws0">问题求解<span class="ff3">-</span>最大公约数</div><div class="t m0 x5 h5 ya ff4 fs3 fc1 sc0 ls0 ws0">汉诺塔（<span class="_"> </span><span class="ff3">Hanoi Tower </span>）</div><div class="t m0 x6 h5 yb ff4 fs3 fc1 sc0 ls0 ws0">编译与程序布局</div><div class="t m0 x7 h5 yc ff4 fs3 fc1 sc0 ls0 ws0">头文件初步</div><div class="t m0 x8 h5 yd ff4 fs3 fc1 sc0 ls0 ws0">题库实战案例研究</div><div class="t m0 x9 h6 ye ff5 fs4 fc1 sc0 ls0 ws0">CONTE<span class="_ _0"></span>NTS</div><div class="t m0 xa h7 yf ff1 fs5 fc1 sc0 ls0 ws0">目<span class="_ _1"> </span>录</div></div></div><div class="pi" data-data='{"ctm":[1.000000,0.000000,0.000000,1.000000,0.000000,0.000000]}'></div></div><div id="pf3" class="pf w0 h0" data-page-no="3"><div class="pc pc3 w0 h0"><img class="bi x0 y0 w1 h1" alt="" src="/image.php?url=https://csdnimg.cn/release/download_crawler_static/89913668/bg3.jpg"><div class="c x0 y1 w2 h0"><div class="t m0 xb h8 y10 ff1 fs6 fc2 sc0 ls2 ws0">问题求解（</div><div class="t m1 xc h9 y10 ff6 fs7 fc2 sc0 ls0 ws0">problem solving</div><div class="t m0 xd ha y10 ff1 fs6 fc2 sc0 ls0 ws0">）<span class="ff2 ls2">一般方法：</span></div><div class="t m1 xb hb y11 ff7 fs8 fc2 sc0 ls3 ws0">1.<span class="_ _2"> </span><span class="ls0">What do I know <span class="_ _3"></span>about the <span class="_ _3"></span>pr<span class="_ _0"></span>oblem?</span></div><div class="t m1 xb hb y12 ff7 fs8 fc2 sc0 ls3 ws0">2.<span class="_ _2"> </span><span class="ls0">What is the information <span class="_ _3"></span>that I have to pr<span class="_ _0"></span>ocess </span></div><div class="t m1 xe hc y13 ff7 fs9 fc2 sc0 ls0 ws0">in or<span class="_ _0"></span>der the find the s<span class="_ _3"></span>olution?</div><div class="t m1 xb hb y14 ff7 fs8 fc2 sc0 ls3 ws0">3.<span class="_ _2"> </span><span class="ls0">What does the <span class="_ _3"></span>solution look <span class="_ _3"></span>lik<span class="_ _0"></span>e?</span></div><div class="t m1 xb hb y15 ff7 fs8 fc2 sc0 ls3 ws0">4.<span class="_ _2"> </span><span class="ls0">What sor<span class="_ _4"></span>t o<span class="_ _0"></span>f special ca<span class="_ _3"></span>ses exist<span class="_ _0"></span>?</span></div><div class="t m1 xb hc y16 ff7 fs9 fc2 sc0 ls4 ws0">5.<span class="_ _2"> </span><span class="ls0">How will I recognize<span class="_ _0"></span> tha<span class="_ _3"></span>t I have found </span></div><div class="t m1 xe hb y17 ff7 fs8 fc2 sc0 ls0 ws0">the solution?</div><div class="t m0 xf hd y18 ff4 fsa fc2 sc0 ls2 ws0">作者<span class="ff3 ls0">: [<span class="ff4">美] G·</span></span>波利亚</div><div class="t m0 x10 he y19 ff8 fs2 fc3 sc0 ls0 ws0">怎样解题<span class="_ _5"> </span><span class="ff9">(</span>豆瓣<span class="ff9">) (douban.com)</span></div><div class="t m0 xb he y1a ff8 fs2 fc2 sc0 ls0 ws0">计算问题的本质就是数学，这本书可能对你提升问题求解能力有所帮助！</div></div><a class="l"><div class="d m2"></div></a></div><div class="pi" data-data='{"ctm":[1.000000,0.000000,0.000000,1.000000,0.000000,0.000000]}'></div></div><div id="pf4" class="pf w0 h0" data-page-no="4"><div class="pc pc4 w0 h0"><img class="bi x0 y0 w1 h1" alt="" src="/image.php?url=https://csdnimg.cn/release/download_crawler_static/89913668/bg4.jpg"><div class="c x0 y1 w2 h0"><div class="t m0 xb ha y10 ff1 fs6 fc2 sc0 ls2 ws0">最大公约数<span class="ff2">，也称</span>最大公因数（</div><div class="t m1 x11 hf y10 ff3 fsb fc2 sc0 ls0 ws0">greatest common <span class="_ _0"></span>divisor</div><div class="t m0 x12 ha y10 ff1 fs6 fc2 sc0 ls0 ws0">）<span class="ff2 ls2">，是指两个或多个</span></div><div class="t m0 xb h10 y1b ff2 fsc fc2 sc0 ls0 ws0">整数共有约数中最大的一个。记为</div><div class="t m0 x13 h11 y11 ffa fsc fc2 sc0 ls0 ws0">󰇛<span class="_ _4"></span><span class="_ _6"></span><span class="_ _7"></span>󰇜</div><div class="t m0 xb h10 y1c ff7 fsc fc2 sc0 ls2 ws0">1.<span class="_ _8"> </span><span class="ff2 ls5">审题：从数学角度，理解最大公因素定义是解题的第一步</span></div><div class="t m0 xb h11 y1d ff7 fsc fc2 sc0 ls2 ws0">2.<span class="_ _8"> </span><span class="ff2 ls5">输入：整数<span class="_ _9"> </span><span class="ffa ls0"><span class="_ _7"></span><span class="ff2">，</span></span></span></div><div class="t m0 xb h12 y1e ff7 fs6 fc2 sc0 ls6 ws0">3.<span class="_ _8"> </span><span class="ff2 ls0">输出：整数<span class="_ _9"> </span><span class="ffa"><span class="_ _a"> </span><span class="_ _b"> </span><span class="_ _c"></span></span></span></div><div class="t m0 x14 h13 y1f ffa fsd fc2 sc0 ls0 ws0"></div><div class="t m0 x15 h12 y1e ffa fs6 fc2 sc0 ls0 ws0">󰇛<span class="_ _d"></span><span class="_ _c"></span><span class="_ _a"> </span><span class="_ _b"> </span><span class="_ _c"></span><span class="_ _c"></span><span class="_ _d"></span><span class="_ _5"></span><span class="_ _e"> </span><span class="_ _b"> </span>󰇜</div><div class="t m0 xb h11 y20 ff7 fsc fc2 sc0 ls2 ws0">4.<span class="_ _8"> </span><span class="ff2 ls5">案例：<span class="ffa ls0">󰇛󰇜<span class="_ _b"> </span><span class="_ _b"> </span><span class="_ _3"></span><span class="_ _f"> </span>󰇛󰇜<span class="_ _b"> </span><span class="_ _b"> </span><span class="_ _f"> </span>󰇛<span class="ls5"></span>󰇜<span class="_ _b"> </span><span class="_ _b"> </span></span></span></div><div class="t m0 xb ha y21 ff7 fs6 fc2 sc0 ls6 ws0">5.<span class="_ _8"> </span><span class="ff2 ls0">类似问题：求<span class="_ _9"> </span></span><span class="ls7">n <span class="ff2 ls2">以内的最大素数</span></span></div></div></div><div class="pi" data-data='{"ctm":[1.000000,0.000000,0.000000,1.000000,0.000000,0.000000]}'></div></div><div id="pf5" class="pf w0 h0" data-page-no="5"><div class="pc pc5 w0 h0"><img class="bi x0 y0 w1 h1" alt="" src="/image.php?url=https://csdnimg.cn/release/download_crawler_static/89913668/bg5.jpg"><div class="c x0 y1 w2 h0"><div class="t m0 xb ha y10 ff2 fs6 fc2 sc0 ls2 ws0">计算方法<span class="ff7 ls0">1</span>：试除法</div><div class="t m0 xb h10 y11 ff2 fsc fc2 sc0 ls0 ws0">两个数的最大公约数有可能是其中较小的数。所以在按从大到小顺序找寻</div><div class="t m0 xb h11 y12 ff2 fsc fc2 sc0 ls0 ws0">最大公约数时，循环变量<span class="ff7">i</span>的初值从<span class="ffa">󰇛<span class="_ _7"></span><span class="_ _6"></span><span class="_ _4"></span>󰇜</span>开始依次递减直到<span class="_ _c"> </span><span class="ffa"></span>，去寻找</div><div class="t m0 xb ha y13 ff2 fs6 fc2 sc0 ls2 ws0">第一个能同时被两整数整除的自然数，并将其输出。（<span class="fc4">注意，<span class="ff7 ls0">1</span>是最小的公</span></div><div class="t m0 xb h10 y14 ff2 fsc fc4 sc0 ls0 ws0">约数，不用考虑无解的问题<span class="fc2">）</span></div></div></div><div class="pi" data-data='{"ctm":[1.000000,0.000000,0.000000,1.000000,0.000000,0.000000]}'></div></div>