Răspuns:
#include <iostream>
using namespace std;
bool superPrim(int n){
int ok=1,d,y;
y = n;
while(n!=0 && ok==1)
{
for(d=2;d<=n/2 && ok!=0;d++)
if(n % d==0)
ok=0;
if(ok==1)
n=n/10;
}
if(ok==0)
return false;
else
return true;
}
bool numarPalindrom(int numar) {
int numarInitial, numarInvers = 0;
numarInitial = numar;
while(numar)
{
int c = numar % 10;
numarInvers = numarInvers * 10 + c;
numar = numar / 10;
}
if(numarInitial == numarInvers)
return true;
else
return false;
}
int main()
{
int n, cnt=0,v[100];
cin>>n;
float ma = 0.0f;
for(int i = 0;i<n;i++){
cin>>v[i];
if(superPrim(v[i]) == true){
cnt++;
ma+=v[i];
}
if(numarPalindrom(v[i]) == true && i % 2 == 0){
cout<<v[i]<<" ";
}
}
cout<<endl;
cout<<ma/cnt<<endl;
return 0;
}
Explicație:
