Tham Khảo:
#include <bits/stdc++.h>
using namespace std;
bool prime(int n)
{
if (n < 2)
{
return false;
}
for (int i = 2; i < n; i++)
{
if (n % i == 0)
{
return false;
}
}
return true;
}
int sumOfNumber(int n)
{
int sum = 0;
while (n > 0)
{
sum += n % 10;
n /= 10;
}
return sum;
}
bool isValidNumber(int n)
{
int m = sumOfNumber(n);
return prime(m);
}
int main()
{
freopen("SDIGIT.INP", "r", stdin);
freopen("SDIGIT.OUT", "w", stdout);
int n, a, b;
cin >> n;
for(int x = 0; x < n; x++)
{
cin >> a >> b;
int count = 0;
for (int i = pow(10, a-1); i < pow(10, b); i++)
{
if (isValidNumber(i) == true) count = count + 1;
}
cout << count << endl;
}
return 0;
}
5 / 5 - (2 Đánh Giá)

