Submission

PPPPPPPPPP

Score: 100

User: kaopj

Problemset: E.Comet

Language: cpp

Time: 0.004 second

Submitted On: 2024-10-14 21:00:36

/********************
 * what  the  sigma *
 ********************/
#include <iostream>
#include <vector>
#include <iomanip>
#include <ios>
#include <map>
#include <queue>
#include <algorithm>
using namespace std;
#define lgm cin.tie(0)->sync_with_stdio(0);
#define be(x) x.begin(),x.end()
#define ve vector
#define ll long long
#define ull unsigned ll
#define f first
#define s second
#define pii pair<int, int>
#define tii tuple<int,int,int>
#define pll pair<ll,ll>
#define sz(x) (int)x.size()
#define pb push_back
const int mod = 1e9+7,maxn=1000005;
ve<int> mon={31,28,31,30,31,30,31,31,30,31,30,31};
void test() {
    int d,m,y;
    cin >> d >> m >> y;
    m--;
    int t;
    cin >> t;
    int c;
    cin >> c;
    int ohio=c*t;
    while (ohio--) {
        d++;
        if (d > mon[m]) {
            if (m == 1) {
                if (d==30) {
                    d=1;
                    m++;
                } else if (!(y%400==0) && !(y%4==0 && !(y%100==0))) {
                    d=1;
                    m++;
                }
            } else {
                d=1;
                m++;
                if (m == 12) {
                    m=0;
                    y++;
                }
            }
        }
    }
    cout << d << ' ' << m+1 << ' ' << y;
}
signed main() {
    lgm;
    test();
}