ICPC（ACM国际大学生程序设计竞赛where nis the number of nodes in the tour.Miroslava works for a computer security company and it is time to renew a shared cryptographic key in many data centres across Europe. To do this, Miroslava is going to rent a private jet and deliver the key to employees waiting at all major European airports. She wants to be back as soon as possible.Miroslava s company has a computer that is able to execute pbillions of operations per second. Since we can approximate Europe by a two-dimensional plane, we assume that the Arora-Mitchellalgorithm runs for exactlypn(log2n)c2p 109seconds on this computer to produce the exact (1 + 1=c)-approximation of the optimal tour. Miroslava noticed that cis a parameter of the algorithm that can be used to her advantage, butone also needs to be very careful when choosing the right value. If she sets ctoo low, the algorithm will nish very fast but the time she spends ying around Europe will be too long. On the other hand, setting it too high will force her to wait for an answer from the computer, while she could be ying instead.Miroslava used to work in a different company and from there she knows that the optimal tour of all major European airports is smeters long, but she wasn t ranked high enough in the company to know the actual tour. Given the speed vof the private jet in meters per second, Miroslava needs s(1 + 1=c)=v seconds to complete the tour produced by the algorithm run with parameterc. For thesake of simplicity, we assume that Miroslava can land, leave a copy of the private key and take off from each airport in an instant.How long does it take Miroslava to rst run the algorithm and then distribute all the keys, assuming that she chooses the optimal parameter c?InputThe input le contains several test cases, each of them as described below. The input consists of one line with four numbers:);n(logn)O((cpd)d1The famous Arora-Mitchell approximation algorithm for the Euclidean Travelling Salesman Problem (Euclidean TSP) was discovered independently by Sanjeev Arora and Joseph S. B. Mitchell in 1998. It can approximate the value of an optimal TSP tour in ddimensions within a factor of 1 + 1cin running time0an integer n(4 n1000000), the number of airports;0a real number p(0:001 p5000), the number of billions of operations the computer can execute per second;0a real number s(106s109), the length of the optimal tour of all European airports in meters;0a real number v(50 v900), the speed of the private jet in meters per second.All real numbers will have at most 10 digits after the decimal point.OutputFor each test case, output one line with the shortest possible time tin seconds to distribute the keys and the value of the parameter cMiroslava should use to achieve time t. Your answer should have an absolute or relative error of at most 10 6.Sample Input10 8.9 40075000 272.147 4.2 1337102.4 256Sample Output157079.04857106 15.5982610923095836.2936298227 8.9113418228146代写计算机编程类/金融/高数/论文/英文本网站支持淘宝 支付宝 微信支付 paypal等等交易。如果不放心可以用淘宝或者Upwork交易！E-mail:[email protected]微信：BadGeniuscs 工作时间：无休息工作日-早上8点到凌晨3点如果您用的手机请先保存二维码到手机里面，识别图中二维码。如果用电脑，直接掏出手机果断扫描。

所有的编程代写范围：essayghost为美国、加拿大、英国、澳洲的留学生提供C语言代写、代写C语言、C语言代做、代做C语言、数据库代写、代写数据库、数据库代做、代做数据库、Web作业代写、代写Web作业、Web作业代做、代做Web作业、Java代写、代写Java、Java代做、代做Java、Python代写、代写Python、Python代做、代做Python、C/C++代写、代写C/C++、C/C++代做、代做C/C++、数据结构代写、代写数据结构、数据结构代做、代做数据结构等留学生编程作业代写服务。