214302026-01-13 08:34:29sklausVilágnaptár (45 pont)cpp17Wrong answer 33/451ms508 KiB
#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
    int ev, n, h;
    cin>>ev>>h>>n;
    int t[12];
    t[0]=1; t[1]=32; t[2]=62; t[3]=92; t[4]=123; t[5]=153; t[6]=183; t[7]=214; t[8]=244; t[9]=274; t[10]=305; t[11]=335;
    int r[12];
    r[0]=1; r[1]=32; r[2]=60; r[3]=91; r[4]=121; r[5]=152; r[6]=182; r[7]=213; r[8]=244; r[9]=274; r[10]=305; r[11]=335;
    cout<<ev<<" ";
    if(h==12 and n==31){cout<<h<<" VN";return 0;}
    if(ev%4==0 and h==7 and n==1){cout<<6<<" SZN"; return 0;}
    if(ev%4==0){
        for(int i=6; i<12; i++)t[i]--;
    }
    int p=r[h-1]+n;
    int *low=lower_bound(t, t+12, p);
    int j=low-t;
    cout << j << " " << p-t[j-1];
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base33/45
1Accepted0/01ms508 KiB
2Accepted0/01ms316 KiB
3Accepted0/01ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted3/31ms352 KiB
7Wrong answer0/31ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms316 KiB
10Wrong answer0/31ms316 KiB
11Wrong answer0/31ms316 KiB
12Accepted3/31ms316 KiB
13Accepted3/31ms316 KiB
14Accepted3/31ms316 KiB
15Accepted3/31ms500 KiB
16Accepted3/31ms316 KiB
17Accepted3/31ms316 KiB
18Accepted2/21ms316 KiB
19Wrong answer0/31ms316 KiB