PrimeSpec

#include<iostream>
using namespace std;

int ngto[]={0,0,1,1,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,1,0,0,0,0,0,1,0,0};

bool NgtoBe(int num)
{
    return ngto[num];
}

bool Ngto(int num)
{
    if (num<2)
        return false;
    for (int i=2;i*i<=num;i++)
        if (!(num%i))
            return false;
    return true;
}

bool KoGiam(int num)
{
    int prev=num%10;
    num=num/10;
    while (num%10 <= prev)
    {
        prev = num%10;
        num=num/10;
        if (!num)
            break;
    }
    if (num)
        return false;
    return true;
}

int sum(int num)
{
    int s=0;
    while (num>0)
    {
        s+=num%10;
        num=num/10;
    }
    return s;
}

int main()
{
    for (int i=1111111;i<=9999999;i++)
        if (KoGiam(i))
            if (NgtoBe(sum(i)))
                if (Ngto(i))
                    cout << i << " ";
    return 0;
}