fork download
copy 
  1. import math
  2.  
  3. def solution(i):
  4.     # edge cases
  5.     if type(i) != int: return False
  6.     if i < 0: return False
  7.     if i == 0: return "23571"
  8.     if i == 1: return "35711"
  9.     if i == 2: return "57111"
  10.  
  11.     primeNumbersCount = 0
  12.     numberToCheck = 2
  13.     primeNumbersString = ""
  14.  
  15.     while primeNumbersCount < i + 5:
  16.         isPrime = True
  17.         for j in range(2, math.floor(numberToCheck / 2)):
  18.             if numberToCheck % j == 0:
  19.                 isPrime = False
  20.                 break
  21.         if isPrime:
  22.             if primeNumbersCount > i:
  23.                 primeNumbersString += str(numberToCheck)
  24.             primeNumbersCount += 1
  25.         numberToCheck += 1
  26.     return primeNumbersString[0:5]
  27.  
  28. print(solution(6))
Success #stdin #stdout 0.03s 9020KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
17192
https://ideone.com/nPZb5R
language:
Python 3 (python  3.9.5)
created:
1 year ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!