寻宝
寻宝
古物和古玩博物馆的考古学家亲自到埃及考察了Key-Ops的大金字塔。 他们使用最先进的技术可以确定金字塔的下层是由一系列直线壁构成的，这些直线相交形成许多封闭的腔室。 当前，不存在允许进入任何腔室的门。 这项最先进的技术还可以精确定位宝藏室的位置。 这些专门的（贪婪的）考古学家想要做的是炸开大门穿过墙壁到达藏宝室。 但是，为了最大程度地减少对中间腔室中艺术品的损坏（并获得炸药的政府拨款），他们希望通过最少数量的门进行爆破。 出于结构完整性的目的，只应在进入房间墙壁的中点对门进行爆破。 您将编写一个确定此最小门数的程序。 一个例子如下所示：
输入
输入将包含一种情况。 第一行将是整数n（0 <= n <= 30），用于指定内墙的数量，其后是n行，其中每行x1 y1 x2 y2包含整数端点。 金字塔的4个封闭墙在（0，0），（0，100），（100，0），（100，100）处具有固定端点
文件下载
资源详情
[{"title":"（ 39 个子文件 32KB ） 寻宝","children":[{"title":"treasure-hunt-master","children":[{"title":"treasure-hunt-test-runner","children":[{"title":"treasure-hunt-test-runner.vcxproj <span style='color:#111;'> 7.10KB </span>","children":null,"spread":false},{"title":"src","children":[{"title":"Main.cpp <span style='color:#111;'> 4.04KB </span>","children":null,"spread":false}],"spread":true},{"title":"treasure-hunt-test-runner.vcxproj.filters <span style='color:#111;'> 960B </span>","children":null,"spread":false}],"spread":true},{"title":"inputs","children":[{"title":"09.txt <span style='color:#111;'> 103B </span>","children":null,"spread":false},{"title":"00.txt <span style='color:#111;'> 8B </span>","children":null,"spread":false},{"title":"07.txt <span style='color:#111;'> 224B </span>","children":null,"spread":false},{"title":"02.txt <span style='color:#111;'> 104B </span>","children":null,"spread":false},{"title":"10.txt <span style='color:#111;'> 79B </span>","children":null,"spread":false},{"title":"04.txt <span style='color:#111;'> 70B </span>","children":null,"spread":false},{"title":"05.txt <span style='color:#111;'> 225B </span>","children":null,"spread":false},{"title":"08.txt <span style='color:#111;'> 100B </span>","children":null,"spread":false},{"title":"06.txt <span style='color:#111;'> 223B </span>","children":null,"spread":false},{"title":"01.txt <span style='color:#111;'> 96B </span>","children":null,"spread":false},{"title":"03.txt <span style='color:#111;'> 70B </span>","children":null,"spread":false}],"spread":false},{"title":"treasure-hunt","children":[{"title":"treasure-hunt.vcxproj.filters <span style='color:#111;'> 1.84KB </span>","children":null,"spread":false},{"title":"src","children":[{"title":"computations","children":[{"title":"WallsAndPointsProcessor.h <span style='color:#111;'> 3.97KB </span>","children":null,"spread":false},{"title":"WallsAndPointsProcessor.cpp <span style='color:#111;'> 12.99KB </span>","children":null,"spread":false}],"spread":true},{"title":"geometry","children":[{"title":"Wall.cpp <span style='color:#111;'> 7.77KB </span>","children":null,"spread":false},{"title":"DoorPointWithSurroundingLines.cpp <span style='color:#111;'> 321B </span>","children":null,"spread":false},{"title":"DoorPointWithSurroundingLines.h <span style='color:#111;'> 2.00KB </span>","children":null,"spread":false},{"title":"Wall.h <span style='color:#111;'> 4.75KB </span>","children":null,"spread":false},{"title":"Point.cpp <span style='color:#111;'> 423B </span>","children":null,"spread":false},{"title":"Point.h <span style='color:#111;'> 1.08KB </span>","children":null,"spread":false}],"spread":true},{"title":"Main.cpp <span style='color:#111;'> 2.81KB </span>","children":null,"spread":false}],"spread":true},{"title":"treasure-hunt.vcxproj <span style='color:#111;'> 7.39KB </span>","children":null,"spread":false}],"spread":true},{"title":"outputs","children":[{"title":"09.txt <span style='color:#111;'> 20B </span>","children":null,"spread":false},{"title":"00.txt <span style='color:#111;'> 20B </span>","children":null,"spread":false},{"title":"07.txt <span style='color:#111;'> 20B </span>","children":null,"spread":false},{"title":"02.txt <span style='color:#111;'> 19B </span>","children":null,"spread":false},{"title":"10.txt <span style='color:#111;'> 20B </span>","children":null,"spread":false},{"title":"04.txt <span style='color:#111;'> 20B </span>","children":null,"spread":false},{"title":"05.txt <span style='color:#111;'> 20B </span>","children":null,"spread":false},{"title":"08.txt <span style='color:#111;'> 20B </span>","children":null,"spread":false},{"title":"06.txt <span style='color:#111;'> 20B </span>","children":null,"spread":false},{"title":"01.txt <span style='color:#111;'> 20B </span>","children":null,"spread":false},{"title":"03.txt <span style='color:#111;'> 20B </span>","children":null,"spread":false}],"spread":false},{"title":".gitignore <span style='color:#111;'> 5.86KB </span>","children":null,"spread":false},{"title":"treasure-hunt.sln <span style='color:#111;'> 2.17KB </span>","children":null,"spread":false},{"title":"README.md <span style='color:#111;'> 2.02KB </span>","children":null,"spread":false}],"spread":true}],"spread":true}]
评论信息
免责申明
【只为小站】的资源来自网友分享，仅供学习研究，请务必在下载后24小时内给予删除，不得用于其他任何用途，否则后果自负。基于互联网的特殊性，【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查；无论 【只为小站】 经营者是否已进行审查，用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，zhiweidada#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，zhiweidada#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明