Plurk paste

import java.lang.reflect.Array;
import java.util.*;

class Rectangle {
	int x, y;
	double height, width;

	double getArea() {
		return height * width;
	}

	void print() {
		System.out.println("以(橫座標 ,縱坐標)=(" + x + "," + y + ")為起點");
		System.out.println("以高為：" + height + "寬為：" + width + "的矩形");
		System.out.println("矩形面積為：" + getArea());
	}
}

class Rectangle1 {
	int x, y;
	double height, width;

	double getArea(double height, double width) {
		return height * width;
	}

	void print(int x, int y, double height, double width) {
		System.out.println("以(橫座標 ,縱坐標)=(" + x + "," + y + ")為起點");
		System.out.println("以高為：" + height + "寬為：" + width + "的矩形");
		System.out.println("矩形面積為：" + getArea(height, width));
	}
}

class Rectangle2 {
	int x, y;
	double height, width;

	Rectangle2(int i, int j, double h, double w) {
		x = i;
		y = j;
		height = h;
		width = w;
	}

	double getArea() {
		return height * width;
	}

	void print() {
		System.out.println("以(橫座標 ,縱坐標)=(" + x + "," + y + ")為起點");
		System.out.println("以高為：" + height + "寬為：" + width + "的矩形");
		System.out.println("矩形面積為：" + getArea());
	}
}

public class test20131029 {
	public static void main(String[] a) {
		Rectangle r1 = new Rectangle();
		r1.x = 0;
		r1.y = 5;
		r1.height = 25.5;
		r1.width = 35.5;
		r1.print();
		Rectangle1 r2 = new Rectangle1();
		r2.print(1, 10, 20.5, 30.5);
		Rectangle2 r3 = new Rectangle2(2, 3, 11.5, 22.5);
		r3.print();
		int[] arri = { 1, 5, 9, 2, 6, 7, 3, 4, 8 };
		int[] arri2 = arri;
		Arrays.sort(arri);
		arri2[0] = 0;
		System.out.println("排列並且替換完的矩陣：");
		for (int i : arri) {
			System.out.print(i);
		}

		int[] arri3 = new int[15];
		int odd = 0, even = 0;
		int[] arreven = new int[15];
		int[] arrodd = new int[15];
		for (int i = 0; i < 15; i++) {
			arri3[i] = (int) (Math.random() * 10) + 1;
		}
		System.out.println("亂數產生的矩陣：");
		for (int i : arri3) {
			System.out.print(i + "\t");
		}
		System.out.println();
		for (int i = 0; i < 15; i++) {
			if (arri3[i] % 2 == 0) {
				arreven[even] = arri3[i];
				even++;
			} else {
				arrodd[odd] = arri3[i];
				odd++;
			}
		}
		int count1 = 0;
		int count2 = 0;
		int count3 = 0;
		System.out.println("奇偶交叉排列：");
		for (int i = 0; i < 15; i++) {
			if (i == 0 || count1 < even) {
				System.out.print(arreven[i] + "\t");
				count1++;
				count3++;
				if (count3 % 5 == 0) {
					System.out.println();
				}
			}
			if (count2 < odd) {
				System.out.print(arrodd[i] + "\t");
				count2++;
				count3++;
				if (count3 % 5 == 0) {
					System.out.println();
				}
			}

		}
		Scanner in = new Scanner(System.in);
		System.out
				.println("請選擇執行項目(1)費氏數列(2)最大公因數(3)最小公倍數(4)次方(5)階層(6)排列(7)和(8)交叉乘積(9)矩陣和");
		int choose = in.nextInt();
		if (choose < 9 && choose > 0) {
			System.out.println("請輸入第一個數：");
			int enter = in.nextInt();
			System.out.println("請輸入第二個數：");
			int enter1 = in.nextInt();
			if (choose == 1) {
				print(fidon(enter));
				System.out.println();
			}
			else if (choose == 2) {
				print(gcd(enter, enter1));
				System.out.println();
			}
			else if (choose == 3) {
				print(lcm(enter, enter1));
				System.out.println();
			}
			else if (choose == 4) {
				print(pow(enter, enter1));
				System.out.println();
			}
			else if (choose == 5) {
				print(step(enter));
				System.out.println();
			}
			else if (choose == 6) {
				print(select(enter, enter1));
				System.out.println();
			}
			else if (choose == 7) {
				print(sum(enter));
				System.out.println();
			}
			else if (choose == 8) {
				print(CrossM(enter));
			}
			System.out.println();
		}
		if (choose == 9) {
			print(sum(arri, arri.length));
		}
	}

	static void print(int i) {
		System.out.print(i);
	}

	public static int fidon(int i) { // 費氏
		if (i < 0) {
			return -1;
		} else if (i == 0) {
			return 0;
		} else if (i == 1) {
			return 1;
		} else
			return fidon(i - 1) + fidon(i - 2);
	}

	public static int gcd(int i, int j) { // 最大公因數
		int sum = 0;
		if (i < 0 || j < 0) {
			return -1;
		} else if (i >= j) {
			sum = i % j;
			if (sum == 0) {
				return j;
			} else {
				i = j;
				j = sum;
				return gcd(i, j);
			}
		} else {
			sum = j % i;
			if (sum == 0) {
				return i;
			} else {
				j = i;
				i = sum;
				return gcd(j, i);
			}
		}
	}

	public static int lcm(int i, int j) { // 最小公倍數
		return (i / gcd(i, j) * j);
	}

	public static int pow(int i, int j) { // 次方
		if (j < 0) {
			return -1;
		} else if (j == 0) {
			return 1;
		} else {
			return pow(i, j - 1) * i;
		}
	}

	public static int step(int i) { // 階層
		if (i < 0) {
			return -1;
		} else if (i == 0) {
			return 0;
		} else if (i == 1) {
			return 1;
		} else {
			return step(i - 1) * i;
		}
	}

	public static int select(int i, int j) { // C幾取幾
		if (i <= 0 || j <= 0 || i < j) {
			return -1;
		} else if (i == j) {
			return 1;
		} else {
			return (step(i) / (step(j) * step(i - j)));
		}
	}

	public static int sum(int i) { // 合
		if (i < 0) {
			return -1;
		} else if (i == 0) {
			return 0;
		} else if (i == 1) {
			return 1;
		} else {
			return i + sum(i - 1);
		}
	}

	public static int CrossM(int i) { // 交叉乘積
		int sum = 0;
		if (i < 0) {
			return -1;
		} else if (i == 0) {
			return 0;
		} else {
			sum = i * (i - 1);
			return sum + CrossM(i - 1);
		}
	}

	public static int sum(int[] arri, int i) {
		if (i < 1) {
			return 0;
		} else {
			return arri[i - 1] + sum(arri, i - 1);
		}
	}
}