Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- //se considera un tablou bidimensional cu n linii n coloane. Sa se construiasca un vector ce contine toate numerele prime aflate sub
- //diagonala principala. Sa se elimine din vector toate numerele ce au cifrele in ordine descrescatoare.
- //citire matrice
- //afisare vector
- //verificare nr prim
- //eliminare din vector
- void citire(int &n,int a[11][11])
- {
- int i,j;
- cin>>n;
- for(i=1;i<=n;i++)
- for(j=1;j<=n;j++)
- cin>>a[i][j];
- }
- int prim(int n)
- {
- int i;
- if(n<2)
- return 0;
- for(i=2;i*i<=n;i++)
- if(n%i==0)
- return 0;
- return 1;
- }
- void vector(int a[11][11],int n,int x[11], int &k)
- {
- int i,j;
- k=0;
- for(i=1;i<=n;i++)
- for(j=1;j<=n;j++)
- if(i>j&&prim(a[i][j])==1)
- {
- k++;
- x[k]=a[i][j];
- }
- }
- int descrescator(int n)
- {
- while(n>9){
- if(n%10>n/10%10)
- return 0;
- n=n/10;}
- return 1;
- }
- void eliminare(int &n, int x[10], int k)
- {
- int i;
- for(i=k+1;i<=n;i++)
- x[i-1]=x[i];
- n--;
- }
- void afisare(int x[10], int n)
- {
- for(int i=1;i<=n;i++)
- cout<<x[i]<<" ";
- }
- int main()
- {
- int i, a[11][11], x[61],n,k;
- citire(n,a);
- vector(a,n,x,k);
- for(i=1;i<=k;i++)
- if(descrescator(x[i])==1)
- {
- eliminare(k,x,i);
- i--;
- }
- afisare(x,n);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement