#996314 (Java21) No.2816 At Most Two Moves

• 問題: No.2816 At Most Two Moves
• ユーザー: ks2m
• 提出日時: 2024-07-19 22:46:02
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 103 ms / 2,000 ms
• コード長: 1,354 bytes
• コンパイル時間: 2,655 ms
• コンパイル使用メモリ: 77,440 KB
• 実行使用メモリ: 38,676 KB
• 最終ジャッジ日時: 2024-07-19 22:46:09
• 合計ジャッジ時間: 6,362 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	54 ms; 36,592 KB
testcase_01	AC	88 ms; 38,060 KB
testcase_02	AC	84 ms; 38,376 KB
testcase_03	AC	89 ms; 38,060 KB
testcase_04	AC	91 ms; 37,912 KB
testcase_05	AC	90 ms; 37,952 KB
testcase_06	AC	100 ms; 38,676 KB
testcase_07	AC	98 ms; 38,200 KB
testcase_08	AC	100 ms; 38,372 KB
testcase_09	AC	103 ms; 37,848 KB
testcase_10	AC	87 ms; 38,452 KB
testcase_11	AC	96 ms; 38,392 KB
testcase_12	AC	98 ms; 38,420 KB
testcase_13	AC	99 ms; 38,368 KB
testcase_14	AC	91 ms; 38,468 KB
testcase_15	AC	91 ms; 38,480 KB
testcase_16	AC	98 ms; 38,280 KB
testcase_17	AC	89 ms; 38,236 KB
testcase_18	AC	95 ms; 38,396 KB
testcase_19	AC	96 ms; 38,072 KB
testcase_20	AC	101 ms; 38,304 KB
testcase_21	AC	85 ms; 38,356 KB
testcase_22	AC	95 ms; 38,240 KB
testcase_23	AC	88 ms; 37,860 KB
testcase_24	AC	100 ms; 38,148 KB
testcase_25	AC	97 ms; 38,144 KB

ソースコード

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int t = Integer.parseInt(br.readLine());
		int mod = 998244353;
		PrintWriter pw = new PrintWriter(System.out);
		for (int z = 0; z < t; z++) {
			long n = Integer.parseInt(br.readLine());

			if (n == 1) {
				pw.println(1);
				continue;
			}

			long m = n * (n - 1) / 2;
			long m2 = power(2, m, mod);
			long total = n * m2 % mod;

			long v1 = 3 * modinv(4, mod) % mod;
			long v2 = power(v1, n - 2, mod);
			long v3 = v2 * modinv(2, mod) % mod;
			long v4 = v3 * (n - 1) % mod;
			long v5 = v4 * m2 % mod;

			long ans = (total - v5 + mod) % mod;
			pw.println(ans);
		}
		pw.flush();
		br.close();
	}

	static long power(long x, long n, int m) {
		if (n == 0) {
			return 1;
		}
		long val = power(x, n / 2, m);
		val = val * val % m;
		if (n % 2 == 1) {
			x %= m;
			val = val * x % m;
		}
		return val;
	}

	static long modinv(long a, int m) {
		long b = m;
		long u = 1;
		long v = 0;
		long tmp = 0;

		while (b > 0) {
			long t = a / b;
			a -= t * b;
			tmp = a;
			a = b;
			b = tmp;

			u -= t * v;
			tmp = u;
			u = v;
			v = tmp;
		}

		u %= m;
		if (u < 0) u += m;
		return u;
	}
}