decomposition.rar

  • PUDN用户
    了解作者
  • Visual C++
    开发工具
  • 70KB
    文件大小
  • rar
    文件格式
  • 0
    收藏次数
  • 10 积分
    下载积分
  • 1
    下载次数
  • 2016-05-23 20:10
    上传日期
设n为一自然数,n可以分解成若干个不同的自然数的和,编写程序,求各种分解方法中各加数乘积的最大值。
decomposition.rar
  • decomposition.docx
    72.1KB
内容介绍
<html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta charset="utf-8"> <meta name="generator" content="pdf2htmlEX"> <meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"> <link rel="stylesheet" href="https://static.pudn.com/base/css/base.min.css"> <link rel="stylesheet" href="https://static.pudn.com/base/css/fancy.min.css"> <link rel="stylesheet" href="https://static.pudn.com/prod/directory_preview_static/622b67543d2fbb0007436d84/raw.css"> <script src="https://static.pudn.com/base/js/compatibility.min.js"></script> <script src="https://static.pudn.com/base/js/pdf2htmlEX.min.js"></script> <script> try{ pdf2htmlEX.defaultViewer = new pdf2htmlEX.Viewer({}); }catch(e){} </script> <title></title> </head> <body> <div id="sidebar" style="display: none"> <div id="outline"> </div> </div> <div id="pf1" class="pf w0 h0" data-page-no="1"><div class="pc pc1 w0 h0"><img class="bi x0 y0 w1 h1" alt="" src="https://static.pudn.com/prod/directory_preview_static/622b67543d2fbb0007436d84/bg1.jpg"><div class="c x0 y1 w2 h2"><div class="t m0 x1 h3 y2 ff1 fs0 fc0 sc0 ls0 ws0">&#39064;&#30446;&#20108;</div><div class="t m0 x2 h4 y3 ff1 fs1 fc0 sc0 ls0 ws0">&#35201;&#27714;&#65306;&#35774;<span class="_ _0"> </span><span class="ff2">n<span class="_ _1"> </span></span>&#20026;&#19968;&#33258;&#28982;&#25968;<span class="_ _2"></span>&#65292;<span class="ff2">n<span class="_ _1"> </span></span>&#21487;<span class="_ _2"></span>&#20197;&#20998;&#35299;&#25104;&#33509;&#24178;<span class="_ _2"></span>&#20010;&#19981;&#21516;&#30340;&#33258;&#28982;<span class="_ _2"></span>&#25968;&#30340;&#21644;&#65292;&#36825;&#26679;<span class="_ _2"></span>&#30340;&#20998;&#27861;&#26377;&#24456;&#22810;<span class="_ _2"></span>&#31181;&#65292;&#27604;&#22914;<span class="_ _3"> </span><span class="ff2">n=10,</span></div><div class="t m0 x3 h4 y4 ff2 fs1 fc0 sc0 ls0 ws0">10<span class="_"> </span><span class="ff1">&#21487;<span class="_ _2"></span>&#20197;<span class="_ _4"></span>&#20998;<span class="_ _2"></span>&#35299;<span class="_ _4"></span>&#20026;<span class="_ _4"></span>&#65306;<span class="_ _4"></span></span>10=5+4+1; <span class="_ _2"></span>10=5+3+<span class="_ _2"></span>2; <span class="_ _2"></span>10+<span class="_ _2"></span>9+1; <span class="_ _4"></span>10=8+2; <span class="_ _2"></span>10=7+3;<span class="_ _2"></span> <span class="_ _2"></span>10=6+<span class="_ _2"></span>4; <span class="_ _2"></span>10=<span class="_ _2"></span>7+2+1;<span class="_ _2"></span> <span class="_ _2"></span>10=6+3+1;&#8230;<span class="_ _4"></span><span class="ff1">&#12290;</span></div><div class="t m0 x3 h4 y5 ff1 fs1 fc0 sc0 ls0 ws0">&#22312;&#25152;&#26377;&#36825;&#20123;&#20998;&#27861;&#20013;&#65292;&#21508;&#21152;&#25968;&#20056;&#31215;&#26368;&#22823;&#30340;&#20026;<span class="_ _5"> </span><span class="ff2">30, </span>&#65288;<span class="ff2">10=5+3+2<span class="_ _1"> </span></span>&#20013;&#21152;&#25968;&#30340;&#20056;&#31215;&#20026;<span class="_ _0"> </span><span class="ff2">5*3*2=30</span>&#65289;&#12290;&#35797;&#32534;&#20889;&#31243;&#24207;&#65292;&#27714;</div><div class="t m0 x3 h4 y6 ff1 fs1 fc0 sc0 ls0 ws0">&#21508;&#31181;&#20998;&#35299;&#26041;&#27861;&#20013;&#21508;&#21152;&#25968;&#20056;&#31215;&#30340;&#26368;&#22823;&#20540;&#12290;</div><div class="t m0 x2 h4 y7 ff1 fs1 fc0 sc0 ls0 ws0">&#31639;&#27861;&#24605;&#24819;&#65306;</div><div class="t m0 x2 h4 y8 ff2 fs1 fc0 sc0 ls0 ws0">1.n<span class="_ _1"> </span><span class="ff1">&#20026;&#35201;&#20998;&#35299;&#30340;&#33258;&#28982;&#25968;&#65292;&#35774;&#19968;&#20010;&#25968;&#32452;<span class="_ _1"> </span></span>a<span class="ff1">&#12304;&#12305;&#26469;&#20445;&#23384;&#20998;&#35299;&#30340;&#21040;&#30340;&#32467;&#26524;&#12290;</span></div><div class="t m0 x2 h4 y9 ff2 fs1 fc0 sc0 ls0 ws0">2.<span class="ff1">&#25226;<span class="_ _1"> </span></span>n<span class="_ _1"> </span><span class="ff1">&#36171;&#32473;<span class="_ _1"> </span></span>m<span class="ff1">&#65292;&#23545;<span class="_ _1"> </span></span>m<span class="_ _1"> </span><span class="ff1">&#36827;&#34892;&#21464;&#25442;&#25805;&#20316;&#12290;&#24403;<span class="_ _1"> </span></span>m&gt;i<span class="_ _1"> </span><span class="ff1">&#26102;&#36827;&#34892;<span class="_ _1"> </span></span>a[i]=i;<span class="_ _6"> </span>m=m-i;<span class="_ _7"> </span>i++;<span class="ff1">&#24490;&#29615;&#25805;&#20316;&#65292;&#30693;&#36947;<span class="_ _1"> </span></span>m&lt;=i<span class="ff1">&#65292;</span></div><div class="t m0 x2 h4 ya ff2 fs1 fc0 sc0 ls0 ws0">3.<span class="ff1">&#25226;<span class="_ _1"> </span></span>i<span class="_ _1"> </span><span class="ff1">&#33258;&#20943;&#21518;&#24471;&#21040;&#26368;&#21518;&#30340;<span class="_ _1"> </span></span>a<span class="ff1">&#12304;</span>i<span class="ff1">&#12305;&#30340;&#20540;&#12290;&#25226;<span class="_ _1"> </span></span>i<span class="_ _1"> </span><span class="ff1">&#36171;&#32473;<span class="_ _1"> </span></span>j<span class="ff1">&#12290;</span></div><div class="t m0 x2 h4 yb ff2 fs1 fc0 sc0 ls0 ws0">4.<span class="ff1">&#25226;<span class="_ _1"> </span></span>m<span class="_ _1"> </span><span class="ff1">&#20998;&#35299;&#25104;<span class="_ _1"> </span></span>m<span class="_ _1"> </span><span class="ff1">&#20010;<span class="_ _1"> </span></span>1<span class="_ _1"> </span><span class="ff1">&#21152;&#21040;<span class="_ _1"> </span></span>a[i]<span class="ff1">&#21040;<span class="_ _1"> </span></span>a[i-m]<span class="ff1">&#20013;&#65307;</span></div><div class="t m0 x2 h4 yc ff2 fs1 fc0 sc0 ls0 ws0">5.Max=max*a[i]<span class="ff1">&#65307;</span>i<span class="_ _1"> </span><span class="ff1">&#20174;<span class="_ _1"> </span></span>2<span class="_ _1"> </span><span class="ff1">&#21040;<span class="_ _1"> </span></span>j<span class="ff1">&#65292;&#23601;&#24471;&#21040;&#20056;&#31215;&#26368;&#22823;&#20540;&#12290;</span></div><div class="t m0 x3 h4 yd ff1 fs1 fc0 sc0 ls0 ws0">&#31243;&#24207;&#27969;&#31243;&#22270;&#65306;</div><div class="t m0 x3 h4 ye ff1 fs1 fc0 sc0 ls0 ws0">&#36816;&#34892;&#32467;&#26524;<span class="ff2">&amp;&amp;</span>&#23454;&#20363;&#20998;&#26512;&#65306;</div><div class="t m0 x3 h5 yf ff3 fs2 fc0 sc0 ls0 ws0">1.8<span class="_"> </span><span class="ff1">&#20808;&#20998;&#35299;&#20026;<span class="_ _1"> </span></span>2 3<span class="_"> </span><span class="ff1">&#36824;&#21097;&#20313;&#19968;&#20010;<span class="_ _1"> </span></span>3.</div></div></div><div class="pi" data-data='{"ctm":[1.611850,0.000000,0.000000,1.611850,0.000000,0.000000]}'></div></div> </body> </html>
评论
    相关推荐
    • Variational Mode Decomposition.rar
      vmd仿真程序在matlab中的应用,可用于数字信号处理方面
    • decomposition.rar
      按照算法步骤对IRIS数据进行仿真,IRIS数据是由鸢尾属植物的三种单独的花的测量结果所组成,模式类别数为3,特征维数是4,每类各有50个模式样本,共有150个样本。首先使用分解聚类算法分离出第一种鸢尾属植物,再对...
    • hroceg-decomposition-decomposition.zip
      此为监控系统界面配置后的界面文件,具体的界面编辑工具与开发者联系
    • bode-decomposition.zip
      API截取窗口信息 API intercepts window information
    • DECOMPOSITION.rar
      里面包含几个m文件,是基于小波的图像分解代码,亲测可以运行
    • decomposition.zip
      User can the image of his choice which is converted to gray scale image. When the Decomposition button is clicked, the image is divided into four bands i.e., LL, LH, HL, HH.
    • Fourier decomposition method
      FDM方法的MATLAB程序,适用于分解非线性非平稳信号。自己试过,可以使用的。
    • LU-Decomposition
      ->This is the sequential implementation of LU decomposition. 2. OMP-LUDecomposition.cpp -> This is the code after adding OpenMP directives to the sequential implementation. It uses 4 threads. 3. ...
    • 迷宫求解问题.zip
      一次软件作业,迷宫的求解问题,有需要的可以直接下载,(c语言版)