方程整数解(蓝桥杯)

import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		boolean flag = true;
		for(int i=1;i<=(int)(Math.sqrt(n));i++){
			for(int j=1;j<=(int)(Math.sqrt(n));j++){
				for(int k=1;k<=(int)(Math.sqrt(n));k++){
					if(i*i+j*j+k*k == n && i<=j && j<=k){
						System.out.println(i+" "+j+" "+k);
						flag = false;
					}
				}
			}
		}
		if(flag) System.out.println("No Solution");
	}
}