import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { // TODO Auto-generated method stub Scanner sc=new Scanner(System.in); int []a=new int [4]; for (int i = 0; i < a.length; i++) { a[i]=sc.nextInt(); } Arrays.sort(a); // 1,2,3 for (int i =0; i <3; i++) { for (int j =0; j <3; j++) { for (int k =0; k <3; k++) { if(i!=j&&i!=k&&j!=k){ System.out.println(a[i]+" "+a[j]+" "+a[k]); } } } } //1,2,4 索引不等于2 for (int i = 0; i<4; i++) { if(i==2) i++; for (int j = 0; j<4; j++) { if(j==2) j++; for (int k = 0; k<4; k++) { if(k==2) k++; if(i!=j&&i!=k&&j!=k){ System.out.println(a[i]+" "+a[j]+" "+a[k]); } } } } //1,3,4 索引不等于1 for (int i = 0; i<4; i++) { if(i==1) i++; for (int j = 0;j<4; j++) { if(j==1) j++; for (int k = 0; k<4; k++) { if(k==1) k++; if(i!=j&&i!=k&&j!=k){ System.out.println(a[i]+" "+a[j]+" "+a[k]); } } } } //2,3,4 索引不等于0 for (int i = 1; i<4; i++) { for (int j = 1; j<4; j++) { for (int k =1; k<4; k++) { if(i!=j&&i!=k&&j!=k){ System.out.println(a[i]+" "+a[j]+" "+a[k]); } } } } } }
0.0分
1 人评分
WU-陶陶摘苹果2 (C++代码)浏览:984 |
理财计划 (C语言代码)浏览:471 |
简单的a+b (C语言代码)浏览:518 |
孤独的骑士 (C语言代码)浏览:1062 |
顺子浏览:1313 |
C语言训练-"水仙花数"问题2 (C语言代码)浏览:622 |
A+B for Input-Output Practice (C++代码)浏览:482 |
奖学金 (C语言代码)浏览:2062 |
Manchester- C语言考试练习题_保留字母浏览:1183 |
蛇行矩阵 (C++代码)浏览:601 |