From 221e5eea8028bda8f659a6b4f831766c72b40884 Mon Sep 17 00:00:00 2001 From: Hoyoung Jung Date: Thu, 13 Jun 2019 16:00:22 +0900 Subject: [PATCH 1/6] Fail to solve find prime MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit 프로그래머스 문제 풀다 실패 순열로 구했는데 조합이었다. 내일 하자. --- 190611/honux/test.js | 21 +++++++++++++++++++++ 190611/honux/try1.js | 43 +++++++++++++++++++++++++++++++++++++++++++ 2 files changed, 64 insertions(+) create mode 100644 190611/honux/test.js create mode 100644 190611/honux/try1.js diff --git a/190611/honux/test.js b/190611/honux/test.js new file mode 100644 index 0000000..cdad665 --- /dev/null +++ b/190611/honux/test.js @@ -0,0 +1,21 @@ +let arr = [1,2,3,4]; + +function swap(arr, i, j) { + const temp = arr[i]; + arr[i] = arr[j]; + arr[j] = temp; +} + +function all(arr, n) { + if (n == arr.length - 1) { + console.log(arr); + } + for (let i = n; i < arr.length ; i++) { + swap(arr, n, i); + all(arr, n + 1); + swap(arr, n, i); + } +} + +all(arr, 0); + diff --git a/190611/honux/try1.js b/190611/honux/try1.js new file mode 100644 index 0000000..fac5e1a --- /dev/null +++ b/190611/honux/try1.js @@ -0,0 +1,43 @@ +const prime = [] +const maxn = 9999999; +let count = 0; + +for (let i = 0; i <= maxn; i++) { + prime.push(true); +} +prime[0] = prime[1] = false; + +for (let i = 2; i<= maxn; i++) { + if(!prime[i]) continue; + for (let j = i * 2; j <= maxn; j += i) { + prime[j] = false; + } +} + +function swap(arr, i, j) { + const temp = arr[i]; + arr[i] = arr[j]; + arr[j] = temp; +} + +function genNum(arr, i) { + if (i == arr.length - 1) { + const n = Number(arr.join("")); + console.log(n); + if (prime[n]) count++; + return; + } + for (let j = i; j < arr.length; j++) { + swap(arr, i, j); + genNum(arr, i + 1); + swap(arr, i, j); + } +} + +function solution(numbers) { + count = 0; + let a = numbers.split(""); + console.log(a); + genNum(a, 0); + return count; +} From c3102d91fb72debc8679ad6ca94d2748f9a6be85 Mon Sep 17 00:00:00 2001 From: Hoyoung Jung Date: Sat, 15 Jun 2019 16:00:53 +0900 Subject: [PATCH 2/6] Solve programmers find prime MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit 복잡하다... 여튼 풀긴 풀었네. --- 190611/honux/test2.js | 22 +++++++++++++++++++ 190611/honux/try2.js | 50 +++++++++++++++++++++++++++++++++++++++++++ 2 files changed, 72 insertions(+) create mode 100644 190611/honux/test2.js create mode 100644 190611/honux/try2.js diff --git a/190611/honux/test2.js b/190611/honux/test2.js new file mode 100644 index 0000000..c2aa652 --- /dev/null +++ b/190611/honux/test2.js @@ -0,0 +1,22 @@ +function swap(arr, i, j) { + const temp = arr[i]; + arr[i] = arr[j]; + arr[j] = temp; +} + +function perm(arr, k, j = 0) { + if (j === k){ + console.log(arr.slice(0,j)); + return; + } + for (let i = j; i < arr.length; i++) { + swap(arr, i, j); + perm(arr, k, j + 1); + swap(arr, i, j); + } +} + +arr = [1, 2, 3]; +perm(arr, 1); +console.log("=========="); +perm(arr, 2); diff --git a/190611/honux/try2.js b/190611/honux/try2.js new file mode 100644 index 0000000..e9e278d --- /dev/null +++ b/190611/honux/try2.js @@ -0,0 +1,50 @@ +const prime = [] +const maxn = 9999999; +let count = 0; + +for (let i = 0; i <= maxn; i++) { + prime.push(true); +} +prime[0] = prime[1] = false; + +for (let i = 2; i<= maxn; i++) { + if(!prime[i]) continue; + for (let j = i * 2; j <= maxn; j += i) { + prime[j] = false; + } +} + +function swap(arr, i, j) { + const temp = arr[i]; + arr[i] = arr[j]; + arr[j] = temp; +} + +function perm(arr, k, j = 0) { + if (j === k){ + const n = Number(arr.slice(0, j).join("")); + console.log(n); + //count only once + if (prime[n]) { + count++; + prime[n] = false; + } + return; + } + for (let i = j; i < arr.length; i++) { + swap(arr, i, j); + perm(arr, k, j + 1); + swap(arr, i, j); + } +} + +function solution(numbers) { + count = 0; + let a = numbers.split(""); + for (let i = 1; i <= numbers.length; i++) { + perm(a, i); + } + return count; +} + +console.log(solution("17")); From 8ebbd597d5e5bb262c9a2568d836da09b312de28 Mon Sep 17 00:00:00 2001 From: Hoyoung Jung Date: Sat, 15 Jun 2019 16:04:55 +0900 Subject: [PATCH 3/6] Add problem MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit 문제 추가 --- 190611/190617/problem.md | 4 ++++ 1 file changed, 4 insertions(+) create mode 100644 190611/190617/problem.md diff --git a/190611/190617/problem.md b/190611/190617/problem.md new file mode 100644 index 0000000..1ba81b0 --- /dev/null +++ b/190611/190617/problem.md @@ -0,0 +1,4 @@ +# programmers 타겟 넘버 + +- https://programmers.co.kr/learn/courses/30/lessons/43165 + From 264c646e6594a0261eb1fe1956fea8a081030622 Mon Sep 17 00:00:00 2001 From: SangYun Ha Date: Sun, 16 Jun 2019 11:41:18 +0900 Subject: [PATCH 4/6] =?UTF-8?q?[H]=20=EC=86=8C=EC=88=98=EC=B0=BE=EA=B8=B0?= =?UTF-8?q?=20=EB=AC=B8=EC=A0=9C=ED=92=80=EC=9D=B4=20=EC=A0=9C=EC=B6=9C?= =?UTF-8?q?=ED=95=A9=EB=8B=88=EB=8B=A4.=20(#73)?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit * H-Index 문제풀이 * H-Index 문제풀이 * 소수 찾기 문제풀이 --- 190611/H/count_prime_number.py | 31 +++++++++++++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 190611/H/count_prime_number.py diff --git a/190611/H/count_prime_number.py b/190611/H/count_prime_number.py new file mode 100644 index 0000000..dae7eea --- /dev/null +++ b/190611/H/count_prime_number.py @@ -0,0 +1,31 @@ +from itertools import permutations + + +def makeNumbers(numbers): + numbers = list(numbers) + resultA = [] + for i in range(1, len(numbers)+1): + resultA.append(permutations(numbers, i)) + resultB = [y for x in resultA for y in x] + answer = set([str(int(''.join(j))) for j in resultB]) + return answer + + +def countPrimeNumber(numberlist): + answer = 0 + for i in numberlist: + t = int(i) + result = 0 + for j in range(2, t): + if t % j == 0: + result += 1 + break + if result == 0 and t != 1 and t != 0: + answer += 1 + return answer + + +def solution(numbers): + numberlist = makeNumbers(numbers) + answer = countPrimeNumber(numberlist) + return answer From 60e864f46d45a355361aa277bf0f7a070ee30d9e Mon Sep 17 00:00:00 2001 From: Minjae Lee <0201.mj.lee@gmail.com> Date: Tue, 18 Jun 2019 14:42:29 +0900 Subject: [PATCH 5/6] =?UTF-8?q?[wangmin]=20=EC=88=98=20=EC=A0=95=EB=A0=AC?= =?UTF-8?q?=ED=95=98=EA=B8=B0=203=20(#74)?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- 190613/wangmin/bj10989.cpp | 32 ++++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 190613/wangmin/bj10989.cpp diff --git a/190613/wangmin/bj10989.cpp b/190613/wangmin/bj10989.cpp new file mode 100644 index 0000000..c555b9a --- /dev/null +++ b/190613/wangmin/bj10989.cpp @@ -0,0 +1,32 @@ +#include +#include + +using namespace std; + +int main(){ + cin.tie(NULL); + cout.tie(NULL); + ios_base :: sync_with_stdio(false); + + int N; + cin >> N; + int a; + vector count(10001, 0); + + + for(int i = 0; i < N; i++){ + cin >> a; + count[a]++; + } + + for(int i = 0; i <= 10001; i++){ + for(int j = count[i]; j > 0; j--){ + cout << i << "\n"; + } + } + + + return 0; +} + + From d039becde349850dc9fce7f399a58d88be1800fa Mon Sep 17 00:00:00 2001 From: Hoyoung Jung Date: Tue, 18 Jun 2019 15:04:37 +0900 Subject: [PATCH 6/6] Add 190618 problem --- 190618/problem.md | 6 ++++++ 1 file changed, 6 insertions(+) create mode 100644 190618/problem.md diff --git a/190618/problem.md b/190618/problem.md new file mode 100644 index 0000000..886ee22 --- /dev/null +++ b/190618/problem.md @@ -0,0 +1,6 @@ +# programmers 체육복 + +- https://programmers.co.kr/learn/courses/30/lessons/42862 +- 레벨 1 +- 분류: greedy +