zoukankan      html  css  js  c++  java
  • 2020.4.2第五周上机作业

    1. 打印出所有的"水仙花数",所谓"水仙花数"是指一个三位数,其各位数字立方和等于该数本身。例如:153是一个"水仙花数",因为153=1的三次方+5的三次方+3的三次方。

    package com.itheima01;
    
    import java.util.Scanner;
    
    public class HelloWorld {
        public static void main(String[] args) {
            int z=100,a,b,c,n=1;
            for(;z<1000;z++) {
                a=z%10;
                b=z/10%10;
                c=z/100;
                if(z==a*a*a+b*b*b+c*c*c) {
                    System.out.println("第"+n+"个水仙花数是"+z);
                    n++;
                }
            }
        }
    }

    2.在控制台输出以下图形

    (1)

    package com.itheima01;
    
    import java.util.Scanner;
    
    public class HelloWorld {
        public static void main(String[] args) {
            for(int i=1;i<=7;i++) {
                for(int j=1;j<i;j++) {
                    System.out.print(j);
                }
                System.out.println();
            }
        }
    }

    (2)

    package com.itheima01;
    
    import java.util.Scanner;
    
    public class HelloWorld {
        public static void main(String[] args) {
            for(int i=6;i>=0;i--) {
                for(int j=1;j<=i;j++) {
                    System.out.print(j);
                }
                System.out.println();
            }
        }
    }

    (3)

    package com.itheima01;
    
    import java.util.Scanner;
    
    public class HelloWorld {
        public static void main(String[] args) {
            for(int i=0;i<6;i++){
                 for(int j=5;j>i;j--){
                  System.out.print(" ");
                 }         
                 for(int j=i+1;j>0;j--){
                  System.out.print(j);
                 }
                 System.out.println();
             }
        }
    }

    (4)

    package com.itheima01;
    
    import java.util.Scanner;
    
    public class HelloWorld {
         public static void main(String[] args) {
                for (int i=0;i<=6;i++) {
                    for( int j=6;j>6-i;j--){
                          System.out.print(" ");
                     }
                   for( int j=1;j<=6-i;j++) {
                    System.out.print(j);
                   }
                       System.out.println();
                  }
            }
    }

    3. 输入年月日,判断这是这一年中的第几天

    package com.itheima01;
    
    import java.util.Scanner;
    
    public class HelloWorld {
         public static void main(String[] args) {
                Scanner input=new Scanner(System.in);
                System.out.println("year");
                int year=input.nextInt();
                System.out.println("month");
                int month=input.nextInt();
                System.out.println("day");
                int day=input.nextInt();
                int a=0;
                for(int i=1;i<month;i++){
                    switch(i) {
                    case 4:
                    case 6:
                    case 9:
                    case 11:
                        a+=30;
                        break;
                    case 2:
                        if(year%4==0&&year%100!=0||year%400==0)
                            a+=29;
                        else
                            a+=28;
                        break;
                    default:
                        a+=31;
                        break;
                    }
                }
                a+=day;
                System.out.println("该天是第"+a+"天");
            }
    }

    4.由控制台输入一个4位整数,求将该数反转以后的数,如原数为1234,反转后的数位4321

    package com.itheima01;
    
    import java.util.Scanner;
    
    public class HelloWorld {
        public static void main(String[] args) {
            Scanner sc = new Scanner(System.in);
            System.out.println("请输入一个四位数");
            int x = sc.nextInt();
            if(x>999 && x<=9999){
                int gewei = x%10;
                int shiwei = x%100/10;
                int baiwei = x%1000/100;
                int qianwei = x/1000;
                int sum = qianwei + baiwei*10 +shiwei*100 +gewei*1000;
                   System.out.println(sum);
               }
        }
    }
  • 相关阅读:
    LA 2038 Strategic game(最小点覆盖,树形dp,二分匹配)
    UVA 10564 Paths through the Hourglass(背包)
    Codeforces Round #323 (Div. 2) D 582B Once Again...(快速幂)
    UVALive 3530 Martian Mining(贪心,dp)
    UVALive 4727 Jump(约瑟夫环,递推)
    UVALive 4731 Cellular Network(贪心,dp)
    UVA Mega Man's Mission(状压dp)
    Aizu 2456 Usoperanto (贪心)
    UVA 11404 Plalidromic Subsquence (回文子序列,LCS)
    Aizu 2304 Reverse Roads(无向流)
  • 原文地址:https://www.cnblogs.com/megumin/p/12619878.html
Copyright © 2011-2022 走看看