Problema

1. Tipareste elementele pare aflate pe pozitii divizibile

#include<iostream.h>
Void main()
{int v[100],i,n;
Cout<<”n=”;cin>>n;
For(i=0;i<n;i++)
{cout<<”v[“<<i<<”]=”; cin>>v[i];};
For(i=0;i<n;i++)
If ( v[i]%2==0 && i%3==0) cout<<v[i]<<” “;}

2. Elementele prime si numarul acestora

#include<iostream.h>
Void main()
{int v[100],i,n,nr,gasit,j;
Cout<<”n=”;cin>>n;
For(i=0;i<n;i++)
{cout<<”v[“<<i<<”]=”; cin>>v[i];};
nr=0;
for(i=0;i<n;i++)
{gasit=1;
For( j=2;j<v[i]/2;j++)
If(v[i]%j==0) gasit=0;
If ( gasit==1) {cout<<v[i]<<” “;nr=nr+1;};};
Cout<<”numarul elementelor prime este”<<nr;}