-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path210126_BOJ_2659.cpp
More file actions
62 lines (46 loc) · 803 Bytes
/
Copy path210126_BOJ_2659.cpp
File metadata and controls
62 lines (46 loc) · 803 Bytes
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 <iostream>
#include <vector>
using namespace std;
vector<int> cards(4, 0);
int Min = 10000;
void input() {
for (int i = 0; i < 4; ++i)
cin >> cards[i];
}
int findMin() {
int m = 10000;
for (int i = 0; i < 4; ++i) {
int sum = 0;
for (int j = i; j < i + 4; ++j) {
sum = sum * 10 + cards[j % 4];
}
if (m > sum)
m = sum;
}
return m;
}
void findAnswer() {
int cnt = 0;
vector<bool> check(Min + 1, false);
for (int i = 1111; i <= Min; ++i) {
int j = 3;
int temp = i;
for ( ; j >= 0; --j) {
cards[j] = temp % 10;
temp = temp / 10;
if (cards[j] == 0) break;
}
temp = findMin();
if (j == -1 && !check[temp]) {
cnt++;
check[temp] = true;
}
}
cout << cnt << "\n";
}
int main() {
input();
Min = findMin();
findAnswer();
return 0;
}