Advertisement
Skygen

11.darbs BETA

Apr 1st, 2013
57
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.62 KB | None | 0 0
  1. #include <iostream>
  2. #include <conio.h>
  3.  
  4. using namespace std;
  5.  
  6. int main()
  7. {
  8. int n,para = 0, nepara = 0,a = 0, b = 0;
  9.  
  10. cout << "Iebadiet masiva izmeru: ";
  11. cin >> n;
  12. int *array1 = new int[n];
  13. for(int i = 0;i<n;i++){ cout << "Ievadiet masica " << i+1 << " elementu: "; cin >> array1[i];
  14. if(array1[i]<0) array1[i] = array1[i]*2;
  15. if(array1[i]%2==0) para++; else nepara++;}
  16. //==============================
  17. int *PARA = new int[para];
  18. int *NEPARA = new int[nepara];
  19. for(int i = 0;i<n;i++){
  20. if(array1[i]%2==0) PARA[a++]= array1[i]; else NEPARA[b++] = array1[i]; }
  21. //==============================
  22. a = 0;
  23. b = 0;
  24. for(int i = 0;i<para;i++)
  25. {if(PARA[i] > PARA[a])a = i;
  26. if(PARA[i] < PARA[b])b = i;}
  27.  
  28. cout << "Atstarpe starp lielako un mazako vertibu: " << a-b-1 << endl;
  29.  
  30. for(int i = 0;i<nepara;i++){
  31. for(int j = i+1;j<nepara;j++){
  32. if(NEPARA[i]==NEPARA[j]){ cout << "Atkartojas vertiba: " << NEPARA[i] << endl; }}}
  33.  
  34. delete[] array1, PARA, NEPARA;
  35. //==============================
  36. cout << "Cik atzimju velaties ievadit?: ";
  37. cin >> n;
  38.  
  39. if(n<10){a=1;b=n;}else if(n/10 > 0 && n%10 ==0){a=(n/10); b = 10;}else{ a=(n/10)+1; b = n%10;}
  40.  
  41. int **a2 = new int*[a];
  42. for (int i = 0 ; i < a; i++)if(i==(a-1))a2[i] = new int[b]; else a2[i] = new int[10];
  43.  
  44. para = 10;
  45. for(int i=0;i<a;i++){
  46. if(i==a-1)para = b;
  47. for(int j=0;j<para;j++){
  48. cout << "Ievadiet atzimi: "; cin >> a2[i][j];
  49. if(a2[i][j]>10 || a2[i][j]<1){ cout << "Kluda! Ievadiet atzimi atkartoti!\n"; --j;}}}
  50.  
  51.  
  52. para = 10;
  53. for(int i=0;i<a;i++){
  54. if(i==a-1)para = b;
  55. for(int j=0;j<para;j++){
  56. cout << a2[i][j];}}
  57.  
  58.  
  59. getch();
  60. return 0;
  61. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement