include iostream using namespace std class Massive private int int pub

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
#include <iostream>
using namespace std;
class Massive{
private:
int *a;
int n, k, l;
public:
void enter();
void output();
int *userFunc(int&);
};
int main(){
int *resultMassive;
int n;
Massive massive;
massive.enter();
massive.output();
resultMassive = massive.userFunc(n);
for (int q=0; q<n; q++)
cout << resultMassive[q] << " ";
cout << endl;
massive.output();
return 0;
}
void Massive::enter(){
cout << "Vvedite razmer massiva" << endl;
cin >> n;
a = new int(n);
cout << "Vvedite elementi massiva" << endl;
for (int q=0; q<n; q++)
cin >> a[q];
}
void Massive::output(){
for (int q=0; q<n; q++)
cout << a[q] << " ";
cout << endl;
}
int *Massive::userFunc(int& nl){
bool check = false;
int curKof, nextKof, indexNumber;
int *d = new int(100);
int count = 0;
nl = n;
for (int q=0; q<n; q++)
for (int w=0; w<n-1; w++)
if (a[w] > a[w+1]){
int k = a[w];
a[w] = a[w+1];
a[w+1] = k;
}
curKof = a[1] - a[0];
for (int q=1; q<n-1; q++){
nextKof = a[q+1] - a[q];
if (nextKof != curKof){
check = true;
indexNumber = q+1;
break;
}
}
if (check == true){
for (int q=0; q<indexNumber; q++)
d[q] = a[q];
for (int q=indexNumber; q<n-1; q++){
d[q] = a[q+1];
count++;
}
d[n-1] = a[indexNumber];
}
else
cout << "Progressiya" << endl;
a = d;
return d;
}