|
@@ -0,0 +1,56 @@
|
|
|
+/**
|
|
|
+ * ClassName: TestScanner01
|
|
|
+ *
|
|
|
+ * @Author 爱扣钉-陈晨
|
|
|
+ * @Create 2023/11/20 9:14
|
|
|
+ * @Version 1.0
|
|
|
+ */
|
|
|
+public class TestForFor15 {
|
|
|
+
|
|
|
+ public static void main(String[] args) {
|
|
|
+ //上半部分:正的等腰三角形
|
|
|
+ //5行
|
|
|
+ for(int i=1; i<=5; i++){
|
|
|
+ //(1)打印空格
|
|
|
+ /*
|
|
|
+ 当i=1,打印4个空格,j=4,3,2,1 j>=i
|
|
|
+ 当i=2,打印3个空格,j=4,3,2
|
|
|
+ 当i=3,打印2个空格,j=4,3
|
|
|
+ 当i=4,打印1个空格,j=4
|
|
|
+ 当i=5,打印0个空格,j=4,让循环条件一次都不满足
|
|
|
+ */
|
|
|
+ for(int j=4; j>=i; j--){
|
|
|
+ System.out.print(" ");
|
|
|
+ }
|
|
|
+ //(2)打印*
|
|
|
+ /*
|
|
|
+ 当i=1,打印1个,j=1 j<=2*i-1
|
|
|
+ 当i=2,打印3个,j=1,2,3,
|
|
|
+ 当i=3,打印5个,j=1,2,3,4,5
|
|
|
+ 当i=4,打印7个,j=1,2,3,4,5,6,7
|
|
|
+ 当i=5,打印9个,j=1,2,3,4,5,6,7,8,9
|
|
|
+ */
|
|
|
+ for(int j=1; j<=2*i-1; j++){
|
|
|
+ System.out.print("* ");
|
|
|
+ }
|
|
|
+ //(3)换行
|
|
|
+ System.out.println();
|
|
|
+ }
|
|
|
+
|
|
|
+
|
|
|
+
|
|
|
+ //*
|
|
|
+ // 公鸡只数的可能性
|
|
|
+ for (int gong = 0; gong <= 20 ;gong++ ) {
|
|
|
+ // 母鸡只数的可能性
|
|
|
+ for (int mu = 0; mu <= 33 ;mu++ ) {
|
|
|
+ // 小鸡只数
|
|
|
+ int xiao = 100 - gong - mu;
|
|
|
+ // 进行条件的判断
|
|
|
+ if ((xiao % 3 == 0) && (gong * 5 + mu * 3 + xiao / 3 == 100)) {
|
|
|
+ System.out.println("公鸡有"+gong+"只,母鸡有"+mu+"只,小鸡有"+xiao+"只");
|
|
|
+ }
|
|
|
+ }
|
|
|
+ }
|
|
|
+ }
|
|
|
+}
|