반응형
|
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
|
package test;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Main {
static final char weeks[] = {'토', '일', '월', '화', '수', '목', '금'};
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int year;
int month;
int day;
year = scanner.nextInt();
month = scanner.nextInt();
day = scanner.nextInt();
// System.out.println(days(year, month, day)%7);
// System.out.println("첫번째 요일 "+firstDayOfWeek(year));
System.out.println(year + "년 " + month + "월 " + day + " 일은 : " + weeks[(firstDayOfWeek(year)+days(year, month, day)%7-1)%7] + " 요일 입니다." );
}
static boolean isLeapYear(int year) {
boolean isLeapYear= false;
if(year%4 == 0) isLeapYear = true;
if(year%100 == 0) isLeapYear = false;
if(year%400 == 0) isLeapYear = true;
return isLeapYear;
}
static int firstDayOfWeek(int year) {
char FirstDoW = ' ';
int cnt = 0;
//2000도 1월 1일(366) 토요일 / 2001년 1월 1일(365) 월요일 / 2002 1월 1일(365) 화요일
if(year > 2000) {
for(int i = 2000; i < year; i ++) {
if(isLeapYear(i)) {
cnt += 2;
FirstDoW = weeks[cnt%7];
}else {
cnt += 1;
FirstDoW = weeks[cnt%7];
}
}
}
return cnt%7;
}
static int days(int year, int month, int day) {
int days[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int allDay = 0;
if(isLeapYear(year)) {
days[1] = 29;
}
for(int i = 0; i < month-1; i ++) {
allDay += days[i];
}
allDay += day;
return allDay;
}
}
|
cs |
반응형