Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- function isPrime(n) {
- if(n < 2){
- return false;
- }
- for (var i = 2; i <= parseInt(Math.sqrt(n)); i++) {
- if (n % i === 0) {
- return false;
- }
- }
- return true;
- }
- function getPrimes(s, e) {
- var primes = [];
- for (var p = s; p <= e; p++) {
- if(isPrime(p)){
- primes.push(p);
- }
- }
- return primes;
- }
- function generatePairs(primes){
- var pairs = [];
- for(var i = 0; i < primes.length; i++){
- for(var j = i; j < primes.length; j++){
- pairs.push([primes[i], primes[j]]);
- }
- }
- return pairs;
- }
- function sumDigits(n){
- var sum = 0;
- while(n > 0){
- sum += n % 10;
- n = parseInt(n/10);
- }
- return sum;
- }
- function solve(a, b) {
- var pairs = generatePairs(getPrimes(a, b - 1));
- var res = 0;
- for(pair of pairs){
- var tmp = sumDigits(pair[0] * pair[1]);
- if(isPrime(tmp)){
- res++;
- }
- }
- return res;
- }
Add Comment
Please, Sign In to add comment