fork download
copy 
  1. let n = 1;
  2. let answersArray;
  3.  
  4. (function () {
  5.     const readline = require('readline');
  6.  
  7.     const rl = readline.createInterface({
  8.         input: process.stdin,
  9.         output: process.stdout
  10.     });
  11.  
  12.     rl.question('', (input) => {
  13.         n = Number(input) || 0
  14.         prepareArray()
  15.     });
  16.  
  17.     rl.on('line', (input) => {
  18.         n = n - 1;
  19.         const index = n
  20.         isPrimeNumber(input, index)
  21.         n === 0 ? showAnswer() : null
  22.     });
  23.  
  24. })()
  25.  
  26.  
  27. function prepareArray() {
  28.     answersArray = new Array(n).fill(0);
  29. }
  30.  
  31. function showAnswer() {
  32.     for (let i = answersArray.length - 1; i >= 0; i--) {
  33.          console.log(answersArray[i])
  34.     }
  35. }
  36.  
  37. function isPrimeNumber(number, index) {
  38. 	let numberfirst = number.match(/\d+/)
  39.     let numbersecond = number.match(/\d+$/)
  40.  
  41. 	let parsed1 =  parseInt(numberfirst[0],10)
  42. 	let parsed2 = parseInt(numbersecond[0],10)
  43.  
  44.  
  45. 	let wyniki = parsed1 % parsed2 
  46.  
  47.     answersArray[index] = wyniki
  48. }
Success #stdin #stdout 0.04s 212352KB
comments (?)
stdin
copy 
6
123, 223
-3, 4
500, 45
-3, -4
5, 5
100, 1
stdout
copy 
123
3
5
3
0
0
https://ideone.com/FGNGpD
problem AL_06_01, based on SPOJ submission 23793069 (NODEJS), 2019-05-19 19:53:05
language:
Node.js (node 11.12.0)
created:
4 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!