Problem:
 Score: 300 points    Problem Statement  Find the minimum prime number greater than or equal to X .      Notes  A prime number is an integer greater than 1 that cannot be evenly divided by any positive integer except 1 and itself.  For example, 2 , 3 , and 5 are prime numbers, while 4 and 6 are not.      Constraints   2 \le X \le 10^5  All values in input are integers.         Input  Input is given from Standard Input in the following format:  X       Output  Print the minimum prime number greater than or equal to X .        Sample Input 1 20      Sample Output 1 23  The minimum prime number greater than or equal to 20 is 23 .       Sample Input 2 2      Sample Output 2 2  X itself can be a prime number.       Sample Input 3 99992      Sample Output 3 100003

Solution (Python):
x = int(input())
primes = [i for i in range(2 * x)]
for i, b in enumerate(primes):
    if i < 2 or b == 0:
        continue
    else:
        m = (2 * x - 1) // i
        if m > 1:
            for j in range(2, m + 1):
                primes[i * j] = 0
print(min([i for i in primes if i >= x]))

Solution (Python):
a = int(input())
def sosutyousa(a):
    src = 2    
    while src <= a:
        if src == a:
            return a
        elif a % src == 0:
            return a + 1
        else:
            src += 1
flag = sosutyousa(a)
while a != flag:
    flag = sosutyousa(flag)
    a += 1
print(a)

Solution (Python):
import math

def is_prime(n):
    if n == 1:
        return False
    for k in range(2, int(math.sqrt(n))+ 1):
        if n % k == 0:
            return False
    return True

n = int(raw_input())
while True:
    if is_prime(n):
        print n
        break
    n += 1

Solution (Python):
import math

X=int(input())
ans = X

def is_prime(n):
  if n==1:
    return False
  for i in range(2, int(math.sqrt(n))+1):
    if n%i == 0:
      return False
  return True

while True:
  if is_prime(ans):
    print(ans)
    exit()
  ans+=1

Solution (Python):

def is_prime(n: int) -> bool:
    """
    Evaluate whether a number is prime or not.

    Args:
        n: a number to evaluate

    Returns: whether n is prime or not
    """
    if n == 2:
        return True
    if n == 1 or n % 2 == 0:
        return False
    for i in range(3, int(n ** 0.5) + 1, 2):
        if n % i == 0:
            return False
    return True


def main():
    N = int(input())
    if N != 2 and N % 2 == 0:
        N += 1
    while not is_prime(N):
        N += 2
    print(N)


if __name__ == "__main__":
    main()

Solution (Python):
A =int(input())
def Primenumber(i):
    if i == 2:
        return 2
    for j in range(2,(i//2)+1):
        if i % j == 0:
            return Primenumber(i+1)
        elif j == i//2:
            return i
            
print(Primenumber(A))

Solution (Python):
import numpy as np
n = int(input())
def is_prime(x):
	if x <= 1:
		return False
	root_n = int(np.sqrt(x))
	for i in range(2,root_n):
		if x%i == 0:
			return False
	return True

p = n

while not is_prime(p):
	p += 1
print(p)

Solution (Python):
import math

x=int(input())
while 1:
  k=1
  for i in range(2,int(math.sqrt(x))+1):
    if x%i==0:
      k=0
      break
  if k:
    print(x)
    break
  x+=1

Solution (Python):
import math
x = int(input())

def is_prime(x):
  for i in range(2, int(math.sqrt(x))+1):
    if x%i==0:
      return False
  return True

while not is_prime(x):
  x+=1
print(x)

Solution (Python):
def isprime(n):
    judgement = True
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            judgement = False
            break
    return judgement


x = int(input())

while True:
    if isprime(x):
        answer = x
        print(answer)
        exit()
    else:
        x += 1

Solution (Python):
import math
x = int(input())
i = 0
flag = True
while flag:
  for k in range(2, int(math.sqrt(x+i)) + 1):
    if (x+i) % k == 0:
      i += 1
      break
  else:
      flag = False

print(x+i)

Solution (Python):
n = int(input())
x=0
while(1):
  if n ==2:
    break
  for i in range (int((-(-n**0.5//1)))):
    if n%(i+1)==0:
      x=x+1
  if x==1:
    break
  else:
    x=0
    n=n+1
print(n)

Solution (Python):
def solve(string):
    x = int(string)
    for i in range(x, 2 * x):
        for j in range(2, int(i**0.5) + 1):
            if i % j == 0:
                break
        else:
            return str(i)


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

Solution (Python):
def solve(string):
    x = int(string)
    for i in range(x, 2 * x):
        for j in range(2, int(i**0.5)):
            if i % j == 0:
                break
        else:
            return str(i)


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))