Submission #6442146


Source Code Expand

local mfl = math.floor

local function func(i)
  return mfl(i * (i + 1) / 2)
end

local function lower_bound(x, max)
  if x == 1 then return 1 end
  if func(max) < x then return max + 1 end
  local min = 1
  while(1 < max - min) do
    local mid = mfl((min + max) / 2)
    if(func(mid) < x) then
      min = mid
    else
      max = mid
    end
  end
  return max
end

local x = io.read("*n")
local r = lower_bound(x, x)
print(r)
x = x - r
while 1 <= x do
  r = lower_bound(x, r - 1)
  print(r)
  x = x - r
end

Submission Info

Submission Time
Task B - Exactly N points
User obakyan
Language LuaJIT (2.0.4)
Score 300
Code Size 541 Byte
Status AC
Exec Time 4 ms
Memory 256 KB

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 200 / 200 100 / 100
Status
AC × 3
AC × 13
AC × 24
Set Name Test Cases
sample sample-01.txt, sample-02.txt, sample-03.txt
dataset1 sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt
dataset2 sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
01-01.txt AC 1 ms 256 KB
01-02.txt AC 1 ms 256 KB
01-03.txt AC 1 ms 256 KB
01-04.txt AC 1 ms 256 KB
01-05.txt AC 1 ms 256 KB
01-06.txt AC 1 ms 256 KB
01-07.txt AC 1 ms 256 KB
01-08.txt AC 1 ms 256 KB
01-09.txt AC 1 ms 256 KB
01-10.txt AC 1 ms 256 KB
02-01.txt AC 4 ms 256 KB
02-02.txt AC 4 ms 256 KB
02-03.txt AC 4 ms 256 KB
02-04.txt AC 4 ms 256 KB
02-05.txt AC 4 ms 256 KB
02-06.txt AC 3 ms 256 KB
02-07.txt AC 2 ms 256 KB
02-08.txt AC 4 ms 256 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB
sample-03.txt AC 1 ms 256 KB