{"lang": "Node.js", "source_code": "const readline = require('readline');\n\nconst rl = readline.createInterface({\n\tinput: process.stdin,\n\toutput: process.stdout,\n\tterminal: false\n});\n\nrl.on('line', function(line){\n\tconst b = parseInt(line);\n\tlet counter = 0;\n\tconst sqrt = Math.sqrt(b)\n\tfor (let i = 2; i < sqrt; i++) {\n\t\tif (b % i === 0) { counter += 2; }\n\t}\n\tif (sqrt % 1 === 0) { counter++; }\n\tconsole.log(b === 1 ? 1 : counter + 2);\n\trl.close();\n});\n", "lang_cluster": "Javascript", "tags": ["math", "number theory"], "code_uid": "d03aa2efaaec588d5f7c5814638d765b", "src_uid": "7fc9e7d7e25ab97d8ebc10ed8ae38fd1", "difficulty": 1200.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "'use strict';\nconst readline = require('readline').createInterface({\n  input: process.stdin,\n  output: process.stdout\n});\n\nreadline.question('', str => {\n  solution(str);\n  readline.close();\n});\n\nfunction solution(str) {\n  let i, j, count = 0;\n  for(i = 0; i < str.length; i++) {\n    for(j = i - 1; j >= 0; j--) {\n      if (str[i] === str[j]) {\n        break;\n      }\n    }\n    if (j === -1) count++;\n  }\n  if (count % 2) {\n    console.log(\"IGNORE HIM!\");\n    return;\n  }\n  console.log(\"CHAT WITH HER!\");\n  return;\n}\n", "lang_cluster": "Javascript", "tags": ["brute force", "strings", "implementation"], "code_uid": "f3236faae66ffa5101f5eacd5422ba95", "src_uid": "a8c14667b94b40da087501fd4bdd7818", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "let inputString = '';\nlet currentLine = 0;\n\nconst runMain = () => {\n  inputString = inputString.trim().split('\\n').map(string => string.trim());\n  main();\n  process.exit();\n}\nconst readLine = () => inputString[currentLine++];\n\nprocess.stdin.on('data', inputStdin => inputString += inputStdin);\nprocess.stdin.on('end', runMain);\nprocess.on('SIGINT', runMain);\n\nfunction main() {\n  const [n, t] = readLine().split(' ').map(num => Number(num));\n  const str = readLine().split('');\n  for (let i = 0; i < t; i++) {\n    let j = 0;\n    while (j < n - 1) {\n      if (str[j] === 'B' && str[j + 1] === 'G') {\n        str[j] = 'G';\n        str[j + 1] = 'B';\n        j++;\n      }\n      j++;\n    }\n  }\n  console.log(str.join(''));\n}\n", "lang_cluster": "Javascript", "tags": ["constructive algorithms", "implementation", "shortest paths", "graph matchings"], "code_uid": "c2839fa4f1512bd5b74a68b4038a6701", "src_uid": "964ed316c6e6715120039b0219cc653a", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "const readline = require('readline');\n\nconst rl = readline.createInterface({\n  input: process.stdin,\n  output: process.stdout\n});\n\nvar ans=0,met=false;\n\nrl.on('line', (input) => {\n    let temp=input.match(/B/g);\n   // console.log(\"temp= \"+temp);\n    if(/*temp.length == 8*/ input==\"BBBBBBBB\")\n       ans++;\n    else if(!met){\n      if(temp!=null)  \n          ans+=temp.length;\n       met=true;\n    }\n   \n  }).on('close',function(){\n      console.log(ans);\n  });", "lang_cluster": "Javascript", "tags": ["brute force", "constructive algorithms"], "code_uid": "cced2b7dcb8bdcc86e67e28e98ea2c2c", "src_uid": "8b6ae2190413b23f47e2958a7d4e7bc0", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "function main() {\n    // write code here:\n    var m=Number(stdin[0]);\n    var n=1;\n    for(var i=1;i<=m;i++){\n        n+=4*(i-1);\n    }\n    console.log(n);\n}\n\nconst readline = require('readline');\nconst rl = readline.createInterface({input: process.stdin});\nvar stdin = [];\nrl.on('line', function (line) {stdin.push(line);});\nrl.on('close', main);", "lang_cluster": "Javascript", "tags": ["math", "dp", "implementation"], "code_uid": "65597bf7c449a87590f99015bfd183c5", "src_uid": "758d342c1badde6d0b4db81285be780c", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "let i = '';\n\nprocess.stdin.on('data', c => i += c);\nprocess.stdin.on('end', () => {\n    const {EOL} = require('os');\n    const lines = i.split(EOL);\n    var t = lines[0]\n    for(j = 1; j <= t; j++){\n        var s = 1\n        var n = lines[j]\n        for(k = 1; k < n; k++){\n            s +=  s + 1\n        }\n        console.log(s   )\n    }\n});\n ", "lang_cluster": "Javascript", "tags": ["implementation"], "code_uid": "f4790c0e5cab37504290714437815b84", "src_uid": "d5e66e34601cad6d78c3f02898fa09f4", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "process.stdin.resume();\nprocess.stdin.setEncoding('utf-8');\nlet inputString = '';\nlet currentLine = 0;\nprocess.stdin.on('data', (inputStd) => {\n    inputString += inputStd;\n});\nprocess.stdin.on('end', function () {\n    inputString = inputString\n        .trim()\n        .split('\\n')\n        .map((str) => {\n            return str.trim();\n        });\n    main();\n});\nfunction readLine() {\n    return inputString[currentLine++];\n}\n\nfunction main() {\n    let word = readLine();\n    if (word.includes('H') || word.includes('Q') || word.includes('9')) {\n        console.log('YES');\n    } else {\n        console.log('NO');\n    }\n}\n", "lang_cluster": "Javascript", "tags": ["implementation"], "code_uid": "318b5d507c39323986bf417baed15256", "src_uid": "1baf894c1c7d5aeea01129c7900d3c12", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "const readline = require('readline');\nconst rl = readline.createInterface({\n  input: process.stdin,\n  output: process.stdout,\n  terminal: false\n});\nlet counter = 0;\nlet S, T;\n\nrl.on('line', (d) => {\n  if (counter === 0) {\n    S = d;\n  }\n  else {\n    T = d;\n\n    let ans = 'YES';\n    let j = 0;\n    for (let i = T.length - 1; i >=0; i--) {\n      if (T[i] !== S[j]) {\n        ans = 'NO';\n        break;\n      }\n      j++;\n    }\n\n    console.log(ans);\n  }\n\n  counter++;\n});\n", "lang_cluster": "Javascript", "tags": ["strings", "implementation"], "code_uid": "902df35f6ba013e8ba5fde43ddc109b9", "src_uid": "35a4be326690b58bf9add547fb63a5a5", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "const readline = require('readline');\nconst rl = readline.createInterface({\n  input: process.stdin,\n  output: process.stdout,\n  terminal: false\n});\nlet c = 0;\n\nrl.on('line', (d) => {\n  if (c === 0) {\n    c++;\n    return;\n  }\n\n  const arr = d.split(' ').map(Number);\n  arr.sort((a, b) => a - b);\n  let ans = 0;\n  let prev = -1;\n\n  for (let i = 0; i < arr.length; i++) {\n    if (prev !== arr[i] && arr[i] !== 0) {\n      ans++;\n      prev = arr[i];\n    }\n  }\n\n  console.log(ans);\n\n  c++;\n});\n", "lang_cluster": "Javascript", "tags": ["sortings", "implementation"], "code_uid": "f728375c4c22ee03e44d16c364b022bc", "src_uid": "3b520c15ea9a11b16129da30dcfb5161", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "let inputString = \"\";\nlet currentLine = 0;\nprocess.stdin.on(\"data\", (data) => {\n  inputString += data;\n});\nprocess.stdin.on(\"end\", function () {\n  inputString = inputString\n    .trim()\n    .split(\"\\n\")\n    .map((str) => str.trim());\n  main();\n});\nfunction readLine() {\n  return inputString[currentLine++];\n}\nfunction main() {\n  let a = readLine();\n  if (a.toUpperCase() === a) {\n    console.log(a.toLowerCase());\n  } else if (a[0].toLowerCase() + a.substring(1).toUpperCase() === a) {\n    console.log(a[0].toUpperCase() + a.substring(1).toLowerCase());\n  } else {\n    console.log(a);\n  }\n}\n", "lang_cluster": "Javascript", "tags": ["strings", "implementation"], "code_uid": "244d422578d87b8a3c447d2d6a64b45e", "src_uid": "db0eb44d8cd8f293da407ba3adee10cf", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "const { EOL } = require('os');\n\nfunction findGreeting(str) {\n  const word = 'hello';\n  let i = 0;\n  for(const l of str) {\n    if(l == word[i]) {\n      i++;\n    }\n  }\n  return i == word.length ? 'YES' : 'NO';\n}\n\nlet data = '';\nprocess.stdin.on('data', c => data += c);\nprocess.stdin.on('end', () => {\n  const res = findGreeting(data.split(EOL)[0]);\n  console.log(res);\n});\n", "lang_cluster": "Javascript", "tags": ["greedy", "strings"], "code_uid": "5037b772020d7b532fda617d3092e0a6", "src_uid": "c5d19dc8f2478ee8d9cba8cc2e4cd838", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "let stdin = process.stdin;\nstdin.setEncoding('utf8');\nstdin.on('data', function (data) {\n    let input = data.split('\\n');\n    let n = input[0].split(' ').map(function (a) { return parseInt(a); });\n    let result = solution(n[0], n[1]);\n    console.log(result);\n});\n\n// End of interface\n\n\nconst solution = function(a, b){\n\tlet i = 0;\n\twhile (a <= b) {\n\t\ta = a * 3; \n\t\tb = b * 2; \n\t\ti++;\n\t}\n\treturn i;\n};", "lang_cluster": "Javascript", "tags": ["implementation"], "code_uid": "fd2b653fa2972b202adf30015cca3a67", "src_uid": "a1583b07a9d093e887f73cc5c29e444a", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "const readLine = require('readline').createInterface({\n  input: process.stdin,\n  output: process.stdout,\n});\n \nconst input = [];\nreadLine.on('line', line => input.push(line));\n \nreadLine.on('close', () => {\n  const [n] = input[0].split(' ').map(x => parseInt(x));\n\n  if (n % 2 === 0) console.log('Mahmoud');\n  else console.log('Ehab');\n}); ", "lang_cluster": "Javascript", "tags": ["math", "games"], "code_uid": "4b6c580465889e5831bcc51f83a5f725", "src_uid": "5e74750f44142624e6da41d4b35beb9a", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "'use strict';\r\n\r\nprocess.stdin.resume();\r\nprocess.stdin.setEncoding('utf-8');\r\n\r\nlet inputString = '';\r\nlet currentLine = 0;\r\n\r\nprocess.stdin.on('data', inputStdin => {\r\n    inputString += inputStdin;\r\n});\r\n\r\nprocess.stdin.on('end', _ => {\r\n    inputString = inputString.trim().split('\\n').map(string => {\r\n        return string.trim();\r\n    });\r\n    \r\n    main();    \r\n});\r\n\r\nfunction readline() {\r\n    return inputString[currentLine++];\r\n}\r\n\r\nfunction output(x) {\r\n    if (typeof x !== 'string') {\r\n        x = x.toString();\r\n    }\r\n    //process.stdout.write(x);   // without auto '\\n' (newline)\r\n    console.log(x);  // with auto '\\n' (newline)\r\n}\r\n\r\nfunction main() {\r\n    let N = readline();\r\n\r\n    for (let test = 0; test < N; test++) {\r\n        let f = readline().split(' ').map(Number);\r\n        let s = readline().split(' ').map(Number);\r\n\r\n        let result = 2;\r\n        if (f[0] === 0 && f[1] === 0 && s[0] === 0 && s[1] === 0) {\r\n            result = 0;\r\n        } else if (f[0] + f[1] + s[0] + s[1] === 4) {\r\n            result = 2;\r\n        } else {\r\n            result = 1;\r\n        }\r\n\r\n        output(result);\r\n    }\r\n}\r\n", "lang_cluster": "Javascript", "tags": ["implementation"], "code_uid": "80bf0e055db432850d8d2a01a1a0f111", "src_uid": "7336b8becd2438f0439240ee8f9610ec", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "const readline = require('readline').createInterface({\n    input: process.stdin,\n    output: process.stdout,\n});\n\nconst input = [];\nreadline.on('line', line => { input.push(line); });\n\nreadline.on('close', () => {\n    const n = Number(input[0]);\n    const left = [], right = [];\n    for (let i = 1; i <= n; i++) {\n        let [l, r] = input[i].split(' ');\n        left.push(l); right.push(r);\n    }\n    let c = 0;\n    for (let i = 0; i < left.length; i++) {\n        for (let j = 0; j < right.length; j++) {\n            if (j === i) continue;\n            if (left[i] === right[j]) c++;\n        }\n    }\n    console.log(c);\n});", "lang_cluster": "Javascript", "tags": ["brute force"], "code_uid": "85e16288bf9ca9f9912727a3f379ba3f", "src_uid": "745f81dcb4f23254bf6602f9f389771b", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "'use strict';\r\n\r\nvar fs = require('fs');\r\n\r\nfunction _interopDefaultLegacy (e) { return e && typeof e === 'object' && 'default' in e ? e : { 'default': e }; }\r\n\r\nvar fs__default = /*#__PURE__*/_interopDefaultLegacy(fs);\r\n\r\nfunction solve(read) {\r\n  const [rn, rb, rns, re, rbs] = convertInput(read);\r\n  const [n, m] = rns();\r\n  let pre = 1,\r\n      M = mod(m),\r\n      res = 0,\r\n      ans = M,\r\n      ans1 = M;\r\n  const p = getPrimes(n + 10);\r\n  for (let i = 2; i <= n; i++) {\r\n    if (pre <= m && p[i]) pre = pre * i;\r\n    if (pre > m) {\r\n      ans = 0;\r\n    } else {\r\n      ans = mul(ans, Math.floor(m / pre));\r\n    }\r\n    ans1 = mul(ans1, M);\r\n    res = mod(res + ans1 - ans);\r\n  }\r\n  return res;\r\n}\r\nfunction getPrimes(n) {\r\n  const nums = new Array(n + 1).fill(1);\r\n  nums[0] = nums[1] = 0;\r\n  const primes = [];\r\n  for (let i = 2; i <= n; i++) {\r\n    if (nums[i]) primes.push(i);\r\n    for (let j = 0; primes[j] <= n / i; j++) {\r\n      nums[primes[j] * i] = 0;\r\n      if (i % primes[j] === 0) break;\r\n    }\r\n  }\r\n  return nums;\r\n}\r\nconst MOD = 998244353;\r\nfunction mod(num) {\r\n  if (num >= MOD) return num % MOD;else if (num < 0) return (num % MOD + MOD) % MOD;\r\n  return num;\r\n}\r\nfunction mul(...args) {\r\n  if (args.length === 0) throw new Error('参数不能为空');\r\n  if (args.length === 1) return args[0];\r\n  const [a, b] = args;\r\n  if (args.length > 2) return mul(mul(a, b), ...args.slice(2));\r\n  return (Math.floor(a / 65536) * b % MOD * 65536 + (a & 65535) * b) % MOD;\r\n}\r\nfunction convertInput(read) {\r\n  const rn = () => Number(read());\r\n  const rb = () => BigInt(read());\r\n  const rns = () => read().split(/\\s+/).map(Number);\r\n  const re = () => read().split(/\\s+/).map(s => Number(s) - 1);\r\n  const rbs = () => read().split(/\\s+/).map(BigInt);\r\n  return [rn, rb, rns, re, rbs];\r\n}\r\nfunction main(r) {\r\n  try {\r\n    let t = 1;\r\n    let res = new Array(t);\r\n    let limit = 0;\r\n    for (let i = 0; i < t; i++) {\r\n      var _solve;\r\n      const s = (_solve = solve(r)) !== null && _solve !== void 0 ? _solve : '';\r\n      if (t < limit) ; else {\r\n        res[i] = s;\r\n      }\r\n    }\r\n    if (t >= limit) {\r\n      return res.join('\\n');\r\n    }\r\n  } catch (error) {\r\n    console.log(error);\r\n  }\r\n}\r\n\r\nconst inputs = fs__default[\"default\"].readFileSync(0, 'utf-8').split(/\\r?\\n/);\r\nvoid function () {\r\n  const read = ((i = 0) => () => inputs[i++])();\r\n  const output = main(read);\r\n  process.stdout.write(output);\r\n}();\r\n", "lang_cluster": "Javascript", "tags": ["math", "dp", "combinatorics", "number theory"], "code_uid": "2f314d0cbd1aa5a967af96169a2d14e9", "src_uid": "0fdd91ed33431848614075ebe9d2ee68", "difficulty": 1900.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "const readline = require('readline');\n\nconst rl = readline.createInterface({\n  input: process.stdin,\n  output: process.stdout\n});\n\nrl.on('line', n => {\n  const a = Array.from(n).filter(letter => letter === 'a').length;\n  console.log((a > (n.length / 2)) ? n.length : (a + (a - 1)));\n  rl.close();\n});", "lang_cluster": "Javascript", "tags": ["strings", "implementation"], "code_uid": "257d1b512cff12600ee4ec59d3ed36f5", "src_uid": "84cb9ad2ae3ba7e912920d7feb4f6219", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "const readline = require('readline');\n\nconst rl = readline.createInterface({\n    input: process.stdin,\n    output: process.stdout\n});\nrl.on('line', (inputString) => {\n    let numberOfSquares = parseInt(inputString);\n    rl.close();\n    console.log(findTheNumberOfLinesForLady(numberOfSquares));\n});\n\nfunction findTheNumberOfLinesForLady(forTheNumberOfSquaress) {\n    let a = Math.sqrt(forTheNumberOfSquaress);\n    let b = Math.trunc(a);\n    if (a == b) return 2 * a;\n    if (b * (b + 1) >= forTheNumberOfSquaress) return 2 * b + 1;\n    return 2 * b + 2;\n}", "lang_cluster": "Javascript", "tags": ["math", "constructive algorithms", "binary search"], "code_uid": "ab5980a0df7d6f1d1dee99c1d119e8ae", "src_uid": "eb8212aec951f8f69b084446da73eaf7", "difficulty": 1100.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "//Don't have to see. start------------------------------------------\nvar read = require('readline').createInterface({\n\tinput: process.stdin, output: process.stdout\n});\nvar obj; var inLine = [];\nread.on('line', function(input){inLine.push(input);});\nread.on('close', function(){\n\tobj = init(inLine);\n\tconsole.error('\\n↑入力 ↓出力');\n\tMain();\n});\nfunction makeClone(obj){return (obj instanceof Set) ? new Set(Array.from(obj)) : JSON.parse(JSON.stringify(obj));}\nfunction nextInt(){return myconv(next(),1);} function nextStrArray(){return myconv(next(),2);}\nfunction nextIntArray(){return myconv(next(),4);} function nextCharArray(){return myconv(next(),6);}\nfunction next(){return obj.next();} function hasNext(){return obj.hasNext();}\nfunction init(input){  \n\treturn {\n\t\tlist : input, index : 0, max : input.length,\n\t\thasNext : function(){return (this.index < this.max);},\n\t\tnext : function(){if(this.hasNext()){return this.list[this.index++];}else{throw 'ArrayIndexOutOfBoundsException ‚There is no more input';}}\n\t};\n}\nfunction myout(s){console.log(s);}\nfunction myerr(s){console.error('debug:' + require('util').inspect(s,false,null));}\n//param \"no\" is\n//unknown or outlier : return i. 1: parseInt.\n//2: split space. 4: split space and parseInt.\n//6: split 1 character. 7: split 1 character and parseInt.\n//8: join space. 9: join nextline. 0: join no character.\nfunction myconv(i,no){try{switch(no){case 1:return parseInt(i);case 2:return i.split(' ');case 4:return i.split(' ').map(Number);case 6:return i.split('');case 7:return i.split('').map(Number);case 8:return i.join(' ');case 9:return i.join('\\n');case 0:return i.join('');default:return i;}}catch(e){return i;}}\n\n//Don't have to see. end------------------------------------------\nfunction Main(){\n\tvar one = nextIntArray();\n\tvar L = one[0];\n\tvar R = one[1];\n\tvar C = one[2];\n\tif(Math.abs(L - R) >= C){\n\t\tmyout((Math.min(Math.max(L, R), Math.min(L, R) + C)) * 2);\n\t}else{\n\t\tvar diff = Math.abs(L - R);\n\t\tif(L > R){\n\t\t\tR += diff;\n\t\t}else{\n\t\t\tL += diff;\n\t\t}\n\t\tC -= diff;\n\t\tmyout((Math.floor(C / 2) + L) * 2);\n\t}\n}\n", "lang_cluster": "Javascript", "tags": ["math", "implementation"], "code_uid": "8eaf0f0c76b1d17a211a4f810d93d188", "src_uid": "e8148140e61baffd0878376ac5f3857c", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "'use strict';\r\n\r\nprocess.stdin.resume();\r\nprocess.stdin.setEncoding('utf-8');\r\n\r\nlet inputString = '';\r\nlet currentLine = 0;\r\n\r\nprocess.stdin.on('data', inputStdin => {\r\n    inputString += inputStdin;\r\n});\r\n\r\nprocess.stdin.on('end', _ => {\r\n    inputString = inputString.trim().split('\\n').map(string => {\r\n        return string.trim();\r\n    });\r\n    \r\n    main();    \r\n});\r\n\r\nfunction readline() {\r\n    return inputString[currentLine++];\r\n}\r\n\r\nfunction output(x) {\r\n    if (typeof x !== 'string') {\r\n        x = x.toString();\r\n    }\r\n    //process.stdout.write(x);   // without auto '\\n' (newline)\r\n    console.log(x);  // with auto '\\n' (newline)\r\n}\r\n\r\nfunction main() {\r\n    let N = readline();\r\n\r\n    for (let test = 0; test < N; test++) {\r\n        let x = Number(readline());\r\n        let arr = readline().split(' ').map(Number);\r\n\r\n        let result = 'YES';\r\n\r\n        let first = arr[x - 1];\r\n        let second = first ? arr[first - 1] : 0;\r\n\r\n        if (first === 0) {\r\n            result = 'NO';\r\n        } else if (second === 0) {\r\n            result = 'NO';\r\n        }\r\n\r\n        output(result);\r\n    }\r\n}\r\n", "lang_cluster": "Javascript", "tags": ["brute force", "greedy", "implementation", "math"], "code_uid": "b28eaee69c1ce648187a89fef0e6b749", "src_uid": "5cd113a30bbbb93d8620a483d4da0349", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "/**\n * Problem - http://codeforces.com/contest/989/problem/A\n */\n\nprocess.stdin.resume()\nprocess.stdin.setEncoding('utf8')\n\nvar input_stdin = ''\nvar input_stdin_array = ''\nvar input_currentline = 0\n\nprocess.stdin.on('data', function (data) {\n  input_stdin += data\n})\n\nprocess.stdin.on('end', function () {\n  input_stdin_array = input_stdin.split('\\n')\n  main()\n})\n\nfunction readLine() {\n  return input_stdin_array[input_currentline++]\n}\n\nfunction main() {\n  let input = readLine()\n  process.stdout.write(doAppearInSomeCell(input))\n  process.exit()\n}\n\nfunction doAppearInSomeCell(input) {\n    if (input.length < 3) {\n        return 'No'\n    }\n\n    let set = ['ABC', 'ACB', 'BAC', 'BCA', 'CAB', 'CBA']\n\n    for (let i = 0 ; i < input.length ; i++) {\n        let k = input.substring(i, i + 3)\n        if (k.length === 3 && set.indexOf(k) !== -1) {\n            return 'Yes'\n        }\n    }\n\n    return 'No'\n}", "lang_cluster": "Javascript", "tags": ["strings", "implementation"], "code_uid": "6c8400e57c449c07ef1429e3faa80564", "src_uid": "ba6ff507384570152118e2ab322dd11f", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "const readline = require('readline');\nconst rl = readline.createInterface({\n  input: process.stdin,\n  output: process.stdout,\n  terminal: false\n});\nlet c = 0;\n\nrl.on('line', (d) => {\n  const [n, m] = d.split(' ').map(Number);\n\n  if (m === 0 || m === 1) {\n    console.log(1);\n  }\n  else if (n === m) {\n    console.log(0);\n  }\n  else if (n / 2 > m) {\n    console.log(m);\n  }\n  else {\n    console.log(n - m);\n  }\n\n  c++;\n});\n", "lang_cluster": "Javascript", "tags": ["math", "greedy"], "code_uid": "e10ee55c9f1a4e3a1e4ba974d6731087", "src_uid": "c05d0a9cabe04d8fb48c76d2ce033648", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "const readline = require('readline');\nconst rl = readline.createInterface({\n  input: process.stdin,\n  output: process.stdout,\n  terminal: false\n});\nlet c = 0;\n\nrl.on('line', (str) => {\n  if (c === 0) {\n    c++;\n    return;\n  }\n\n  let ans = 0;\n  const arr = str.split(' ');\n\n  for (let i = 0; i < arr.length; i++) {\n    let curr = 0;\n\n    for (let j = 0; j < arr[i].length; j++) {\n      if (arr[i].charCodeAt(j) >= 65 && arr[i].charCodeAt(j) <= 90) {\n        curr++;\n      }\n    }\n\n    ans = Math.max(ans, curr);\n  }\n\n  console.log(ans);\n\n  c++;\n});\n", "lang_cluster": "Javascript", "tags": ["implementation"], "code_uid": "96924e105e53ac170cf3358a6a0a5662", "src_uid": "d3929a9acf1633475ab16f5dfbead13c", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "let inputString = \"\";\nlet currentLine = 0;\nprocess.stdin.on(\"data\", (data) => {\n  inputString += data;\n});\nprocess.stdin.on(\"end\", function () {\n  inputString = inputString\n    .trim()\n    .split(\"\\n\")\n    .map((str) => str.trim());\n  main();\n});\nfunction readLine() {\n  return inputString[currentLine++];\n}\nfunction main() {\n  const [total, front, back] = readLine()\n    .split(\" \")\n    .map((n) => parseInt(n));\n  const diff = total - front;\n\n  if (diff > back) console.log(back + 1);\n  else console.log(diff);\n}\n", "lang_cluster": "Javascript", "tags": ["math"], "code_uid": "7a7a6040af7a56cebc90a37617d9c73e", "src_uid": "51a072916bff600922a77da0c4582180", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "process.stdin.resume()\nprocess.stdin.setEncoding('utf-8')\n\nvar arr = ''\nprocess.stdin.on('data', (i) => {\n  arr += i\n})\n\n\nprocess.stdin.on('end', () => {\n  arr = arr.split('\\n')\n  const ax = arr.shift().split(' ')\n  const v = parseInt(ax[0])\n  const e = parseInt(ax[1])\n\n  if(e == 0) {\n    console.log(0)\n    return\n  }\n  if(v <= 6) {\n    console.log(e)\n  }\n\n  else {\n    let m = new Map()\n  \n    for(let i = 1; i <= v; i ++) {\n      m.set(i, [])\n    }\n  \n    for(let i = 0; i < e; i ++) {\n      const edge = arr.shift().split(' ')\n      const a = parseInt(edge[0])\n      const b = parseInt(edge[1])\n      m.get(a).push(b)\n      m.get(b).push(a)\n    }\n\n    var f = false\n    var noOfVertices = 20\n    for(let j = 1; j <= 7; j ++) {\n      var a7 = m.get(j)\n      for(let i = 1; i <= 7; i ++) {\n        if(i == j) continue\n        var other = m.get(i)\n        var x = a7.filter(el => other.indexOf(el) != -1)\n        if(x.length == 0) {\n          f = true\n          break\n        }\n        else if(x.length < noOfVertices) {\n          noOfVertices = x.length\n        }\n      }\n    }\n    if(f) {\n      console.log(e)\n    }\n\n    else {\n      console.log(e - noOfVertices)\n    }\n  }\n})  ", "lang_cluster": "Javascript", "tags": ["brute force", "graphs"], "code_uid": "12ef2da25ccd0f255054ae58aa658cee", "src_uid": "11e6559cfb71b8f6ca88242094b17a2b", "difficulty": 1700.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "function main() {\n    // write code here:\n    var arr=stdin[0].split(' ').map(a => Number.parseInt(a)),s;\n    var min = Math.min(arr[1], arr[2]);\n    s=(arr[0] <= min) ? 'Yes' : 'No';\n    console.log(s);\n}\n\nconst readline = require('readline');\nconst rl = readline.createInterface({input: process.stdin});\nvar stdin = [];\nrl.on('line', function (line) {stdin.push(line);});\nrl.on('close', main);", "lang_cluster": "Javascript", "tags": ["implementation"], "code_uid": "a1819de4cd1f79453c6453d2bf2af7d9", "src_uid": "6cd07298b23cc6ce994bb1811b9629c4", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "function funkyNumbers(n) { \n\n    var funkyNumber = 'NO';\n\n    var maxTriangle = maxTrianglePossible(n);\n\n    for(let i = maxTriangle; i > 0; i--) {\n        var firstTriangle = triangleNumbers(i);\n        var rem = n - firstTriangle\n\n        if(rem === 0) continue;\n\n        var secFactor = maxTrianglePossible(rem);\n        var secTriangle = triangleNumbers(secFactor);\n\n        var triangles = firstTriangle + secTriangle;\n\n        if(triangles == n) {\n            funkyNumber = 'YES';\n            break;\n        } \n        \n    }\n    \n    return funkyNumber;       \n} \n\nfunction maxTrianglePossible(n) {\n    //k(k+1) / 2 = n where n is an integer\n    //k(k+1) = n*2\n    //k^2 + k - n*2 = 0 -> factors\n\n    var k = Math.floor( Math.sqrt(n*2) );\n\n    return k;\n\n}\n\nfunction triangleNumbers(x) {\n    \n    var f = ( x * (x + 1) ) / 2;\n\n    return f;\n}\n\n//stdin → stdout\nconst readline = require('readline').createInterface({\n  input: process.stdin,\n  output: process.stdout\n});\n\nreadline.on('line', n => {\n    readline.close();\n    \n    let res = funkyNumbers(n);\n    console.log(res);\n});", "lang_cluster": "Javascript", "tags": ["brute force", "implementation", "binary search"], "code_uid": "86353972c6f9605a10afe48297caea9d", "src_uid": "245ec0831cd817714a4e5c531bffd099", "difficulty": 1300.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "let input = '';\nlet inputResolve;\nlet inputPromise = new Promise(resolve => inputResolve = resolve);\nprocess.stdin.on('data', c => input += c);\nprocess.stdin.on('end', () => inputResolve());\n\nfunction For(a, b, fn) {\n  let res;\n  if (a < b) {\n    for (let i = a; i <= b; i++) {\n      if ((res = fn(i)) !== undefined) return res;\n    }\n  } else {\n    for (let i = a; i >= b; i--) {\n      if ((res = fn(i)) !== undefined) return res;\n    }\n  }\n}\n\nfunction Arr(a, b, fn, prev) {\n  let p = prev || 0;\n  if (a < b) return Array(b - a + 1).fill(0).map((v, i) => fn ? (p = fn(a + i, p)) : a + i);\n  return Array(a - b + 1).fill(0).map((v, i) => fn ? (p = fn(a - i, p)) : a - i);\n}\n\nObject.defineProperty(Object.prototype, '$k', {\n  value: function () { return Object.keys(this) }\n});\nObject.defineProperty(Object.prototype, '$v', {\n  value: function () { return Object.values(this) }\n});\nObject.defineProperty(Object.prototype, '$kv', {\n  value: function () { return Object.entries(this) }\n});\nArray.prototype.sum = function (fn) { return this.reduce((p, v) => p + (fn ? fn(v) : v), 0) }\nArray.prototype.uniq = function (fn) {\n  var set = new Set();\n  return this.filter(v => {\n    var newValue = !set.has(fn ? fn(v) : v);\n    set.add(fn ? fn(v) : v);\n    return newValue;\n  });\n}\nArray.prototype.toObj = function (fn) {\n  return this.map(v => fn(v)).reduce((p, v) => {\n    p[v[0]] = v[1];\n    return p;\n  }, {})\n}\nArray.prototype.min = function (fn) {\n  let min = Math.min(...this.map((v, i) => fn ? fn(v, i) : v));\n  let i = this.findIndex((v, i) => fn ? fn(v, i) == min : v == min);\n  return [this[i], i, min];\n}\nArray.prototype.max = function (fn) {\n  let max = Math.max(...this.map((v, i) => fn ? fn(v, i) : v));\n  let i = this.findIndex((v, i) => fn ? fn(v, i) == max : v == max);\n  return [this[i], i, max];\n}\n\nfunction gcd(a, b) {\n  if (!b) return a;\n  return gcd(b, a % b);\n}\nfunction mod(a, n, m) {\n  if (n == 0n) return 1n;\n  if (n % 2n == 0n) return mod(a * a % m, n / 2n, m);\n  return a * mod(a, n - 1n, m) % m;\n}\nfunction extendedEuclid(a, b) {\n  if (!b) return [1, 0];\n  else {\n    let [x, y] = extendedEuclid(b, a % b);\n    return [y, x - (a / b | 0) * y];\n  }\n}\n// [m] = extendedEuclid(a, 998244353);\n\n(async () => {\n  await inputPromise;\n  let inp = input.split(/\\s+/); r = 0;\n  let [n, k, s, t] = inp;\n  n = +n;\n  k = +k;\n  if (t[0] == t[1]) {\n    let x = Math.min([...s].filter(c => c == t[0]).length + k, n);\n    console.log(x * (x - 1) / 2);\n    return;\n  }\n  let f = Arr(0, n + 1, i => Arr(0, n + 1, i => Arr(0, n + 1, i => -1e5)));\n  f[0][0][0] = 0;\n  For(0, n, i => {\n    For(0, k, j => {\n      For(0, i, cnt0 => {\n        if (f[i][j][cnt0] < 0) return;\n        let e0 = s[i] == t[0];\n        let e1 = s[i] == t[1];\n        f[i + 1][j][cnt0 + e0] = Math.max(f[i + 1][j][cnt0 + e0], f[i][j][cnt0] + e1 * cnt0);\n        f[i + 1][j + 1][cnt0 + 1] = Math.max(f[i + 1][j + 1][cnt0 + 1], f[i][j][cnt0]);\n        f[i + 1][j + 1][cnt0] = Math.max(f[i + 1][j][cnt0], f[i][j][cnt0] + cnt0);\n      })\n    })\n  })\n  // console.log(f);\n  console.log(Arr(0, k, i => Arr(0, n, j => f[n][i][j]).max()[0]).max()[0]);\n})();", "lang_cluster": "Javascript", "tags": ["strings", "dp"], "code_uid": "100c816511ef0df576076a6d7dde3f5d", "src_uid": "9c700390ac13942cbde7c3428965b18a", "difficulty": 2100.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "//Don't have to see. start------------------------------------------\nvar read = require('readline').createInterface({\n\tinput: process.stdin, output: process.stdout\n});\nvar obj; var inLine = [];\nread.on('line', function(input){inLine.push(input);});\nread.on('close', function(){\n\tobj = init(inLine);\n\tconsole.error('\\n↑入力 ↓出力');\n\tMain();\n});\nfunction makeClone(obj){return (obj instanceof Set) ? new Set(Array.from(obj)) : JSON.parse(JSON.stringify(obj));}\nfunction nextInt(){return myconv(next(),1);} function nextStrArray(){return myconv(next(),2);}\nfunction nextIntArray(){return myconv(next(),4);} function nextCharArray(){return myconv(next(),6);}\nfunction next(){return obj.next();} function hasNext(){return obj.hasNext();}\nfunction init(input){  \n\treturn {\n\t\tlist : input, index : 0, max : input.length,\n\t\thasNext : function(){return (this.index < this.max);},\n\t\tnext : function(){if(this.hasNext()){return this.list[this.index++];}else{throw 'ArrayIndexOutOfBoundsException ‚There is no more input';}}\n\t};\n}\nfunction myout(s){console.log(s);}\nfunction myerr(s){console.error('debug:' + require('util').inspect(s,false,null));}\n//param \"no\" is\n//unknown or outlier : return i. 1: parseInt.\n//2: split space. 4: split space and parseInt.\n//6: split 1 character. 7: split 1 character and parseInt.\n//8: join space. 9: join nextline. 0: join no character.\nfunction myconv(i,no){try{switch(no){case 1:return parseInt(i);case 2:return i.split(' ');case 4:return i.split(' ').map(Number);case 6:return i.split('');case 7:return i.split('').map(Number);case 8:return i.join(' ');case 9:return i.join('\\n');case 0:return i.join('');default:return i;}}catch(e){return i;}}\n\n//Don't have to see. end------------------------------------------\nfunction Main(){\n\tvar N = nextInt();\n\tvar alist = nextIntArray();\n\tvar blist = nextIntArray();\n\tvar asum = 0;\n\tvar bsum = 0;\n\tfor(var i = 0; i < N; i++){\n\t\tasum += alist[i];\n\t\tbsum += blist[i];\n\t}\n\tif(asum >= bsum){\n\t\tmyout(\"Yes\");\n\t}else{\n\t\tmyout(\"No\");\n\t}\n}\n", "lang_cluster": "Javascript", "tags": ["math"], "code_uid": "919b5455b5e3f09aee8c06a3bc47b082", "src_uid": "e0ddac5c6d3671070860dda10d50c28a", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "let i = '';\nprocess.stdin.on('data', (c) => {\n  i += c;\n});\nprocess.stdin.on('end', () => {\n  const { EOL } = require('os');\n  const lines = i.split(EOL);\n  const [n, k] = lines[0].split(' ');\n  console.log(getCandiesEaten(parseInt(n, 10), parseInt(k, 10)));\n});\n\nfunction getCandiesEaten(n, k) {\n  if (n === 1) return 0;\n  n--;\n  let candies = 1;\n  let sum = 2;\n  let consumed = 0;\n  while (n > 0) {\n    while (candies <= k) {\n      candies += sum;\n      sum++;\n      n--;\n    }\n    // Reduce candies to less than k\n    const candiesToSubtract = candies - k;\n    n -= candiesToSubtract;\n    consumed += candiesToSubtract;\n    candies -= candiesToSubtract;\n  }\n  return consumed;\n}\n", "lang_cluster": "Javascript", "tags": ["brute force", "math", "binary search"], "code_uid": "3c793135afffbfd78992282386bf7423", "src_uid": "17b5ec1c6263ef63c668c2b903db1d77", "difficulty": 1000.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "let data = '';\nprocess.stdin.on('data', c => data += c);\n\nfunction* nextLine() {\n\tlet lines = data.trim().split(/\\n/g);\n\tfor(let l of lines){\n\t\tyield l.trim();\n\t}\n}\n\nlet nl = nextLine();\n\nnl.num = function() {\n\t\treturn Number(this.next().value);\n\t};\nnl.nums = function() {\n\t\treturn this.next().value.split(/\\s/g).map(Number);\n\t};\nnl.line = function() {\n\t\treturn this.next().value;\n\t}\n\t\nconst sol = () => {\n\tlet [n, k] = nl.nums();\n\tlet a = nl.nums();\n\tlet r = Array(n);\n\tr.fill(0);\n\tfor(let i of a){\n\t\tfor(let j = i-1; j < n && r[j] === 0; j++){\n\t\t\tr[j] = i;\n\t\t}\n\t}\n\tconsole.log(r.join(' '));\n\n};\n\nprocess.stdin.on('end', sol);\n", "lang_cluster": "Javascript", "tags": ["implementation"], "code_uid": "9c645fab4322f3f0b397c98736a924f3", "src_uid": "2e44c8aabab7ef7b06bbab8719a8d863", "difficulty": 900.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "process.stdin.setEncoding('ASCII');\nlet string = '';\nprocess.stdin.on('data', (data) => string += data);\n\nconst main = (input) => {\n    const ns = input[0].split(' ').map(Number);\n    const vol = input[1].split(' ').map(Number);\n\n    let sum = 0, mx = 0;\n\n    vol.forEach( (val) => {\n        sum += val;\n        mx = Math.max(mx, val);\n    });\n\n    if ((sum - mx) <= ns[1]) console.log(\"YES\");\n    else console.log(\"NO\");\n};\n\nprocess.stdin.on('end', () => main( string.trim().split('\\n') ));\n", "lang_cluster": "Javascript", "tags": ["implementation"], "code_uid": "f88a7d4e85929073f233c6d9b448370d", "src_uid": "496baae594b32c5ffda35b896ebde629", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "const readline = require('readline');\nconst rl = readline.createInterface({\n  input: process.stdin,\n  output: process.stdout,\n  terminal: false\n});\n\nrl.on('line', (d) => {\n  console.log(Math.floor(+d / 2) + 1);\n});\n", "lang_cluster": "Javascript", "tags": ["math"], "code_uid": "e4b36b867bd86773dd6eccfc9ea1af3d", "src_uid": "5551742f6ab39fdac3930d866f439e3e", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "var readline = require('readline');\nvar z = readline.createInterfrace\nvar r = readline.createInterface({\n    input: process.stdin,\n    output: process.stdout,\n    terminal: false\n});\nvar b = [];\nr.on('line', function (line) {\n    b.push(line);\n    if(b.length == 2){\n        r.close();\n\n        bain();\n    }\n});\nfunction bain(){\n    let a = \"\";\n    for(let k = 0; k<b[0].length; k++){\n        if(b[0].substr(k,1) != b[1].substr(k,1)){\n            a += \"\" + 1;\n        } else{\n            a += \"\" + 0;\n        }\n    }\n    console.log(a + \"\");\n}\n", "lang_cluster": "Javascript", "tags": ["implementation"], "code_uid": "076535cdc043b3328c864f4ae04bdbbb", "src_uid": "3714b7596a6b48ca5b7a346f60d90549", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "process.stdin.resume();\nprocess.stdin.setEncoding('utf-8');\nlet inputString = '';\nlet currentLine = 0;\nprocess.stdin.on('data', (inputStd) => {\n    inputString += inputStd;\n});\nprocess.stdin.on('end', function () {\n    inputString = inputString\n        .trim()\n        .split('\\n')\n        .map((str) => {\n            return str.trim();\n        });\n    main();\n});\nfunction readLine() {\n    return inputString[currentLine++];\n}\nfunction main() {\n    let nums = readLine().split(' ').map(Number);\n    let [n, m] = nums; // [2, 5]\n    for (let i = n + 1; i <= m; i++) {\n        // console.log(i);\n        if (isPrime(i) && i !== m) {\n            console.log('NO');\n            return;\n        }\n        if (isPrime(i)) {\n            if (i === m) {\n                // console.log(isPrime(i));\n                console.log('YES');\n                return;\n            }\n        }\n    }\n    console.log('NO');\n}\n\nfunction isPrime(number) {\n    if (number <= 1) {\n        return false;\n    }\n    for (let i = 2; i < number; i++) {\n        if (number % i === 0) {\n            return false;\n        }\n    }\n    return true;\n}\n", "lang_cluster": "Javascript", "tags": ["brute force"], "code_uid": "45bc8c8fdc58ba73c9e10f56e88dda3f", "src_uid": "9d52ff51d747bb59aa463b6358258865", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "const input = [];\n\nconst RL = require('readline').createInterface({\n   input : process.stdin,\n   output : process.stdout\n});\n \nRL.on('line', (line) => {\n    input.push(line);\n});\n\nfunction solver(n, m) {\n  let first = 0, second = 0, copyN = n;\n  let point = (m % 2 === 0) ? m : m + 1;\n\n  while (copyN !== point/2) {\n    if (copyN > point/2) {\n      first += copyN - (point/2);\n      copyN = point/2;\n    }\n    if (copyN < point/2) { copyN *= 2;  first += 1; }\n  }\n  first += (m % 2 === 0) ? 1 : 2;\n\n  copyN = n;\n  while (copyN !== m) {\n    if (copyN < m) copyN *= 2;\n    else {\n      second += copyN - m;\n      break;\n    }\n    second += 1;\n  }\n  \n  return Math.min(first, second);\n}\n\nRL.on('close', () => {\n  let [n, m] = input[0].split(' ').map(x => parseInt(x));\n  if (n > m) {\n    console.log(n - m); return;\n  }\n  let data = {};\n  data[n] = n;\n  \n  let find = 0;\n  while (true) {\n    const map = {};\n    for (const i of Object.keys(data)) {\n      let x = parseInt(i);\n      if (x - 1 >=  1 ) {\n        map[x - 1] = x-1;\n        if (x - 1 === m) {\n          console.log(find+1); return;\n        }\n      }\n      if (x*2 <= m*1.5) {\n        map[x * 2] =x*2;\n        if (x*2 === m) {\n          console.log(find+1); return;\n        }\n      }\n    }\n    data = map;\n  \n    find += 1;\n  }\n});", "lang_cluster": "Javascript", "tags": ["dfs and similar", "shortest paths", "math", "graphs", "greedy", "implementation"], "code_uid": "99383e2a03bf4eeb0a7c807c09b99f8e", "src_uid": "861f8edd2813d6d3a5ff7193a804486f", "difficulty": 1400.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "//Don't have to see. start------------------------------------------\nvar read = require('readline').createInterface({\n\tinput: process.stdin, output: process.stdout\n});\nvar obj; var inLine = [];\nread.on('line', function(input){inLine.push(input);});\nread.on('close', function(){\n\tobj = init(inLine);\n\tconsole.error('\\n↑入力 ↓出力');\n\tMain();\n});\nfunction makeClone(obj){return (obj instanceof Set) ? new Set(Array.from(obj)) : JSON.parse(JSON.stringify(obj));}\nfunction nextInt(){return myconv(next(),1);} function nextStrArray(){return myconv(next(),2);}\nfunction nextIntArray(){return myconv(next(),4);} function nextCharArray(){return myconv(next(),6);}\nfunction next(){return obj.next();} function hasNext(){return obj.hasNext();}\nfunction init(input){  \n\treturn {\n\t\tlist : input, index : 0, max : input.length,\n\t\thasNext : function(){return (this.index < this.max);},\n\t\tnext : function(){if(this.hasNext()){return this.list[this.index++];}else{throw 'ArrayIndexOutOfBoundsException ‚There is no more input';}}\n\t};\n}\nfunction myout(s){console.log(s);}\nfunction myerr(s){console.error('debug:' + require('util').inspect(s,false,null));}\n//param \"no\" is\n//unknown or outlier : return i. 1: parseInt.\n//2: split space. 4: split space and parseInt.\n//6: split 1 character. 7: split 1 character and parseInt.\n//8: join space. 9: join nextline. 0: join no character.\nfunction myconv(i,no){try{switch(no){case 1:return parseInt(i);case 2:return i.split(' ');case 4:return i.split(' ').map(Number);case 6:return i.split('');case 7:return i.split('').map(Number);case 8:return i.join(' ');case 9:return i.join('\\n');case 0:return i.join('');default:return i;}}catch(e){return i;}}\n\n//Don't have to see. end------------------------------------------\nfunction Main(){\n\tvar N = nextInt();\n\tvar s = next();\n\tvar sf = 0;\n\tvar fs = 0;\n\tfor(var i = 0; i < N - 1; i++){\n\t\tif(s[i] == \"F\" && s[i + 1] == \"S\"){\n\t\t\tfs++;\n\t\t}\n\t\tif(s[i] == \"S\" && s[i + 1] == \"F\"){\n\t\t\tsf++;\n\t\t}\n\t}\n\tif(sf > fs){\n\t\tmyout(\"YES\");\n\t}else{\n\t\tmyout(\"NO\");\n\t}\n}\n", "lang_cluster": "Javascript", "tags": ["implementation"], "code_uid": "f05425a933967eed3617e524de33368b", "src_uid": "ab8a2070ea758d118b3c09ee165d9517", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "//Don't have to see. start------------------------------------------\nvar read = require('readline').createInterface({\n  input: process.stdin, output: process.stdout\n});\nvar obj; var inLine = [];\nread.on('line', function(input){inLine.push(input);});\nread.on('close', function(){\n  obj = init(inLine);\n  console.error('\\n↑入力 ↓出力');\n  Main();\n});\nfunction makeClone(obj){return (obj instanceof Set) ? new Set(Array.from(obj)) : JSON.parse(JSON.stringify(obj));}\nfunction nextInt(){return myconv(next(),1);} function nextStrArray(){return myconv(next(),2);}\nfunction nextIntArray(){return myconv(next(),4);} function nextCharArray(){return myconv(next(),6);}\nfunction next(){return obj.next();} function hasNext(){return obj.hasNext();}\nfunction init(input){  \n  return {\n    list : input, index : 0, max : input.length,\n    hasNext : function(){return (this.index < this.max);},\n    next : function(){if(this.hasNext()){return this.list[this.index++];}else{throw 'ArrayIndexOutOfBoundsException ‚There is no more input';}}\n  };\n}\nfunction myout(s){console.log(s);}\nfunction myerr(s){console.error('debug:' + require('util').inspect(s,false,null));}\n//param \"no\" is\n//unknown or outlier : return i. 1: parseInt.\n//2: split space. 4: split space and parseInt.\n//6: split 1 character. 7: split 1 character and parseInt.\n//8: join space. 9: join nextline. 0: join no character.\nfunction myconv(i,no){try{switch(no){case 1:return parseInt(i);case 2:return i.split(' ');case 4:return i.split(' ').map(Number);case 6:return i.split('');case 7:return i.split('').map(Number);case 8:return i.join(' ');case 9:return i.join('\\n');case 0:return i.join('');default:return i;}}catch(e){return i;}}\n\n//Don't have to see. end------------------------------------------\nfunction Main(){\n  var N = nextInt();\n  var s = next().split(\"W\");\n  var output = [];\n  for(var i = 0; i < s.length; i++){\n    if(s[i] != \"\"){\n      output.push(s[i].length);\n    }\n  }\n  myout(output.length);\n  myout(myconv(output, 8));\n}\n", "lang_cluster": "Javascript", "tags": ["implementation"], "code_uid": "040ead5d05ece947ba1fc0ac77d4e1c1", "src_uid": "e4b3a2707ba080b93a152f4e6e983973", "difficulty": 800.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "const readline = require(\"readline\").createInterface({\n    input: process.stdin,\n    output: process.stdout,\n  });\n  \n  readline.question(\"\", (_input) => {\n      const input = _input.split(' ').map(Number);\n              digiGame(input[0], input[1], input[2]);\n  });\n  \n  \n  const digiGame = (a, b, r) => {\n      if (2 * r <= a && 2 * r <= b) {\n          console.log('First');\n      } else {\n        console.log('Second');\n      }\n  };\n  \n  ", "lang_cluster": "Javascript", "tags": ["math", "constructive algorithms", "games"], "code_uid": "dda133a14e39e92c16f69aad82d16f65", "src_uid": "90b9ef939a13cf29715bc5bce26c9896", "difficulty": 1600.0, "exec_outcome": "PASSED"}
{"lang": "Node.js", "source_code": "// Little Pigs and Wolves - https://codeforces.com/problemset/problem/116/B\n\nconst main = async () => {\n  const arr = [];\n  let len = [];\n\n  const rl = require(\"readline\").createInterface({\n    input: process.stdin,\n    output: process.stdout,\n  });\n\n  let m, n;\n  let i = 1;\n\n  for await (const line of rl) {\n    if (!len.length) {\n      len = line.split(\" \").map(Number);\n      n = len[0];\n      m = len[1];\n      arr[n + 1] = [];\n      arr[0] = [];\n      for (let x = 0; x < m + 2; x++) {\n        arr[0].push(\".\");\n        arr[n + 1].push(\".\");\n      }\n    } else {\n      if (i < n) {\n        arr[i] = [\".\"];\n        arr[i].push(...line.split(\"\"));\n        arr[i].push(\".\");\n      } else {\n        arr[i] = [\".\"];\n        arr[i].push(...line.split(\"\"));\n        arr[i].push(\".\");\n        rl.close();\n      }\n      i++;\n    }\n  }\n  runGame(arr, m, n);\n};\n\nconst runGame = (arr, m, n) => {\n  let output = 0;\n\n  for (let i = 1; i < n + 1; i++) {\n    for (let j = 1; j < m + 1; j++) {\n      if (arr[i][j] == \"W\") {\n        if (\n          arr[i - 1][j] == \"P\" ||\n          arr[i + 1][j] == \"P\" ||\n          arr[i][j - 1] == \"P\" ||\n          arr[i][j + 1] == \"P\"\n        ) {\n          output++;\n        }\n      }\n    }\n  }\n  console.log(output);\n};\n\nmain();\n", "lang_cluster": "Javascript", "tags": ["greedy", "implementation"], "code_uid": "fc5fe7f6ae26755ff64bcd6a525d1768", "src_uid": "969b24ed98d916184821b2b2f8fd3aac", "difficulty": 1100.0, "exec_outcome": "PASSED"}