DistanceBetween2Dcoordinates

-
Main.class code: import java.util.Scanner;
import java.text.DecimalFormat;
public class Main {
public static void main(String[] args) {
// write your code here
int x1;
int y1;
int x2;
int y2;
Scanner sc = new Scanner(System.in);
x1=sc.nextInt();
y1=sc.nextInt();
x2=sc.nextInt();
y2=sc.nextInt();
Point p1=new Point(x1,y1);
Point p2 = new Point(x2,y2);
double distance = findDistance(p1, p2);
DecimalFormat df=new DecimalFormat("0.000");
String finalDistance = df.format(distance);
System.out.println(finalDistance);
}
public static double findDistance(Point p1, Point p2) {
double x = (p1.getX() - p2.getX());
x = Math.pow(x, 2);
double y = (p1.getY() - p2.getY());
y = Math.pow(y, 2);
double sum = (x + y);
double distance = Math.sqrt(sum);
return distance;
}
} Point.class
public class Point {
/* private int x1;
private int y1;
private int x2;
private int y2;*/
private int x;
private int y;
public int getX() {
return x;
}
public int getY() {
return y;
}
/*
public Point(int x1, int y1, int x2, int y2) {
this.x1 = x1;
this.y1 = y1;
this.x2 = x2;
this.y2 = y2;
}*/
public Point(int x,int y)
{
this.x=x;
this.y=y;
}

Comments

Post a Comment

Popular posts from this blog

Factorial of consecutively 5 numbers(input)

-
import java.util.Scanner ; public class Main { public static void main ( String [] args ) { // write your code here int arr[] = new int [ 5 ]; Scanner sc = new Scanner ( System . in); for ( int i = 0 ;i < 5 ;i ++ ) { arr[i] = sc . nextInt(); } for ( int i = 0 ;i < arr . length;i ++ ) { System . out . println(factorial(arr[i])); ; } } private static int factorial ( int num ) { int fact = 1 ; for ( int i = 1 ;i <= num;i ++ ) fact = fact * i; return fact; } }
Read more

Square Root of a number without using math.h function

-
# include < stdio.h > # include < string.h > # include < stdlib.h > void main () { int number; float temp, sqrt ; scanf ( " %d " , &number); // store the half of the given number e.g from 256 => 128 sqrt = number / 2 ; temp = 0 ; // Iterate until sqrt is different of temp, that is updated on the loop while ( sqrt != temp){ // initially 0, is updated with the initial value of 128 // (on second iteration = 65) // and so on temp = sqrt ; // Then, replace values (256 / 128 + 128 ) / 2 = 65 // (on second iteration 34.46923076923077) // and so on sqrt = ( number/temp + temp) / 2 ; } printf ( " %.0f " , sqrt ); }
Read more

prime number print as per given range

-
# include < stdio.h > int main () { int i,j,flag,temp; int beg,end; scanf ( " %d %d " ,&beg,&end); if (beg== 1 ) beg= 2 ; if (beg>end) { temp=beg; beg=end; end=temp; } for (i=beg;i<=end;i++) { flag= 0 ; for (j= 2 ;j<i;j++) { if (i%j== 0 ) { flag= 1 ; break ; } } if (flag== 0 ) printf ( " %d " ,i); } return 0 ; }
Read more