close
題目概要：
輸入一整數k，找出a^2+b^2+c^2=k。a<=b<=c。
解題方向：
直接硬幹，先找出a再找出b再找出c。
程式碼：
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| //Java | |
| import java.util.Scanner; | |
| import java.util.Vector; | |
| class uva11342{ | |
| public static void main(String args[]){ | |
| Scanner sc=new Scanner(System.in); | |
| int cases=sc.nextInt(); | |
| for(int i=0;i<cases;i++){ | |
| double k=sc.nextDouble(); | |
| Vector<Integer> vector=new Vector<Integer>(); | |
| boolean flag=false; | |
| int powM=(int)Math.sqrt(k); //找出k的整數根號。 | |
| //找出a^2+b^2+c^2=k。 | |
| for(int j=0;j<=powM;j++){ | |
| double tempK=k-(j*j); //b^2+c^2=k-a^2。 | |
| for(int z=0;z<=powM;z++){ | |
| double tempK2=tempK-(z*z); //c^2=k-b^2。 | |
| int temp=(int)Math.sqrt(tempK2); | |
| //當c可以開成整數根號時，代表符合題意。 | |
| if((temp*temp)==(int)tempK2){ | |
| vector.add(j); | |
| vector.add(z); | |
| vector.add(temp); | |
| flag=true; | |
| break; | |
| } | |
| } | |
| if(flag) break; | |
| } | |
| //Output | |
| if(vector.size()==3) System.out.println(vector.get(0)+" "+vector.get(1)+" "+vector.get(2)); | |
| else System.out.println("-1"); | |
| } | |
| } | |
| } |
文章標籤
全站熱搜
留言列表
