-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsheep.cpp
More file actions
88 lines (72 loc) · 1.68 KB
/
Copy pathsheep.cpp
File metadata and controls
88 lines (72 loc) · 1.68 KB
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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
#include <iostream>
#include <set>
#include <string>
#include <sstream>
using namespace std;
// Google Code Jam 2016: Qualification Round - Counting Sheep
int convertToInt(string s) {
int number = 0;
stringstream convert(s);
convert >> number;
return number;
}
string convertToString(int n) {
string temp = "";
ostringstream convert;
convert << n;
temp = convert.str();
return temp;
}
set<int> parseInt(string n) {
set<int> nums;
int num = 0;
string temp = "";
for (size_t i = 0; i < n.length(); i++) {
temp += n[i];
num = convertToInt(temp);
nums.insert(num);
temp = "";
}
return nums;
}
void lastNumberBeforeAsleep(string n) {
int multiplier = 1;
int result = 0;
int number = 0;
string tempnum = "";
set<int> digits = parseInt(n);
set<int> moredigits;
set<int> sum;
sum.insert(digits.begin(),digits.end());
while (multiplier < 1000000) {
number = convertToInt(n);
multiplier++;
result = number*multiplier;
tempnum = convertToString(result);
moredigits = parseInt(tempnum);
sum.insert(moredigits.begin(),moredigits.end());
if (sum.size() == 10) {
cout << tempnum << endl;
break;
}
if (number == 0 || number > 1000000) {
cout << "INSOMNIA" << endl;
break;
}
tempnum = "";
result = 0;
}
}
int main()
{
int i = 1;
int testCases;
string input;
cin >> testCases;
while (i <= testCases && cin >> input) {
cout << "Case #" << i << ": ";
lastNumberBeforeAsleep(input);
i++;
}
return 0;
}