Primality Test - CodeChef Solution

Hello coders, today we are going to solve Primality Test CodeChef Solution whose Problem Code is PRB01. Alice and Bob are meeting after a long time. A

Hello coders, today we are going to solve Primality Test CodeChef Solution whose Problem Code is PRB01.

Primality Test - CodeChef Solution

Task

Alice and Bob are meeting after a long time. As usual they love to play some math games. This times Alice takes the call and decides the game. The game is very simple, Alice says out an integer and Bob has to say whether the number is prime or not. Bob as usual knows the logic but since Alice doesn't give Bob much time to think, so Bob decides to write a computer program.

Help Bob accomplish this task by writing a computer program which will calculate whether the number is prime or not.

Input

The first line of the input contains an integer T, the number of testcases. T lines follow.

Each of the next T lines contains an integer N which has to be tested for primality.

Output

For each test case output in a separate line, "yes" if the number is prime else "no."

Constraints

  • 1 <= T <= 20
  • 1 <= N <= 100000

Sample Input:

5
23
13
20
1000
99991

Sample Output:

yes
yes
no
no
yes

Solution - Primality Test - CodeChef Solution 

Python 3 

#Solution Provided by Sloth Coders
T = int(input())
for i in range(T):
    num = int(input())
    l = 0
    for j in range (1, num + 1):
        if (num % j == 0):
            l = l + 1
    if (l == 2):
        print("yes")
    else:
        print("no")

Disclaimer: The above Problem (Primality Test) is generated by CodeChef but the Solution is provided by Sloth Coders. This tutorial is only for Educational and Learning Purpose.

A Sloth Who loves to Code

Also Read:

Sloth Coders is a Learning Platform for Coders, Programmers and Developers to learn from the basics to advance of Coding of different langauges(python, Java, Javascript and many more).

Post a Comment