Tutte le sfide
Media 0 risolte 0% di accettazione

Counting Sundays

Count the months in a range of years that begin on a Sunday.

Cosa imparerai

  • Apply the Gregorian leap year rule
  • Track the weekday as days pass
  • Count events over a range of months

Problema

Mostra traduzione

A club meets on the first day of every month, and those meetings that land on a Sunday get a brunch. Count the months from January of start_year to December of end_year whose first day is a Sunday, using the Gregorian calendar. As a fixed point: 1 January 2023 was a Sunday. Remember the leap year rule: divisible by 4, except century years, which must be divisible by 400.

Implement counting_sundays(start_year, end_year).

Input

start_year: The first year, counted from January.

end_year: The last year, counted through December.

Output

Return the number of months in that range whose first day is a Sunday.

Vincoli

1600 ≤ start_year ≤ end_year ≤ 2400

Esempi

Esempio 1
Input:
start_year = 2023
end_year = 2023

Output atteso:
expected = 2
Input:
long long start_year = 2023;
long long end_year = 2023;

Output atteso:
long long expected = 2;
Input:
long start_year = 2023;
long end_year = 2023;

Output atteso:
long expected = 2;

Spiegazione

In 2023 only January and October began on a Sunday, so the answer is 2.

Esempio 2
Input:
start_year = 2024
end_year = 2025

Output atteso:
expected = 3
Input:
long long start_year = 2024;
long long end_year = 2025;

Output atteso:
long long expected = 3;
Input:
long start_year = 2024;
long end_year = 2025;

Output atteso:
long expected = 3;

Spiegazione

2024 had September and December, 2025 had June: 3 months.

Come affrontarlo

Prova prima da solo, poi apri un suggerimento alla volta.

Suggerimento 1

Find the weekday of January 1 of the start year from a known date, or use a weekday formula.

Suggerimento 2

Moving to the next month shifts the weekday by that month's length mod 7.

Suggerimento 3

February has 29 days in leap years: divisible by 4, but century years only when divisible by 400.

Complessità attesa

O(years) time, O(1) extra space

Riferimenti

Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.

La migliore soluzione superata di ogni programmatore. Le più veloci, leggere e meglio valutate stanno in alto.

Ancora nessuna soluzione superata. Risolvila e prendi il primo posto.

Impara dagli altri

Soluzioni della community

Nessuna soluzione pubblicata. Risolvi questa sfida per condividere la prima.