結果

問題 No.731 等差数列がだいすき
ユーザー tutuztutuz
提出日時 2018-09-08 12:18:14
言語 Java21
(openjdk 21)
結果
AC  
実行時間 135 ms / 1,500 ms
コード長 3,869 bytes
コンパイル時間 2,352 ms
コンパイル使用メモリ 74,868 KB
実行使用メモリ 55,876 KB
最終ジャッジ日時 2023-08-22 01:20:18
合計ジャッジ時間 6,808 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 120 ms
55,756 KB
testcase_01 AC 118 ms
55,300 KB
testcase_02 AC 117 ms
55,628 KB
testcase_03 AC 120 ms
53,512 KB
testcase_04 AC 122 ms
55,656 KB
testcase_05 AC 119 ms
55,712 KB
testcase_06 AC 126 ms
55,852 KB
testcase_07 AC 121 ms
55,828 KB
testcase_08 AC 122 ms
55,388 KB
testcase_09 AC 123 ms
55,572 KB
testcase_10 AC 126 ms
55,580 KB
testcase_11 AC 119 ms
55,876 KB
testcase_12 AC 123 ms
55,548 KB
testcase_13 AC 122 ms
55,480 KB
testcase_14 AC 124 ms
55,476 KB
testcase_15 AC 128 ms
55,828 KB
testcase_16 AC 125 ms
55,796 KB
testcase_17 AC 125 ms
55,812 KB
testcase_18 AC 128 ms
55,752 KB
testcase_19 AC 127 ms
55,792 KB
testcase_20 AC 135 ms
55,512 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskX solver = new TaskX();
		solver.solve(1, in, out);
		out.close();
	}

	static int INF = 1 << 30;
	static long LINF = 1L << 55;
	static int MOD = 1000000007;
	static int[] mh4 = { 0, -1, 1, 0 };
	static int[] mw4 = { -1, 0, 0, 1 };
	static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };
	static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };

	static class TaskX {

		public void solve(int testNumber, InputReader in, PrintWriter out) {

			int n = in.nextInt();
			double[] xn = new double[n];
			for (int i = 0; i < n; i++) xn[i] = i;
			double[] yn = in.nextDoubleArray(n);

			double x = 0, y = 0, xx = 0, xy = 0;
			for (int i = 0; i < n; i++) {
				x += xn[i];
				y += yn[i];
				xy += xn[i] * yn[i];
				xx += xn[i] * xn[i];
			}

			double alpha = (n*xy - x*y) / (n*xx - (x*x));
			double beta = (xx*y - xy*x) / (n*xx - (x*x));

			double cost = 0;
			for (int i = 0; i < n; i++) {
				cost += Math.pow(yn[i]-alpha*xn[i]-beta, 2);
			}

			out.printf("%f %f\n", beta, alpha);
			out.println(cost);
		}
	}

	static class InputReader {
		BufferedReader in;
		StringTokenizer tok;

		public String nextString() {
			while (!tok.hasMoreTokens()) {
				try {
					tok = new StringTokenizer(in.readLine(), " ");
				} catch (IOException e) {
					throw new InputMismatchException();
				}
			}
			return tok.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(nextString());
		}

		public long nextLong() {
			return Long.parseLong(nextString());
		}

		public double nextDouble() {
			return Double.parseDouble(nextString());
		}

		public double[] nextDoubleArray(int n) {
			double[] res = new double[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt();
			}
			return res;
		}

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

		public int[] nextIntArrayDec(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt() - 1;
			}
			return res;
		}

		public int[] nextIntArray1Index(int n) {
			int[] res = new int[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextInt();
			}
			return res;
		}

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

		public long[] nextLongArrayDec(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong() - 1;
			}
			return res;
		}

		public long[] nextLongArray1Index(int n) {
			long[] res = new long[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextLong();
			}
			return res;
		}

		public InputReader(InputStream inputStream) {
			in = new BufferedReader(new InputStreamReader(inputStream));
			tok = new StringTokenizer("");
		}
	}

	static long max(long... n) {
		long ret = n[0];
		for (int i = 0; i < n.length; i++) {
			ret = Math.max(ret, n[i]);
		}
		return ret;
	}

	static int max(int... n) {
		int ret = n[0];
		for (int i = 0; i < n.length; i++) {
			ret = Math.max(ret, n[i]);
		}
		return ret;
	}

	static long min(long... n) {
		long ret = n[0];
		for (int i = 0; i < n.length; i++) {
			ret = Math.min(ret, n[i]);
		}
		return ret;
	}

	static int min(int... n) {
		int ret = n[0];
		for (int i = 0; i < n.length; i++) {
			ret = Math.min(ret, n[i]);
		}
		return ret;
	}

}
0