diff --git "a/11\354\233\22416\354\235\274/\354\264\210\354\244\221\352\270\211/2276274_2246.c" "b/11\354\233\22416\354\235\274/\354\264\210\354\244\221\352\270\211/2276274_2246.c" new file mode 100644 index 0000000..facfaf0 --- /dev/null +++ "b/11\354\233\22416\354\235\274/\354\264\210\354\244\221\352\270\211/2276274_2246.c" @@ -0,0 +1,38 @@ +#include +#include + +int compare(const void* a, const void* b) { + if (((int*)a)[0] > ((int*)b)[0]) return 1; //오름차순 + return 0; +} +int n[10000][2]; +int main() { + int N, c, d, res = 0; + scanf("%d", &N); + for (int i = 0; i < N; i++) + scanf("%d%d", &n[i][0], &n[i][1]); + qsort(n, N, 8, compare); + for (int i = 0; i < N; i++) { + int a = 1; + for (int j = i - 1; j >= 0; j--) { + if (n[i][1] >= n[j][1]) { //첫번째 조건 + a = 0; + break; + } + } + if (a) { + for (int j = 0; j < N; j++) { + if (i == j)continue; + if (n[i][1] > n[j][1]) { //두번째 조건 + if (n[i][0] >= n[j][0]) { + a = 0; + break; + } + } + } + } + if (a)res++; + } + printf("%d", res); + return 0; +} diff --git "a/11\354\233\22416\354\235\274/\354\264\210\354\244\221\352\270\211/2276274_4436.c" "b/11\354\233\22416\354\235\274/\354\264\210\354\244\221\352\270\211/2276274_4436.c" new file mode 100644 index 0000000..d3b291f --- /dev/null +++ "b/11\354\233\22416\354\235\274/\354\264\210\354\244\221\352\270\211/2276274_4436.c" @@ -0,0 +1,24 @@ +#include + +int main() { + int n; + while (scanf("%lld", &n) != EOF) { + long long int n1 = n, k = 1; + int m[10] = { 0 }, Ism = 0; + while (Ism == 0) { + while (n1 >= 1) { + m[n1 % 10] = 1; + n1 /= 10; + } + for (int i = 0; i < 10; i++) { + if (m[i] == 0) { + n1 = n * ++k; + break; + } + if (i == 9)Ism = 1; + } + } + printf("%d\n", k); + } + return 0; +}