tasks_gem 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 6732a76a919bedc6f51aaeee8d3aeea161f1504afda79215267a1b797c90fcef
+  data.tar.gz: 14b23e00033338811349e03ad38162bdd8692bdff014fa5eef7e2009356afcfa
+SHA512:
+  metadata.gz: 8a7e217f0b98dc5839c765eb8447b8ebfd27bba59b1db38659f3b2db601ed186a4a5a8f9bbfd37fb5692295a33b7bd2eaf9e61db94d5885259c293d4484166bf
+  data.tar.gz: cff1e5e7aeb02f823ec58fe30a2a1e5fc71136ffb8ee43e601da2c65bfd63d4c6d83ff447e0ef60bbd71831b3e10e558b01463bf2fd78eed4c0d8ccfd958c83a

data/.gitignore

@@ -0,0 +1,12 @@
+/.bundle/
+/.yardoc
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+.idea/
+
+# rspec failure tracking
+.rspec_status

data/.rspec

@@ -0,0 +1,3 @@
+--format documentation
+--color
+--require spec_helper

data/.travis.yml

@@ -0,0 +1,7 @@
+---
+sudo: false
+language: ruby
+cache: bundler
+rvm:
+  - 2.5.3
+before_install: gem install bundler -v 1.17.1

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,74 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+In the interest of fostering an open and welcoming environment, we as
+contributors and maintainers pledge to making participation in our project and
+our community a harassment-free experience for everyone, regardless of age, body
+size, disability, ethnicity, gender identity and expression, level of experience,
+nationality, personal appearance, race, religion, or sexual identity and
+orientation.
+
+## Our Standards
+
+Examples of behavior that contributes to creating a positive environment
+include:
+
+* Using welcoming and inclusive language
+* Being respectful of differing viewpoints and experiences
+* Gracefully accepting constructive criticism
+* Focusing on what is best for the community
+* Showing empathy towards other community members
+
+Examples of unacceptable behavior by participants include:
+
+* The use of sexualized language or imagery and unwelcome sexual attention or
+advances
+* Trolling, insulting/derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or electronic
+  address, without explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+  professional setting
+
+## Our Responsibilities
+
+Project maintainers are responsible for clarifying the standards of acceptable
+behavior and are expected to take appropriate and fair corrective action in
+response to any instances of unacceptable behavior.
+
+Project maintainers have the right and responsibility to remove, edit, or
+reject comments, commits, code, wiki edits, issues, and other contributions
+that are not aligned to this Code of Conduct, or to ban temporarily or
+permanently any contributor for other behaviors that they deem inappropriate,
+threatening, offensive, or harmful.
+
+## Scope
+
+This Code of Conduct applies both within project spaces and in public spaces
+when an individual is representing the project or its community. Examples of
+representing a project or community include using an official project e-mail
+address, posting via an official social media account, or acting as an appointed
+representative at an online or offline event. Representation of a project may be
+further defined and clarified by project maintainers.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported by contacting the project team at nonalatus@ukr.net. All
+complaints will be reviewed and investigated and will result in a response that
+is deemed necessary and appropriate to the circumstances. The project team is
+obligated to maintain confidentiality with regard to the reporter of an incident.
+Further details of specific enforcement policies may be posted separately.
+
+Project maintainers who do not follow or enforce the Code of Conduct in good
+faith may face temporary or permanent repercussions as determined by other
+members of the project's leadership.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4,
+available at [http://contributor-covenant.org/version/1/4][version]
+
+[homepage]: http://contributor-covenant.org
+[version]: http://contributor-covenant.org/version/1/4/

data/Gemfile

@@ -0,0 +1,6 @@
+source "https://rubygems.org"
+
+git_source(:github) {|repo_name| "https://github.com/#{repo_name}" }
+
+# Specify your gem's dependencies in tasks_gem.gemspec
+gemspec

data/Gemfile.lock

@@ -0,0 +1,37 @@
+PATH
+  remote: .
+  specs:
+    tasks_gem (0.1.0)
+
+GEM
+  remote: https://rubygems.org/
+  specs:
+    diff-lcs (1.3)
+    rake (10.5.0)
+    rspec (3.8.0)
+      rspec-core (~> 3.8.0)
+      rspec-expectations (~> 3.8.0)
+      rspec-mocks (~> 3.8.0)
+    rspec-core (3.8.0)
+      rspec-support (~> 3.8.0)
+    rspec-expectations (3.8.2)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.8.0)
+    rspec-mocks (3.8.0)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.8.0)
+    rspec-support (3.8.0)
+    run_tests (0.1.1)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  bundler (~> 1.17)
+  rake (~> 10.0)
+  rspec (~> 3.0)
+  run_tests (~> 0.1.1)
+  tasks_gem!
+
+BUNDLED WITH
+   1.17.1

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2018 marina8915
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/README.md

@@ -0,0 +1,53 @@
+# Tasks
+
+50 tasks
+Book with tasks http://libgen.io/book/index.php?md5=02CEF7BC8F9FAF75690C1CBE83BE3B70
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'tasks_gem'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install tasks
+
+## Usage
+
+Example:
+```ruby
+require 'tasks_gem'
+
+puts Tasks::Task.new.task(num: 2)
+print Tasks::Task.new.number_array(digit: 2356), "\n"
+print Tasks::Task.new.task_1(number_a: 2, number_b: 5), "\n"
+```
+
+All methods:
+```ruby
+print Tasks::Task.instance_methods(false), "\n"
+```
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake spec` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+
+To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/tasks. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [Contributor Covenant](http://contributor-covenant.org) code of conduct.
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).
+
+## Code of Conduct
+
+Everyone interacting in the Tasks project’s codebases, issue trackers, chat rooms and mailing lists is expected to follow the [code of conduct](https://github.com/[USERNAME]/tasks/blob/master/CODE_OF_CONDUCT.md).

data/Rakefile

@@ -0,0 +1,6 @@
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+
+RSpec::Core::RakeTask.new(:spec)
+
+task :default => :spec

data/bin/console

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "tasks_gem"
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+# (If you use this, don't forget to add pry to your Gemfile!)
+# require "pry"
+# Pry.start
+
+require "irb"
+IRB.start(__FILE__)

data/bin/setup

@@ -0,0 +1,8 @@
+#!/usr/bin/env bash
+set -euo pipefail
+IFS=$'\n\t'
+set -vx
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/lib/tasks/version.rb

@@ -0,0 +1,3 @@
+module Tasks
+  VERSION = "0.1.0"
+end

data/lib/tasks.rb

@@ -0,0 +1,503 @@
+require "tasks/version"
+
+module Tasks
+  class Error < StandardError; end
+
+  # 50 tasks
+  class Task
+    def task(num:)
+      puts "\n Task #{num}"
+    end
+
+    # number => array, example 234 => [2, 3, 4]
+    def number_array(digit:)
+      digit.to_s.split('').map(&:to_i)
+    end
+
+    # array of prime numbers
+    def array_separators(array:)
+      array.select { |x| (1..x).select { |y| (x % y).zero? }.length <= 2 }
+    end
+
+    # matrix n x m
+    def new_matrix(n_lines:, m_lines:)
+      array = []
+      (0..(n_lines - 1)).each do |i|
+        array[i] = []
+        (0..(m_lines - 1)).each { array[i].push(rand(1..10)) }
+      end
+      print array, "\n"
+      array
+    end
+
+    # if digit not in diapason lower_bound..top_bound enter new n
+    def check_digit(digit:, lower_bound: 1, top_bound: 10)
+      until (lower_bound..top_bound).cover? digit
+        puts 'incorrect value'
+        puts 'take again'
+        digit = gets.to_i
+      end
+      digit
+    end
+
+    # array with random digits in diapason lower_bound..y
+    def new_array(quantity:, lower_bound: -100, top_bound: 100)
+      array = []
+      quantity.times { array.push(rand(lower_bound..top_bound)) }
+      print "Elements: #{array} \n"
+      array
+    end
+
+    # hint when comparing numbers
+    def hint(digit1:, digit2:)
+      if digit1 > digit2
+        'more than needed'
+      elsif digit1 < digit2
+        'less than needed'
+      end
+    end
+
+    def task_1(number_a:, number_b:)
+      task(num: 1)
+      { sum: number_a + number_b,
+        difference: number_a - number_b,
+        multiplication: number_a * number_b }
+    end
+
+    def task_2(number_a:, number_b:)
+      task(num: 2)
+      ((number_a.abs - number_b.abs) / (1 + (number_a * number_b).abs)).round(4)
+    end
+
+    def task_3(edge_length:)
+      task(num: 3)
+      { Volume: edge_length**3, Square: edge_length**2 * 6 }
+    end
+
+    def task_6(cathetus_a:, cathetus_b:)
+      task(num: 6)
+      { hypotenuse: Math.sqrt(cathetus_a**2 + cathetus_b**2).round(4),
+        Square: cathetus_a * cathetus_b / 2 }
+    end
+
+    def task_8(n_corners:, radius:)
+      task(num: 8)
+      result = 2 * radius * Math.tan(3.14 / n_corners) * n_corners
+      result.round(4)
+    end
+
+    def task_9(resistance1:, resistance2:, resistance3:)
+      task(num: 9)
+      (1 / (1 / resistance1 + 1 / resistance2 + 1 / resistance3)).round(4)
+    end
+
+    def task_10(height:)
+      task(num: 10)
+      result = Math.sqrt((2 * height) / 9.81)
+      result.round(2)
+    end
+
+    def task_12(side_of_triangle:)
+      task(num: 12)
+      result = Math.sqrt(3) * side_of_triangle / 4 * side_of_triangle**2
+      result.round(2)
+    end
+
+    def task_13(pendulum_length:)
+      task(num: 13)
+      (2 * 3.14 * Math.sqrt(pendulum_length / 9.81)).round(2)
+    end
+
+    def task_15(cathetus_a:, hypotenuse:)
+      task(num: 15)
+      cathetus_b = Math.sqrt(hypotenuse**2 - cathetus_a**2).round(2)
+      { cathetus_b: cathetus_b,
+        Square: ((cathetus_a + cathetus_b - hypotenuse) / 2).round(2) }
+    end
+
+    def task_16(circumference:)
+      task(num: 16)
+      result = Math::PI * Math.sqrt(circumference / (2 * Math::PI))
+      result.round(2)
+    end
+
+    def task_24(coordinate_x1:, coordinate_x2:, coordinate_y1:, coordinate_y2:)
+      task(num: 24)
+      difference_x = coordinate_x1 - coordinate_x2
+      difference_y = coordinate_y1 - coordinate_y2
+      result = Math.sqrt(difference_x**2 + difference_y**2)
+      result.round(2)
+    end
+
+    def task_30(real_num:)
+      task(num: 30)
+      degree3 = real_num**3
+      middle = 2 * real_num + 3 * real_num**2
+      res1 = 1 - middle - 4 * degree3
+      res2 = 1 + middle + 4 * degree3
+      { result1: res1, result2: res2 }
+    end
+
+    def task_33(real_number_x:, real_number_y:)
+      task(num: 33)
+      array = [real_number_x, real_number_y]
+      { min: array.min, max: array.max }
+    end
+
+    def task_34(real_number_x:, real_number_y:, real_number_z:)
+      task(num: 34)
+      array = [real_number_x, real_number_y, real_number_z]
+      { min: array.min, max: array.max }
+    end
+
+    def task_41(natural_number = 3)
+      task(num: 41)
+      new_array(quantity: natural_number).select { |x| x <= 3 && x >= 1 }
+    end
+
+    def task_43(natural_number = 3)
+      task(num: 43)
+      array = new_array(quantity: natural_number)
+      array2 = array.select { |x| x > 0 }.map { |x| x**2 }
+      { array: array, array2: array2 }
+    end
+
+    def task_62(integer:)
+      task(num: 62)
+      (integer % 2).zero?
+    end
+
+    def task_64(natural_number:)
+      task(num: 64)
+      natural_number / 100
+    end
+
+    def task_65(natural_number:)
+      task(num: 65)
+      sum_array = number_array(digit: natural_number).reduce(:+)
+      sum_array**3 == natural_number**2
+    end
+
+    def task_67(natural_number:)
+      task(num: 67)
+      array = number_array(digit: natural_number)
+      penultimate_number = array[array.length - 2] if natural_number >= 10
+      { digits_number: array.length,
+        sum: array.reduce(:+),
+        last_digit: array[array.length - 1],
+        first_digit: array[0],
+        penultimate_number: penultimate_number }
+    end
+
+    def task_182(natural_number:)
+      task(num: 182)
+      array = new_array(quantity: natural_number)
+      array2 = array.select { |elem| (elem % 5).zero? && elem % 7 != 0 }
+      { arr_new: array2,
+        sum: array2.reduce(:+),
+        quantity: array2.length }
+    end
+
+    def task_185(natural_number:)
+      task(num: 185)
+      array = new_array(quantity: natural_number)
+      array2 = array.select { |elem| elem > 0 }
+      sum = if array2 != []
+              array2.reduce(:+)**2
+            else
+              0
+            end
+      { array: array2, sum: sum }
+    end
+
+    def task_191(natural_number:)
+      task(num: 191)
+      quantity = 0
+      array = new_array(quantity: natural_number)
+      array.map! do |elem|
+        quantity += 1 if elem > 7
+        elem > 7 ? 7 : elem
+      end
+      { array: array, quantity: quantity }
+    end
+
+    def task_205(natural_number:)
+      task(num: 205)
+      array = new_array(quantity: natural_number)
+      { array: array,
+        max: array.map(&:abs).max,
+        sum: array.map { |x| x * x }.reduce(:+) }
+    end
+
+    def task_207(natural_number:)
+      task(num: 207)
+      arr = number_array(digit: natural_number).delete_if do |x|
+        x.zero? || x == 5
+      end
+      arr.join.to_i
+    end
+
+    def task_224(natural_number:)
+      task(num: 224)
+      (1..natural_number).select { |x| (natural_number % x).zero? }
+    end
+
+    def task_225(natural_number:)
+      task(num: 225)
+      (1..natural_number).select do |x|
+        (natural_number % x**2).zero? && natural_number % x**3 != 0
+      end
+    end
+
+    def task_230(natural_number:)
+      task(num: 230)
+      min = 1000
+      num_array = new_array(quantity: natural_number)
+      num_array.inject do |x, y|
+        min = (x - y).abs if (x - y).abs < min
+        y
+      end
+      min
+    end
+
+    def task_272(natural_number = 50)
+      task(num: 272)
+      precipitation = new_array(quantity: natural_number,
+                                lower_bound: 1,
+                                top_bound: 100)
+      average = precipitation.reduce(:+) / precipitation.size
+      deviation = []
+      precipitation.each { |x| deviation.push(x - average) }
+      { array: precipitation,
+        average: average,
+        deviation: deviation }
+    end
+
+    def task_279(natural_number:)
+      task(num: 279)
+      a = new_array(quantity: natural_number)
+      b = new_array(quantity: natural_number).reverse!
+      ab = []
+      (0..natural_number - 1).each { |i| ab.push(a[i] + b[i]) }
+      { array_a: a, array_b: b, array_ab: ab }
+    end
+
+    def task_302(natural_number:)
+      task(num: 302)
+      number = number_array(digit: natural_number)
+      number.uniq!
+      number.length
+    end
+
+    def task_317(natural_number = 10)
+      task(num: 317)
+      array = new_array(quantity: natural_number)
+      sum_array = 0
+      (0..natural_number - 1).each { |i| sum_array += array[i]**(i + 1) }
+    end
+
+    def task_325(natural_number:)
+      task(num: 325)
+      separators = (1..natural_number).select { |x| (natural_number % x).zero? }
+      array_separators(array: separators)
+    end
+
+    def task_328(lower_bound = 1, top_bound = 100)
+      task(num: 328)
+      array_separators(array: (lower_bound..top_bound))
+    end
+
+    def task_536(natural_number:)
+      task(num: 536)
+      array = new_array(quantity: natural_number)
+      { array: array, identical_elements: array != array.uniq }
+    end
+
+    def task_555(natural_number:)
+      task(num: 555)
+      puts 'pascals triangle'
+      a = []
+      (0..natural_number - 1).each do |i|
+        a[i] = []
+        a[i].push(1)
+        if i > 0
+          (0..a[i - 1].size - 2).each do |j|
+            a[i].unshift(a[i - 1][j] + a[i - 1][j + 1])
+          end
+          a[i].unshift(1)
+        end
+        print a[i], "\n"
+      end
+      a
+    end
+
+    def task_561(natural_number:)
+      task(num: 561)
+      new_array = []
+      (1..natural_number).each do |s|
+        array = number_array(digit: s * s)
+        if array.last(number_array(digit: s).size).join.to_i == s
+          new_array.push(s)
+        end
+      end
+      new_array
+    end
+
+    def task_606(side_a:, side_b:, side_c:, side_d:)
+      task(num: 606)
+      rectangle = [side_a, side_b, side_c, side_d]
+      sum_rectangle = rectangle.reduce(:+)
+      rectangle_flag = true
+      (0..3).each do |i|
+        rectangle_flag = false if (sum_rectangle - rectangle[i]) < rectangle[i]
+      end
+      rectangle_flag
+    end
+
+    def task_697(natural_number1:, natural_number2:, natural_number3:)
+      task(num: 697)
+      matrix_a = Matrix.rows(new_matrix(n_lines: natural_number1,
+                                        m_lines: natural_number2))
+      matrix_b = Matrix.rows(new_matrix(n_lines: natural_number2,
+                                        m_lines: natural_number3))
+      { matrix_a: matrix_a,
+        matrix_b: matrix_b,
+        result: matrix_a * matrix_b }
+    end
+
+    def task_698(natural_number:)
+      task(num: 698)
+      matrix = Matrix.rows(new_matrix(n_lines: natural_number,
+                                      m_lines: natural_number))
+      { matrix: matrix, result: matrix**2 }
+    end
+
+    def task_699(natural_number:)
+      task(num: 699)
+      matrix_a = Matrix.rows(new_matrix(n_lines: natural_number,
+                                        m_lines: natural_number))
+      matrix_b = Matrix.rows(new_matrix(n_lines: natural_number,
+                                        m_lines: natural_number))
+      result = matrix_a * matrix_b - matrix_b * matrix_a
+      { matrix_a: matrix_a,
+        matrix_b: matrix_b,
+        result: result }
+    end
+
+    def task_704(natural_number:)
+      task(num: 704)
+      matrix_a = Matrix.rows(new_matrix(n_lines: natural_number,
+                                        m_lines: natural_number))
+      matrix_b = Matrix.rows(new_matrix(n_lines: natural_number,
+                                        m_lines: natural_number))
+      matrix_c = Matrix.rows(new_matrix(n_lines: natural_number,
+                                        m_lines: natural_number))
+      { matrix_a: matrix_a, matrix_b: matrix_b,
+        matrix_c: matrix_c, result: (matrix_a + matrix_b) * matrix_c }
+    end
+
+    def task_710(natural_number1:, natural_number2:)
+      task(num: 710)
+      m = Matrix.rows(new_matrix(n_lines: natural_number1,
+                                 m_lines: natural_number2))
+      m.transpose
+    end
+
+    def task_822(year:)
+      task(num: 822)
+      (year % 4).zero? ? '366 days' : '365 days'
+    end
+
+    def task_823(year1:, year2:)
+      task(num: 823)
+      leap_years = 0
+      (year1..year2).each { |y| leap_years += 1 if (y % 4).zero? }
+      leap_years
+    end
+
+    def task_831(year:)
+      task(num: 831)
+      october = Time.mktime(year, 10, 1)
+      day1 = october.wday
+      if day1 < 7
+        day = 7 - day1
+        Time.mktime(year, 10, day + 1)
+      else
+        Time.mktime(year, 10, day1)
+      end
+    end
+
+    def task_986
+      task(num: 986)
+      digit = rand(0..9)
+      digit_user = ''
+      3.times do
+        puts 'Guess the digit (0..9)'
+        digit_user = check_digit(digit: gets.to_i, lower_bound: 0, top_bound: 9)
+        break if digit_user == digit
+
+        puts hint(digit1: digit_user, digit2: digit)
+      end
+      puts digit_user != digit ? "You did not guess #{digit}" : 'Right you are!'
+    end
+
+    # select horse, task 988
+    def select_horse
+      puts horses = { 1 => 'Watercolor', 2 => 'Alpha', 3 => 'Gallop' }
+      puts 'Select horses (1..3)'
+      horse_num = check_digit(digit: gets.to_i, lower_bound: 1, top_bound: 3)
+      puts horses[horse_num]
+      horse_num
+    end
+
+    # place of the horse, task 988
+    def horses_num(run:, horse_num:)
+      run.map! { |x| x + rand(1..100) }
+      text = if run[horse_num - 1] == run.max
+               'First'
+             elsif run[horse_num - 1] == run.min
+               'Last'
+             else
+               'Second'
+             end
+      puts text
+      run
+    end
+
+    def task_988
+      task(num: 988)
+      horse_num = select_horse
+      finish = 500
+      horses_run = []
+      3.times { horses_run.push(rand(1..100)) }
+      while horses_run.max < finish
+        horses_run = horses_num(run: horses_run, horse_num: horse_num)
+      end
+      puts horses_run[horse_num - 1] >= finish ? 'Victory!' : 'Try again.'
+    end
+
+    # result game 100 matches
+    def matches_result(first:, second:)
+      if first > second
+        'First is won'
+      elsif first == second
+        'Won friendship'
+      else
+        'Second is won'
+      end
+    end
+
+    def task_1009
+      puts 'Game - 100 matches \n must take from 1 to 10 matches'
+      first_player = 0
+      second_player = 0
+      until first_player >= 100 || second_player >= 100
+        puts 'first player'
+        first_player += check_digit(digit: gets.to_i)
+        puts 'second player'
+        second_player += check_digit(digit: gets.to_i)
+      end
+      puts matches_result(first: first_player, second: second_player)
+    end
+  end
+end

data/tasks.gemspec

@@ -0,0 +1,29 @@
+
+lib = File.expand_path("../lib", __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require "tasks/version"
+
+Gem::Specification.new do |spec|
+  spec.name          = "tasks_gem"
+  spec.version       = Tasks::VERSION
+  spec.authors       = ["marina8915"]
+  spec.email         = ["nonalatus@ukr.net"]
+
+  spec.summary       = %q{50 tasks}
+  spec.homepage      = "https://github.com/marina8915/tasks_gem"
+  spec.license       = "MIT"
+
+  # Specify which files should be added to the gem when it is released.
+  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
+  spec.files         = Dir.chdir(File.expand_path('..', __FILE__)) do
+    `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
+  end
+  spec.bindir        = "exe"
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.17"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "rspec", "~> 3.0"
+  spec.add_development_dependency "run_tests", "~> 0.1.1"
+end

metadata

@@ -0,0 +1,115 @@
+--- !ruby/object:Gem::Specification
+name: tasks_gem
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- marina8915
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2018-11-04 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.17'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.17'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.0'
+- !ruby/object:Gem::Dependency
+  name: run_tests
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.1.1
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 0.1.1
+description: 
+email:
+- nonalatus@ukr.net
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".rspec"
+- ".travis.yml"
+- CODE_OF_CONDUCT.md
+- Gemfile
+- Gemfile.lock
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- lib/tasks.rb
+- lib/tasks/version.rb
+- tasks-0.1.0.gem
+- tasks.gemspec
+homepage: https://github.com/marina8915/tasks_gem
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.7.7
+signing_key: 
+specification_version: 4
+summary: 50 tasks
+test_files: []