Skip to content

Honux #72

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
honux77 merged 3 commits into from
Jun 15, 2019
Merged

Honux #72

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
221e5ee
Fail to solve find prime
honux77 Jun 13, 2019
c3102d9
Solve programmers find prime
honux77 Jun 15, 2019
8ebbd59
Add problem
honux77 Jun 15, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 4 additions & 0 deletions 190611/190617/problem.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,4 @@
# programmers 타겟 넘버

- https://programmers.co.kr/learn/courses/30/lessons/43165

21 changes: 21 additions & 0 deletions 190611/honux/test.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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);

22 changes: 22 additions & 0 deletions 190611/honux/test2.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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);
43 changes: 43 additions & 0 deletions 190611/honux/try1.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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;
}
50 changes: 50 additions & 0 deletions 190611/honux/try2.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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"));