mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-02-03 02:25:57 +08:00
* fix: add <cstdint> to subset_sum.cpp * fix: add <cstdint> to subarray_sum.cpp * fix: add <cstdint> to wildcard_matching.cpp * fix: add <cstdint> to count_bit_flips.cpp * fix: add <cstdint> to count_of_set_bits.cpp * fix: add <cstdint> to trailing_ciphers.cpp * fix: add <cstdint> to hamming_distance.cpp * doc: include doc for hamming_distance * fix: add <cstdint> to next_higher_numebr_with_same_number_of_set_bits.cpp * fix: add <cstdint> to power_of_2.cpp * fix: add <cstdint> to set_kth_bit.cpp * fix: add <cstdint> to bit_manipulation/set_kth_bit.cpp * fix: add <cstdint> to bit_manipulation/travelling_salesman_using_bit_manipulation.cpp * fix: add <cstdint> to ciphers/base64_encoding.cpp * fix: add <cstdint> to ciphers/hill_cipher.cpp * fix: add <cstdint> to ciphers/uint128_t.hpp * fix: add <cstdint> to data_structures/dsu_path_compression.cpp * fix: add <cstdint> to data_structures/dsu_path_compression.cpp * fix add <cstdint> to datastructures/list_array>cpp * fix add <cstdint> to datastructures/queue_using_array.cpp * fix: add <cstdint> to sparse_table.cpp * fix: add <cstdint> to stack_using_list_queue.cpp * fix: add <cstdint> to treap.cpp * fix: add <cstdint> to graham_scan_functions.hpp * fix: add <cstdint> to graph/** * fix: add integral typdefs to hashing/** * fix: add <cstdint> to math/** * fix: add <cstdint> to numerical_methods/** * fix: add <cstdint> to other/** * fix: add <cstdint> to search/** * fix: add <cstdint> to sorting/** * fix: add <cstdint> to string/** * doc: remove include statement from comment * fix: make tests static Co-authored-by: David Leal <halfpacho@gmail.com> * fix: make tests static Co-authored-by: David Leal <halfpacho@gmail.com> * chore: use iwyu on backtracking/**.cpp * chore: use iwyu on bit_manip/**.cpp * chore: use iwyu on ciphers/**.cpp * chore: use iwyu on cpu_scheduling_algorithms/**.cpp * chore: use iwyu on data_structures/**.cpp * chore: use iwyu on divide_and_conquer/**.cpp * chore: use iwyu on geometry/**.cpp * chore: use iwyu on graph/**.cpp * chore: use iwyu on hashing/**.cpp * chore: use iwyu on machine_learning/**.cpp * chore: use iwyu on math/**.cpp * chore: use iwyu on numerical_methods/**.cpp * chore: use iwyu on others/**.cpp * chore: use iwyu on probablity/**.cpp * chore: use iwyu on search/**.cpp * chore: use iwyu on sorting/**.cpp * chore: use iwyu on strings/**.cpp * Revert "chore: use iwyu on strings/**.cpp" This reverts commitf2127456a8. * Revert "chore: use iwyu on sorting/**.cpp" This reverts commita290ae7ee2. * Revert "chore: use iwyu on search/**.cpp" This reverts commit19d136ae0f. * Revert "chore: use iwyu on probablity/**.cpp" This reverts commit5dd7f82a34. * Revert "chore: use iwyu on others/**.cpp" This reverts commit8a8fd42383. * Revert "chore: use iwyu on numerical_methods/**.cpp" This reverts commiteff2f44a50. * Revert "chore: use iwyu on math/**.cpp" This reverts commitc47117ca3f. * Revert "chore: use iwyu on machine_learning/**.cpp" This reverts commitc3897d3763. * Revert "chore: use iwyu on hashing/**.cpp" This reverts commit0c6611a835. * Revert "chore: use iwyu on graph/**.cpp" This reverts commitdabd6d2591. * Revert "chore: use iwyu on geometry/**.cpp" This reverts commit740bd65932. * Revert "chore: use iwyu on divide_and_conquer/**.cpp" This reverts commit16ee49e086. * Revert "chore: use iwyu on data_structures/**.cpp" This reverts commita3b719e368. * Revert "chore: use iwyu on cpu_scheduling_algorithms/**.cpp" This reverts commit24e597f7e2. * Revert "chore: use iwyu on ciphers/**.cpp" This reverts commit3d80295883. * Revert "chore: use iwyu on bit_manip/**.cpp" This reverts commit7edcb6e458. * Revert "chore: use iwyu on backtracking/**.cpp" This reverts commitf0a30d7cdb. * Update search/binary_search.cpp * Update backtracking/subarray_sum.cpp * Update backtracking/subset_sum.cpp * Update backtracking/wildcard_matching.cpp * Update bit_manipulation/count_bits_flip.cpp * Update bit_manipulation/count_of_set_bits.cpp * Update bit_manipulation/count_of_trailing_ciphers_in_factorial_n.cpp * Update bit_manipulation/hamming_distance.cpp * Update bit_manipulation/next_higher_number_with_same_number_of_set_bits.cpp * Update bit_manipulation/power_of_2.cpp * Update others/lru_cache.cpp * Update bit_manipulation/set_kth_bit.cpp * Update bit_manipulation/travelling_salesman_using_bit_manipulation.cpp * Update ciphers/base64_encoding.cpp * Update ciphers/hill_cipher.cpp * Update ciphers/uint128_t.hpp * Update cpu_scheduling_algorithms/fcfs_scheduling.cpp * Update data_structures/dsu_path_compression.cpp * Update data_structures/dsu_union_rank.cpp * Update data_structures/list_array.cpp * Update data_structures/queue_using_array.cpp * Update data_structures/sparse_table.cpp * Update data_structures/stack_using_queue.cpp * Update data_structures/treap.cpp * Update geometry/graham_scan_functions.hpp * Update graph/bidirectional_dijkstra.cpp * Update graph/connected_components_with_dsu.cpp * Update graph/cycle_check_directed_graph.cpp * Update graph/is_graph_bipartite2.cpp * Update graph/travelling_salesman_problem.cpp * Update hashing/md5.cpp * Update hashing/sha1.cpp * Update math/n_choose_r.cpp * Update strings/z_function.cpp * Update strings/manacher_algorithm.cpp * Update sorting/wiggle_sort.cpp * Update sorting/selection_sort_recursive.cpp * Update sorting/selection_sort_iterative.cpp * Update sorting/recursive_bubble_sort.cpp * Update sorting/radix_sort2.cpp * Update sorting/dnf_sort.cpp * Update sorting/cycle_sort.cpp * Update search/sublist_search.cpp * Update search/saddleback_search.cpp * Update search/interpolation_search.cpp * Update search/floyd_cycle_detection_algo.cpp * Update search/exponential_search.cpp * Update search/exponential_search.cpp * Update math/n_bonacci.cpp * Update math/aliquot_sum.cpp * Update math/check_factorial.cpp * Update math/double_factorial.cpp * Update math/eulers_totient_function.cpp * Update math/factorial.cpp * Update math/fibonacci.cpp * Update math/fibonacci_matrix_exponentiation.cpp * Update math/fibonacci_sum.cpp * Update math/finding_number_of_digits_in_a_number.cpp * chore: remove "/// for integral typedefs" * chore: remove for integral typedefs from modular division * fix: remove comment from include * fix: add cstdint to gale shapely --------- Co-authored-by: David Leal <halfpacho@gmail.com>
111 lines
3.5 KiB
C++
111 lines
3.5 KiB
C++
/*
|
|
* @file
|
|
* @brief Determines the [Date of
|
|
* Easter](https://en.wikipedia.org/wiki/Date_of_Easter) after 1582
|
|
*
|
|
* @details
|
|
* The date of Easter is determined in each year through a calculation known as
|
|
* "computus." Easter is celebrated on the first Sunday after the Paschal full
|
|
* moon, which is the first full moon on or after 21 March. Determining this
|
|
* date in advance requires a correlation between the lunar months and the solar
|
|
* year, while also accounting for the month, date, and weekday of the Julian or
|
|
* Gregorian calendar. The complexity of the algorithm arises because of the
|
|
* desire to associate the date of Easter with the date of the Jewish feast of
|
|
* Passover which, Christians believe, is when Jesus was crucified.
|
|
*
|
|
*
|
|
* @author [AlternateWalls](https://github.com/AlternateWalls)
|
|
*/
|
|
|
|
#include <cassert> /// for assert
|
|
#include <cstdint>
|
|
#include <iostream> /// for IO operations
|
|
|
|
/*
|
|
* @brief Contains information for Easter date
|
|
*/
|
|
class EasterYearMonthDay {
|
|
public:
|
|
uint64_t year; ///< year Easter is on
|
|
uint64_t month; ///< month Easter is on
|
|
uint64_t day; ///< day Easter is on
|
|
|
|
EasterYearMonthDay(uint64_t newYear, uint64_t newMonth, uint64_t newDay) {
|
|
year = newYear; // Assigns year to class
|
|
month = newMonth;
|
|
day = newDay;
|
|
}
|
|
};
|
|
|
|
/*
|
|
* @brief Function that finds the month and day of Easter
|
|
* @params param1 An int "y" of the year you want to find Easter on after
|
|
* 1582
|
|
* @returns An instance of the easterYearMonthDay calss that contains the
|
|
* information (Ex. 420 - 4/20 or April 20th)
|
|
*/
|
|
EasterYearMonthDay findEaster(uint64_t y) {
|
|
if (y > 1582) {
|
|
uint64_t a = y % 19; // Year's location on Metonic Calendar
|
|
uint64_t b = y / 100; // Century index
|
|
uint64_t c = y % 100;
|
|
uint64_t d = b / 4;
|
|
uint64_t e = b % 4; // Takes into account leap years
|
|
uint64_t f = (b + 8) / 25;
|
|
uint64_t g = (b - f + 1) / 3;
|
|
uint64_t h = (19 * a + b - d - g + 15) %
|
|
30; // Days from Mar. 21st until the full moon
|
|
uint64_t i = c / 4;
|
|
uint64_t k = c % 4;
|
|
uint64_t r =
|
|
(32 + 2 * e + 2 * i - h - k) %
|
|
7; // The number of days from Paschal full moon to next Sunday
|
|
uint64_t m = (a + 11 * h + 22 * r) / 451;
|
|
uint64_t n = (h + r - 7 * m + 114) / 31; // Month of Easter
|
|
uint64_t p = (h + r - 7 * m + 114) % 31; // p + 1 is the day of Easter
|
|
|
|
// Assign values
|
|
EasterYearMonthDay date(
|
|
y, n, p + 1); // Assign values to new instance of class
|
|
|
|
// Return date
|
|
return date;
|
|
} else {
|
|
EasterYearMonthDay date(0, 0, 0);
|
|
|
|
// Return date
|
|
return date;
|
|
}
|
|
}
|
|
|
|
/**
|
|
* @brief Self-test implementations
|
|
* @returns void
|
|
*/
|
|
static void test() {
|
|
// 2003 | April 20th
|
|
assert(findEaster(2003).month == 4); // Should return true
|
|
assert(findEaster(2003).day == 20); // Should return true
|
|
|
|
// 1910 | March 27th
|
|
assert(findEaster(1910).month == 3); // Should return true
|
|
assert(findEaster(1910).day == 27); // Should return true
|
|
|
|
// 1877 | April 1st
|
|
assert(findEaster(1877).month != 3); // Should return true
|
|
assert(findEaster(1877).day != 22); // Should return true
|
|
|
|
// 1400 | Invalid date
|
|
assert(findEaster(1400).month == 0); // Should return true
|
|
assert(findEaster(1400).day == 0); // Should return true
|
|
}
|
|
|
|
/**
|
|
* @brief Main function
|
|
* @returns 0 on exit
|
|
*/
|
|
int main() {
|
|
test(); // run self-test implementations
|
|
return 0;
|
|
}
|