요일 찾아내기 알고리즘 Zeller's congruence C++
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 | #include <string> #include <vector> #include <iostream> #include <algorithm> using namespace std; int Zellercongruence(int day, int month, int year) { if (month == 1) { month = 13; year--; } if (month == 2) { month = 14; year--; } int q = day; int m = month; int k = year % 100; int j = year / 100; int h = q + 13 * (m + 1) / 5 + k + k / 4 + j / 4 + 5 * j; h = h % 7; return h; return 0; } string solution(int year,int month,int day) { string answer; int n = Zellercongruence(day, month, year); switch (n){ case 0: answer = "SAT"; break; case 1: answer = "SUN"; break; case 2: answer = "MON"; break; case 3: answer = "TUE"; break; case 4: answer = "WED"; break; case 5: answer = "THU"; break; case 6: answer = "FRI"; break; } return answer; } int main() { string ans = solution(2022,1,1); cout << ans; return 0; } | cs |
댓글
댓글 쓰기