Advertisement
Guest User

Untitled

a guest
Apr 23rd, 2018
63
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.61 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5. int main()
  6. {
  7. int n, i, j,a[100], st, dr, mijl, mijl1, aparitii[100];
  8. cin>>n;
  9. for(i=0;i<n;i++)
  10. cin>>a[i];
  11. //perechile cu aceeasi paritate
  12. st=0;
  13. dr=n-1;
  14. nmijl=(st+dr)/2;
  15. mijl1=mijl;
  16. for(i=0; i<n/2; i++)
  17. if(a[mijl1--]%2==a[mijl++]%2)
  18. cout<<"{"<<a[mijl1]<<" , "<<a[mijl]<<"}";
  19. //nr de aparitii
  20. for(i=0;i<n-1;i++)
  21. for(j=1;j<n;j++)
  22. if(a[i]==a[j])
  23. {
  24. aparitii++;
  25. }
  26. cout<<a[i]<<" apare de "<<aparitii<<" ori";
  27.  
  28. return 0;
  29. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement