• 2020.4.24.java第八周作业


    1:完善menu注册功能,抽奖,看小故事等功能

    package kksk;
    
    import java.util.Random;
    import java.util.Scanner;
    
    public class kksk {
        public static void main(String[] args) {
            mainMenu();
        }
    
        public static void mainMenu() {
            Scanner input = new Scanner(System.in);
            System.out.println("1.登录");
            System.out.println("2.注册");
            System.out.println("3.幸运抽奖,输入四位会员卡号,如果百位等于系统随机数,就是星运会员.否则不是.");
            System.out.println("4.看小故事,");
            System.out.println("5.退出系统");
            System.out.println("请选择");
            int i = input.nextInt();
            switch (i) {
            case 1:
                login();
                break;
            case 2:
                zhuce();
                break;
            case 3:
                choujiang();
                break;
            case 4 :
                xiaogushi();
                break;
            case 5:
                System.out.println("退出");
                }
        }
    
        private static void login() {
            // TODO Auto-generated method stub
            Scanner input = new Scanner(System.in);
            System.out.println("输入用户名");
            String uname = input.next();
            System.out.println("输入密码");
            String upwd = input.next();
            if (uname.equals("ltt") && upwd.equals("123")) {
                System.out.println("登录成功");
            } else {
                System.out.println("登录失败");
            }
            returnMain();
        
        }
        
        public static void zhuce(){
            Scanner input = new Scanner(System.in);
            System.out.println("输入用户名");
            String uname = input.next();
            System.out.println("输入密码");
            String upwd = input.next();
            System.out.println("注册成功");
            returnMain();
        }
        public static void choujiang() {
            Scanner input = new Scanner(System.in);
            System.out.println("抽奖模式");
            Random r=new Random();
            int sjs=r.nextInt(10);
            System.out.println("请输入四位会员数");
            int num=input.nextInt();
            if(num/100%10==sjs) {
                System.out.println("恭喜你,是幸运会员");
            }else {
                System.out.println("祝你下次好运");
            }
            returnMain();
        }
        public static void xiaogushi() {
            System.out.println("吃菠萝包的方法");
            System.out.println("1.张嘴");
            System.out.println("2.咬下去");
            System.out.println("3.扔皮");
            returnMain();
        }
        
            
        
        
        
        
        public static void returnMain(){
            System.out.println("是否返回主菜单?Y/N");
            Scanner input = new Scanner(System.in);
            if (input.next().equalsIgnoreCase("Y")) {
                mainMenu();
            }else{
                System.out.println("谢谢使用");
            }
    
        }
    }

    2.编写一个方法,求整数n的阶乘,例如5的阶乘是1*2*3*4*5。

    package kksk;
    
    import java.util.Scanner;
    
    public class kksk {
        public static void main(String[] args){
        int jc=1;
        Scanner sc = new Scanner(System.in);
        System.out.println("请输入一个整数");
        int x=sc.nextInt();
        for(int i=1;i<=x;i++){
            jc*=i;
        }
        System.out.println(x+"的阶乘:"+jc);
        }
    }
     

    3.编写一个方法,判断该年份是平年还是闰年。

    package kksk;
    
    import java.util.Scanner;
    
    public class kksk {
        public static void main(String[] args){
        int year;
        Scanner sc = new Scanner(System.in);
        System.out.println(" 输入年份:");
         year= sc.nextInt();
         if(year%4==0&&year%100!=0||year%400==0){
             System.out.println(year+"年是闰年");
         }else{
             System.out.println(year+"年是平年");
         }
        }
    }
  • 相关阅读:
    获取安卓控件的大小
    最详细eclipse汉化插件安装教程
    android图片的内存优化
    网站性能并发测试工具
    [php]数据结构&算法(PHP描述) 半折插入排序 straight binary sort
    ubuntu 环境变量
    [php]php设计模式 Interator (迭代器模式)
    nginx 显示文件目录
    [php]php设计模式 (总结)
    [php]数据结构&算法(PHP描述) 冒泡排序 bubble sort
  • 原文地址:https://www.cnblogs.com/megumin/p/12796402.html
Copyright © 2020-2023  润新知