题解 | #日期类#

加1之后处理一下细节就完了

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;

int daytab[2][13] = { // 平年和闰年的日子
    {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31},
    {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}};

bool isLeapYear(int year)
{
    return (year % 4 == 0 && year % 100 != 0) || (year % 400 == 0);
}

int main()
{
    int i, j, number1 = 0, number2 = 0, row, n, year, month, day;
    string str;
    cin >> n;
    while (n--)
    {
        cin >> str;
        year = stoi(str);
        cin >> str;
        month = stoi(str);
        cin >> str;
        day = stoi(str);
        // cout << year << "hdu" << month << "hdu" << day << endl;
        int row = isLeapYear(year);
        day++;
        if (day > daytab[row][month])
        {
            day = 1;
            month++;
            if (month > 12)
            {
                month = 1;
                year++;
            }
        }
        cout << year << '-';
        if (month < 10)
            cout << '0' << month << '-';
        else
            cout << month << '-';
        if (day < 10)
            cout << '0' << day;
        else
            cout << day;
        cout << endl;
    }

    return 0;
}