Java Example

Problem1001ReverseRoot.java

import java.util.Scanner;

public class Problem1001ReverseRoot 
{
	
	public static void main(String[] args)
	{
		Scanner in = new Scanner(System.in);
		double[] roots = new double[131072];
		
		// Get our input
		int i = 0;
		while(in.hasNextDouble())
		{
			roots[i] = in.nextDouble();
			i++;
		}

		while(i > 0)
		{
			// Note: This output is a dirty hack, but much faster than anything else
			System.out.println((double)Math.round(Math.sqrt(roots[i-1]) * 10000) / 10000);
			i--;
		}
	}
	
}