結果
問題 | No.1927 AB-CD |
ユーザー | 👑 箱 |
提出日時 | 2022-05-16 21:12:37 |
言語 | Kotlin (1.9.23) |
結果 |
AC
|
実行時間 | 366 ms / 2,000 ms |
コード長 | 2,926 bytes |
コンパイル時間 | 15,567 ms |
コンパイル使用メモリ | 429,124 KB |
実行使用メモリ | 58,356 KB |
最終ジャッジ日時 | 2023-10-12 15:36:32 |
合計ジャッジ時間 | 26,761 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 262 ms
52,520 KB |
testcase_01 | AC | 263 ms
54,512 KB |
testcase_02 | AC | 264 ms
52,912 KB |
testcase_03 | AC | 263 ms
54,848 KB |
testcase_04 | AC | 357 ms
56,060 KB |
testcase_05 | AC | 361 ms
58,104 KB |
testcase_06 | AC | 361 ms
57,780 KB |
testcase_07 | AC | 365 ms
58,124 KB |
testcase_08 | AC | 272 ms
52,932 KB |
testcase_09 | AC | 361 ms
56,064 KB |
testcase_10 | AC | 362 ms
56,040 KB |
testcase_11 | AC | 360 ms
57,948 KB |
testcase_12 | AC | 311 ms
57,180 KB |
testcase_13 | AC | 360 ms
56,444 KB |
testcase_14 | AC | 272 ms
54,400 KB |
testcase_15 | AC | 291 ms
54,968 KB |
testcase_16 | AC | 364 ms
56,148 KB |
testcase_17 | AC | 364 ms
58,276 KB |
testcase_18 | AC | 364 ms
55,900 KB |
testcase_19 | AC | 364 ms
57,844 KB |
testcase_20 | AC | 360 ms
55,972 KB |
testcase_21 | AC | 363 ms
57,956 KB |
testcase_22 | AC | 303 ms
55,356 KB |
testcase_23 | AC | 362 ms
56,176 KB |
testcase_24 | AC | 364 ms
56,004 KB |
testcase_25 | AC | 365 ms
58,356 KB |
testcase_26 | AC | 366 ms
57,764 KB |
testcase_27 | AC | 262 ms
54,472 KB |
testcase_28 | AC | 262 ms
52,700 KB |
testcase_29 | AC | 264 ms
52,664 KB |
ソースコード
import java.io.PrintWriter import java.util.* import kotlin.math.* fun PrintWriter.solve() { val n = nextInt() val s = nextLine() val a = s.count { it == 'A' } val b = s.count { it == 'B' } println(binomSimple(n.toLong(), a + b.toLong())) } // region ModInt class ModInt(x: Long) { companion object { const val MOD = 998244353L //const val MOD = 1000000007L } constructor(y: Int) : this(y.toLong()) val x = (x % MOD + MOD) % MOD operator fun plus(other: ModInt): ModInt { return ModInt(x + other.x) } operator fun minus(other: ModInt): ModInt { return ModInt(x - other.x) } operator fun times(other: ModInt): ModInt { return ModInt(x * other.x) } operator fun div(other: ModInt): ModInt { return this * other.inv() } fun pow(exp: Long): ModInt { if (exp == 0L) return ModInt(1L) var a = pow(exp shr 1) a *= a if (exp and 1L == 0L) return a return this * a } fun inv(): ModInt { return this.pow(MOD - 2) } override fun equals(other: Any?): Boolean { if (this === other) return true if (javaClass != other?.javaClass) return false other as ModInt if (x != other.x) return false return true } override fun hashCode(): Int { return x.hashCode() } override fun toString(): String { return "$x" } } class ModIntArray(n: Int) { private val a = LongArray(n) { 0L } constructor(n: Int, init: (Int) -> ModInt) : this(n) { for (i in 0 until n) { a[i] = init(i).x } } operator fun set(i: Int, x: ModInt) { a[i] = x.x } operator fun get(i: Int): ModInt { return ModInt(a[i]) } fun joinToString(s: String = ", "): String { return a.joinToString(s) } } fun Long.toModInt(): ModInt { return ModInt(this) } fun Int.toModInt(): ModInt { return ModInt(this) } fun binomSimple(n: Long, k: Long): ModInt { var numer = ModInt(1) var denom = ModInt(1) for (i in 0 until k) { numer *= ModInt(n - i) denom *= ModInt(k - i) } return numer / denom } // endregion fun main() { Thread(null, { val writer = PrintWriter(System.out, false) writer.solve() writer.flush() }, "solve", abs(1L.shl(26))) .apply { setUncaughtExceptionHandler { _, e -> e.printStackTrace(); kotlin.system.exitProcess(1) } } .apply { start() }.join() } // region Scanner private var st = StringTokenizer("") private val br = System.`in`.bufferedReader() fun next(): String { while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine()) return st.nextToken() } fun nextInt() = next().toInt() fun nextLong() = next().toLong() fun nextLine() = br.readLine() fun nextDouble() = next().toDouble() // endregion