Submission

Score: 0

User: havename

Problemset: Journey of Love

Language: cpp

Time: 0.004 second

Submitted On: 2025-10-05 22:05:34

#include<bits/stdc++.h>
using namespace std;
bool leapyear(int y){
    if(y%4!=0)return false;
    if(y%100!=0){
        return true;
        if(y%400==0){
            return true;
        }
        else{
             return false;
        }
    }
    return true;
}
int main(){
    int dinmon[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
    long long a;
    int n,y,mon,d,h,mn,se;
    cin>>y>>mon>>d>>h>>mn>>se;
    cin>>n;
    bool leaf=leapyear(y);
    while(n--){
        cin>>a;
        se=se+a;
        mn=mn+se/60;
        se=se%60;
        h=h+mn/60;
        mn=mn%60;
        d=d+h/24;
        h=h%24;

        while(d>dinmon[mon]){
            d=d-dinmon[mon];
            mon=mon+1;
            if(mon>12){
                mon=1;
                y=y+1;
                leaf=leapyear(y);
            }
            dinmon[2] = leaf ? 29 : 28;
        }
        cout<<y<<" "<<mon<<" "<<d<<" "<<h<<" "<<mn<<" "<<se<<"\n";


    }
}