-
Notifications
You must be signed in to change notification settings - Fork 0
/
huawei3.cpp
101 lines (100 loc) · 2.04 KB
/
huawei3.cpp
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
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int main()
{
string s;
getline(cin, s);
vector<int> get;
for (int i = 1; i < s.size() - 1; i++)
{
if (s[i] >= '1' && s[i] <= '9')
get.push_back(s[i] - '0');
else if (s[i] == 'n')
get.push_back(0);
}
map<string, int> mp;
for (int i = 1; i < get.size(); i++)
{
string s;
queue<int> lq;
lq.push(i);
while (lq.empty() == 0)
{
int t = lq.front();
if (t < get.size())
s += to_string(get[t]);
lq.pop();
if (get[t] == 0)
continue;
if (2 * t + 1 < get.size())
lq.push(2 * t + 1);
if (2 * t + 2 < get.size())
lq.push(2 * t + 2);
}
int end = s.size() - 1;
while (s[end] == '0')
{
s.erase(end);
end--;
}
// cout << s << endl;
mp[s]++;
}
int ans = 0;
string out;
for (auto i : mp)
{
if (i.second > 1)
{
if (ans < (i.first).size())
{
ans = (i.first).size();
out = i.first;
}
}
}
int layer = 0;
int need = 0;
if (ans == 1)
{
layer = 1;
need = 1;
}
else if (ans >= 2 && ans <= 3)
{
layer = 2;
need = 3;
}
else if (ans >= 4 && ans <= 7)
{
layer = 3;
need = 7;
}
else
{
layer = 4;
need = 15;
}
string key;
key += "[";
for (int i = 0; i < out.size() || i < need; i++)
{
if (i >= out.size())
{
key += "null,";
continue;
}
if (i < out.size() && out[i] > '0')
key += to_string(out[i] - '0') + ",";
else
key += "null,";
}
key.erase(key.size() - 1);
key += "]";
cout << key << " " << layer << endl;
getchar();
getchar();
}