Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- -----------------------------------------------------------------------------
- -- 13423
- do
- local entries = io.read('*n')
- local sums = {}
- for i = 1, entries do
- local num = io.read('*n')
- local sum = 0
- while num > 0 do
- sum = sum + (num % 10)
- num = math.floor(num / 10)
- end
- sums[sum] = (sums[sum] or 0) + 1
- end
- local maxs = 0
- for k, v in pairs(sums) do
- if maxs == 0 then maxs = k end
- if v > sums[maxs] then maxs = k
- elseif v == sums[maxs] and maxs > k then maxs = k end
- end
- print(maxs)
- end
- -----------------------------------------------------------------------------
- --
- -- 13476
- do
- local entries = io.read('*n')
- local sums = {}
- for i = 1, entries do
- local num = io.read('*n')
- local sum = 0
- while num > 0 do
- sum = sum + (num % 10)
- num = math.floor(num / 10)
- end
- sums[sum] = (sums[sum] or 0) + 1
- end
- local mins = 0
- for k, v in pairs(sums) do
- if mins == 0 then mins = k end
- if v < sums[mins] then mins = k
- elseif v == sums[mins] and mins < k then mins = k end
- end
- print(mins)
- end
- -----------------------------------------------------------------------------
- --
- -- 13503
- do
- local entries = io.read('*n')
- local digits = {}
- for i = 1, entries do
- local num = io.read('*n')
- while num > 0 do
- local digit = num % 10
- digits[digit] = (digits[digit] or 0) + 1
- num = math.floor(num / 10)
- end
- end
- local max = 0
- for i = 0, 9 do
- if digits[i] and digits[i] > max then max = digits[i] end
- end
- for i = 9, 0, -1 do
- if digits[i] and (digits[i] == max) then io.write(i, ' ') end
- end
- end
- -----------------------------------------------------------------------------
- --
- -- 13530
- do
- local entries = io.read('*n')
- local digits = {}
- for i = 1, entries do
- local num = io.read('*n')
- while num > 0 do
- local digit = num % 10
- digits[digit] = (digits[digit] or 0) + 1
- num = math.floor(num / 10)
- end
- end
- local max
- for k, v in pairs(digits) do
- if not max then max = k end
- if v > digits[max] or (v == digits[max] and k > max) then max = k end
- end
- print(max)
- end
- -----------------------------------------------------------------------------
- --
- -- 13557
- do
- local entries = io.read('*n')
- local sum, min = 0, 10000 + 1
- local counter = 0
- local div = 6
- for i = 1, entries do
- local num = io.read('*n')
- sum = sum + num
- counter = counter + 1
- if num < min and num % div ~= 0 then min = num end
- end
- if sum % div ~= 0 then print(counter, sum)
- elseif (sum - min) % div ~= 0 then print(counter - 1, sum - min)
- else print(0, 0) end
- end
- -----------------------------------------------------------------------------
- --
- -- 13584
- do
- local entries = io.read('*n')
- local sum, min = 0, 10000 + 1
- local counter = 0
- local div = 8
- for i = 1, entries do
- local num = io.read('*n')
- sum = sum + num
- counter = counter + 1
- if num < min and num % div ~= 0 then min = num end
- end
- if sum % div ~= 0 then print(counter, sum)
- elseif (sum - min) % div ~= 0 then print(counter - 1, sum - min)
- else print(0, 0) end
- end
- -----------------------------------------------------------------------------
- --
- -- 13584
- do
- local entries = io.read('*n')
- local lengths, maxi, maxv = {}, 0, 0
- for i = 1, entries do
- local num = io.read('*n')
- local len = #tostring(num)
- lengths[len] = (lengths[len] or 0) + 1
- if lengths[len] > maxv then maxv = lengths[len] maxi = len end
- if lengths[len] == maxv and len > maxi then maxi = len end
- end
- print(maxi, maxv)
- end
- -----------------------------------------------------------------------------
- --
- -- 13638
- do
- local entries = io.read('*n')
- local lengths, mini, minv = {}, 10001, 10001
- for i = 1, entries do
- local num = io.read('*n')
- local len = #tostring(num)
- lengths[len] = (lengths[len] or 0) + 1
- if lengths[len] < minv then minv = lengths[len] mini = len end
- if lengths[len] == minv and len < mini then mini = len end
- end
- print(mini, minv)
- end
- -----------------------------------------------------------------------------
- --
- -- 13754
- do
- local entries = io.read('*n')
- local d26, d13, d2 = 0, 0, 0
- for i = 1, entries do
- local num = io.read('*n')
- if num % 26 == 0 then
- d26 = d26 + 1
- elseif num % 13 == 0 then
- d13 = d13 + 1
- elseif num % 2 == 0 then
- d2 = d2 + 1
- end
- end
- local whole = d26 * math.floor((d26 - 1) / 2) + d26 * (entries - d26) + d2 * d13
- print(whole)
- end
- -----------------------------------------------------------------------------
- --
- -- 14242
- do
- local entries = io.read('*n')
- local sums = {}
- for i = 1, entries do
- local num = io.read('*n')
- local dsum = 0
- dsum = num % 10 + math.floor(num / 10) % 10
- sums[dsum] = (sums[dsum] or 0) + 1
- end
- local max = next(sums)
- for k, v in pairs(sums) do
- if v > sums[max] or (v == sums[max] and k > max) then max = k end
- end
- print(max)
- end
- -----------------------------------------------------------------------------
- --
- -- 14286
- do
- local entries = io.read('*n')
- local sums = {}
- for i = 1, entries do
- local num = io.read('*n')
- local dsum = 0
- dsum = num % 10 + math.floor(num / 10) % 10
- print('n', num, 'd', dsum)
- sums[dsum] = (sums[dsum] or 0) + 1
- end
- local min = next(sums)
- for k, v in pairs(sums) do
- if v < sums[min] or (v == sums[min] and k < min) then min = k end
- end
- print(min)
- end
- -----------------------------------------------------------------------------
- --
- -- 14713
- do
- local entries = io.read('*n')
- local rems = {}
- local divider = 7
- for i = 1, entries do
- local num = io.read('*n')
- local rem = num % divider
- rems[rem] = (rems[rem] or 0) + 1
- print('rem', rem, 'n', rems[rem])
- end
- local s = rems[0] and math.floor((rems[0] * (rems[0] - 1) / 2) ) or 0
- for i = 1, 3 do
- if rems[i] and rems[divider-i] then
- s = s + rems[i] * rems[divider-i]
- end
- end
- print(s)
- end
- -----------------------------------------------------------------------------
- --
- -- 14788
- do
- local entries = io.read('*n')
- local rems = {}
- local divider = 9
- for i = 1, entries do
- local num = io.read('*n')
- local rem = num % divider
- rems[rem] = (rems[rem] or 0) + 1
- print('rem', rem, 'n', rems[rem])
- end
- local s = rems[0] and math.floor((rems[0] * (rems[0] - 1) / 2)) or 0
- for i = 1, 4 do
- if rems[i] and rems[divider-i] then
- s = s + rems[i] * rems[divider-i]
- end
- end
- print(s)
- end
- -----------------------------------------------------------------------------
- --
- -- 15643
- do
- local entries = io.read('*n')
- local d2, d17, d = 0, 0, 0
- for i = 1, entries do
- local num = io.read('*n')
- if num % 2 == 0 and num % 17 ~= 0 then
- d2 = d2 + 1
- elseif num % 2 ~= 0 and num % 17 == 0 then
- d17 = d17 + 1
- elseif num % 2 ~= 0 and num % 17 ~= 0 then
- d = d + 1
- end
- end
- local all = math.floor(d2 * (d2 - 1) / 2) + math.floor(d17 * (d17 - 1) / 2)
- + math.floor(d * (d - 1) / 2) + d2 * d + d * d17
- print(all)
- end
- -----------------------------------------------------------------------------
- --
- -- 7684
- do
- local entries = io.read('*n')
- local maxeven, maxuneven = 0, 0
- for i = 1, entries do
- local num = io.read('*n')
- if num % 2 == 0 then
- if num > maxeven then maxeven = num end
- else
- if num > maxuneven then maxuneven = num end
- end
- end
- local s = maxeven + maxuneven
- if s % 2 == 0 then
- print('-1')
- else
- print(s)
- end
- end
- -----------------------------------------------------------------------------
- --
- -- 7772
- do
- local entries = io.read('*n')
- local buffer = {}
- local dist = 8
- local max, prod = 0, 0
- for i = 1, dist do
- buffer[i % dist] = io.read('*n')
- end
- for i = dist + 1, entries do
- local num = io.read('*n')
- if buffer[i % dist] > max then max = buffer[i % dist] end
- if num * max > prod then prod = num * max end
- buffer[i % dist] = num
- end
- print(prod)
- end
- -----------------------------------------------------------------------------
- --
- -- 7799
- do
- local entries = io.read('*n')
- local buffer = {}
- local dist = 4
- local min, sum = 1001, 1001
- for i = 1, dist do
- buffer[i % dist] = io.read('*n')
- end
- for i = dist + 1, entries do
- local num = io.read('*n')
- if buffer[i % dist] < min then min = buffer[i % dist] end
- if num + min < sum then sum = num + min end
- buffer[i % dist] = num
- end
- print(sum)
- end
- -----------------------------------------------------------------------------
- --
- -- 8675
- do
- local entries = io.read('*n')
- local buffer = {}
- local dist = 10
- local max, sum = 0, 0
- for i = 1, dist do
- buffer[i % dist] = io.read('*n')
- end
- for i = dist + 1, entries do
- local num = io.read('*n')
- if buffer[i % dist] > max then max = buffer[i % dist] end
- if num^2 + max^2 > sum then sum = num^2 + max^2 end
- buffer[i % dist] = math.abs(num)
- end
- print(sum)
- end
- -----------------------------------------------------------------------------
- --
- -- 9179
- do
- local entries = io.read('*n')
- local buffer = {}
- local dist = 9
- local min, arm = 1001, 1001
- for i = 1, dist do
- buffer[i % dist] = io.read('*n')
- end
- for i = dist + 1, entries do
- local num = io.read('*n')
- if buffer[i % dist] < min then min = buffer[i % dist] end
- if math.floor((num + min)/2) < arm then arm = math.floor((num + min)/2) end
- buffer[i % dist] = num
- end
- print(arm)
- end
- -----------------------------------------------------------------------------
- --
- -- 9378
- do
- local entries = io.read('*n')
- local buffer = {}
- local dist = 6
- local min, prod = 1001, 1001
- for i = 1, dist do
- buffer[i % dist] = io.read('*n')
- end
- for i = dist + 1, entries do
- local num = io.read('*n')
- if buffer[i % dist] < min then min = buffer[i % dist] end
- if num * min < prod and (num * min) % 2 == 0 then prod = num * min end
- buffer[i % dist] = num
- end
- if prod == 1001 then print('-1') else print(prod) end
- end
- -----------------------------------------------------------------------------
- --
- -- 9708
- do
- local entries = io.read('*n')
- local m14, m7, m2, max = 0, 0, 0, 0
- for i = 1, entries do
- local num = io.read('*n')
- if num > 0 then
- if num % 2 == 0 and num % 7 ~= 0 and num > m2 then m2 = num end
- if num % 7 == 0 and num % 2 ~= 0 and num > m7 then m7 = num end
- if num % 14 == 0 and num > m14 then
- if max < m14 then max = m14 end
- m14 = num
- elseif num > max then max = num end
- end
- end
- if m14 * max > m7 * m2 then
- print(m14 * max)
- else
- print(m7 * m2)
- end
- end
- -----------------------------------------------------------------------------
- --
- -- 3628
- do
- local ln, mr, r, c = 1001, 0, 0, 0
- while true do
- local num = io.read('*n')
- if num == 0 then break end
- if num > ln then
- r = r + num - ln
- else
- if r > mr then mr = r end
- r = 0
- end
- ln = num
- c = c + 1
- end
- print(c, mr)
- end
- -----------------------------------------------------------------------------
- --
- -- 5291
- do
- local fn, ln, r, c = 1001, 1001, 0, 0
- while true do
- local num = io.read('*n')
- if num == 0 then if r > fn then c = c + 1 end break end
- if ln < num then
- r = r + num - ln
- else
- if r > fn then c = c + 1 end
- fn = num
- r = 0
- end
- ln = num
- print('r', r, 'fn', fn, 'ln', ln, 'c', c)
- end
- print(c)
- end
- -----------------------------------------------------------------------------
- --
- -- 5503
- do
- local entries = io.read('*n')
- local buffer = {}
- local dist = 6
- local min, prod = 1001, 1001
- for i = 1, dist do
- buffer[i % dist] = io.read('*n')
- end
- for i = dist + 1, entries do
- local num = io.read('*n')
- if buffer[i % dist] < min then min = buffer[i % dist] end
- if num * min < prod and (num * min) % 2 == 0 then prod = num * min end
- buffer[i % dist] = num
- end
- if prod == 1001 then print('-1') else print(prod) end
- end
- -----------------------------------------------------------------------------
- --
- -- 9378
- do
- local entries = io.read('*n')
- local buffer = {}
- local dist = 6
- local min, prod = 1001, 1001
- for i = 1, dist do
- buffer[i % dist] = io.read('*n')
- end
- for i = dist + 1, entries do
- local num = io.read('*n')
- if buffer[i % dist] < min then min = buffer[i % dist] end
- if num * min < prod and (num * min) % 2 == 0 then prod = num * min end
- buffer[i % dist] = num
- end
- if prod == 1001 then print('-1') else print(prod) end
- end
- -----------------------------------------------------------------------------
- --
- -- 9378
- do
- local entries = io.read('*n')
- local buffer = {}
- local dist = 6
- local min, prod = 1001, 1001
- for i = 1, dist do
- buffer[i % dist] = io.read('*n')
- end
- for i = dist + 1, entries do
- local num = io.read('*n')
- if buffer[i % dist] < min then min = buffer[i % dist] end
- if num * min < prod and (num * min) % 2 == 0 then prod = num * min end
- buffer[i % dist] = num
- end
- if prod == 1001 then print('-1') else print(prod) end
- end
- -----------------------------------------------------------------------------
- --
- -- 9378
- do
- local entries = io.read('*n')
- local buffer = {}
- local dist = 6
- local min, prod = 1001, 1001
- for i = 1, dist do
- buffer[i % dist] = io.read('*n')
- end
- for i = dist + 1, entries do
- local num = io.read('*n')
- if buffer[i % dist] < min then min = buffer[i % dist] end
- if num * min < prod and (num * min) % 2 == 0 then prod = num * min end
- buffer[i % dist] = num
- end
- if prod == 1001 then print('-1') else print(prod) end
- end
- -----------------------------------------------------------------------------
- --
- -- 9378
- do
- local entries = io.read('*n')
- local buffer = {}
- local dist = 6
- local min, prod = 1001, 1001
- for i = 1, dist do
- buffer[i % dist] = io.read('*n')
- end
- for i = dist + 1, entries do
- local num = io.read('*n')
- if buffer[i % dist] < min then min = buffer[i % dist] end
- if num * min < prod and (num * min) % 2 == 0 then prod = num * min end
- buffer[i % dist] = num
- end
- if prod == 1001 then print('-1') else print(prod) end
- end
- -----------------------------------------------------------------------------
- --
- -- 6436
- do
- local entries = io.read('*n')
- local t = {}
- for i = 1, 16 do
- t[i] = 0
- end
- for i = 1, entries do
- local num = io.read('*n')
- t[num] = (t[num] or 0) + 1
- end
- local k = 0
- for i = 1, 16 do
- if k < t[i] then k = t[i] end
- end
- for j = k, 1, -1 do
- for i = 1, 16 do
- if j == t[i] then print(i, t[i]) end
- end
- end
- end
- -----------------------------------------------------------------------------
- --
- -- 6906
- do
- local entries = io.read('*n')
- local x_min, x_max, y_min, y_max = 0, 0, 0, 0
- local s = 0
- for i = 1, entries do
- local x, y = io.read('*n'), io.read('*n')
- if y == 0 then
- if x_min > x then x_min = x end
- if x_max < x then x_max = x end
- elseif y_min > y then y_min = y
- elseif y_max < y then y_max = y end
- end
- if x_max > x_min and y_min < 0 and y_max > 0 then
- print(x_max, x_min, y_min, y_max)
- s = (x_max-x_min) * (y_max-y_min) / 2
- else
- s = 0
- end
- print(s)
- end
- -----------------------------------------------------------------------------
- --
- -- 3130
- do
- local entries = io.read('*n')
- local pos, neg = {}, {}
- for i = 1, entries do
- local num = io.read('*n')
- if num > 0 then
- pos[#pos + 1] = num
- elseif num < 0 then
- neg[#neg + 1] = num
- end
- end
- for i = 1, #neg do
- print(neg[i])
- end
- for i = 1, #pos do
- print(pos[i])
- end
- end
- -----------------------------------------------------------------------------
- --
- -- 9777
- do
- local entries = io.read('*n')
- local max_x, max_y = 0, 0
- for i = 1, entries do
- local x, y = io.read('*n'), io.read('*n')
- if y == 0 then
- if math.abs(x) > max_x then max_x = math.abs(x) end
- elseif x == 0 then
- if math.abs(y) > max_y then max_y = math.abs(y) end
- end
- end
- s = max_x * max_y / 2
- if s == 0 then print('Треугольник не существует')
- else print(s) end
- end
- -----------------------------------------------------------------------------
- --
- -- 5258
- do
- local entries = io.read('*n')
- local K, R, xA, yA = {}, {}, {}, {}
- for i = 1, 4 do
- K[i] = 0
- R[i] = 0
- end
- for i = 1, entries do
- local x, y = io.read('*n'), io.read('*n')
- local q = 0
- if x > 0 and y > 0 then
- q = 1
- elseif x < 0 and y > 0 then
- q = 2
- elseif x < 0 and y < 0 then
- q = 3
- elseif x > 0 and y < 0 then
- q = 4
- end
- if q > 0 then
- K[q] = K[q] + 1
- if R[q] == 0 or R[q] > math.min(math.abs(x), math.abs(y)) then
- R[q] = math.min(math.abs(x), math.abs(y))
- end
- xA[q], yA[q] = x, y
- end
- end
- local q = 1
- for i = 2, 4 do
- if K[i] > K[q] or K[i] == K[q] and R[i] < R[q] then
- q = i
- end
- end
- print('K: ', q)
- print('M: ', K[q])
- print('A: (' .. xA[q] .. ', ' .. yA[q] .. ')')
- print('R: ', R[q])
- end
- -----------------------------------------------------------------------------
- --
- -- 5258
- do
- local entries = io.read('*n')
- for i = 1, entries do
- local num = io.read('*n')
- end
- end
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement