Salut!
Ai rezolvarea in limbaj C++ mai jos
#include <iostream>
using namespace std;
bool prim(int n)
{
if (n <= 1)
{
return false;
}
else
{
for (int i = 2; i <= n / 2; i++)
{
if (n % i == 0)
{
return false;
break;
}
}
}
return true;
}
int nrCif(int n)
{
int s = 0;
while (n != 0)
{
int c = n % 10;
s++;
n /= 10;
}
return s;
}
int main()
{
int n, s = 0;
cin >> n;
for (int i = 1; i <= n; i++)
{
int x;
cin >> x;
if (prim(x) == true)
{
s += nrCif(x);
}
}
cout << s;
return 0;
}
