Advertisement
Saleh127

Untitled

Apr 27th, 2020
72
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.52 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. double pi=acos(-1.);
  4. int main()
  5. {
  6. int n,a,i;
  7. double x[200],y[200],s=0.0,m,s1;
  8. scanf("%d %lf",&n,&m);
  9. for(i=0;i<n;i++)
  10. {
  11. scanf("%lf %lf",&x[i],&y[i]);
  12. }
  13. for(i=0;i<n;i++)
  14. {
  15. if(i==n-1)
  16. break;
  17. s=s+sqrt(((x[i]-x[i+1])*(x[i]-x[i+1]))+((y[i]-y[i+1])*(y[i]-y[i+1])));
  18. }
  19. s=s+sqrt(((x[0]-x[n-1])*(x[0]-x[n-1]))+((y[0]-y[n-1])*(y[0]-y[n-1])));
  20. s1=(2*pi*m)/(double)n;
  21. printf("%.2lf\n",s+(n*s1));
  22. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement