UVA – 256 – Quirksome Squares

import java.util.ArrayList;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);

		int [] Ns = { 2, 4, 6, 8 };
		ArrayList[] digits= new ArrayList[9];
		for(int i=0; i(),i++);
		int div[] = {  10, 100, 1000, 10000};

		for(int i=0; i
			for(int j = 0; j < div[i]*div[i]; j++)
		        if(((j%div[i])+(int)(j/div[i]))*((j%div[i])+(int)(j/div[i])) == j)
		        	digits[Ns[i]].add(String.format(new String("%0"+Ns[i]+"d"), j));
		}

		while(in.hasNext()){
			int n =in.nextInt();
			for(String e : digits[n])
				System.out.println(e);
		}
	}
}

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: