We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
링크
#include <algorithm> #include <iostream> #include <string> #include <vector> using namespace std; vector<int> nums; vector<string> answers; int N, M; bool visited[8] = { false, }; void dfs(int answer_count, string answer) { if (answer_count == M) { answers.push_back(answer); return; } for (int i = 0; i < N; i++) { if (visited[i]) continue; visited[i] = 1; string new_answer = answer + to_string(nums[i]) + " "; dfs(answer_count + 1, new_answer); visited[i] = 0; } } void solution() { cin >> N >> M; nums.resize(N); for (int i = 0; i < N; i++) cin >> nums[i]; vector<int> answer; dfs(0, ""); sort(answers.begin(), answers.end()); answers.erase(unique(answers.begin(), answers.end()), answers.end()); for (string a : answers) { cout << a << "\n"; } //cout << "\n"; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); solution(); return 0; }
The text was updated successfully, but these errors were encountered:
No branches or pull requests
15663. N과 M(9)
링크
설계
정리
고생한 점
코드
The text was updated successfully, but these errors were encountered: