• PUDN用户
    了解作者
  • C++
    开发工具
  • 12KB
    文件大小
  • rar
    文件格式
  • 0
    收藏次数
  • 1 积分
    下载积分
  • 52
    下载次数
  • 2006-07-01 01:52
    上传日期
问题描述: 设有 个运动员要进行网球循环赛。现要设计一个满足以下要求的比赛日程表: (1) 每个选手必须与其他n-1个选手各赛一次; (2) 每个选手一天只能赛一次; (3) 循环赛一共进行n-1天;
wangqiu.rar
  • resource.h
    91B
  • stdafx.h
    232B
  • 羽毛球循环赛日程表.cpp
    3.2KB
  • AssemblyInfo.cpp
    1.8KB
  • stdafx.cpp
    149B
  • 网球循环赛.doc
    40KB
  • www.pudn.com.txt
    218B
内容介绍
<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/622b2faa81ded46b7f15991d/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/622b2faa81ded46b7f15991d/bg1.jpg"><div class="c x0 y1 w2 h2"><div class="t m0 x1 h3 y2 ff1 fs0 fc0 sc0 ls0 ws0">&#32593;&#29699;&#24490;&#29615;&#36187;&#38382;&#39064;</div><div class="t m0 x2 h4 y3 ff1 fs1 fc0 sc1 ls0 ws0">&#19968;&#12289;<span class="_ _0"> </span>&#39064;&#30446;</div><div class="t m0 x3 h4 y4 ff1 fs1 fc0 sc1 ls0 ws0">&#35774;&#26377;<span class="_ _1"> </span>&#20010;&#36816;&#21160;&#21592;&#35201;&#36827;&#34892;&#32593;&#29699;&#24490;&#29615;&#36187;&#12290;&#29616;&#35201;&#35774;&#35745;&#19968;&#20010;&#28385;&#36275;&#20197;&#19979;&#35201;&#27714;&#30340;&#27604;&#36187;&#26085;&#31243;&#34920;&#65306;</div><div class="t m0 x2 h4 y5 ff1 fs1 fc0 sc1 ls0 ws0">&#65288;<span class="ff2">1</span>&#65289;<span class="_ _2"> </span>&#27599;&#20010;&#36873;&#25163;&#24517;&#39035;&#19982;&#20854;&#20182;<span class="_ _3"> </span><span class="ff2">n-1<span class="_ _3"> </span></span>&#20010;&#36873;&#25163;&#21508;&#36187;&#19968;&#27425;&#65307;</div><div class="t m0 x2 h4 y6 ff1 fs1 fc0 sc1 ls0 ws0">&#65288;<span class="ff2">2</span>&#65289;<span class="_ _2"> </span>&#27599;&#20010;&#36873;&#25163;&#19968;&#22825;&#21482;&#33021;&#36187;&#19968;&#27425;&#65307;</div><div class="t m0 x2 h4 y7 ff1 fs1 fc0 sc1 ls0 ws0">&#65288;<span class="ff2">3</span>&#65289;<span class="_ _2"> </span>&#24490;&#29615;&#36187;&#19968;&#20849;&#36827;&#34892;<span class="_ _3"> </span><span class="ff2">n-1<span class="_ _3"> </span></span>&#22825;&#65307;</div><div class="t m0 x4 h4 y8 ff1 fs1 fc0 sc1 ls0 ws0">&#25353;&#27492;&#35201;<span class="_ _4"></span>&#27714;&#21487;&#23558;<span class="_ _4"></span>&#27604;&#36187;&#26085;<span class="_ _4"></span>&#31243;&#34920;&#35774;<span class="_ _4"></span>&#35745;&#25104;<span class="_ _5"> </span><span class="ff2">n<span class="_ _3"> </span></span>&#34892;&#21644;<span class="_ _6"> </span><span class="ff2">n-1<span class="_ _3"> </span></span>&#21015;&#30340;<span class="_ _4"></span>&#34920;&#12290;&#34920;<span class="_ _4"></span>&#20013;&#31532;<span class="_ _6"> </span><span class="ff2">i<span class="_ _3"> </span></span>&#34892;<span class="_ _4"></span>&#21644;&#31532;<span class="_ _6"> </span><span class="ff2">j<span class="_ _3"> </span></span>&#21015;&#22788;&#22635;<span class="_ _4"></span>&#20837;&#31532;<span class="_ _6"> </span><span class="ff2">i<span class="_ _3"> </span></span>&#20010;</div><div class="t m0 x2 h4 y9 ff1 fs1 fc0 sc1 ls0 ws0">&#36873;&#25163;&#22312;&#31532;<span class="_ _3"> </span><span class="ff2">j<span class="_ _3"> </span></span>&#22825;&#25152;&#36935;&#21040;&#30340;&#23545;&#25163;&#12290;</div><div class="t m0 x2 h4 ya ff1 fs1 fc0 sc1 ls0 ws0">&#20108;&#12289;<span class="_ _0"> </span>&#31639;&#27861;&#20998;&#26512;&#19982;&#35774;&#35745;</div><div class="t m0 x3 h4 yb ff1 fs1 fc0 sc1 ls0 ws0">&#25353;&#20998;&#27835;&#31574;&#30053;&#65292;&#21487;&#20197;&#23558;&#25152;&#26377;&#30340;&#36873;&#25163;&#20998;&#20026;&#20004;&#21322;&#65292;&#21017;<span class="_ _3"> </span><span class="ff2">n<span class="_ _3"> </span></span>&#20010;&#36873;&#25163;&#30340;&#27604;&#36187;&#26085;&#31243;&#34920;&#21487;&#20197;&#36890;&#36807;<span class="_ _3"> </span><span class="ff2">n/2<span class="_ _3"> </span></span>&#20010;</div><div class="t m0 x2 h4 yc ff1 fs1 fc0 sc1 ls0 ws0">&#36873;&#25163;&#30340;&#27604;&#36187;&#26085;&#31243;&#34920;&#26469;&#20915;&#23450;&#12290;&#36882;&#24402;&#22320;&#29992;&#36825;&#31181;&#19968;&#20998;&#20026;&#20108;&#30340;&#31574;&#30053;&#23545;&#36873;&#25163;&#36827;&#34892;&#21010;&#20998;&#65292;&#30452;&#21040;&#21482;&#21097;&#19979;&#20004;</div><div class="t m0 x2 h4 yd ff1 fs1 fc0 sc1 ls0 ws0">&#20010;&#36873;&#25163;&#26102;&#65292;&#27604;&#36187;&#26085;&#31243;&#34920;&#30340;&#21046;&#23450;&#23601;&#21464;&#24471;&#24456;&#31616;&#21333;&#12290;&#36825;&#26102;&#21482;&#35201;&#35753;&#36825;&#20004;&#20010;&#36873;&#25163;&#36827;&#34892;&#27604;&#36187;&#23601;&#21487;&#20197;&#20102;&#12290;</div><div class="t m0 x5 h5 ye ff2 fs1 fc0 sc1 ls0 ws0">&#58889; 1 2 3&#58889; 4 5 6 7</div><div class="t m0 x6 h5 yf ff2 fs1 fc0 sc1 ls0 ws0">1 </div><div class="t m0 x6 h5 y10 ff2 fs1 fc0 sc1 ls0 ws0">2</div><div class="t m0 x6 h5 y11 ff2 fs1 fc0 sc1 ls0 ws0">3</div><div class="t m0 x6 h5 y12 ff2 fs1 fc0 sc1 ls0 ws0">4 </div><div class="t m0 x7 h5 yf ff2 fs1 fc0 sc1 ls0 ws0">2 3 4 </div><div class="t m0 x7 h5 y10 ff2 fs1 fc0 sc1 ls0 ws0">1 4 3</div><div class="t m0 x7 h5 y11 ff2 fs1 fc0 sc1 ls0 ws0">4 1 2</div><div class="t m0 x7 h5 y12 ff2 fs1 fc0 sc1 ls0 ws0">3 2 1 </div><div class="t m0 x8 h5 yf ff2 fs1 fc0 sc1 ls0 ws0">5 6 7 8 </div><div class="t m0 x8 h5 y10 ff2 fs1 fc0 sc1 ls0 ws0">6 5 8 7</div><div class="t m0 x8 h5 y11 ff2 fs1 fc0 sc1 ls0 ws0">7 8 5 6</div><div class="t m0 x8 h5 y12 ff2 fs1 fc0 sc1 ls0 ws0">8 7 6 5 </div><div class="t m0 x6 h5 y13 ff2 fs1 fc0 sc1 ls0 ws0">5 </div><div class="t m0 x6 h5 y14 ff2 fs1 fc0 sc1 ls0 ws0">6</div><div class="t m0 x6 h5 y15 ff2 fs1 fc0 sc1 ls0 ws0">7</div><div class="t m0 x6 h5 y16 ff2 fs1 fc0 sc1 ls0 ws0">8 </div><div class="t m0 x7 h5 y13 ff2 fs1 fc0 sc1 ls0 ws0">6 7 8 </div><div class="t m0 x7 h5 y14 ff2 fs1 fc0 sc1 ls0 ws0">5 8 7</div><div class="t m0 x7 h5 y15 ff2 fs1 fc0 sc1 ls0 ws0">8 5 6</div><div class="t m0 x7 h5 y16 ff2 fs1 fc0 sc1 ls0 ws0">7 6 5 </div><div class="t m0 x8 h5 y13 ff2 fs1 fc0 sc1 ls0 ws0">1 2 3 4 </div><div class="t m0 x8 h5 y14 ff2 fs1 fc0 sc1 ls0 ws0">2 1 4 3</div><div class="t m0 x8 h5 y15 ff2 fs1 fc0 sc1 ls0 ws0">3 4 1 2</div><div class="t m0 x8 h5 y16 ff2 fs1 fc0 sc1 ls0 ws0">4 3 2 1 </div><div class="t m0 x1 h4 y17 ff2 fs1 fc0 sc1 ls0 ws0"> <span class="ff1">&#20843;&#20010;&#36873;&#25163;&#30340;&#27604;&#36187;&#26085;&#31243;&#34920;</span></div><div class="t m0 x4 h4 y18 ff1 fs1 fc0 sc1 ls0 ws0">&#19978;&#22270;&#25152;&#21015;&#20986;&#30340;&#27491;&#26041;&#24418;&#34920;&#26159;<span class="_ _3"> </span><span class="ff2">8<span class="_ _3"> </span></span>&#20010;&#36873;&#25163;&#30340;&#27604;&#36187;&#26085;&#31243;&#34920;&#12290;&#20854;&#20013;&#24038;&#19978;&#35282;&#19982;&#24038;&#19979;&#35282;&#30340;&#20004;&#23567;&#22359;&#20998;&#21035;</div><div class="t m0 x2 h4 y19 ff1 fs1 fc0 sc1 ls0 ws0">&#20026;&#36873;&#25163;<span class="_ _3"> </span><span class="ff2">1<span class="_ _3"> </span></span>&#33267;&#36873;&#25163;<span class="_ _3"> </span><span class="ff2">4<span class="_ _3"> </span></span>&#21644;&#36873;&#25163;<span class="_ _3"> </span><span class="ff2">5<span class="_ _3"> </span></span>&#33267;&#36873;&#25163;<span class="_ _3"> </span><span class="ff2">8<span class="_ _3"> </span></span>&#21069;<span class="_ _3"> </span><span class="ff2">3<span class="_ _3"> </span></span>&#22825;&#30340;&#27604;&#36187;&#26085;&#31243;&#12290;&#25454;&#27492;&#65292;&#23558;&#24038;&#19978;&#35282;&#23567;&#22359;&#20013;&#30340;&#25152;&#26377;&#25968;</div><div class="t m0 x2 h4 y1a ff1 fs1 fc0 sc1 ls0 ws0">&#23383;&#25353;&#20854;&#30456;&#23545;&#20301;&#32622;&#25220;&#21040;&#21491;&#19979;&#35282;&#65292;&#21448;&#23558;&#24038;&#19979;&#35282;&#23567;&#22359;&#20013;&#30340;&#25152;&#26377;&#25968;&#23383;&#25353;&#20854;&#30456;&#23545;&#20301;&#32622;&#25220;&#21040;&#21491;&#19978;&#35282;&#65292;&#36825;</div><div class="t m0 x2 h4 y1b ff1 fs1 fc0 sc1 ls0 ws0">&#26679;&#23601;&#20998;&#21035;&#23433;&#25490;&#22909;&#20102;&#36873;&#25163;<span class="_ _3"> </span><span class="ff2">1<span class="_ _3"> </span></span>&#33267;&#36873;&#25163;<span class="_ _3"> </span><span class="ff2">4<span class="_ _3"> </span></span>&#21644;&#36873;&#25163;<span class="_ _3"> </span><span class="ff2">5<span class="_ _3"> </span></span>&#33267;&#36873;&#25163;<span class="_ _3"> </span><span class="ff2">8<span class="_ _3"> </span></span>&#22312;&#21518;<span class="_ _3"> </span><span class="ff2">4<span class="_ _3"> </span></span>&#22825;&#30340;&#27604;&#36187;&#26085;&#31243;&#12290;&#20381;&#27492;&#24605;&#24819;&#23481;&#26131;</div><div class="t m0 x2 h4 y1c ff1 fs1 fc0 sc1 ls0 ws0">&#23558;&#36825;&#20010;&#27604;&#36187;&#26085;&#31243;&#34920;&#25512;&#24191;&#21040;&#20855;&#26377;&#20219;&#24847;&#22810;&#20010;&#36873;&#25163;&#30340;&#24773;&#24418;&#12290;</div><div class="t m0 x2 h4 y1d ff1 fs1 fc0 sc1 ls0 ws0">&#19977;&#12289;<span class="_ _0"> </span>&#27969;&#31243;&#22270;</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>
评论
    相关推荐
    • 比赛安排.zip
      给定n个选手,比赛n天,画出表格,单循环比赛
    • Carl-Friedrich:一个命令行应用程序来组织循环国际象棋比赛
      在第一步(哈佛大学CS50课程的最终项目)中,锦标赛类型将限制为循环赛,将流行但复杂的瑞士锦标赛留给以后。 同样,用户界面将为德语。 可以添加其他语言作为以后的改进,前提是该项目可以长期维护和使用。 比赛...
    • 循环赛日程表(C#)
      设计要求:请使用C语言编程,设计一个有效的算法解决循环赛日程表问题。 设计提示:按分治策略,将所有的选手分为两半,n个选手的比赛日程表就可以通过为n/2个选手设计的比赛日程表来决定。递归地用对选手进行分割,...
    • 比赛计分器
      用51单片机Protues实现的计分器,很简单的
    • AWD攻防比赛 PHP WAF
      AWD攻防比赛 PHP WAF 超强waf,防读flag 比赛用基本可以完美防住
    • 算法设计与分析 循环赛
      这是我在学算法设计与分析时老师要求作的实验,很不错拿来分享
    • 用分治法设计循环比赛日程安排C++源码
      【问题描述】 设计一个满足以下要求的比赛日程表: (1)每个选手必须与其他n-1个选手各赛一次; (2)每个选手一天只能赛一次; (3)循环赛一共进行n-1天。
    • 篮球比赛秒表
      篮球比赛秒表,包括定时器与显示功能,keil程序,hex文件,C语言
    • 算法(c++)——循环比赛日程安排问题.rar
      算法(c++)——循环比赛日程安排问题
    • Kyjoukan:比赛策划师
      循环赛:每个团队在同一个池中对战对方 方括号:每支球队都踢另一支; 每个获胜者都扮演另一个获胜者,依此类推... 特征 一旦给定了团队,场地和池数(团队组),该应用程序将: 自动将团队分配到池中 让用户手动...