week1.java

一些Java的小的应用程序

import java.io.BufferedReader;
import java.io.InputStreamReader;
//import java2.MonthException;
public class Week1 {
public static void main(String args[]){
	try{BufferedReader input=new BufferedReader
		(new InputStreamReader(System.in));
	System.out.println("Enter the year:");
	int year=Integer.parseInt(input.readLine());
	System.out.println("Enter the month:");
	int month=Integer.parseInt(input.readLine());
	if(month>12)throw new MonthException();
	System.out.println("Enter the day:");
	int day=Integer.parseInt(input.readLine());
	if(bigmonth(month)&day>31)throw new DayException();
	else if(smallmonth(month)&day>30)throw new DayException();
	else if(leap(year)&month==2&day>29 )throw new DayException();
	else if(!leap(year)&month==2&day>28)throw new DayException ();
	int week=getweek(year,month,day);
	System.out.println(week);
	String s=weekchange(week);
	System.out.printf("%d 年 %d 月 %d 日 是 %d ",year,month,day,s);
}catch(MonthException e1){
	System.out.println(e1.getMessage());
	System.exit(0);
}catch(DayException e2){
	System.out.println(e2.getMessage());
	System.exit(0);
}catch(Exception e3){
	System.out.printf("ERROR!");
}}public static boolean bigmonth(int n){
	switch(n){
	case 1:	case 3:case 5:case 7:case 8:case 10:case 12:return true;
	default:return false;
	}
}public static boolean smallmonth(int n){
	switch(n){
	case 4:	case 6:case 9:case 11:return true;
	default:return false;
	}
}public static boolean leap(int i){
	boolean leapyear;
	if(i%400==0|(i%100!=0&i%4==0))
		leapyear=true;
	else leapyear=false;
	return leapyear;
}public  static String weekchange(int n){
	String week="";
	switch(n){
	case 1: week="星期一";break;
	case 2:week="星期二";break;
	case 3:week="星期三";break;
	case 4:week="星期四";break;
	case 5:week="星期五";break;
	case 6:week="星期六";break;
	case 0:week="星期日";break;
	}return week;
}public static int getweek(int year,int month ,int day){
	int sum=0,sum1=0,sum2=0,sum3=0;int n=0;
	int[] a=new int[12];
	a[0]=a[2]=a[4]=a[6]=a[7]=a[9]=a[10]=a[11]=31;
	a[3]=a[5]=a[8]=a[10]=30;
	sum1=365*(year-1);
	for(int i=1;i<year;i++)if(leap(i))n++;
	if(leap(year))a[1]=29;
	
	for(int j=0;j<month;j++)sum2+=a[j];
	sum3=n;
	sum=sum1+sum2+sum3;
	int weekday=sum%7+1;
	return weekday;
}}