diff --git "a/11\354\233\22416\354\235\274/\354\264\210\354\244\221\352\270\211/1971039_2246.cpp" "b/11\354\233\22416\354\235\274/\354\264\210\354\244\221\352\270\211/1971039_2246.cpp" new file mode 100644 index 0000000..d253160 --- /dev/null +++ "b/11\354\233\22416\354\235\274/\354\264\210\354\244\221\352\270\211/1971039_2246.cpp" @@ -0,0 +1,40 @@ +#include +#include +#include + +using namespace std; + +int main() { + int n; + cin >> n; + + vector> condo(n); + for (int i = 0; i < n; i++) { + int a, b; + cin >> a >> b; + condo[i] = make_pair(a, b); + } + + // sort(condo.begin(), condo.end()); + + int count = 0; + for (int i = 0; i < n; i++) { //기준 + int check = true; + for (int j = 0; j < n; j++) { + if (j == i) + continue; + + if (condo[j].first < condo[i].first && condo[i].second >= condo[j].second) { + check = false; + break; + } + if (condo[j].second < condo[i].second && condo[j].first <= condo[i].first) { + check = false; + break; + } + } + if (check) + count++; + } + cout << count; +} \ No newline at end of file diff --git "a/11\354\233\22416\354\235\274/\354\264\210\354\244\221\352\270\211/1971039_4436.cpp" "b/11\354\233\22416\354\235\274/\354\264\210\354\244\221\352\270\211/1971039_4436.cpp" new file mode 100644 index 0000000..3ec67db --- /dev/null +++ "b/11\354\233\22416\354\235\274/\354\264\210\354\244\221\352\270\211/1971039_4436.cpp" @@ -0,0 +1,28 @@ +#include +#include +#include +#include + +using namespace std; + +int main() { + while (true) { + long long n; //반드시 long long으로 해야함 (아니면 19번째줄 연산시 형변환 필요) + cin >> n; + if (cin.eof() == true) { + break; + } + + int i = 1; + set s; + while (s.size() < 10) { + long long num = n * i; //반드시 long long으로 해야함 + while (num != 0) { + s.insert(num % 10); + num /= 10; + } + i++; + } + cout << i - 1 << "\n"; + } +} \ No newline at end of file