結果

問題 No.53 悪の漸化式
ユーザー fujisufujisu
提出日時 2015-03-21 12:12:20
言語 Java21
(openjdk 21)
結果
AC  
実行時間 54 ms / 5,000 ms
コード長 4,353 bytes
コンパイル時間 2,756 ms
コンパイル使用メモリ 82,596 KB
実行使用メモリ 37,396 KB
最終ジャッジ日時 2024-06-28 23:53:57
合計ジャッジ時間 4,477 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
36,568 KB
testcase_01 AC 50 ms
36,428 KB
testcase_02 AC 52 ms
37,396 KB
testcase_03 AC 50 ms
36,684 KB
testcase_04 AC 53 ms
36,844 KB
testcase_05 AC 51 ms
37,136 KB
testcase_06 AC 52 ms
37,216 KB
testcase_07 AC 50 ms
37,204 KB
testcase_08 AC 51 ms
37,204 KB
testcase_09 AC 53 ms
37,280 KB
testcase_10 AC 50 ms
37,252 KB
testcase_11 AC 51 ms
37,012 KB
testcase_12 AC 53 ms
37,396 KB
testcase_13 AC 53 ms
36,948 KB
testcase_14 AC 52 ms
37,192 KB
testcase_15 AC 54 ms
37,116 KB
testcase_16 AC 52 ms
37,272 KB
testcase_17 AC 51 ms
37,312 KB
testcase_18 AC 52 ms
37,248 KB
testcase_19 AC 51 ms
36,976 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.math.BigDecimal;
import java.util.InputMismatchException;

public class Main {
	class Fraction {
		long numerator;
		long denominator;

		Fraction(long numerator, long denominator) {
			this.numerator = numerator;
			this.denominator = denominator;
			reduce();
		}

		Fraction(long k) {
			this.numerator = k;
			this.denominator = 1;
		}

		Fraction add(Fraction x) {
			long a = this.denominator;
			long b = this.numerator;
			long c = x.denominator;
			long d = x.numerator;
			Fraction res = new Fraction(b * c + a * d, a * c);
			res.reduce();
			return res;
		}

		Fraction sub(Fraction x) {
			long a = this.denominator;
			long b = this.numerator;
			long c = x.denominator;
			long d = x.numerator;
			Fraction res = new Fraction(b * c - a * d, a * c);
			res.reduce();
			return res;
		}

		Fraction multiple(Fraction x) {
			long a = this.denominator;
			long b = this.numerator;
			long c = x.denominator;
			long d = x.numerator;
			Fraction res = new Fraction(b * d, a * c);
			res.reduce();
			return res;
		}

		Fraction devide(Fraction x) {
			long a = this.denominator;
			long b = this.numerator;
			long c = x.denominator;
			long d = x.numerator;
			Fraction res = new Fraction(b * c, a * d);
			res.reduce();
			return res;
		}

		void reduce() {
			long gcd = gcd(numerator, denominator);
			this.numerator /= gcd;
			this.denominator /= gcd;
			if (this.denominator < 0) {
				this.numerator *= -1;
				this.denominator *= -1;
			}
		}

		long gcd(long a, long b) {
			a = Math.abs(a);
			b = Math.abs(b);
			while (a != 0 && b != 0) {
				if (a > b)
					a %= b;
				else
					b %= a;
			}
			if (a == 0)
				return b;
			return a;
		}

		@Override
		public String toString() {
			String res = "" + numerator;
			if (denominator != 1)
				res += "/" + denominator;
			return res;
		}
	}

	void run() {
		MyScanner sc = new MyScanner();

		int n = sc.nextInt();
		if (n == 0) {
			System.out.println(4.);
		} else if (n == 1) {
			System.out.println(3.);
		} else {
			BigDecimal prepre = new BigDecimal(4);
			BigDecimal pre = new BigDecimal(3);
			for (int i = 2; i <= n; i++) {
				BigDecimal tmp1 = pre.multiply(new BigDecimal(19. / 4));
				BigDecimal tmp2 = prepre.multiply(new BigDecimal(3));
				BigDecimal now = tmp1.subtract(tmp2);
				prepre = pre;
				pre = now;
			}
			System.out.println(pre.toPlainString());
		}
	}

	public static void main(String[] args) {
		new Main().run();
	}

	public void mapDebug(int[][] a) {
		System.out.println("--------map display---------");
		for (int i = 0; i < a.length; i++) {
			for (int j = 0; j < a[i].length; j++) {
				System.out.printf("%3d ", a[i][j]);
			}
			System.out.println();
		}
		System.out.println("----------------------------" + '\n');
	}

	class MyScanner {
		int read() {
			try {
				return System.in.read();
			} catch (IOException e) {
				throw new InputMismatchException();
			}
		}

		boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		boolean isEndline(int c) {
			return c == '\n' || c == '\r' || c == -1;
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		int[] nextIntArray(int n) {
			int[] array = new int[n];
			for (int i = 0; i < n; i++)
				array[i] = nextInt();
			return array;
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		long[] nextLongArray(int n) {
			long[] array = new long[n];
			for (int i = 0; i < n; i++)
				array[i] = nextLong();
			return array;
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		double[] nextDoubleArray(int n) {
			double[] array = new double[n];
			for (int i = 0; i < n; i++)
				array[i] = nextDouble();
			return array;
		}

		String next() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}

		String[] nextStringArray(int n) {
			String[] array = new String[n];
			for (int i = 0; i < n; i++)
				array[i] = next();

			return array;
		}

		String nextLine() {
			int c = read();
			while (isEndline(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isEndline(c));
			return res.toString();
		}
	}
}
0