This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <iostream>
#include <fstream>
#include <deque>
#include <algorithm>
#include <utility>
#include <vector>
#include <cmath>
#include <queue>
using namespace std;
#define in cin
#define out cout
#define PII pair<int, int>
#define x first
#define y second
#define REP(i, s, e) for(int i=s; i<=e; i++)
#define pi 3.14159265358979323846
int main()
{
int n, k; in >> n >> k;
if( n == 2 )
{
double ax, ay; in >> ax >> ay;
double bx, by; in >> bx >> by;
out << sqrt( (ax-bx)*(ax-bx) + (ay-by)*(ay-by) )*2 + pi*k*2;
}
else
{
return 0;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |