#690585 (Go) No.368 LCM of K-products

• 問題: No.368 LCM of K-products
• ユーザー: sgsw
• 提出日時: 2021-08-17 22:31:09
• 言語: Go (1.22.1)
• 結果: AC
• 実行時間: 388 ms / 2,000 ms
• コード長: 1,670 bytes
• コンパイル時間: 11,063 ms
• コンパイル使用メモリ: 225,248 KB
• 実行使用メモリ: 5,888 KB
• 最終ジャッジ日時: 2024-10-10 22:43:09
• 合計ジャッジ時間: 15,668 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	198 ms; 5,248 KB
testcase_01	AC	159 ms; 5,888 KB
testcase_02	AC	269 ms; 5,248 KB
testcase_03	AC	199 ms; 5,248 KB
testcase_04	AC	189 ms; 5,248 KB
testcase_05	AC	388 ms; 5,504 KB
testcase_06	AC	2 ms; 5,248 KB
testcase_07	AC	1 ms; 5,248 KB
testcase_08	AC	2 ms; 5,248 KB
testcase_09	AC	2 ms; 5,248 KB
testcase_10	AC	1 ms; 5,248 KB
testcase_11	AC	1 ms; 5,248 KB
testcase_12	AC	1 ms; 5,248 KB
testcase_13	AC	139 ms; 5,248 KB
testcase_14	AC	215 ms; 5,248 KB
testcase_15	AC	240 ms; 5,632 KB
testcase_16	AC	206 ms; 5,248 KB
testcase_17	AC	173 ms; 5,248 KB
testcase_18	AC	248 ms; 5,248 KB
testcase_19	AC	61 ms; 5,248 KB
testcase_20	AC	162 ms; 5,248 KB
testcase_21	AC	38 ms; 5,248 KB
testcase_22	AC	239 ms; 5,504 KB
testcase_23	AC	2 ms; 5,248 KB
testcase_24	AC	2 ms; 5,248 KB
testcase_25	AC	1 ms; 5,248 KB
testcase_26	AC	1 ms; 5,248 KB
testcase_27	AC	1 ms; 5,248 KB
testcase_28	AC	1 ms; 5,248 KB
testcase_29	AC	1 ms; 5,248 KB
testcase_30	AC	1 ms; 5,248 KB
testcase_31	AC	1 ms; 5,248 KB
testcase_32	AC	1 ms; 5,248 KB
testcase_33	AC	92 ms; 5,248 KB
testcase_34	AC	7 ms; 5,248 KB

ソースコード

package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

var wg = bufio.NewScanner(os.Stdin)

const (
	inf            = int(1e18)
	initialBufSize = int(1e6)
	maxBufSize     = int(1e6)
	mod            = int(1e9 + 7)
)

var buf []byte = make([]byte, initialBufSize)

func factorize(n int) map[int]int {
	div := n
	retval := make(map[int]int)
	for i := 2; i*i <= n; i++ {
		if div%i == 0 {
			ord := 0
			for div%i == 0 {
				div /= i
				ord++
			}
			retval[i] = ord
		}
	}
	if div > 1 {
		retval[div] = 1
	}
	return retval
}

func main() {
	n, k := nextInt(), nextInt()
	a := make([]int, n)
	for i := 0; i < n; i++ {
		a[i] = nextInt()
	}
	fact_a := make([]map[int]int, n)
	prime_set := make(map[int]bool)
	for i := 0; i < n; i++ {
		fact_a[i] = factorize(a[i])
		for key := range fact_a[i] {
			prime_set[key] = true
		}
	}
	ans := 1
	for p := range prime_set {
		b := make([]int, n)
		for i := 0; i < n; i++ {
			if val, ok := fact_a[i][p]; ok {
				b[i] = val
			}
		}
		sort.Slice(b, func(i, j int) bool {
			return b[i] > b[j]
		})
		ord := 0
		for i := 0; i < k; i++ {
			ord += b[i]
		}
		ans = ans * powMod(p, ord, mod) % mod
	}
	fmt.Printf("%d\n", ans)
}

// greatest common divisor (GCD) via Euclidean algorithm
func GCD(a, b int) int {
	for b != 0 {
		t := b
		b = a % b
		a = t
	}
	return a
}

func powMod(x, n, mod int) int {
	retval := 1
	for mul := x; n > 0; {
		if n&1 == 1 {
			retval = retval * mul % mod
		}
		mul = mul * mul % mod
		n >>= 1
	}
	return retval
}

func init() {
	wg.Split(bufio.ScanWords)
	wg.Buffer(buf, maxBufSize)
}

func nextInt() int {
	wg.Scan()
	i, e := strconv.Atoi(wg.Text())
	if e != nil {
		panic(e)
	}
	return i
}