-
Notifications
You must be signed in to change notification settings - Fork 0
/
n진수게임.cpp
49 lines (40 loc) · 1.02 KB
/
n진수게임.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
#include <iostream>
#include <queue>
#include <string>
using namespace std;
string answer = "0";
string numList = "0123456789ABCDEF";
int maxLen = 0;
string getString(char x) {
string s(1, x);
return s;
}
void bfs(int n) {
queue<string> q;
for (int i = 1; i < n; i++)
q.push(getString(numList[i]));
while (!q.empty()) {
string f = q.front();
q.pop();
answer += f;
if (answer.length() >= maxLen) {
return;
}
for (int i = 0; i < n; i++)
q.push(f + numList[i]);
}
}
string solution(int n, int t, int m, int p) {
// 0은 처음에는 빼주고 시작. (0으로 시작하는 숫자는 없기 때문. ex 01, 001 ...) => 마지막에 맨 앞에 추가
maxLen = m * t;
bfs(n);
string result = "";
for (int i = 0; i < t; i++) {
int turn = (p - 1) + m * i;
result += answer[turn];
}
return result;
}
int main() {
cout << solution(16, 16, 2, 2);
}