Submission

P---------

Score: 10

User: Mingyuanz

Problemset: E.Comet

Language: cpp

Time: 0.003 second

Submitted On: 2024-10-13 22:52:33

#include <bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define f first
#define s second
#define INF (int)1e9
#define MOD (int)(1e9+7)
#define MAXN 200005
#define enl '\n'
//#define int long long
typedef long long ll;
using namespace std;
int d,m,y;
int dpm[12]={31,28,31,30,31,30,31,31,30,31,30,31};
void addday(int t){
    int dpy=((y%4==0 && y%100!=0) || y%400==0)?366:365;
    while(t>=dpy){
        y++;
        t-=dpy;
        dpy=((y%4==0 && y%100!=0) || y%400==0)?366:365;
    }
    while(t>=dpm[m]){
        m=(m+1)%12;
        t-=dpm[m];
    }
    if(d+t>dpm[m]){
        d=d+t-dpm[m];
        m++;
    } else{
        d+=t;
    }
}
void testcase(){
    int t,q;
    cin >> d >> m >> y >> t >> q;
    m--;
    while(q--){
        addday(t);
        cout << d << " " << m+1 << " " << y << enl;
    }
}
signed main(){
    ios_base::sync_with_stdio(true);
    cin.tie(0);
    int t=1;
    while(t--){
        testcase();
    }
    return 0;
}

/*



*/

/*
#include <bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define f first
#define s second
#define INF (int)1e9
#define MOD (int)(1e9+7)
#define MAXN 2004
#define MAXS 20004
#define enl '\n'
typedef long long ll;
using namespace std;
int main(){
    ios_base::sync_with_stdio(true);
    cin.tie(0);
    int t;
    cin >> t;
    while(t--){
        int n;
        cin >> n;
        int arr[n];
        for(int i=0; i<n; i++) cin >> arr[i];
    }
    return 0;
}
*/