https://www.acmicpc.net/problem/1924
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 | #include <iostream> #include <stdio.h> #include <string> #pragma warning(disable : 4996) using namespace std; int main() { //2007.1.1 MON //1,3,5,7,8,10,12 => 31th //4,6,9,11 => 30th //2 => 28th //1/15 2/5 3/5 4/2 5/7 6/4 7/2 8/6 9/3 10/1 11/5 12/3 => MON int M, D; cin >> M >> D; int tmp = 1; for (int i = 1; i < M; i++) { if (i == 1 || i == 3 || i == 5 || i == 7 || i == 8 || i == 10 || i == 12) tmp += 31; else if (i == 4 || i == 6 || i == 9 || i == 11) tmp += 30; else if (i == 2) tmp += 28; } tmp += D; switch (tmp%7){ case 0: cout << "SAT"; break; case 1: cout << "SUN"; break; case 2: cout << "MON"; break; case 3: cout << "TUE"; break; case 4: cout << "WED"; break; case 5: cout << "THU"; break; case 6: cout << "FRI"; break; } return 0; } | cs |
'Algorithm Problems > BOJ' 카테고리의 다른 글
[10817번] Three Interger 세 수 - if condition[C++] (0) | 2017.01.02 |
---|---|
[11721번] Print out per ten lines 열개씩 끊어 출력하기 - For Loop [C++] ☆ (0) | 2016.12.29 |
[2439번] Star Shooting 2 별찍기2 - For loop [C++] (0) | 2016.12.28 |
[10845번] QUEUE 큐 - Queue [C++] (0) | 2016.12.27 |
[2839번] ŠEĆER(sugar) 설탕 배달 - In/Output [C++] ☆ (0) | 2016.12.27 |