-
Code require "prime" def is_prime(n) n.prime? end
Test Cases Test.describe "Fixed Tests" do Test.it 'Basic Test Cases' do Test.assert_equals(is_prime(2), true) Test.assert_equals(is_prime(3), true) Test.assert_equals(is_prime(5), true) Test.assert_equals(is_prime(3571), true) Test.assert_equals(is_prime(0), false) Test.assert_equals(is_prime(1), false) Test.assert_equals(is_prime(4), false) Test.assert_equals(is_prime(3572), false) Test.assert_equals(is_prime(25), false) end end Test.describe "Random Tests" do Test.it "should pass random tests" do require "prime" sol = ->(n) do n.prime? end 100.times do num = rand(0..10**rand(1..5)) Test.assert_equals(is_prime(num), sol.(num)) end end end
Output:
-
Code is_prime = lambda n: n == 2 or n > 2 and n % 2 and all(n % i for i in range(3, int(n**.5) + 1, 2))- require "prime"
- def is_prime(n)
- n.prime?
- end
Test Cases import codewars_test as testfrom solution import is_prime@test.describe("Fixed Tests")def fixed_tests():@test.it('Basic Test Cases')def basic_test_cases():test.assert_equals(is_prime(2), True)test.assert_equals(is_prime(3), True)test.assert_equals(is_prime(5), True)test.assert_equals(is_prime(3571), True)test.assert_equals(is_prime(0), False)test.assert_equals(is_prime(1), False)test.assert_equals(is_prime(4), False)test.assert_equals(is_prime(3572), False)test.assert_equals(is_prime(25), False)- Test.describe "Fixed Tests" do
- Test.it 'Basic Test Cases' do
- Test.assert_equals(is_prime(2), true)
- Test.assert_equals(is_prime(3), true)
- Test.assert_equals(is_prime(5), true)
- Test.assert_equals(is_prime(3571), true)
- Test.assert_equals(is_prime(0), false)
- Test.assert_equals(is_prime(1), false)
- Test.assert_equals(is_prime(4), false)
- Test.assert_equals(is_prime(3572), false)
- Test.assert_equals(is_prime(25), false)
- end
- end
@test.describe("Random Tests")def random_tests():- Test.describe "Random Tests" do
- Test.it "should pass random tests" do
from random import randint- require "prime"
for _ in range(100):num = randint(0, 10**randint(1,5))expected = num == 2 or num > 2 and num % 2 and all(num % i for i in range(3, int(num**.5) + 1, 2))@test.it(f"testing for is_prime({num})")def test_case():test.assert_equals(is_prime(num), expected)- sol = ->(n) do
- n.prime?
- end
- 100.times do
- num = rand(0..10**rand(1..5))
- Test.assert_equals(is_prime(num), sol.(num))
- end
- end
- end
- All
- {{group.name}} ({{group.count}})
This comment has been reported as {{ abuseKindText }}.
Show
This comment has been hidden. You can view it now .
This comment can not be viewed.
- |
- Reply
- Edit
- View Solution
- Expand 1 Reply Expand {{ comments?.length }} replies
- Collapse
- Remove
- Remove comment & replies
- Report
{{ fetchSolutionsError }}