Advertisement
UMME_RUKAYA13

Untitled

Sep 30th, 2018
93
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.69 KB | None | 0 0
  1. #include<stdio.h>
  2. #include<math.h>
  3. int main()
  4. {
  5. int n,r,i;
  6. scanf("%d %d",&n,&r);
  7. double a[n],b[n],ans,sum=0.0;
  8. for(i=0; i<n; i++)
  9. {
  10. scanf("%lf %lf",&a[i],&b[i]);
  11. }
  12. if(n==2)
  13. {
  14. sum=sqrt((a[1]-a[0])*(a[1]-a[0])+(b[1]-b[0])*(b[1]-b[0]));
  15. ans=2.0*3.14159*r;
  16. }
  17. else if(n==1)
  18. ans=2.0*3.14159*r;
  19. else
  20. {
  21. for(i=0,sum=0.0; i<n-1; i++)
  22. {
  23. sum=sum+sqrt((a[i]-a[i+1])*(a[i]-a[i+1])+(b[i]-b[i+1])*(b[i]-b[i+1]));
  24. }
  25. sum=sum+sqrt((a[n-1]-a[0])*(a[n-1]-a[0])+(b[n-1]-b[0])*(b[n-1]-b[0]));
  26.  
  27. ans=2.0*3.14159*r;
  28. }
  29. printf("%.2lf\n",ans+sum);
  30.  
  31. return 0;
  32. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement