-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathAccurateLee.cpp
executable file
·62 lines (56 loc) · 995 Bytes
/
AccurateLee.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
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, first_one = 0;
string s, ans = "";
cin >> n >> s;
// if (n == 1) {
// cout << s << "\n";
// return;
// }
// for (int i = n - 1; i >= 0; i--)
// if (s[i] == '1')
// ans = s[i] + ans;
// else {
// if (i == 0)
// first_one = 0;
// else
// first_one = i + 1;
// break;
// }
// for (int i = 0 ; i < first_one; i++)
// if (s[i] == '0')
// ans = s[i] + ans;
// else {
// ans = '0' + ans;
// break;
// }
for (int i = n - 1; i >= 0; i--) {
if (s[i] == '0' && i > 0) {
first_one = i + 1;
break;
}
ans = s[i] + ans;
}
for (int i = 0; i < first_one; i++) {
if (s[i] == '1') {
ans = '0' + ans;
break;
}
ans = s[i] + ans;
}
cout << ans << "\n";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t;
cin >> t;
while (t--)
solve();
return 0;
}