-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSort4.cpp
More file actions
159 lines (136 loc) · 3.46 KB
/
Copy pathSort4.cpp
File metadata and controls
159 lines (136 loc) · 3.46 KB
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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
#include <fstream>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
typedef struct {
int val;
int dgt;
int sum;
int prod;
} Elem;
const int NMAX = 1e6 + 5;
int n;
Elem a[NMAX];
int fr[10];
class InParser {
private:
vector<char> str;
int ptr;
ifstream fin;
private:
char getChar() {
if (ptr == (int)str.size()) {
fin.read(str.data(), (int)str.size());
ptr = 0;
}
return str[ptr++];
}
template<class T>
T getInt() {
char chr;
do {
chr = getChar();
} while (!isdigit(chr) && (chr != '-'));
int sgn = +1;
if (chr == '-') {
sgn = -1;
chr = getChar();
}
T num = 0;
while (isdigit(chr)) {
num = num * 10 + (chr - '0');
chr = getChar();
}
return sgn * num;
}
public:
InParser(const char *name) : str((int)1e5), ptr((int)str.size()), fin(name) { }
~InParser() { fin.close(); }
template<class T>
friend InParser& operator>>(InParser &in, T &num) {
num = in.getInt<T>();
return in;
}
};
class OutParser {
private:
vector<char> str;
int ptr;
ofstream fout;
private:
void putChar(char chr) {
if (ptr == (int)str.size()) {
fout.write(str.data(), (int)str.size());
ptr = 0;
}
str[ptr++] = chr;
}
template<class T>
void putInt(T num) {
if (num < 0) {
putChar('-');
num *= -1;
}
if (num > 9)
putInt(num / 10);
putChar(num % 10 + '0');
}
public:
OutParser(const char *name) : str((int)1e5), ptr(0), fout(name) { }
~OutParser() { fout.write(str.data(), ptr); fout.close(); }
template<class T>
friend OutParser& operator<<(OutParser &out, const T num) {
out.putInt(num);
return out;
}
friend OutParser& operator<<(OutParser &out, const char chr) {
out.putChar(chr);
return out;
}
friend OutParser& operator<<(OutParser &out, const char *str) {
for (int i = 0; str[i]; i++)
out.putChar(str[i]);
return out;
}
};
inline bool cmp(const Elem &A, const Elem &B) {
if (A.dgt == B.dgt) {
if (A.sum == B.sum) {
if (A.prod == B.prod)
return A.val < B.val;
return A.prod < B.prod;
}
return A.sum < B.sum;
}
return A.dgt > B.dgt;
}
int main() {
InParser fin("sort4.in");
OutParser fout("sort4.out");
fin >> n;
for (int i = 1; i <= n; i++) {
fin >> a[i].val;
int cnt, s, p, tmp;
cnt = s = 0;
p = 1;
tmp = a[i].val;
do {
s += (tmp % 10);
p *= (tmp % 10);
if (fr[tmp % 10] != i) {
cnt++;
fr[tmp % 10] = i;
}
tmp /= 10;
} while (tmp);
a[i].dgt = cnt;
a[i].sum = s;
a[i].prod = p;
}
sort(a + 1, a + n + 1, cmp);
for (int i = 1; i <= n; i++)
fout << a[i].val << ' ';
fout << '\n';
return 0;
}