Untitled
unknown
plain_text
5 years ago
790 B
161
Indexable
#include <stdio.h>
#include <math.h>
bool ktsnt(long long int n)
{
if (n < 2)
{
return false;
}
for (long long int i = 1; i < sqrt(n); i++)
{
if (n % i ==0)
{
return false;
}
return true;
}
}
bool csnt(long long int n)
{
while (n--)
{
if (!ktsnt(n%10))
{
return false;
}
n /= 10;
}
return true;
}
bool tcs(long long int n)
{
int sum = 0;
while (n--)
{
sum = sum + n % 10;
n /= 10;
}
return(ktsnt(sum));
}
int main()
{
int sobotest;
scanf("%d", &sobotest);
for (int j = 1; j <= sobotest, j++)
{
long long int a, b;
scanf("%lli", &a);
scanf("%lli", &b);
for (long long int i = a; i <= b; i++)
{
if (ktsnt(i) && csnt(i) && tcs(i))
{
printf("%d ", i);
}
}
}
}Editor is loading...