raven29

-module(teams).
-export([start/0, sets/1]).

start() ->
    Pid = spawn(fun loop/0),
    spawn(teams, sets, [Pid]).
    
loop() -> 
    process_flag(trap_exit, true), 
    loop([], 0).

raven29

class FenwickTree
  
  def initialize(n)
    @n = n
    @t = Array.new(n, 0)
  end
  
  def update(i, delta)
    while i < @n do

raven29

class FenwickTree
  
  def initialize(n)
    @n = n
    @t = Array.new(n, 0)
  end
  
  def update(i, delta)
    while i < @n do
      @t[i] += delta

raven29

class FenwickTree
  
  def initialize(n)
    @n = n
    @t = Array.new(n, 0)
  end
  
  def update(i, delta)
    while i < @n do
      @t[i] += delta

raven29

class SumCheckerHash
  
  def initialize(file_name)
    @hsh = {}
    File.open(file_name).each{|line| @hsh[line.to_i] = @hsh[line.to_i].nil? ? 1 : (@hsh[line.to_i]+1)}
  end
  
  def check(sum)
    @hsh.each_key{|i| return true if @hsh.has_key?(sum - i) && ((2*i != sum) || (@hsh[i] > 1))}
    return false

raven29

class MySortedArray < Array

  def initialize(ary)
    super(ary.sort!)
  end
  
  def search_binary(el, start_pos=0, end_pos=self.length-1)
    if start_pos == end_pos - 1
      if self[start_pos] == el or self[end_pos] == el
        return true

raven29

class File
  
  attr_reader :pos_start_line, :eol_length
    
  def set_eol_length
    rewind
    str = gets
    @eol_length = self.pos - str.length + 1
    rewind
  end

raven29

class File
  
  attr_reader :pos_start_line
  
  def seek_line(pos)
    if pos < 1
      seek(0)
      @pos_start_line = 0
      return gets 
    else