Primality Test : PRB01 | CodeChef Solution

2 min read

Problem

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 .

All Weeks CodeChef Solution | Please Share With Your friends 😉😊

Input Format

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 Format

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

Constraints

1 ≤ T ≤ 20
1 ≤ N ≤ 100000
$1 \leq T \leq 100$

Example / Sample:

Input:

Output:

yes
yes
no
no
yes

Solution

#include <iostream>
using namespace std;

// Solution from : Code Radius [ https://radiuscode.blogspot.com/ ]

int main() {
 ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n,t,i,y;
    cin>>t;
    while(t--)
    {
        cin>>n;
        if(n==1)
            cout<<"no"<<endl;
        else{
            y=0;
            for(i=2; i*i<=n; i++)
            {
                if(n%i==0)
                {
                    y=1;
                    break;
                }
            }
            if(y==0)
                cout<<"yes"<<endl;
            else
                cout<<"no"<<endl;
        }

    }
 return 0;

}

Please First Try to Solve Problem by Yourself.

Code Radius 2