一些程序设计训练相关的题目，及其报告 71.94KB

wcj_______

资源文件列表:

程序设计训练报告.zip 大约有11个文件

程序设计训练报告.docx 66.68KB
合法的括号串.cpp 545B
魔咒词典.cpp 1.14KB
打牌.cpp 1.15KB
Maya历法.cpp 1020B
欧洲冠军联赛.cpp 1.09KB
最大报销额.cpp 894B
拼写检查.cpp 1.6KB
数码管.cpp 723B
相同生日.cpp 950B
电话号码.cpp 1.32KB

资源介绍:

程序设计训练报告，这个文件中有10道题，有难有易，题目，代码，问题分析，算法设计，具体代码设计，样例输出……都有涉及，如果想要找一些相关的题目来增加一些知识点，或者对程序设计题多加了解，那么可以下载来看一下，对你都是有好处的，这里的代码都经平台检测过，是正确的，可以放心看。其中涉及的知识点都是需要掌握的。

<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/89714443/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/89714443/bg1.jpg"/><div class="t m0 x1 h2 y1 ff1 fs0 fc0 sc0 ls0 ws0">题<span class="_ _0"> </span><span class="ff2">1</span>：数<span class="_ _1"></span>码管</div><div class="t m0 x2 h3 y2 ff1 fs1 fc0 sc0 ls0 ws0">一、问题描<span class="_ _1"></span>述</div><div class="t m0 x2 h3 y3 ff3 fs1 fc0 sc1 ls0 ws0">【问题描述】</div><div class="t m0 x2 h3 y4 ff3 fs1 fc0 sc1 ls0 ws0">液晶数码<span class="_ _1"></span>管用七<span class="_ _1"></span>笔阿拉<span class="_ _1"></span>数字表示<span class="_ _1"></span>的十个<span class="_ _1"></span>数字，<span class="_ _1"></span>把横和竖<span class="_ _1"></span>的一<span class="ff4"> <span class="_ _1"></span></span>个短划</div><div class="t m0 x2 h3 y5 ff3 fs1 fc0 sc1 ls0 ws0">都称为一笔，<span class="_ _2"></span>即７有３笔，<span class="_ _2"></span>８有７笔等。<span class="_ _2"></span>对于十个数字一种排列，<span class="_ _2"></span>要</div><div class="t m0 x2 h3 y6 ff3 fs1 fc0 sc1 ls0 ws0">做到两相邻数字都可以由另一个数字加上几笔或减去几笔组成，<span class="_ _3"></span>但不</div><div class="t m0 x2 h3 y7 ff3 fs1 fc0 sc1 ls0 ws0">能又加又<span class="_ _1"></span>减。比<span class="_ _1"></span>如<span class="ff4"> </span>７<span class="_ _1"></span>→３是允<span class="_ _1"></span>许的，<span class="_ _1"></span>７→２<span class="_ _1"></span>不允许。<span class="_ _1"></span>任意输<span class="_ _1"></span>入一组</div><div class="t m0 x2 h3 y8 ff3 fs1 fc0 sc1 ls0 ws0">数，判断是否符合上述规则，注意，<span class="ff4">1<span class="_ _4"> </span></span>在右边。</div><div class="t m0 x2 h3 y9 ff3 fs1 fc0 sc1 ls0 ws0">【输入形式】</div><div class="t m0 x2 h3 ya ff3 fs1 fc0 sc1 ls0 ws0">每行<span class="_ _1"></span>输<span class="_ _1"></span>入<span class="_ _1"></span>一<span class="_ _1"></span>个<span class="_ _4"> </span><span class="ff4">0~9<span class="_ _5"> </span></span>的排<span class="_ _1"></span>列<span class="_ _1"></span>，<span class="_ _1"></span>数<span class="_ _1"></span>字之<span class="_ _1"></span>间<span class="_ _1"></span>用<span class="_ _1"></span>空<span class="_ _1"></span>格分<span class="_ _1"></span>隔<span class="_ _1"></span>，<span class="_ _1"></span>以<span class="_ _1"></span><span class="ff4">-1<span class="_ _5"> </span></span>作为输<span class="_ _1"></span>入<span class="_ _1"></span>结</div><div class="t m0 x2 h3 yb ff3 fs1 fc0 sc1 ls0 ws0">束</div><div class="t m0 x2 h3 yc ff3 fs1 fc0 sc1 ls0 ws0">【输出形式】</div><div class="t m0 x2 h3 yd ff3 fs1 fc0 sc1 ls0 ws0">输出<span class="_ _4"> </span><span class="ff4">YES<span class="_ _4"> </span></span>或<span class="_ _4"> </span><span class="ff4">NO</span></div><div class="t m0 x2 h3 ye ff3 fs1 fc0 sc1 ls0 ws0">【样例输入】</div><div class="t m0 x2 h3 yf ff4 fs1 fc0 sc1 ls0 ws0">4 1 0 7 3 9 5 6 8 2</div><div class="t m0 x2 h3 y10 ff4 fs1 fc0 sc1 ls0 ws0">3 5 1 6 2 7 9 0 4 8</div><div class="t m0 x2 h3 y11 ff4 fs1 fc0 sc1 ls0 ws0">-1</div><div class="t m0 x2 h3 y12 ff3 fs1 fc0 sc1 ls0 ws0">【样例输出】</div><div class="t m0 x2 h3 y13 ff4 fs1 fc0 sc1 ls0 ws0">YES</div><div class="t m0 x2 h3 y14 ff4 fs1 fc0 sc1 ls0 ws0">NO</div></div><div class="pi" data-data='{"ctm":[1.611830,0.000000,0.000000,1.611830,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/89714443/bg2.jpg"><div class="c x0 y15 w0 h4"><div class="t m0 x3 h5 y16 ff3 fs2 fc0 sc1 ls0 ws0">第<span class="_ _6"> </span><span class="ff5">2<span class="_"> </span></span>页</div></div><div class="t m0 x2 h3 y17 ff1 fs1 fc0 sc0 ls0 ws0">二、问题分<span class="_ _1"></span>析及边界条<span class="_ _1"></span>件</div><div class="t m0 x2 h3 y18 ff3 fs1 fc0 sc1 ls0 ws0">要处理的问题就是如何判断相邻的两个数字是否可以相互转变，只</div><div class="t m0 x2 h3 y19 ff3 fs1 fc0 sc1 ls0 ws0">要这个问题解决了，本题就迎刃而解了。</div><div class="t m0 x2 h3 y1a ff1 fs1 fc0 sc0 ls0 ws0">三、算法设<span class="_ _1"></span>计</div><div class="t m0 x2 h3 y1b ff3 fs1 fc0 sc1 ls0 ws0">这个题我选择的是先把能够相互转换的数字一一列举出来，总归不</div><div class="t m0 x2 h3 y1c ff3 fs1 fc0 sc1 ls0 ws0">是太麻烦，然后将它们存储进字符串<span class="_ _4"> </span><span class="ff4">1<span class="_ _4"> </span></span>中，将输入的数字转换成字</div><div class="t m0 x2 h3 y1d ff3 fs1 fc0 sc1 ls0 ws0">符串，遍历，判断相邻的两个字符是否存在于字符串<span class="_ _4"> </span><span class="ff4">1<span class="_ _4"> </span></span>中，若是则</div><div class="t m0 x2 h3 y1e ff3 fs1 fc0 sc1 ls0 ws0">计上，循环结束后，看计上的数是否等于<span class="_ _4"> </span><span class="ff4">9</span>，若是，则这<span class="_ _4"> </span><span class="ff4">10<span class="_ _4"> </span></span>个数字</div><div class="t m0 x2 h3 y1f ff3 fs1 fc0 sc1 ls0 ws0">两两相连的都可以由另一个数字加上几笔或减去几笔组成，输出</div><div class="t m0 x2 h3 y20 ff4 fs1 fc0 sc1 ls0 ws0">YES<span class="ff3">。</span></div><div class="t m0 x2 h3 y21 ff1 fs1 fc0 sc0 ls0 ws0">四、详细设<span class="_ _1"></span>计（从算法<span class="_ _1"></span>到程序）</div><div class="t m0 x2 h3 y22 ff4 fs1 fc0 sc1 ls0 ws0">1.<span class="ff3">用字符串<span class="_ _4"> </span></span>s <span class="ff3">来存储可以相互转换的数字，如<span class="_ _4"> </span></span>01<span class="ff3">、</span>07<span class="ff3">……注意每个</span></div><div class="t m0 x2 h3 y23 ff3 fs1 fc0 sc1 ls0 ws0">字符串要以逗号分隔开。</div><div class="t m0 x2 h3 y24 ff4 fs1 fc0 sc1 ls0 ws0">2.<span class="ff3">在输入的时候将数字转化成字符存储进字符串<span class="_ _4"> </span></span>str<span class="_ _4"> </span><span class="ff3">中，</span>str.push_ </div><div class="t m0 x2 h3 y25 ff4 fs1 fc0 sc1 ls0 ws0">b ack ((a+'0'))<span class="ff3">。</span></div><div class="t m0 x2 h3 y26 ff4 fs1 fc0 sc1 ls0 ws0">3.for()<span class="ff3">循环遍历字符串<span class="_ _4"> </span></span>str<span class="ff3">，截取相邻的两个字符，</span></div><div class="t m0 x2 h3 y27 ff4 fs1 fc0 sc1 ls0 ws0">str.substr(i,2)<span class="ff3">。</span></div><div class="t m0 x2 h3 y28 ff4 fs1 fc0 sc1 ls0 ws0">4.<span class="ff3">如果<span class="_ _4"> </span></span>s.find(ss)!=s.npos<span class="ff3">，说明这两个数字可以转化，</span>sum++<span class="ff3">。</span></div><div class="t m0 x2 h3 y29 ff4 fs1 fc0 sc1 ls0 ws0">5.<span class="ff3">循环结束后，</span>if(sum==9)<span class="ff3">，输出<span class="_ _4"> </span></span>YES<span class="ff3">。</span></div><div class="t m0 x2 h3 y2a ff1 fs1 fc0 sc0 ls0 ws0">五、样例设<span class="_ _1"></span>计与测试</div><div class="c x2 y2b w2 h6"><div class="t m0 x4 h3 y2c ff3 fs1 fc0 sc1 ls0 ws0">测试样例一</div></div><div class="c x5 y2b w2 h6"><div class="t m0 x4 h3 y2c ff4 fs1 fc0 sc1 ls0 ws0">4 <span class="_"> </span>1 <span class="_"> </span>0 <span class="_"> </span>7 <span class="_"> </span>3 <span class="_"> </span>9 <span class="_"> </span>5 <span class="_"> </span>6 <span class="_"> </span>8 <span class="_"> </span>2</div><div class="t m0 x4 h3 y2d ff4 fs1 fc0 sc1 ls0 ws0">3 <span class="_"> </span>5 <span class="_"> </span>1 <span class="_"> </span>6 <span class="_"> </span>2 <span class="_"> </span>7 <span class="_"> </span>9 <span class="_"> </span>0 <span class="_"> </span>4 <span class="_"> </span>8</div></div></div><div class="pi" data-data='{"ctm":[1.611830,0.000000,0.000000,1.611830,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/89714443/bg3.jpg"><div class="c x0 y15 w0 h4"><div class="t m0 x3 h5 y16 ff3 fs2 fc0 sc1 ls0 ws0">第<span class="_ _6"> </span><span class="ff5">3<span class="_"> </span></span>页</div></div><div class="c x5 y2e w2 h7"><div class="t m0 x4 h3 y2d ff4 fs1 fc0 sc1 ls0 ws0">-1</div></div><div class="c x2 y2f w2 h6"><div class="t m0 x4 h3 y2c ff3 fs1 fc0 sc1 ls0 ws0">样例输出</div></div><div class="c x5 y2f w2 h6"><div class="t m0 x4 h3 y2c ff4 fs1 fc0 sc1 ls0 ws0">YES</div><div class="t m0 x4 h3 y2d ff4 fs1 fc0 sc1 ls0 ws0">NO</div></div><div class="t m0 x2 h3 y30 ff4 fs1 fc0 sc1 ls0 ws0">4 1 0 7 3 9 5 6 8 2</div><div class="t m0 x2 h3 y31 ff4 fs1 fc0 sc1 ls0 ws0">YES</div><div class="t m0 x2 h3 y32 ff4 fs1 fc0 sc1 ls0 ws0">3 5 1 6 2 7 9 0 4 8</div><div class="t m0 x2 h3 y33 ff4 fs1 fc0 sc1 ls0 ws0">NO</div><div class="t m0 x2 h3 y34 ff4 fs1 fc0 sc1 ls0 ws0">-1</div><div class="t m0 x2 h3 y35 ff4 fs1 fc0 sc1 ls0 ws0">Process exited after 7.651 seconds with return value 0</div><div class="t m0 x2 h3 y36 ff3 fs1 fc0 sc1 ls0 ws0">请按任意键继续<span class="ff4">. . .</span></div><div class="c x2 y37 w2 h8"><div class="t m0 x4 h3 y38 ff3 fs1 fc0 sc1 ls0 ws0">样例测试二</div></div><div class="c x5 y37 w2 h8"><div class="t m0 x4 h3 y38 ff4 fs1 fc0 sc1 ls0 ws0">3 2 8 0 9 2 3 1 8 4</div><div class="t m0 x4 h3 y39 ff4 fs1 fc0 sc1 ls0 ws0">0 2 8 4 7 1 9 4 3 7</div><div class="t m0 x4 h3 y3a ff4 fs1 fc0 sc1 ls0 ws0">-1</div></div><div class="c x2 y3b w2 h6"><div class="t m0 x4 h3 y2c ff3 fs1 fc0 sc1 ls0 ws0">样例输出</div></div><div class="c x5 y3b w2 h6"><div class="t m0 x4 h3 y2c ff4 fs1 fc0 sc1 ls0 ws0">NO</div><div class="t m0 x4 h3 y2d ff4 fs1 fc0 sc1 ls0 ws0">NO</div></div><div class="t m0 x2 h3 y3c ff4 fs1 fc0 sc1 ls0 ws0">3 2 8 0 9 2 3 1 8 4</div><div class="t m0 x2 h3 y3d ff4 fs1 fc0 sc1 ls0 ws0">NO</div><div class="t m0 x2 h3 y3e ff4 fs1 fc0 sc1 ls0 ws0">0 2 8 4 7 1 9 4 3 7</div><div class="t m0 x2 h3 y3f ff4 fs1 fc0 sc1 ls0 ws0">NO</div><div class="t m0 x2 h3 y40 ff4 fs1 fc0 sc1 ls0 ws0">-1</div><div class="t m0 x2 h3 y41 ff4 fs1 fc0 sc1 ls0 ws0">Process exited after 46.37 seconds with return value 0</div><div class="t m0 x2 h3 y42 ff3 fs1 fc0 sc1 ls0 ws0">请按任意键继续<span class="ff4">. . .</span></div><div class="t m0 x2 h3 y43 ff1 fs1 fc0 sc0 ls0 ws0">六、分析与<span class="_ _1"></span>总结</div><div class="t m0 x2 h3 y44 ff3 fs1 fc0 sc1 ls0 ws0">如果想不出其他方法，<span class="_ _7"></span>有时候像这个题一样先把所有情况<span class="_ _7"></span>（前提是不</div><div class="t m0 x2 h3 y45 ff3 fs1 fc0 sc1 ls0 ws0">复杂）列<span class="_ _1"></span>举出来<span class="_ _1"></span>也不失<span class="_ _1"></span>为一个好<span class="_ _1"></span>方法；<span class="_ _1"></span>单个数<span class="_ _1"></span>字转换成<span class="_ _1"></span>字符，<span class="_ _1"></span><span class="ff4">+ ‘0’ </span></div><div class="t m0 x2 h3 y46 ff3 fs1 fc0 sc1 ls0 ws0">即可<span class="_ _8"></span>；<span class="_ _8"></span>字符截取函数<span class="ff4"> substr</span>（）的用法<span class="_ _8"></span>；<span class="_ _8"></span>字符串中<span class="_ _4"> </span><span class="ff4">find</span>（）函数的</div><div class="t m0 x2 h3 y47 ff3 fs1 fc0 sc1 ls0 ws0">用法，如果找到字符串，表达式为<span class="_ _4"> </span><span class="ff4">s.find(ss)!=s.npos</span>。</div></div><div class="pi" data-data='{"ctm":[1.611830,0.000000,0.000000,1.611830,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/89714443/bg4.jpg"><div class="c x0 y15 w0 h4"><div class="t m0 x3 h5 y16 ff3 fs2 fc0 sc1 ls0 ws0">第<span class="_ _6"> </span><span class="ff5">4<span class="_"> </span></span>页</div></div><div class="t m0 x6 h2 y48 ff1 fs0 fc0 sc0 ls0 ws0">题<span class="_ _0"> </span><span class="ff2">2</span>：最<span class="_ _1"></span>大报销<span class="_ _1"></span>额</div><div class="t m0 x2 h3 y49 ff1 fs1 fc0 sc0 ls0 ws0">一、问题描<span class="_ _1"></span>述</div><div class="t m0 x2 h3 y4a ff3 fs1 fc0 sc1 ls0 ws0">【问题描述】<span class="_ _7"></span>现有一笔经费可以报销一定额度的发票。<span class="_ _7"></span>允许报销的发</div><div class="t m0 x2 h3 y4b ff3 fs1 fc0 sc1 ls0 ws0">票类<span class="_ _1"></span>型<span class="_ _1"></span>包括<span class="_ _1"></span>买<span class="_ _1"></span>图书<span class="_ _1"></span>（<span class="_ _1"></span><span class="ff4">A<span class="_ _5"> </span></span>类）<span class="_ _1"></span>、文<span class="_ _1"></span>具<span class="_ _1"></span>（<span class="ff4">B<span class="_ _5"> </span></span>类<span class="_ _1"></span>）<span class="_ _1"></span>、差<span class="_ _1"></span>旅<span class="_ _1"></span>（<span class="ff4">C<span class="_ _5"> </span></span>类<span class="_ _1"></span>），<span class="_ _1"></span>要<span class="_ _1"></span>求每</div><div class="t m0 x2 h3 y4c ff3 fs1 fc0 sc1 ls0 ws0">张发票<span class="_ _1"></span>的总额不<span class="_ _1"></span>得超过<span class="_ _5"> </span><span class="ff4">1000<span class="_ _4"> </span></span>元，每<span class="_ _1"></span>张发票<span class="_ _1"></span>上，单项<span class="_ _1"></span>物品的<span class="_ _1"></span>价值不<span class="_ _1"></span>得</div><div class="t m0 x2 h3 y4d ff3 fs1 fc0 sc1 ls0 ws0">超过<span class="_ _4"> </span><span class="ff4">600<span class="_ _4"> </span></span>元。<span class="_ _9"></span>现请你编写程序，<span class="_ _9"></span>在给出的一堆发票中找出可以报销的、</div><div class="t m0 x2 h3 y4e ff3 fs1 fc0 sc1 ls0 ws0">不超过给定额度的最大报销额。</div><div class="t m0 x2 h3 y4f ff3 fs1 fc0 sc1 ls0 ws0">【输入形式】<span class="_ _7"></span>测试输入包含若干测试用例。<span class="_ _7"></span>每个测试用例的第<span class="_ _4"> </span><span class="ff4">1<span class="_ _4"> </span></span>行包</div><div class="t m0 x2 h3 y50 ff3 fs1 fc0 sc1 ls0 ws0">含两个正数<span class="ff4"> Q </span>和<span class="ff4"> N</span>，<span class="_ _a"></span>其中<span class="ff4"> Q </span>是给定的报销额度，<span class="_ _a"></span><span class="ff4">N<span class="ff3">（</span>N<=30<span class="ff3">）<span class="_ _a"></span>是发票</span></span></div><div class="t m0 x2 h3 y51 ff3 fs1 fc0 sc1 ls0 ws0">张数。随后是<span class="ff4"> N </span>行输入，每行的格式为：</div><div class="t m0 x2 h3 y52 ff4 fs1 fc0 sc1 ls0 ws0"> <span class="_"> </span> <span class="_"> </span> <span class="_"> </span> <span class="_"> </span> <span class="_"> </span> <span class="_ _a"></span>m <span class="_ _a"></span>Type_1:price_1 <span class="_ _a"></span>Type_2:price_2 … Type_m:price_m</div><div class="t m0 x2 h3 y53 ff4 fs1 fc0 sc1 ls0 ws0"> <span class="_"> </span> <span class="_"> </span> <span class="_"> </span> <span class="_"> </span> <span class="_"> </span> <span class="_ _1"></span><span class="ff3">其<span class="_ _b"></span>中<span class="_ _1"></span>正<span class="_ _b"></span>整<span class="_ _1"></span>数<span class="_ _b"></span></span> <span class="_ _1"></span>m <span class="_ _b"></span><span class="ff3">是<span class="_ _1"></span>这<span class="_ _b"></span>张<span class="_ _1"></span>发<span class="_ _b"></span>票<span class="_ _1"></span>上<span class="_ _b"></span>所<span class="_ _1"></span>开<span class="_ _b"></span>物<span class="_ _1"></span>品<span class="_ _b"></span>的<span class="_ _1"></span>件<span class="_ _b"></span>数<span class="_ _1"></span>，<span class="_ _b"></span></span>Type_i </div><div class="t m0 x2 h3 y54 ff3 fs1 fc0 sc1 ls0 ws0">和<span class="ff4"> price_i </span>是第<span class="ff4"> i </span>项物品的种类和价值。<span class="_ _3"></span>物品种类用一个大写英文</div><div class="t m0 x2 h3 y55 ff3 fs1 fc0 sc1 ls0 ws0">字母表示。当<span class="_ _4"> </span><span class="ff4">N<span class="_ _4"> </span></span>为<span class="_ _4"> </span><span class="ff4">0<span class="_ _4"> </span></span>时，全部输入结束，相应的结果不要输出。</div><div class="t m0 x2 h3 y56 ff3 fs1 fc0 sc1 ls0 ws0">【输出形式】<span class="_ _a"></span>对每个测试用例输出<span class="_ _4"> </span><span class="ff4">1<span class="_ _4"> </span></span>行，<span class="_ _a"></span>即可以报销的最大数额，<span class="_ _a"></span>精</div><div class="t m0 x2 h3 y57 ff3 fs1 fc0 sc1 ls0 ws0">确到小数点后<span class="_ _4"> </span><span class="ff4">2<span class="_ _4"> </span></span>位。</div><div class="t m0 x2 h3 y58 ff3 fs1 fc0 sc1 ls0 ws0">【样例输入】</div><div class="t m0 x2 h3 y59 ff4 fs1 fc0 sc1 ls0 ws0">200.00 3</div><div class="t m0 x2 h3 y5a ff4 fs1 fc0 sc1 ls0 ws0">2 A:23.50 B:100.00</div><div class="t m0 x2 h3 y5b ff4 fs1 fc0 sc1 ls0 ws0">1 C:650.00</div><div class="t m0 x2 h3 y5c ff4 fs1 fc0 sc1 ls0 ws0">3 A:59.99 A:120.00 X:10.00</div></div><div class="pi" data-data='{"ctm":[1.611830,0.000000,0.000000,1.611830,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/89714443/bg5.jpg"><div class="c x0 y15 w0 h4"><div class="t m0 x3 h5 y16 ff3 fs2 fc0 sc1 ls0 ws0">第<span class="_ _6"> </span><span class="ff5">5<span class="_"> </span></span>页</div></div><div class="t m0 x2 h3 y17 ff4 fs1 fc0 sc1 ls0 ws0">1200.00 2</div><div class="t m0 x2 h3 y18 ff4 fs1 fc0 sc1 ls0 ws0">2 B:600.00 A:400.00</div><div class="t m0 x2 h3 y5d ff4 fs1 fc0 sc1 ls0 ws0">1 C:200.50</div><div class="t m0 x2 h3 y1a ff4 fs1 fc0 sc1 ls0 ws0">1200.50 3</div><div class="t m0 x2 h3 y1b ff4 fs1 fc0 sc1 ls0 ws0">2 B:600.00 A:400.00</div><div class="t m0 x2 h3 y5e ff4 fs1 fc0 sc1 ls0 ws0">1 C:200.50</div><div class="t m0 x2 h3 y5f ff4 fs1 fc0 sc1 ls0 ws0">1 A:100.00</div><div class="t m0 x2 h3 y60 ff4 fs1 fc0 sc1 ls0 ws0">100.00 0</div><div class="t m0 x2 h3 y61 ff3 fs1 fc0 sc1 ls0 ws0">【样例输出】</div><div class="t m0 x2 h3 y62 ff4 fs1 fc0 sc1 ls0 ws0">123.50</div><div class="t m0 x2 h3 y21 ff4 fs1 fc0 sc1 ls0 ws0">1000.00</div><div class="t m0 x2 h3 y22 ff4 fs1 fc0 sc1 ls0 ws0">1200.50</div><div class="t m0 x2 h3 y63 ff1 fs1 fc0 sc0 ls0 ws0">二、问题分<span class="_ _1"></span>析及边界条<span class="_ _1"></span>件</div><div class="t m0 x2 h3 y24 ff3 fs1 fc0 sc1 ls0 ws0">本题主要就是对数据的处理，<span class="_ _7"></span>如果成功的得到数据，<span class="_ _7"></span>那么剩下的就只</div><div class="t m0 x2 h3 y25 ff3 fs1 fc0 sc1 ls0 ws0">是普通的<span class="_ _4"> </span><span class="ff4">0-1<span class="_ _4"> </span></span>背包问题。</div><div class="t m0 x2 h3 y26 ff1 fs1 fc0 sc0 ls0 ws0">三、算法设<span class="_ _1"></span>计</div><div class="t m0 x2 h3 y64 ff3 fs1 fc0 sc1 ls0 ws0">每张发票上的物品数为<span class="_ _4"> </span><span class="ff4">m</span>，<span class="_ _c"></span>然后输入<span class="_ _4"> </span><span class="ff4">m<span class="_ _4"> </span></span>个字符串，<span class="_ _c"></span>接下来就是对这些</div><div class="t m0 x2 h3 y65 ff3 fs1 fc0 sc1 ls0 ws0">字<span class="_ _1"></span>符<span class="_ _1"></span>串<span class="_ _1"></span>进<span class="_ _1"></span>行<span class="_ _b"></span>处<span class="_ _1"></span>理<span class="_ _1"></span>，<span class="_ _1"></span>每<span class="_ _1"></span>个<span class="_ _b"></span>字<span class="_ _1"></span>符<span class="_ _1"></span>串<span class="_ _1"></span>的<span class="_ _1"></span>前<span class="_ _1"></span>两<span class="_ _b"></span>个<span class="_ _1"></span>字<span class="_ _1"></span>符<span class="_ _1"></span>是<span class="_ _1"></span>固<span class="_ _1"></span>定<span class="_ _b"></span>的<span class="_ _1"></span>，<span class="_ _1"></span>只<span class="_ _1"></span>需<span class="_ _1"></span>要<span class="_ _b"></span>删<span class="_ _1"></span>除<span class="_ _1"></span>，</div><div class="t m0 x2 h3 y66 ff3 fs1 fc0 sc1 ls0 ws0">剩下的就是数字字符串了，<span class="_ _7"></span>只需要将其转化成数字即可，<span class="_ _7"></span>同时对照题</div><div class="t m0 x2 h3 y67 ff3 fs1 fc0 sc1 ls0 ws0">目要求，<span class="_ _d"></span>将最终满足题意可以报销的发票上的钱数依次存储进<span class="_ _6"> </span><span class="ff4">vector</span></div><div class="t m0 x2 h3 y68 ff3 fs1 fc0 sc1 ls0 ws0">容<span class="_ _1"></span>器<span class="_ _b"></span>中<span class="_ _b"></span>，<span class="_ _1"></span><span class="ff4">0-1<span class="_ _5"> </span></span>背<span class="_ _b"></span>包<span class="_ _b"></span>问<span class="_ _b"></span>题<span class="_ _1"></span>，<span class="_ _b"></span>可<span class="_ _b"></span>以<span class="_ _1"></span>把<span class="_ _b"></span>给<span class="_ _b"></span>定<span class="_ _1"></span>的<span class="_ _b"></span>报<span class="_ _b"></span>销<span class="_ _1"></span>额<span class="_ _b"></span>度<span class="_ _b"></span><span class="ff4">*100<span class="_ _1"></span></span>（<span class="_ _b"></span>因<span class="_ _b"></span>为<span class="_ _1"></span>是<span class="_ _b"></span>小<span class="_ _b"></span>数<span class="_ _1"></span>）</div><div class="t m0 x2 h3 y69 ff3 fs1 fc0 sc1 ls0 ws0">看作背包容量，<span class="_ _7"></span>可以报销的钱数<span class="ff4">*100</span>（对照上面的报销额）<span class="_ _7"></span>看作每个</div></div><div class="pi" data-data='{"ctm":[1.611830,0.000000,0.000000,1.611830,0.000000,0.000000]}'></div></div>

100+评论昵称:

captcha

类型	标题	大小	时间
	基于前端VUE+elementUI+后端springboot的会议管理系统	69.62MB	7月前

	逆向学习环境BinHunt	407.19KB	8月前
	优化后的PSINS-DR的MATLAB程序，解决了odsimu报错的问题	366.41KB	8月前
	python3.8版本的Cartopy库whl文件	20.5MB	8月前
	实验六存储系统（源码）	3.03KB	7月前

	实验二运算器设计（源码）	11.95KB	7月前
	2023全新个人免签约支付系统PHP源码码支付系统 ThinkPHP6框架	45.19MB	7月前
	2222222222222222222222222222	9.13MB	7月前