Submission

Score: 40

User: monpluk

Problemset: Journey of Love

Language: cpp

Time: 0.004 second

Submitted On: 2025-10-08 08:54:44

#include <iostream>
using namespace std;

int main(){
    int y,mo,d,h,mi,s,q;
    cin >> y >> mo >> d >> h >> mi >> s >> q;
    for(int i=0;i<q;i++){
        int t;
        cin >> t;
        int dt = t/86400;
        int ht = (t%86400)/3600;
        int mit = (t-dt*86400-ht*3600)/60;
        int st = t-dt*86400-ht*3600-mit*60;
        int ya = y;
        int moa = mo;
        int da = d+dt;
        int ha = h+ht;
        int mia = mi+mit;
        int sa = s+st;
        mia += sa/60;
        sa %= 60;
        ha += mia/60;
        mia %= 60;
        da += ha/24;
        ha %= 24;
        for(int i=0;i<2;i++){
            if((moa == 4 || moa == 6 || moa == 9 || moa == 11) && da > 30){
                da -= 30;
                moa++;
            }else if(moa == 2 && ((ya%4 == 0 && ya%100!=0) || (ya%400 == 0)) && da > 29){
                da -= 29;
                moa++;
            }else if(moa == 2 && da > 28){
                da -= 28;
                moa++;
            }else if(da > 31){
                da -= 31;
                moa++;
            }
        }
        ya += moa/12;
        moa %= 12;
        cout << ya << " " << moa << " " << da << " " << ha << " " << mia << " " << sa << '\n';
    }
}