Question

VerifPrim #45 pbinfo de 100 va rog!

Answer 1

#include<iostream>

#include<cmath>

using namespace std;

int main()

{

   int n;

   cin>>n;

   int ok=1;

   for(int d=2;d<=sqrt(n) && ok==1;d++)

       if(n%d==0)  

       ok=0;

   if(ok==1 && n>1)  

       cout<<"DA";

   else  

       cout<<"NU";

   return 0;

}

Answer 2

#include <iostream>

using namespace std;

int main()

{

int i, x, n, ok;

cin>>n;

ok = 1;

if(n == 1 || n == 0)

ok = 0;

x = n/2; /*bine, mai acurate e sa ii dai x = radical din n, adica sqrt(n) si face mai putini pasi, dar si asa e corect*/

for(i = 2; i<=x; i++)

if(n%i == 0)

ok = 0;

if(ok == 1)

cout<<"Nr prim";

else

cout<<"Nr nu e prim";

return 0;

}