Divizibilitate

1. Verificare numar prim
#include <iostream>
#include <cmath>

using namespace std;

int main ()
{
    int n,i,OK;
    cout<<"n=";cin>>n;
    OK=1;
    for (i=2;i<=sqrt(n)&&OK==1;i++)
        if(n%i==0) OK=0;
    if (OK==1) cout<<"DA";
    else cout<<"NU";
    return 0;
}


2. Numar perfect
#include <iostream>

using namespace std;

int main ()
{
    int n,i,S;
    cout<<"n=";cin>>n;
    S=0;
    for (i=1;i<=n/2;i++)
        if (n%i==0) S=S+i;
    if (S==n) cout<<"DA";
    else cout<<"NU";
    return 0;
}
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s