You are on page 1of 1

#include <iostream>

using namespace std;

bool prim (int a)


{
int i;
if(a<=1)
return false;
if(a==2)
return true;
if(a%2==0)
return false;
for(i=3;i*i<=a;i+=2)
if(a%i==0)
return false;
return true;
}

int main()
{
int n,m,v[101][101],i,j,k=0;
cin>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
cin>>v[i][j];
for(i=2;i<=n;i+=2)
for(j=1;j<=m;j++)
if(prim(v[i][j])==true)
k++;
cout<<k;
return 0;
}

You might also like