Submission #7724095


Source Code Expand

local mce, mfl, msq, mmi, mma = math.ceil, math.floor, math.sqrt, math.min, math.max

local function getprimes(x)
  local primes = {}
  local allnums = {}
  for i = 1, x do allnums[i] = true end
  for i = 2, x do
    if(allnums[i]) then
      table.insert(primes, i)
      local lim = mfl(x / i)
      for j = 2, lim do
        allnums[j * i] = false
      end
    end
  end
  return primes
end

local function getdivisorparts(x, primes)
  local prime_num = #primes
  local tmp = {}
  local lim = mce(msq(x))
  local primepos = 1
  local dv = primes[primepos]
  while(primepos <= prime_num and dv <= lim) do
    if(x % dv == 0) then
      local asdf = {}
      asdf.p = dv
      asdf.cnt = 1
      x = x / dv
      while(x % dv == 0) do
        x = x / dv
        asdf.cnt = asdf.cnt + 1
      end
      table.insert(tmp, asdf)
      lim = mce(msq(x))
    end
    if(primepos == prime_num) then break end
    primepos = primepos + 1
    dv = primes[primepos]
  end
  if(x ~= 1) then
    local asdf = {}
    asdf.p, asdf.cnt = x, 1
    table.insert(tmp, asdf)
  end
  return tmp
end

local function getdivisor(divisorparts)
  local t = {}
  local pat = 1
  local len = #divisorparts
  local allpat = 1
  for i = 1, len do
    allpat = allpat * (1 + divisorparts[i].cnt)
  end
  for t_i_pat = 0, allpat - 1 do
    local div = allpat
    local i_pat = t_i_pat
    local ret = 1
    for i = 1, len do
      div = mfl(div / (divisorparts[i].cnt + 1))
      local mul = mfl(i_pat / div)
      i_pat = i_pat % div
      for j = 1, mul do
        ret = ret * divisorparts[i].p
      end
    end
    table.insert(t, ret)
  end
  -- table.sort(t)
  return t
end

local function getgcd(x, y)
  while 0 < x do
    x, y = y % x, x
  end
  return y
end

local n, k = io.read("*n", "*n")
local primes = getprimes(mce(msq(k)))
local tmp = getdivisorparts(k, primes)
local divs = getdivisor(tmp)
local divdiv = {}
local cnt = {}
for i = 1, #divs do
  cnt[divs[i]] = 0
  local divp = getdivisorparts(divs[i], primes)
  divdiv[divs[i]] = getdivisor(divp)
end

local a = io.read("*n")
local gcd = getgcd(a, k)
for i, v in pairs(divdiv[gcd]) do
  cnt[v] = cnt[v] + 1
end
local ret = 0
for i = 2, n do
  a = io.read("*n")
  gcd = getgcd(a, k)
  ret = ret + cnt[mfl(k / gcd)]
  for j, v in pairs(divdiv[gcd]) do
    cnt[v] = cnt[v] + 1
  end
end
print(ret)

Submission Info

Submission Time
Task C - ロト2
User obakyan
Language LuaJIT (2.0.4)
Score 400
Code Size 2443 Byte
Status AC
Exec Time 1208 ms
Memory 2300 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 25
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt, 00_example_03.txt
All 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 10_random_01.txt, 10_random_02.txt, 10_random_03.txt, 10_random_04.txt, 10_random_05.txt, 20_max_01.txt, 20_max_02.txt, 20_max_03.txt, 20_max_04.txt, 20_max_05.txt, 30_overflow_01.txt, 30_overflow_02.txt, 40_dmax_01.txt, 40_dmax_02.txt, 40_dmax_03.txt, 50_prime_01.txt, 50_prime_02.txt, 50_prime_03.txt, 60_prime_pow_01.txt, 60_prime_pow_02.txt, 60_prime_pow_03.txt, 70_one_01.txt
Case Name Status Exec Time Memory
00_example_01.txt AC 1 ms 256 KB
00_example_02.txt AC 1 ms 256 KB
00_example_03.txt AC 1 ms 256 KB
10_random_01.txt AC 1 ms 256 KB
10_random_02.txt AC 2 ms 256 KB
10_random_03.txt AC 1 ms 256 KB
10_random_04.txt AC 2 ms 256 KB
10_random_05.txt AC 1 ms 256 KB
20_max_01.txt AC 95 ms 256 KB
20_max_02.txt AC 88 ms 256 KB
20_max_03.txt AC 106 ms 384 KB
20_max_04.txt AC 82 ms 256 KB
20_max_05.txt AC 84 ms 256 KB
30_overflow_01.txt AC 74 ms 256 KB
30_overflow_02.txt AC 74 ms 256 KB
40_dmax_01.txt AC 1184 ms 2300 KB
40_dmax_02.txt AC 1208 ms 2300 KB
40_dmax_03.txt AC 1192 ms 2300 KB
50_prime_01.txt AC 77 ms 256 KB
50_prime_02.txt AC 81 ms 256 KB
50_prime_03.txt AC 108 ms 512 KB
60_prime_pow_01.txt AC 207 ms 512 KB
60_prime_pow_02.txt AC 107 ms 384 KB
60_prime_pow_03.txt AC 94 ms 512 KB
70_one_01.txt AC 58 ms 256 KB