Problem :
Marie invented a Time Machine and wants to test it by time-traveling to visit Russia on the Day of the Programmer (the 256th
day of the year) during a year in the inclusive range from 1700
to 2700
.
From 1700
to 1917
, Russia’s official calendar was the Julian calendar; since 1919
they used the Gregorian calendar system. The transition from the Julian to Gregorian calendar system occurred in 1918
, when the next day after January 31st
was February 14th
. This means that in 1918
, February 14th
was the 32nd
day of the year in Russia.
In both calendar systems, February is the only month with a variable amount of days; it has 29
days during a leap year, and 28
days during all other years. In the Julian calendar, leap years are divisible by 4
; in the Gregorian calendar, leap years are either of the following:
- Divisible by
400
. - Divisible by
4
and not divisible by100
.
Given a year, y
, find the date of the 256th
day of that year according to the official Russian calendar during that year. Then print it in the format dd.mm.yyyy
, where dd
is the two-digit day, mm
is the two-digit month, and yyyy
is y
.
For example, the given year = 1984
. 1984
is divisible by 4
, so it is a leap year. The 256th
day of a leap year after 1918
is September 12, so the answer is 12.09.1984
.
Function Description :
Complete the dayOfProgrammer function in the editor below. It should return a string representing the date of the day of the year given.
dayOfProgrammer has the following parameter(s):
- year: an integer
Input Format :
A single integer denoting year y
.
Constraints :
1700 <= y <= 2700
Output Format :
Print the full date of Day of the Programmer during year y
in the format dd.mm.yyyy
, where dd
is the two-digit day, mm
is the two-digit month, and yyyy
is y
.
Sample Input 0 :
2017
Sample Output 0 :
13.09.2017
Sample Input 1 :
2016
Sample Output 1 :
12.09.2016
Sample Input 2 :
1800
Sample Output 2 :
12.09.1800
Solution :
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
// Complete the dayOfProgrammer function below.
string dayOfProgrammer(int year) {
const int mon7 = 215; //7 months' days
short int feb; //days in february
if(year < 1918) //julian
feb = year%4 ? 28 : 29;
else if(year > 1918) //gregorian
feb = !(year%400) || year%100&&!(year%4) ? 29 : 28;
else //dreaded 1918
feb = 15;
feb = 256 - (feb + mon7);
return to_string(feb) + ".09." + to_string(year);
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
string year_temp;
getline(cin, year_temp);
int year = stoi(ltrim(rtrim(year_temp)));
string result = dayOfProgrammer(year);
fout << result << "\n";
fout.close();
return 0;
}
string ltrim(const string &str) {
string s(str);
s.erase(
s.begin(),
find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
);
return s;
}
string rtrim(const string &str) {
string s(str);
s.erase(
find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
s.end()
);
return s;
}
192 total views, 1 views today
Post Disclaimer
the above hole problem statement is given by hackerrank.com but the solution is generated by the SLTECHACADEMY authority if any of the query regarding this post or website fill the following contact form thank you.