A. Wasted Time

最新推荐文章于 2019-08-12 22:10:25 发布

原创最新推荐文章于 2019-08-12 22:10:25 发布 · 1.4k 阅读

0 ·

CC 4.0 BY-SA版权

本文为博主原创文章，未经博主允许不得转载。

AC路漫漫专栏收录该内容

1880 篇文章

订阅专栏

本文介绍了一个计算Mr. Scrooge签署文件所浪费时间的问题。通过输入他的签名路径坐标及签署次数，利用线段距离公式计算总时间。文章提供了一段C++代码实现。

Mr. Scrooge, a very busy man, decided to count the time he wastes on all sorts of useless stuff to evaluate the lost profit. He has already counted the time he wastes sleeping and eating. And now Mr. Scrooge wants to count the time he has wasted signing papers.

Mr. Scrooge's signature can be represented as a polyline A₁A₂... A_n. Scrooge signs like that: first it places a pen at the pointA₁, then draws a segment from point A₁ to point A₂, then he draws a segment from point A₂ to point A₃ and so on to pointA_n, where he stops signing and takes the pen off the paper. At that the resulting line can intersect with itself and partially repeat itself but Scrooge pays no attention to it and never changes his signing style. As Scrooge makes the signature, he never takes the pen off the paper and his writing speed is constant — 50 millimeters per second.

Scrooge signed exactly k papers throughout his life and all those signatures look the same.

Find the total time Scrooge wasted signing the papers.

Input

The first line contains two integers n and k (2 ≤ n ≤ 100, 1 ≤ k ≤ 1000). Each of the following n lines contains the coordinates of the polyline's endpoints. The i-th one contains coordinates of the point A_i — integers x_i and y_i, separated by a space.

All points A_i are different. The absolute value of all coordinates does not exceed 20. The coordinates are measured in millimeters.

Output

Print one real number — the total time Scrooges wastes on signing the papers in seconds. The absolute or relative error should not exceed 10^- 6.

       Sample test(s)
     

         input
       
2 1
0 0
10 0

         output
       
0.200000000

         input
       
5 10
3 1
-5 6
-2 -1
3 2
10 0

         output
       
6.032163204

         input
       
6 10
5 0
4 0
6 0
3 0
7 0
2 0

         output
       
3.000000000
        
 
       

解题说明：此题就是求N段线段距离

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;

int main()
{
	int n,k;
	int i;
	double sum;
	double x[101],y[101];
	scanf("%d %d",&n,&k);
	sum=0;
	scanf("%lf %lf",&x[0],&y[0]);
	for(i=1;i<n;i++)
	{
		scanf("%lf %lf",&x[i],&y[i]);
		sum+=sqrt((x[i]-x[i-1])*(x[i]-x[i-1])+(y[i]-y[i-1])*(y[i]-y[i-1]));
	}
	sum=(sum/50)*k;
	printf("%lf\n",sum);
	
	return 0;
}