URI - BEECROWD - BEE 1015 | Distance Between Two Points Solution in C,C++,Python

URI - BEECROWD - BEE Online Judge Solution  1015 | Distance Between Two Points - URI - BEECROWD - BEE 1015 Solution in C,C++,Python 

Read the four values corresponding to the x and y axes of two points in the plane, p1 (x1, y1) and p2 (x2, y2) and calculate the distance between them, showing four decimal places after the comma, according to the formula:

Distance = 

Input

The input file contains two lines of data. The first one contains two double values: x1 y1 and the second one also contains two double values with one digit after the decimal point: x2 y2.

Output

Calculate and print the distance value using the provided formula, with 4 digits after the decimal point.

Input Sample	Output Sample
1.0 7.0 5.0 9.0	4.4721

-2.5 0.4 12.1 7.3

16.1484

2.5 -0.4 -12.2 7.0

16.4575

URI Online Judge Solution  1015 | Distance Between Two Points - URI 1015 Solution in C,C++,Python:

  URI Problem 1015 Solution in C :   

URI Online Judge 1015 Solve in C :                                                                         #include <stdio.h>     #include <math.h>          int main()     {      double x1, x2, y1, y2, dist;           scanf("%lf %lf %lf %lf", &x1, &y1, &x2, &y2);           dist = sqrt(pow(x2-x1,2)+pow(y2-y1,2));           printf("%.4lf\n", dist);      return 0;     }

  URI Problem 1015 Solution in C ++:

URI Online Judge 1015 Solve  in C++ :     #include<bits/stdc++.h>                                                  #include<math.h>     using namespace std;     int main(){         double x1,y1,x2,y2,Distance=0;         cin>>x1>>y1;         cin>>x2>>y2;         Distance=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));         cout<<fixed;         cout<<setprecision(4)<<Distance<<endl;                                               return 0;     }

  URI Problem 1015 Solution in Python:

URI Online Judge 1015 Solve in Python :                                                                                import math     x1,y1=list(map(float,input().split()))                                   x2,y2=list(map(float,input().split()))     distance = math.sqrt(pow(x2-x1,2)+pow(y2-y1,2))     print(f'{distance:0.4f}')

Previous Post:

URI Online Judge Solution  1014 | Consumption - URI Problem 1014 Solution in C,C++,Python

Next Post:

URI Online Judge Solution  1016 | Distance - URI Problem 1016 Solution in C,C++,Python

Ashraf URI/BEE Problem Solution