Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int prim(int n)
- {
- if (n<2) return 0;
- if (n==2) return 1;
- for(int i=2; i<n/2; i++)
- {
- if(n%i==0) return 0;
- }
- return 1;
- }
- void citire(int n, int x[])
- {
- for(int i=1; i<=n; i++)
- {
- cin >> x[i];
- }
- }
- int cmin(int n)
- {
- int min=10;
- while(n>0)
- {
- if(n%10<min) min = n%10;
- n/=10;
- }
- return min;
- }
- void afisare(int n, int x[])
- {
- for(int i=1; i<=n; i++)
- {
- if(cmin(x[i]==i)) cout << x[i] << ' ';
- }
- cout << '\n';
- }
- int eprim(int n, int x[])
- {
- for(int i=1; i<=n; i++)
- {
- return prim(x[i]);
- }
- return 0;
- }
- int main()
- {
- int x[20], n;
- cin >> n;
- citire(n, x);
- afisare(n, x);
- cout << (eprim(n, x)) ? "Exista nr. prim" : "Nu exista";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement