Advertisement
Guest User

Untitled

a guest
May 21st, 2018
89
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Lua 17.99 KB | None | 0 0
  1. -----------------------------------------------------------------------------
  2.  
  3. -- 13423
  4. do
  5.   local entries = io.read('*n')
  6.  
  7.   local sums = {}
  8.  
  9.   for i = 1, entries do
  10.     local num = io.read('*n')
  11.  
  12.     local sum = 0
  13.     while num > 0 do
  14.       sum = sum + (num % 10)
  15.       num = math.floor(num / 10)
  16.     end
  17.  
  18.     sums[sum] = (sums[sum] or 0) + 1
  19.   end
  20.  
  21.   local maxs = 0
  22.   for k, v in pairs(sums) do
  23.     if maxs == 0 then maxs = k end
  24.  
  25.     if v > sums[maxs] then maxs = k
  26.     elseif v == sums[maxs] and maxs > k then maxs = k end
  27.   end
  28.  
  29.   print(maxs)
  30. end
  31.  
  32. -----------------------------------------------------------------------------
  33. --
  34. -- 13476
  35. do
  36.   local entries = io.read('*n')
  37.  
  38.   local sums = {}
  39.  
  40.   for i = 1, entries do
  41.     local num = io.read('*n')
  42.  
  43.     local sum = 0
  44.     while num > 0 do
  45.       sum = sum + (num % 10)
  46.       num = math.floor(num / 10)
  47.     end
  48.  
  49.     sums[sum] = (sums[sum] or 0) + 1
  50.   end
  51.  
  52.   local mins = 0
  53.   for k, v in pairs(sums) do
  54.     if mins == 0 then mins = k end
  55.  
  56.     if v < sums[mins] then mins = k
  57.     elseif v == sums[mins] and mins < k then mins = k end
  58.   end
  59.  
  60.   print(mins)
  61. end
  62.  
  63. -----------------------------------------------------------------------------
  64. --
  65. -- 13503
  66. do
  67.   local entries = io.read('*n')
  68.  
  69.   local digits = {}
  70.  
  71.   for i = 1, entries do
  72.     local num = io.read('*n')
  73.  
  74.     while num > 0 do
  75.       local digit = num % 10
  76.       digits[digit] = (digits[digit] or 0) + 1
  77.  
  78.       num = math.floor(num / 10)
  79.     end
  80.   end
  81.  
  82.   local max = 0
  83.   for i = 0, 9 do
  84.     if digits[i] and digits[i] > max then max = digits[i] end
  85.   end
  86.  
  87.   for i = 9, 0, -1 do
  88.     if digits[i] and (digits[i] == max) then io.write(i, ' ') end
  89.   end
  90. end
  91.  
  92. -----------------------------------------------------------------------------
  93. --
  94. -- 13530
  95. do
  96.   local entries = io.read('*n')
  97.  
  98.   local digits = {}
  99.  
  100.   for i = 1, entries do
  101.     local num = io.read('*n')
  102.  
  103.     while num > 0 do
  104.       local digit = num % 10
  105.       digits[digit] = (digits[digit] or 0) + 1
  106.  
  107.       num = math.floor(num / 10)
  108.     end
  109.   end
  110.  
  111.   local max
  112.   for k, v in pairs(digits) do
  113.     if not max then max = k end
  114.     if v > digits[max] or (v == digits[max] and k > max) then max = k end
  115.   end
  116.  
  117.   print(max)
  118. end
  119.  
  120. -----------------------------------------------------------------------------
  121. --
  122. -- 13557
  123. do
  124.   local entries = io.read('*n')
  125.  
  126.   local sum, min = 0, 10000 + 1
  127.   local counter = 0
  128.   local div = 6
  129.  
  130.   for i = 1, entries do
  131.     local num = io.read('*n')
  132.  
  133.     sum = sum + num
  134.     counter = counter + 1
  135.     if num < min and num % div ~= 0 then min = num end
  136.   end
  137.  
  138.   if sum % div ~= 0 then print(counter, sum)
  139.   elseif (sum - min) % div ~= 0 then print(counter - 1, sum - min)
  140.   else print(0, 0) end
  141. end
  142.  
  143. -----------------------------------------------------------------------------
  144. --
  145. -- 13584
  146. do
  147.   local entries = io.read('*n')
  148.  
  149.   local sum, min = 0, 10000 + 1
  150.   local counter = 0
  151.   local div = 8
  152.  
  153.   for i = 1, entries do
  154.     local num = io.read('*n')
  155.  
  156.     sum = sum + num
  157.     counter = counter + 1
  158.     if num < min and num % div ~= 0 then min = num end
  159.   end
  160.  
  161.   if sum % div ~= 0 then print(counter, sum)
  162.   elseif (sum - min) % div ~= 0 then print(counter - 1, sum - min)
  163.   else print(0, 0) end
  164. end
  165.  
  166. -----------------------------------------------------------------------------
  167. --
  168. -- 13584
  169. do
  170.   local entries = io.read('*n')
  171.  
  172.   local lengths, maxi, maxv = {}, 0, 0
  173.  
  174.   for i = 1, entries do
  175.     local num = io.read('*n')
  176.  
  177.     local len = #tostring(num)
  178.     lengths[len] = (lengths[len] or 0) + 1
  179.  
  180.     if lengths[len] > maxv then maxv = lengths[len] maxi = len end
  181.     if lengths[len] == maxv and len > maxi then maxi = len end
  182.   end
  183.  
  184.   print(maxi, maxv)
  185. end
  186.  
  187. -----------------------------------------------------------------------------
  188. --
  189. -- 13638
  190. do
  191.   local entries = io.read('*n')
  192.  
  193.   local lengths, mini, minv = {}, 10001, 10001
  194.  
  195.   for i = 1, entries do
  196.     local num = io.read('*n')
  197.  
  198.     local len = #tostring(num)
  199.     lengths[len] = (lengths[len] or 0) + 1
  200.  
  201.     if lengths[len] < minv then minv = lengths[len] mini = len end
  202.     if lengths[len] == minv and len < mini then mini = len end
  203.   end
  204.  
  205.   print(mini, minv)
  206. end
  207.  
  208. -----------------------------------------------------------------------------
  209. --
  210. -- 13754
  211. do
  212.   local entries = io.read('*n')
  213.  
  214.   local d26, d13, d2 = 0, 0, 0
  215.  
  216.   for i = 1, entries do
  217.     local num = io.read('*n')
  218.     if num % 26 == 0 then
  219.       d26 = d26 + 1
  220.     elseif num % 13 == 0 then
  221.       d13 = d13 + 1
  222.     elseif num % 2 == 0 then
  223.       d2 = d2 + 1
  224.     end
  225.   end
  226.  
  227.   local whole = d26 * math.floor((d26 - 1) / 2) + d26 * (entries - d26) + d2 * d13
  228.  
  229.   print(whole)
  230. end
  231.  
  232. -----------------------------------------------------------------------------
  233. --
  234. -- 14242
  235. do
  236.   local entries = io.read('*n')
  237.  
  238.   local sums = {}
  239.  
  240.   for i = 1, entries do
  241.     local num = io.read('*n')
  242.     local dsum = 0
  243.  
  244.     dsum = num % 10 + math.floor(num / 10) % 10
  245.     sums[dsum] = (sums[dsum] or 0) + 1
  246.   end
  247.  
  248.   local max = next(sums)
  249.   for k, v in pairs(sums) do
  250.     if v > sums[max] or (v == sums[max] and k > max) then max = k end
  251.   end
  252.  
  253.   print(max)
  254. end
  255.  
  256. -----------------------------------------------------------------------------
  257. --
  258. -- 14286
  259. do
  260.   local entries = io.read('*n')
  261.  
  262.   local sums = {}
  263.  
  264.   for i = 1, entries do
  265.     local num = io.read('*n')
  266.     local dsum = 0
  267.  
  268.     dsum = num % 10 + math.floor(num / 10) % 10
  269.     print('n', num, 'd', dsum)
  270.     sums[dsum] = (sums[dsum] or 0) + 1
  271.   end
  272.  
  273.   local min = next(sums)
  274.   for k, v in pairs(sums) do
  275.     if v < sums[min] or (v == sums[min] and k < min) then min = k end
  276.   end
  277.  
  278.   print(min)
  279. end
  280.  
  281. -----------------------------------------------------------------------------
  282. --
  283. -- 14713
  284. do
  285.   local entries = io.read('*n')
  286.  
  287.   local rems = {}
  288.   local divider = 7
  289.  
  290.   for i = 1, entries do
  291.     local num = io.read('*n')
  292.  
  293.     local rem = num % divider
  294.     rems[rem] = (rems[rem] or 0) + 1
  295.     print('rem', rem, 'n', rems[rem])
  296.   end
  297.  
  298.   local s = rems[0] and math.floor((rems[0] * (rems[0] - 1) / 2) ) or 0
  299.  
  300.   for i = 1, 3 do
  301.     if rems[i] and rems[divider-i] then
  302.       s = s + rems[i] * rems[divider-i]
  303.     end
  304.   end
  305.  
  306.   print(s)
  307. end
  308.  
  309. -----------------------------------------------------------------------------
  310. --
  311. -- 14788
  312. do
  313.   local entries = io.read('*n')
  314.  
  315.   local rems = {}
  316.   local divider = 9
  317.  
  318.   for i = 1, entries do
  319.     local num = io.read('*n')
  320.  
  321.     local rem = num % divider
  322.     rems[rem] = (rems[rem] or 0) + 1
  323.     print('rem', rem, 'n', rems[rem])
  324.   end
  325.  
  326.   local s = rems[0] and math.floor((rems[0] * (rems[0] - 1) / 2)) or 0
  327.  
  328.   for i = 1, 4 do
  329.     if rems[i] and rems[divider-i] then
  330.       s = s + rems[i] * rems[divider-i]
  331.     end
  332.   end
  333.  
  334.   print(s)
  335. end
  336.  
  337. -----------------------------------------------------------------------------
  338. --
  339. -- 15643
  340. do
  341.   local entries = io.read('*n')
  342.  
  343.   local d2, d17, d = 0, 0, 0
  344.   for i = 1, entries do
  345.     local num = io.read('*n')
  346.  
  347.     if num % 2 == 0 and num % 17 ~= 0 then
  348.       d2 = d2 + 1
  349.     elseif num % 2 ~= 0 and num % 17 == 0 then
  350.       d17 = d17 + 1
  351.     elseif num % 2 ~= 0 and num % 17 ~= 0 then
  352.       d = d + 1
  353.     end
  354.   end
  355.  
  356.   local all = math.floor(d2 * (d2 - 1) / 2) + math.floor(d17 * (d17 - 1) / 2)
  357.                 + math.floor(d * (d - 1) / 2) + d2 * d + d * d17
  358.   print(all)
  359. end
  360.  
  361. -----------------------------------------------------------------------------
  362. --
  363. -- 7684
  364. do
  365.   local entries = io.read('*n')
  366.  
  367.   local maxeven, maxuneven = 0, 0
  368.  
  369.   for i = 1, entries do
  370.     local num = io.read('*n')
  371.  
  372.     if num % 2 == 0 then
  373.       if num > maxeven then maxeven = num end
  374.     else
  375.       if num > maxuneven then maxuneven = num end
  376.     end
  377.   end
  378.  
  379.   local s = maxeven + maxuneven
  380.   if s % 2 == 0 then
  381.     print('-1')
  382.   else
  383.     print(s)
  384.   end
  385. end
  386.  
  387. -----------------------------------------------------------------------------
  388. --
  389. -- 7772
  390.  
  391. do
  392.   local entries = io.read('*n')
  393.   local buffer = {}
  394.   local dist = 8
  395.   local max, prod = 0, 0
  396.  
  397.   for i = 1, dist do
  398.     buffer[i % dist] = io.read('*n')
  399.   end
  400.  
  401.   for i = dist + 1, entries do
  402.     local num = io.read('*n')
  403.  
  404.     if buffer[i % dist] > max then max = buffer[i % dist] end
  405.  
  406.     if num * max > prod then prod = num * max end
  407.     buffer[i % dist] = num
  408.   end
  409.  
  410.   print(prod)
  411. end
  412.  
  413. -----------------------------------------------------------------------------
  414. --
  415. -- 7799
  416.  
  417. do
  418.   local entries = io.read('*n')
  419.   local buffer = {}
  420.   local dist = 4
  421.   local min, sum = 1001, 1001
  422.  
  423.   for i = 1, dist do
  424.     buffer[i % dist] = io.read('*n')
  425.   end
  426.  
  427.   for i = dist + 1, entries do
  428.     local num = io.read('*n')
  429.  
  430.     if buffer[i % dist] < min then min = buffer[i % dist] end
  431.  
  432.     if num + min < sum then sum = num + min end
  433.     buffer[i % dist] = num
  434.   end
  435.  
  436.   print(sum)
  437. end
  438.  
  439. -----------------------------------------------------------------------------
  440. --
  441. -- 8675
  442.  
  443. do
  444.   local entries = io.read('*n')
  445.   local buffer = {}
  446.   local dist = 10
  447.   local max, sum = 0, 0
  448.  
  449.   for i = 1, dist do
  450.     buffer[i % dist] = io.read('*n')
  451.   end
  452.  
  453.   for i = dist + 1, entries do
  454.     local num = io.read('*n')
  455.  
  456.     if buffer[i % dist] > max then max = buffer[i % dist] end
  457.  
  458.     if num^2 + max^2 > sum then sum = num^2 + max^2 end
  459.     buffer[i % dist] = math.abs(num)
  460.   end
  461.  
  462.   print(sum)
  463. end
  464.  
  465. -----------------------------------------------------------------------------
  466. --
  467. -- 9179
  468.  
  469. do
  470.   local entries = io.read('*n')
  471.   local buffer = {}
  472.   local dist = 9
  473.   local min, arm = 1001, 1001
  474.  
  475.   for i = 1, dist do
  476.     buffer[i % dist] = io.read('*n')
  477.   end
  478.  
  479.   for i = dist + 1, entries do
  480.     local num = io.read('*n')
  481.  
  482.     if buffer[i % dist] < min then min = buffer[i % dist] end
  483.  
  484.     if math.floor((num + min)/2) < arm then arm = math.floor((num + min)/2) end
  485.     buffer[i % dist] = num
  486.   end
  487.  
  488.   print(arm)
  489. end
  490.  
  491. -----------------------------------------------------------------------------
  492. --
  493. -- 9378
  494.  
  495. do
  496.   local entries = io.read('*n')
  497.   local buffer = {}
  498.   local dist = 6
  499.   local min, prod = 1001, 1001
  500.  
  501.   for i = 1, dist do
  502.     buffer[i % dist] = io.read('*n')
  503.   end
  504.  
  505.   for i = dist + 1, entries do
  506.     local num = io.read('*n')
  507.  
  508.     if buffer[i % dist] < min then min = buffer[i % dist] end
  509.  
  510.     if num * min < prod and (num * min) % 2 == 0 then prod = num * min end
  511.     buffer[i % dist] = num
  512.   end
  513.  
  514.   if prod == 1001 then print('-1') else print(prod) end
  515. end
  516.  
  517. -----------------------------------------------------------------------------
  518. --
  519. -- 9708
  520.  
  521. do
  522.   local entries = io.read('*n')
  523.   local m14, m7, m2, max = 0, 0, 0, 0
  524.  
  525.   for i = 1, entries do
  526.     local num = io.read('*n')
  527.  
  528.     if num > 0 then
  529.       if num % 2 == 0 and num % 7 ~= 0 and num > m2 then m2 = num end
  530.       if num % 7 == 0 and num % 2 ~= 0 and num > m7 then m7 = num end
  531.       if num % 14 == 0 and num > m14 then
  532.         if max < m14 then max = m14 end
  533.         m14 = num
  534.       elseif num > max then max = num end
  535.     end
  536.   end
  537.  
  538.   if m14 * max > m7 * m2 then
  539.     print(m14 * max)
  540.   else
  541.     print(m7 * m2)
  542.   end
  543. end
  544.  
  545. -----------------------------------------------------------------------------
  546. --
  547. -- 3628
  548.  
  549. do
  550.   local ln, mr, r, c = 1001, 0, 0, 0
  551.  
  552.   while true do
  553.     local num = io.read('*n')
  554.  
  555.     if num == 0 then break end
  556.     if num > ln then
  557.       r = r + num - ln
  558.     else
  559.       if r > mr then mr = r end
  560.       r = 0
  561.     end
  562.  
  563.     ln = num
  564.     c = c + 1
  565.   end
  566.  
  567.   print(c, mr)
  568. end
  569.  
  570. -----------------------------------------------------------------------------
  571. --
  572. -- 5291
  573.  
  574. do
  575.   local fn, ln, r, c = 1001, 1001, 0, 0
  576.  
  577.   while true do
  578.     local num = io.read('*n')
  579.  
  580.     if num == 0 then if r > fn then c = c + 1 end break end
  581.  
  582.     if ln < num then
  583.       r = r + num - ln
  584.     else
  585.       if r > fn then c = c + 1 end
  586.       fn = num
  587.       r = 0
  588.     end
  589.  
  590.     ln = num
  591.     print('r', r, 'fn', fn, 'ln', ln, 'c', c)
  592.   end
  593.  
  594.   print(c)
  595. end
  596.  
  597. -----------------------------------------------------------------------------
  598. --
  599. -- 5503
  600.  
  601. do
  602.   local entries = io.read('*n')
  603.   local buffer = {}
  604.   local dist = 6
  605.   local min, prod = 1001, 1001
  606.  
  607.   for i = 1, dist do
  608.     buffer[i % dist] = io.read('*n')
  609.   end
  610.  
  611.   for i = dist + 1, entries do
  612.     local num = io.read('*n')
  613.  
  614.     if buffer[i % dist] < min then min = buffer[i % dist] end
  615.  
  616.     if num * min < prod and (num * min) % 2 == 0 then prod = num * min end
  617.     buffer[i % dist] = num
  618.   end
  619.  
  620.   if prod == 1001 then print('-1') else print(prod) end
  621. end
  622.  
  623. -----------------------------------------------------------------------------
  624. --
  625. -- 9378
  626.  
  627. do
  628.   local entries = io.read('*n')
  629.   local buffer = {}
  630.   local dist = 6
  631.   local min, prod = 1001, 1001
  632.  
  633.   for i = 1, dist do
  634.     buffer[i % dist] = io.read('*n')
  635.   end
  636.  
  637.   for i = dist + 1, entries do
  638.     local num = io.read('*n')
  639.  
  640.     if buffer[i % dist] < min then min = buffer[i % dist] end
  641.  
  642.     if num * min < prod and (num * min) % 2 == 0 then prod = num * min end
  643.     buffer[i % dist] = num
  644.   end
  645.  
  646.   if prod == 1001 then print('-1') else print(prod) end
  647. end
  648.  
  649. -----------------------------------------------------------------------------
  650. --
  651. -- 9378
  652.  
  653. do
  654.   local entries = io.read('*n')
  655.   local buffer = {}
  656.   local dist = 6
  657.   local min, prod = 1001, 1001
  658.  
  659.   for i = 1, dist do
  660.     buffer[i % dist] = io.read('*n')
  661.   end
  662.  
  663.   for i = dist + 1, entries do
  664.     local num = io.read('*n')
  665.  
  666.     if buffer[i % dist] < min then min = buffer[i % dist] end
  667.  
  668.     if num * min < prod and (num * min) % 2 == 0 then prod = num * min end
  669.     buffer[i % dist] = num
  670.   end
  671.  
  672.   if prod == 1001 then print('-1') else print(prod) end
  673. end
  674.  
  675. -----------------------------------------------------------------------------
  676. --
  677. -- 9378
  678.  
  679. do
  680.   local entries = io.read('*n')
  681.   local buffer = {}
  682.   local dist = 6
  683.   local min, prod = 1001, 1001
  684.  
  685.   for i = 1, dist do
  686.     buffer[i % dist] = io.read('*n')
  687.   end
  688.  
  689.   for i = dist + 1, entries do
  690.     local num = io.read('*n')
  691.  
  692.     if buffer[i % dist] < min then min = buffer[i % dist] end
  693.  
  694.     if num * min < prod and (num * min) % 2 == 0 then prod = num * min end
  695.     buffer[i % dist] = num
  696.   end
  697.  
  698.   if prod == 1001 then print('-1') else print(prod) end
  699. end
  700.  
  701. -----------------------------------------------------------------------------
  702. --
  703. -- 9378
  704.  
  705. do
  706.   local entries = io.read('*n')
  707.   local buffer = {}
  708.   local dist = 6
  709.   local min, prod = 1001, 1001
  710.  
  711.   for i = 1, dist do
  712.     buffer[i % dist] = io.read('*n')
  713.   end
  714.  
  715.   for i = dist + 1, entries do
  716.     local num = io.read('*n')
  717.  
  718.     if buffer[i % dist] < min then min = buffer[i % dist] end
  719.  
  720.     if num * min < prod and (num * min) % 2 == 0 then prod = num * min end
  721.     buffer[i % dist] = num
  722.   end
  723.  
  724.   if prod == 1001 then print('-1') else print(prod) end
  725. end
  726.  
  727. -----------------------------------------------------------------------------
  728. --
  729. -- 6436
  730.  
  731. do
  732.   local entries = io.read('*n')
  733.  
  734.   local t = {}
  735.  
  736.   for i = 1, 16 do
  737.     t[i] = 0
  738.   end
  739.  
  740.   for i = 1, entries do
  741.     local num = io.read('*n')
  742.     t[num] = (t[num] or 0) + 1
  743.   end
  744.  
  745.   local k = 0
  746.   for i = 1, 16 do
  747.     if k < t[i] then k = t[i] end
  748.   end
  749.  
  750.   for j = k, 1, -1 do
  751.     for i = 1, 16 do
  752.       if j == t[i] then print(i, t[i]) end
  753.     end
  754.   end
  755. end
  756.  
  757. -----------------------------------------------------------------------------
  758. --
  759. -- 6906
  760.  
  761. do
  762.   local entries = io.read('*n')
  763.  
  764.   local x_min, x_max, y_min, y_max = 0, 0, 0, 0
  765.   local s = 0
  766.  
  767.   for i = 1, entries do
  768.     local x, y = io.read('*n'), io.read('*n')
  769.  
  770.     if y == 0 then
  771.       if x_min > x then x_min = x end
  772.       if x_max < x then x_max = x end
  773.     elseif y_min > y then y_min = y
  774.     elseif y_max < y then y_max = y end
  775.   end
  776.  
  777.   if x_max > x_min and y_min < 0 and y_max > 0 then
  778.     print(x_max, x_min, y_min, y_max)
  779.     s = (x_max-x_min) * (y_max-y_min) / 2
  780.   else
  781.     s = 0
  782.   end
  783.  
  784.   print(s)
  785. end
  786.  
  787. -----------------------------------------------------------------------------
  788. --
  789. -- 3130
  790.  
  791. do
  792.   local entries = io.read('*n')
  793.  
  794.   local pos, neg = {}, {}
  795.  
  796.   for i = 1, entries do
  797.     local num = io.read('*n')
  798.  
  799.     if num > 0 then
  800.       pos[#pos + 1] = num
  801.     elseif num < 0 then
  802.       neg[#neg + 1] = num
  803.     end
  804.   end
  805.  
  806.   for i = 1, #neg do
  807.     print(neg[i])
  808.   end
  809.  
  810.   for i = 1, #pos do
  811.     print(pos[i])
  812.   end
  813. end
  814.  
  815. -----------------------------------------------------------------------------
  816. --
  817. -- 9777
  818.  
  819. do
  820.   local entries = io.read('*n')
  821.  
  822.   local max_x, max_y = 0, 0
  823.  
  824.   for i = 1, entries do
  825.     local x, y = io.read('*n'), io.read('*n')
  826.  
  827.     if y == 0 then
  828.       if math.abs(x) > max_x then max_x = math.abs(x) end
  829.     elseif x == 0 then
  830.       if math.abs(y) > max_y then max_y = math.abs(y) end
  831.     end
  832.   end
  833.  
  834.   s = max_x * max_y / 2
  835.   if s == 0 then print('Треугольник не существует')
  836.   else print(s) end
  837. end
  838.  
  839. -----------------------------------------------------------------------------
  840. --
  841. -- 5258
  842.  
  843. do
  844.   local entries = io.read('*n')
  845.  
  846.   local K, R, xA, yA = {}, {}, {}, {}
  847.  
  848.   for i = 1, 4 do
  849.     K[i] = 0
  850.     R[i] = 0
  851.   end
  852.  
  853.   for i = 1, entries do
  854.     local x, y = io.read('*n'), io.read('*n')
  855.     local q = 0
  856.  
  857.     if x > 0 and y > 0 then
  858.       q = 1
  859.     elseif x < 0 and y > 0 then
  860.       q = 2
  861.     elseif x < 0 and y < 0 then
  862.       q = 3
  863.     elseif x > 0 and y < 0 then
  864.       q = 4
  865.     end
  866.  
  867.     if q > 0 then
  868.       K[q] = K[q] + 1
  869.  
  870.       if R[q] == 0 or R[q] > math.min(math.abs(x), math.abs(y)) then
  871.         R[q] = math.min(math.abs(x), math.abs(y))
  872.       end
  873.  
  874.       xA[q], yA[q] = x, y
  875.     end
  876.   end
  877.  
  878.   local q = 1
  879.   for i = 2, 4 do
  880.     if K[i] > K[q] or K[i] == K[q] and R[i] < R[q] then
  881.       q = i
  882.     end
  883.   end
  884.  
  885.   print('K: ', q)
  886.   print('M: ', K[q])
  887.   print('A: (' .. xA[q] .. ', ' .. yA[q] .. ')')
  888.   print('R: ', R[q])
  889. end
  890.  
  891. -----------------------------------------------------------------------------
  892. --
  893. -- 5258
  894.  
  895. do
  896.   local entries = io.read('*n')
  897.  
  898.   for i = 1, entries do
  899.     local num = io.read('*n')
  900.   end
  901. end
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement