algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-07 01:35:16 +08:00
Code Issues Packages Projects Releases Wiki Activity

update

Browse Source 
added comments and variable names are more simpler now
This commit is contained in:
Deepak
2017-10-03 13:12:50 +05:30
committed by GitHub
parent b7a9d0de44
commit 32d03516fe
1 changed files with 15 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

23
Misc/root_precision.java
View File

@ -7,22 +7,27 @@ import java.util.regex.*;
public class Solution { public class Solution {
public static void main(String[] args) { public static void main(String[] args) {
//take input
Scanner scn = new Scanner(System.in); Scanner scn = new Scanner(System.in);
int N = scn.nextInt(); int N = scn.nextInt(); //N is the input number
int P = scn.nextInt(); int P = scn.nextInt(); //P is precision value for eg - P is 3 in 2.564 and 5 in 3.80870.
System.out.println(squareRoot(N, P)); System.out.println(squareRoot(N, P));
} }
public static double squareRoot(int N, int P) { public static double squareRoot(int N, int P) {
double sqrt = 0;; double rv = 0; //rv means return value
// Write your code here double root = Math.pow(N, 0.5);
double root = Math.pow(N, 0.5);
int pre = (int) Math.pow(10, P); //calculate precision to power of 10 and then multiply it with root value.
root = root * pre; int precision = (int) Math.pow(10, P);
sqrt = (int)root; root = root * precision;
return (double)sqrt/pre; /*typecast it into integer then divide by precision and again typecast into double
so as to have decimal points upto P precision */
rv = (int)root;
return (double)rv/precision;
} }
} }