結果

問題 No.1529 Constant Lcm
ユーザー maguroflymagurofly
提出日時 2021-06-04 20:25:57
言語 Ruby
(3.3.0)
結果
TLE  
実行時間 -
コード長 5,043 bytes
コンパイル時間 421 ms
コンパイル使用メモリ 7,680 KB
実行使用メモリ 259,780 KB
最終ジャッジ日時 2024-11-19 08:58:16
合計ジャッジ時間 47,656 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 98 ms
19,236 KB
testcase_01 AC 99 ms
183,996 KB
testcase_02 AC 94 ms
19,108 KB
testcase_03 AC 91 ms
161,164 KB
testcase_04 AC 89 ms
19,364 KB
testcase_05 AC 90 ms
197,696 KB
testcase_06 AC 90 ms
19,360 KB
testcase_07 AC 89 ms
197,268 KB
testcase_08 AC 88 ms
19,492 KB
testcase_09 AC 90 ms
196,928 KB
testcase_10 TLE -
testcase_11 AC 1,737 ms
259,780 KB
testcase_12 AC 160 ms
23,076 KB
testcase_13 TLE -
testcase_14 AC 2,328 ms
99,288 KB
testcase_15 AC 2,514 ms
117,336 KB
testcase_16 AC 1,962 ms
84,772 KB
testcase_17 AC 1,037 ms
51,688 KB
testcase_18 AC 1,140 ms
54,588 KB
testcase_19 AC 2,365 ms
101,228 KB
testcase_20 TLE -
testcase_21 TLE -
testcase_22 TLE -
testcase_23 TLE -
testcase_24 TLE -
testcase_25 TLE -
権限があれば一括ダウンロードができます
コンパイルメッセージ
Syntax OK

ソースコード

diff # 

def main
  n = int

  table = PrimeTable.new(n)

  prime_divisions = {}
  (1 .. n - 1).each do |i|
    prime_divisions[i] = table.factorize(i)
  end

  lcm = Hash.new(0)
  (1 .. n - 1).each do |i|
    j = n - i
    pd = Hash.new(0)
    prime_divisions[i].each do |p|
      pd[p] += 1
    end
    prime_divisions[j].each do |p|
      pd[p] += 1
    end
    pd.each do |p, e|
      lcm[p] = [lcm[p], e].max
    end
  end

  ans = 1
  lcm.each do |p, e|
    ans *= p**e
    ans %= 998244353
  end

  puts ans
end

DEBUG = true
MOD = 10**9+7
YESNO = %w(No Yes)
INF = 10**9

require "prime"

def int; gets.to_s.to_i end
def ints; gets.to_s.split.map { |s| s.to_i } end
def int1s; gets.to_s.split.map { |s| s.to_i - 1 } end
def intss(n); Array.new(n) { ints }; end
def float; gets.to_s.to_f end
def floats; gets.to_s.split.map { |s| s.to_f } end
def array_of(&convert); gets.to_s.split.map(&convert) end
def string; gets.to_s.chomp end
def rep(n, &b); Array.new(n, &b) end
def yes; puts YESNO[1] end
def no; puts YESNO[0] end
def yesno t; puts YESNO[t] end
def zip(xs, *yss); Enumerator.new { |y| xs.zip(*yss) { |a| y.yield(*a) } } end
def max(*xs, &block); block_given? ? xs.max_by(&block) : xs.max end
def min(*xs, &block); block_given? ? xs.min_by(&block) : xs.min end
def minmax(*xs, &block); block_given? ? xs.minmax_by(&block) : xs.minmax end
def gcd(*xs); xs.inject(0, :gcd) end
def matrix(h, w, fill=nil, &block); return Array.new(h) { Array.new(w, &block) } if block_given?; Array.new(h) { [fill] * w } end
def debug(x = nil); STDERR.puts (block_given? ? yield(x) : x).inspect if DEBUG; x end
def debug_grid(grid, width = 1); grid.each { |row| STDERR.puts row.map { |x| x.inspect.ljust(width) }.join("") } if DEBUG; grid end
def if_debug; yield if DEBUG end

module Boolean
  def coerce(other); [other, to_i] end
  def +@; to_i end
  def to_int; to_i end
  def *(other); to_i * other end
end

class TrueClass
  include Boolean
  def to_i; 1 end
end

class FalseClass
  include Boolean
  def to_i; 0 end
end

class Integer
  def div_ceil(y); (self + y - 1) / y end
  def mod_inv(mod = MOD); pow(mod-2, mod) end
  def mod_div(y, mod = MOD); self * mod_inv(y, mod) % mod end
  def factorial(mod = MOD); (2..self).inject(1) { |f, x| f * x % mod } end
  def popcount; x = self; c = 0; while x > 0; c += 1 if x & 1 == 1; x >>= 1 end; c end #TODO: faster
  def bitbrute(&block); (1<<self).times(&block) end
  def nCr(r); x = 1; (1..r).each { |i| x *= self + 1 - i; x /= i }; x; end
  def each_divisor; return Enumerator.new { |y| each_divisor { |k| y << k } } unless block_given?; k = 1; while k * k < self; if self % k == 0; yield k; yield self / k end; k += 1; end; yield k if k * k == self end
  def divisors; each_divisor.to_a end
end

class Range
  def end_open; exclude_end? ? self.end : self.end + 1 end
  def end_close; exclude_end? ? self.end - 1 : self.end end
  def upper_bound; ac, wa = self.begin, self.end_open; while wa - ac > 1; if yield((wj = (ac + wa) / 2)); ac = wj else wa = wj end; end; yield(ac) ? ac : nil end
  def lower_bound; ac, wa = self.end_open, self.begin; while ac - wa > 1; if yield((wj = (ac + wa) / 2)); ac = wj else wa = wj end; end; yield(ac) ? ac : nil end
  def shakutori(r2, &pred); Enumerator.new { |y| j, r = r2.begin, r2.end_open; each { |i| j += 1 while j + 1 < r and pred[i, j+1]; y.yield(i, j) } }; end
  def widest(&block); Enumerator.new { |y| j, n = self.begin, self.end_open; each { |i| j += 1 while j < n and block[i, j]; y.yield(i, j) if block[i, j] } } end
  def pairs; Enumerator.new { |y| l, r = self.begin, self.end_open; i = l; while i < r - 1; j = i + 1; while j < r; y.yield(i, j); j += 1 end; i += 1 end } end
end

class Array
  def power(&block); (0 ... 1 << size).each(&block) end
  def sorted_merge(other); a = []; i = j = 0; n, m = size, other.size; if j < m and other[j] < self[i]; a << other[j]; j += 1 else; a << self[i]; i += 1 end while i < n; a.push(*other[j..-1]) if j < m; a end
  def upper_bound; ac, wa = 0, size; while wa - ac > 1; if yield(self[(wj = (ac + wa) / 2)]); ac = wj else; wa = wj end; end; ac end
  def lower_bound; ac, wa = size, 0; while wa - ac > 1; if yield(self[(wj = (ac + wa) / 2)]); ac = wj else; wa = wj end; end; ac end
  def cum(*xs, &op); a = []; a << xs[0] if xs.size > 0; a << x = self[0]; (1...size).each { |i| a << x = op[x, self[i]] }; a end
  def cumdiff(range); self[range.end_open] - self[range.begin]; end
end

module Enumerable
  def sorted_uniq; x = nil; filter { |y| c = x === y; x = y; !c } end
  def cumsum; ys = [0]; each { |x| ys << x + ys[-1] }; ys end
end

class PrimeTable
	def initialize(n)
		@lpf = [nil] * (n + 1)
		@primes = [2]
		(2 .. n).step(2) do |d| @lpf[d] = 2 end
		(3 .. n).step(2) do |d|
			unless @lpf[d]
				@lpf[d] = d
				@primes << d
			end
			@primes.each do |p|
				break if p * d > n or p > @lpf[d]
				@lpf[p * d] = p
			end
		end
	end
	def prime?(n); @lpf[n] == n; end
	def each(&block); @primes.each(&block); end
	def factorize(n); fs = []; while n > 1; fs << (f = @lpf[n]); n /= f; end; fs; end
end

main
0