zoukankan      html  css  js  c++  java
  • Java学习日报7.21

     

     

    package leap;
    import java.util.Scanner;
    public class Leap {
    public static void main(String args[])
    {
    int year; //年
    int month; //月
    int day = 0; //日
    boolean flag; //判断标志
    System.out.print("请依次输入年和月:"+' ');
    Scanner sc=new Scanner(System.in);
    year=sc.nextInt();
    month=sc.nextInt();
    if(year%400==0||(year%4==0&&year%100!=0))
    {
    flag=true;
    System.out.println(year+"年是闰年!");
    }

    else {
    flag=false;
    System.out.println(year+"年是平年!");
    }
    if(flag==true)
    {
    switch(month)
    {
    case 1:
    day=31;
    break;
    case 2:
    day=29;
    break;
    case 3:
    day=31;
    break;
    case 4:
    day=30;
    break;
    case 5:
    day=31;
    break;
    case 6:
    day=30;
    break;
    case 7:
    case 8:
    day=31;
    break;
    case 9:
    day=30;
    break;
    case 10 :
    day=31;
    break;
    case 11:
    day=30;
    break;
    case 12:
    day=31;
    break;
    }
    System.out.println("且"+year+"年的"+month+"月有"+day+"天");
    }
    else
    {
    switch(month)
    {
    case 1:
    day=31;
    break;
    case 2:
    day=28;
    break;
    case 3:
    day=31;
    break;
    case 4:
    day=30;
    break;
    case 5:
    day=31;
    break;
    case 6:
    day=30;
    break;
    case 7:
    case 8:
    day=31;
    break;
    case 9:
    day=30;
    break;
    case 10 :
    day=31;
    break;
    case 11:
    day=30;
    break;
    case 12:
    day=31;
    break;
    }
    System.out.println("且"+year+"年的"+month+"月有"+day+"天");
    }
    }
    }

  • 相关阅读:
    合并区间
    编程团体赛
    寻找数组的中间位置
    翻转链表2
    链表翻转
    CF1237H. Balanced Reversals
    arc108E
    agc028D
    CF1446D. Frequency Problem
    CF1439D. INOI Final Contests
  • 原文地址:https://www.cnblogs.com/rainbow-1/p/13357906.html
Copyright © 2011-2022 走看看