Submission

Score: 30

User: havename

Problemset: Journey of Love

Language: cpp

Time: 0.004 second

Submitted On: 2025-10-05 22:27:29

#include<bits/stdc++.h>
using namespace std;
bool leapyear(int temp1){
    if(temp1%4==0){
        if(temp1%100==0){
            if(temp1%400==0){
                return true;
            }
            else{
                return false;
            }
        }
        else{
            return true;
        }
    }
    else{
        return false;
    }



}
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,temp1,temp2,temp3,temp4,temp5,temp6;
    cin>>y>>mon>>d>>h>>mn>>se;
    temp1=y;
    temp2=mon;
    temp3=d;
    temp4=h;
    temp5=mn;
    temp6=se;
    cin>>n;
    bool leaf=leapyear(temp1);
    while(n--){
        cin>>a;
        temp6=temp6+a;
        temp5=temp5+temp6/60;
        temp6=temp6%60;

        temp4=temp4+temp5/60;
        temp5=temp5%60;

        temp3=temp3+temp4/24;
        temp4=temp4%24;

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

    }
}