結果

問題 No.8094 Character Table
コンテスト
ユーザー 箱星
提出日時 2022-02-17 12:03:47
言語 Kotlin
(2.1.0)
結果
AC  
実行時間 300 ms / 2,000 ms
コード長 3,291 bytes
コンパイル時間 15,846 ms
コンパイル使用メモリ 453,228 KB
実行使用メモリ 50,252 KB
最終ジャッジ日時 2024-06-29 07:37:25
合計ジャッジ時間 23,859 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.PrintWriter
import java.util.*
import kotlin.math.*

fun PrintWriter.solve() {
    val n = nextInt()
    if (n == 1) {
        println(1)
        return
    }
    val a = Array(n) { Array(n) { 0 } }
    var x = 0
    var y = 0
    for (i in 0 until n) {
        for (j in 0 until n) {
            val s = next()
            if (s == "?") {
                x = i
                y = j
            } else {
                a[i][j] = s.toInt()
            }
        }
    }
    for (j in 0 until n) {
        if (a[x][j] != 0) {
            var sum = 0
            for (i in 0 until n) {
                sum -= a[i][j] * a[i][y]
            }
            println(sum / a[x][j])
            a[x][y] = sum / a[x][j]
            break
        }
    }
    for (j1 in 0 until n) {
        for (j2 in 0 until n) {
            if (j1 == j2) continue
            var sum = 0
            for (i in 0 until n) {
                sum -= a[i][j1] * a[i][j2]
            }
            if (sum != 0) {
                throw Exception()
            }
        }
    }
}

// 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"
    }
}

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
0