Merge branch 'release/1.4.0'

Author: ecgan

2019/qualification/1-foregone-solution/.babelrc

@@ -0,0 +1,24 @@
+{
+  "env": {
+    "test": {
+      "presets": [
+        [
+          "@babel/preset-env"
+        ]
+      ]
+    },
+    "build": {
+      "presets": [
+        [
+          "@babel/preset-env",
+          {
+            "modules": false,
+            "targets": {
+              "node": "11.13.0"
+            }
+          }
+        ]
+      ]
+    }
+  }
+}

2019/qualification/1-foregone-solution/.eslintrc.js

@@ -0,0 +1,18 @@
+module.exports = {
+  'env': {
+    'es6': true,
+    'node': true,
+    'jest': true,
+  },
+  'extends': 'standard',
+  'globals': {
+    'Atomics': 'readonly',
+    'SharedArrayBuffer': 'readonly'
+  },
+  'parserOptions': {
+    'ecmaVersion': 2018,
+    'sourceType': 'module'
+  },
+  'rules': {
+  }
+}

2019/qualification/1-foregone-solution/README.md

@@ -0,0 +1,37 @@
+# Foregone Solution
+
+[Direct link to Google Code Jam site](https://codingcompetitions.withgoogle.com/codejam/round/0000000000051705/0000000000088231)
+
+This solution passes all test set 1 (6 points), test set 2 (10 points) and test set 3 (1 point).
+
+## Prerequisite
+
+nodejs 11.13.0
+
+## Usage
+
+First, install dev dependencies (babel, rollup, jest etc) by running the following:
+
+```
+npm install
+```
+
+To run tests:
+
+```
+npm run test
+```
+
+Build the solution into one file output at `build/solution.js`:
+
+```
+npm run build
+```
+
+`build/solution.js` is the code to be submitted to Google Code Jam site.
+
+To run and test `build/solution.js` manually, run the following and key in the input:
+
+```
+npm run start
+```

2019/qualification/1-foregone-solution/build/solution.js

@@ -0,0 +1,94 @@
+'use strict';
+
+const parseCase = (line, data) => {
+  const {
+    isProcessing,
+    ...result
+  } = data;
+  result.N = line;
+  return result;
+};
+
+const parseProblem = (line, problem) => {
+  if (!problem.T || problem.T === 0) {
+    const result = { ...problem,
+      T: parseInt(line),
+      isProcessing: true
+    };
+    return result;
+  }
+
+  const cases = [...problem.cases];
+
+  if (cases.length === 0 || !cases[cases.length - 1].isProcessing) {
+    cases.push({
+      isProcessing: true
+    });
+  }
+
+  const currentCase = cases[cases.length - 1];
+  cases[cases.length - 1] = parseCase(line, currentCase);
+  const isProcessing = cases.length < problem.T || cases[cases.length - 1].isProcessing;
+  const result = { ...problem,
+    cases,
+    isProcessing
+  };
+  return result;
+};
+
+const solve = data => {
+  const {
+    N
+  } = data;
+  const A = [];
+  const B = [];
+  N.split('').forEach(c => {
+    if (c === '4') {
+      A.push('2');
+      B.push('2');
+    } else {
+      A.push(c);
+
+      if (B.length > 0) {
+        B.push('0');
+      }
+    }
+  });
+  const result = `${A.join('')} ${B.join('')}`;
+  return result;
+};
+
+const solveCases = cases => {
+  for (let index = 0; index < cases.length; index++) {
+    const result = solve(cases[index]);
+    console.log(`Case #${index + 1}: ${result}`);
+  }
+};
+
+const main = () => {
+  const readline = require('readline');
+
+  let problem = {
+    T: 0,
+    cases: [],
+    isProcessing: true
+  };
+  const rl = readline.createInterface({
+    input: process.stdin,
+    output: process.stdout
+  });
+  rl.on('line', line => {
+    problem = parseProblem(line, problem);
+
+    if (!problem.isProcessing) {
+      rl.close();
+    }
+  }).on('close', () => {
+    solveCases(problem.cases);
+    process.exit(0);
+  });
+};
+
+if (!module.parent) {
+  main();
+}