-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path10597.cpp
55 lines (47 loc) · 1.12 KB
/
10597.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
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
int xxxx[]={-1,0,1,0};
int yyyy[]={0,1,0,-1};
string str;
bool visited[51];
vector<int> result;
bool dfs(int x){
if (x >= str.size()) {
bool all = true;
for (int i = 1; i <= result.size(); i++) all &= visited[i];
if (!all) return false;
for (auto s : result) {
cout << s;
cout << ' ';
}
return true;
}
int temp = 0;
for (int i = x; i < str.size(); i++) {
temp = temp * 10 + str[i] - '0';
if (temp > 50) break;
if (visited[temp]) continue;
visited[temp] = true;
result.push_back(temp);
if (dfs(i + 1)) {
return true;
} else result.pop_back();
visited[temp] = false;
}
return false;
}
void solve(){
cin >> str;
dfs(0);
}
int main()
{
cin.tie(0)->sync_with_stdio(false);
solve();
return 0;
}