杭电oj 2005 java

最新推荐文章于 2021-11-19 12:38:28 发布

原创最新推荐文章于 2021-11-19 12:38:28 发布 · 548 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#acm

acm 专栏收录该内容

18 篇文章

订阅专栏

import java.util.Scanner;

class Main {

    public static boolean ifleapYear(int year) {
        if ((year%4==0 && year%100!=0) ||year%400 == 0){
            return true;
        }
        return false;
    }
    public static int sumab(int a,int b) {
        a-=1;b-=1;
        int[] month = {31,28,31,30,31,30,31,31,30,31,30,31};
        int sum = 0;
        for(int i= a;i<=b;i++) {
            sum+=month[i];
        }
        return sum;
    }
    public static int countDays(int y,int m,int d) {
        boolean leapYear = ifleapYear(y);
        boolean overTwo = (m-1)>=2;
        if (leapYear && overTwo) {
                return sumab(1,m-1)+d+1;    
        }
        return sumab(1,m-1)+d;
    }
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner read = new Scanner(System.in);
        
        while(read.hasNextLine()) {
            String str = read.nextLine();
            String[] data = str.split("/");
            int y = Integer.parseInt(data[0]);
            int m = Integer.parseInt(data[1]);
            int d = Integer.parseInt(data[2]);
            System.out.println(countDays(y,m,d));

        }
        read.close();
                
    }

}