From daa6771ba6c9ea45b587493a7a8a462444c3d3f1 Mon Sep 17 00:00:00 2001 From: Sean-HL-Lin Date: Wed, 9 Oct 2019 12:51:02 -0700 Subject: [PATCH 1/2] solution for summatio of primes --- Solutions/summation_of_primes.js | 61 ++++++++++++++++++++++++++++++++ 1 file changed, 61 insertions(+) create mode 100644 Solutions/summation_of_primes.js diff --git a/Solutions/summation_of_primes.js b/Solutions/summation_of_primes.js new file mode 100644 index 0000000..3e8288f --- /dev/null +++ b/Solutions/summation_of_primes.js @@ -0,0 +1,61 @@ +const readline = require('readline'); + +const rl = readline.createInterface({ + input: process.stdin, + output: process.stdout +}); + +let numbers +let testcases = [] +let count = 1 + +rl.on('line', (input) => { + if (!numbers) { + numbers = parseInt(input); + } else { + if (count < numbers) { + testcases.push(parseInt(input)); + count ++; + } else if (count === numbers) { + testcases.push(parseInt(input)); + + // here comes the logic + outputSummation(testcases) + rl.close() + } + }; +}); + + +const outputSummation = (testcases) => { + for (let item of testcases) { + + if (testcases === 1) { + console.log(1) + } else if (testcases === 2) { + console.log(3) + } else { + let primesArray = [2] + for (let i = 3; i <= item; i ++) { + let bool = true + for (let prime of primesArray) { + if (i%prime === 0) { + bool = false; + break + } + } + if(bool) { + primesArray.push(i) + } + } + + let sum = 1 + for(let prime of primesArray) { + sum += prime + } + console.log(sum) + } + + + } +} \ No newline at end of file From c2c49c9633261a08b4495d522097c7f45b07de31 Mon Sep 17 00:00:00 2001 From: Sean-HL-Lin Date: Wed, 9 Oct 2019 13:20:26 -0700 Subject: [PATCH 2/2] add solution for 10001st_prime --- Solutions/10001st_prime.js | 18 ++++++++++ Solutions/summation_of_primes.js | 61 -------------------------------- 2 files changed, 18 insertions(+), 61 deletions(-) create mode 100644 Solutions/10001st_prime.js delete mode 100644 Solutions/summation_of_primes.js diff --git a/Solutions/10001st_prime.js b/Solutions/10001st_prime.js new file mode 100644 index 0000000..5ec068c --- /dev/null +++ b/Solutions/10001st_prime.js @@ -0,0 +1,18 @@ +let primesArray = [2] +let current = 3 + +while(primesArray.length < 10001) { + let bool = true + for (let prime of primesArray) { + if (current%prime === 0) { + bool = false; + break + } + } + if(bool) { + primesArray.push(current) + } + current ++ +} + +console.log(primesArray[10000]) diff --git a/Solutions/summation_of_primes.js b/Solutions/summation_of_primes.js deleted file mode 100644 index 3e8288f..0000000 --- a/Solutions/summation_of_primes.js +++ /dev/null @@ -1,61 +0,0 @@ -const readline = require('readline'); - -const rl = readline.createInterface({ - input: process.stdin, - output: process.stdout -}); - -let numbers -let testcases = [] -let count = 1 - -rl.on('line', (input) => { - if (!numbers) { - numbers = parseInt(input); - } else { - if (count < numbers) { - testcases.push(parseInt(input)); - count ++; - } else if (count === numbers) { - testcases.push(parseInt(input)); - - // here comes the logic - outputSummation(testcases) - rl.close() - } - }; -}); - - -const outputSummation = (testcases) => { - for (let item of testcases) { - - if (testcases === 1) { - console.log(1) - } else if (testcases === 2) { - console.log(3) - } else { - let primesArray = [2] - for (let i = 3; i <= item; i ++) { - let bool = true - for (let prime of primesArray) { - if (i%prime === 0) { - bool = false; - break - } - } - if(bool) { - primesArray.push(i) - } - } - - let sum = 1 - for(let prime of primesArray) { - sum += prime - } - console.log(sum) - } - - - } -} \ No newline at end of file