<< problem 18 - Maximum path sum I Factorial digit sum - problem 20 >>

# Problem 19: Counting Sundays

You are given the following information, but you may prefer to do some research for yourself.

1 Jan 1900 was a Monday.
Thirty days has September,
April, June and November.
All the rest have thirty-one,
Saving February alone,
Which has twenty-eight, rain or shine.
And on leap years, twenty-nine.
A leap year occurs on any year evenly divisible by 4, but not on a century unless it is divisible by 400.

How many Sundays fell on the first of the month during the twentieth century (1 Jan 1901 to 31 Dec 2000)?

# Algorithm

There is a sweet algorithm called "Zeller's congruence' that determines the weekday of any given date.
Its Wikipedia page has a detailled explanation and comes with a few examples, too: en.wikipedia.org/wiki/Zeller's_congruence)
You will even find instructions on how to convert that algorithm to source code - my implementation is inside the function getWeekday.

We are only interested in Sundays, that means only an algorithm's result of 1 is of importance.
My program calls getWeekday for every first of every month and increments a counter sum if getWeekday returned 1.

## Alternative Approaches

The original problem can be easily solved by brute-force, too.
An overview of other algorithms: en.wikipedia.org/wiki/Determination_of_the_day_of_the_week

## Modifications by HackerRank

Arbitrary input dates that are ridiculously far in the future ... but not too far apart from each other.
Therefore the "2800 years optimization" isn't actually needed to achieve full score.

## Note

The weekday pattern repeats every 2800 years and contains 4816 Sundays on the first of a month:
- 7 days a week x 400 years in the leap year cycle → 2800
- processing any such cycle produces 4816 matches

# My code

… was written in C++ and can be compiled with G++, Clang++, Visual C++. You can download it, too.

       #include <iostream>

const unsigned int Sunday = 1;
// based on Zeller's congruence
// January = 1, February = 2, ..., December = 12
// returns 0 => Saturday, 1 => Sunday, 2 => Monday, ... 6 => Friday
unsigned int getWeekday(unsigned long long year, unsigned int month, unsigned int day)
{

// January and February are counted as month 13 and 14 of the previous year
if (month <= 2)
{
month += 12;
year--;
}

// Wikipedia provides an altered formula better suited for software implementation
return (day +
13 * (month + 1) / 5 +
year + year / 4 - year / 100 + year / 400)
% 7;
}

int main()
{
unsigned int tests;
std::cin >> tests;
while (tests--)
{
unsigned long long year1, year2;
unsigned int month1, month2, day1, day2;
std::cin >> year1 >> month1 >> day1; // from
std::cin >> year2 >> month2 >> day2; // to

// wrong input order ?
if (year2 < year1 || (year2 == year1 && month2 < month1))
{
std::swap(year1,  year2);
std::swap(month1, month2);
}

// jump forward to the first day of the month
unsigned long long currentYear  = year1;
unsigned int       currentMonth = month1;
if (day1 > 1)
{
currentMonth++;

// from December to January of next year
if (currentMonth > 12)
{
currentMonth -= 12;
currentYear++;
}
}

// number of relevant Sundays
unsigned int sum = 0;

// same patterns every 2800 years
while (currentYear + 2800 < year2)
{
currentYear += 2800;
sum += 4816;         // there are 4816 Sundays on the first of a month in 2800 years
}
// note: a constant-time approach would be to use MOD ...
//       but the while-loop is probably easier to understand

// simple scan through all months
while (currentMonth < month2 || currentYear < year2) // days already match, they are both 1
{
// count Sundays
if (getWeekday(currentYear, currentMonth, 1) == Sunday)
sum++;

currentMonth++;

// from December to January of next year
if (currentMonth > 12)
{
currentMonth -= 12;
currentYear++;
}
}
// check last month, too
if (getWeekday(currentYear, currentMonth, 1) == Sunday)
sum++;

std::cout << sum << std::endl;
}
return 0;
}


This solution contains 13 empty lines, 16 comments and 1 preprocessor command.

# Interactive test

You can submit your own input to my program and it will be instantly processed at my server:

Number of test cases (1-5):

Input data (separated by spaces or newlines):

This is equivalent to
echo "1 1900 1 1 1910 1 1" | ./19

Output:

(please click 'Go !')

(this interactive test is still under development, computations will be aborted after one second)

# Benchmark

The correct solution to the original Project Euler problem was found in less than 0.01 seconds on a Intel® Core™ i7-2600K CPU @ 3.40GHz.
(compiled for x86_64 / Linux, GCC flags: -O3 -march=native -fno-exceptions -fno-rtti -std=c++11 -DORIGINAL)

See here for a comparison of all solutions.

Note: interactive tests run on a weaker (=slower) computer. Some interactive tests are compiled without -DORIGINAL.

# Changelog

February 24, 2017 submitted solution
April 3, 2017 added comments

# Hackerrank

My code solves 8 out of 8 test cases (score: 100%)

# Difficulty

Project Euler ranks this problem at 5% (out of 100%).

Hackerrank describes this problem as easy.

Note:
Hackerrank has strict execution time limits (typically 2 seconds for C++ code) and often a much wider input range than the original problem.
In my opinion, Hackerrank's modified problems are usually a lot harder to solve. As a rule thumb: brute-force is rarely an option.

# Links

projecteuler.net/thread=19 - the best forum on the subject (note: you have to submit the correct solution first)

Code in various languages:

Python: www.mathblog.dk/project-euler-19/ (written by Kristian Edlund)
Haskell: github.com/nayuki/Project-Euler-solutions/blob/master/haskell/p019.hs (written by Nayuki)
Java: github.com/nayuki/Project-Euler-solutions/blob/master/java/p019.java (written by Nayuki)
Mathematica: github.com/nayuki/Project-Euler-solutions/blob/master/mathematica/p019.mathematica (written by Nayuki)
C: github.com/eagletmt/project-euler-c/blob/master/10-19/problem19.c (written by eagletmt)
Go: github.com/frrad/project-euler/blob/master/golang/Problem019.go (written by Frederick Robinson)
Javascript: github.com/dsernst/ProjectEuler/blob/master/19 Counting Sundays.js (written by David Ernst)
Scala: github.com/samskivert/euler-scala/blob/master/Euler019.scala (written by Michael Bayne)

# Heatmap

green problems solve the original Project Euler problem and have a perfect score of 100% at Hackerrank, too.
yellow problems score less than 100% at Hackerrank (but still solve the original problem).
gray problems are already solved but I haven't published my solution yet.
blue problems are solved and there wasn't a Hackerrank version of it at the time I solved it or I didn't care about it because it differed too much.
red problems are solved but exceed the time limit of one minute.

Please click on a problem's number to open my solution to that problem:

 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200
 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300
 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375
The 206 solved problems had an average difficulty of 27.5% at Project Euler and
I scored 12,626 points (out of 14300 possible points, top rank was 20 out ouf ≈60000 in July 2017) at Hackerrank's Project Euler+.
Look at my progress and performance pages to get more details.

My username at Project Euler is stephanbrumme while it's stbrumme at Hackerrank.

 << problem 18 - Maximum path sum I Factorial digit sum - problem 20 >>
more about me can be found on my homepage, especially in my coding blog.
some names mentioned on this site may be trademarks of their respective owners.
thanks to the KaTeX team for their great typesetting library !