Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- void citireSir(int n, int sir[]){
- for(int i=0; i<n; i++)
- cin>>sir[i];
- }
- void afisareSir(int n, int sir[]){
- for(int i=0; i<n; i++)
- cout<<sir[i]<<" ";
- cout<<endl;
- }
- bool prim(int nr){
- //cazurile particulare pt numere prime
- if(nr<2)
- return false;
- if(nr==2)
- return true;
- if(nr%2==0)
- return false;
- //cautam divizorii, daca gasim unul, returnam false ca nu e prim
- for(int i=2; i<=nr/2; i++)
- if(nr%i==0)
- return false;
- return true;
- }
- int aflarePrimulNumarPrim(int n, int sir[]){
- //returneaza indexul primului numar prim din sir, INDEXARE DE LA 0!!!
- for(int i=0; i<n; i++)
- if(prim(sir[i]))
- return i;
- return -1;
- }
- int numarDe3(int nr){
- //returneaza suma tuturor cifrelor de 3 dintr-un numar 'nr' dat ca si parametru
- int ultimaCifra;
- int contor = 0;
- while(nr){
- ultimaCifra = nr%10;
- if(ultimaCifra==3)
- contor += 3;
- nr/=10;
- }
- return contor;
- }
- int main()
- {
- int n, sir[101], index=-2;
- //citire n si sir
- cin>>n;
- citireSir(n, sir);
- //afisare sir
- afisareSir(n, sir);
- index = aflarePrimulNumarPrim(n, sir);
- if(index==-1)
- cout<<"nu exista numere prime in sir"<<endl;
- else{
- int suma = 0;
- for(int i=0; i<n; i++)
- suma += numarDe3(sir[i]);
- cout<<suma;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement