blob: 5c2c700ac3da166a09bec740c7c9e826fde535f6 (
plain)
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
|
#include<bits/stdc++.h>
using namespace std;
bool vectorZero(vector<int>& v);
int secondSmallest(vector<int>& v);
int main(){
int vsize;
int count=0;
vector<int> vec;
cin >> vsize;
vector<int> result;
for(int i = 0; i < vsize; i++){
int element;
cin >> element;
vec.push_back(element);
}
sort(vec.begin(), vec.end());
int mn = *min_element(vec.begin(), vec.end());
for(int i = 0; i < vsize; i++){
if(vec[i] != 0){
vec[i]-= mn;
}
}
cout << vsize;
while(!vectorZero(vec)){
int ss = vec[secondSmallest(vec)];
count = 0;
for(int x : vec){
cout << x << " ";
}
cout << endl;
for(int i = 0; i < vsize; i++){
if(vec[i] != 0){
vec[i] -= ss;
count++;
}
}
cout << count << endl;
}
return 0;
}
bool vectorZero(vector<int>& v){
int count = 0;
for(int i = 0; i < v.size(); i++){
if(v[i] == 0){
count++;
}
}
return count == v.size();
}
int secondSmallest(vector<int>& v){
for(int i = 0; i < v.size(); i++){
if(v[i] != *min_element(v.begin(), v.end())){
return i;
}
}
return -1;
}
|