alprog2/5-7

5.

#include <iostream>
#include <cmath>

using namespace std;
int sdiv(int y)
{
    int os=0;
    for(int i=1;i<=y/2;i++)
        if(y%i==0) os=os+i;

    return os+y;

}
int prim(int n)
{
    if(n<2) return 0;
    for(int i=2;i<=sqrt(n);i++)
        if(n%i==0) return 0;
    return 1;
}
int vinetta(int y)
{
    int x=sdiv(y);
    if(prim(x)==1) cout<<"DA";
    else cout<<"NU";
}
int main()
{
    int y;
    cout<<"Y ";cin>>y;
    cout<<"Osztok osszege "<<sdiv(y)<<endl;
    cout<<vinetta(y);
    return 0;
}
+++++++++++++++++++++++++++++++++++
6.

#include <iostream>
#include <cmath>
using namespace std;
int prim(int n)
{
    if(n<2) return 0;
    for(int i=2;i<=sqrt(n);i++)
        if(n%i==0) return 0;
    return 1;
}
int egy(int n)
{
    int db=0;
    while(n!=0)
    {
        if(n%10==1)db++;

        n=n/10;
    }
    return db;
}
int paros(int a,int b)
{
    int db=0;
    for(int i=a;i<=b;i++)
        if(i%2==0) db++;
    return db;
}
int vane(int n)
{
    int x=egy(n);
    if(x!=0) return 1;
    return 0;
}
int main()
{
    int a,b;
    int db=0, db1=0;
    cout<<"A ";cin>>a;
    cout<<"B ";cin>>b;
    cout<<"Paros szamok szama "<<paros(a,b)<<endl;
    cout<<"Tobb mint 2db 1-st tartalmaz: ";
    for(int i=a;i<=b;i++){
    if(egy(i)>1)cout<<i;
    if(prim(i)==1) db++;
    if(vane(i)==1)db1++;

    }
    cout<<endl;
    cout<<db<<" primszam van"<<endl;
    cout<<db1<<" szamban szerepel 1es"<<endl;

    return 0;
}
+++++++++++++++++++++++++++++++++++
7.

#include <iostream>
#include <cmath>
using namespace std;
int szjegy(int n, int p1, int p2)
{
    int db=0;
    while(n!=0)
    {
        if(n%10>p1 && n%10<p2) db++;
        n=n/10;
    }
    return db;
}
int prim(int n)
{
    if(n<2) return 0;
    for(int i=2;i<=sqrt(n);i++)
        if(n%i==0) return 0;
    return 1;
}
void szamok()
{
   for(int i=1000;i<=9999;i++)
        if(prim(i)==1 && szjegy(i,4,6)==2)
           cout<<i<<" ";
}
int main()
{
    szamok();
    return 0;
}