题解 | #获得月份天数#

知识点：

分支控制：分支控制

#include <iostream>
#include <map>
using namespace std;

bool isPrime(int year);

int main() {
    int year;
    int month;
    int days = 0;
    array<int, 13> months = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

    while (cin >> year >> month) {
        days = months[month];

        if (isPrime(year) && month == 2) {
            days += 1;
        }
        
        cout << days << endl;
    }
    return 0;
}

bool isPrime(int year) {
    if ((year % 4 == 0 && year % 100 != 0) || (year % 400 == 0)) {
        return true;
    } else {
        return false;
    }
}