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 A1A2… An. Scrooge signs like that: first it places a pen at the point A1, then draws a segment from point A1 to point A2, then he draws a segment from point A2 to point A3 and so on to point An, 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 Ai — integers xi and yi, separated by a space.
All points Ai 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.
Examples
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
本题题意就是用勾股定理,并且求出总共的长度,最后求时间就可以了。刚开始提交上去总是编译错误,后来学到了原来sqrt内一定是小数,下次要注意了。
代码如下:
#include"iostream"
#include"algorithm"
#include"cstring"
using namespace std;
int main()
{
int a[105];
int n;
while(~scanf("%d",&n))
{
int b[105]={0};
for(int i = 0;i < n;i ++)
{
scanf("%d",&a[i]);
}
sort(a,a+n);
int sum = 0;
int sum1=0;
for(int i = 0;i < n;i ++)
{
sum1=1;
if(!b[i])
{
sum++;
b[i]=1;
for(int j = i + 1;j < n;j ++)
{
if(a[j]>=sum1 && !b[j])
{
sum1++;
b[j]=1;
}
}
}
}
if(!b[n-1])
{
sum++;
}
printf("%d\n",sum);
}
return 0;
}