{"source_code": "var readline = require('readline');\r\nvar rl = readline.createInterface({\r\n input: process.stdin,\r\n output: process.stdout,\r\n terminal: false\r\n});\r\n\r\nlet ls = [];\r\n\r\nfunction solve(){\r\n const len = parseInt(ls[0]);\r\n for (let i = 1; i <= len; i++){\r\n console.log(Math.pow(2, parseInt(ls[i])) - 1);\r\n }\r\n}\r\n\r\nrl.on('line', (l) => ls.push(`${l}`));\r\nrl.on('close', () => solve());", "src_uid": "d5e66e34601cad6d78c3f02898fa09f4"}
{"source_code": "MOD = 1000000000+7;\n\nfunction main() {\n\tvar n = +readline();\n\tvar answer = 1;\n\tfor (var i = 0; i < n*3; i++) {\n\t\tanswer *= 3;\n\t\tanswer %= MOD;\n\t}\n\t// 2..\n\t// 1 2 3\n\tb = 1;\n\tfor (var i =0; i < n; i++)\n\t{\n\t\tb *= 7\n\t\tb %= MOD;\n\t}\n\tanswer = (MOD + answer - b);\n\tanswer %= MOD;\n\n\t// 3 2 1\n\t//answer -= 3;\n\n\twrite(answer);\n}\n\nmain();", "src_uid": "eae87ec16c284f324d86b7e65fda093c"}
{"source_code": "/*! bignumber.js v5.0.0 https://github.com/MikeMcl/bignumber.js/LICENCE */\n\"use strict\";var BigNumber,isNumeric=/^-?(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?$/i,mathceil=Math.ceil,mathfloor=Math.floor,notBool=\" not a boolean or binary digit\",roundingMode=\"rounding mode\",tooManyDigits=\"number type has more than 15 significant digits\",ALPHABET=\"0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_\",BASE=1e14,LOG_BASE=14,MAX_SAFE_INTEGER=9007199254740991,POWS_TEN=[1,10,100,1e3,1e4,1e5,1e6,1e7,1e8,1e9,1e10,1e11,1e12,1e13],SQRT_BASE=1e7,MAX=1e9;function constructorFactory(e){var n,t,r=0,o=m.prototype,i=new m(1),u=20,l=4,s=-7,c=21,f=-1e7,a=1e7,h=!0,g=b,A=!1,E=1,p=0,S={decimalSeparator:\".\",groupSeparator:\",\",groupSize:3,secondaryGroupSize:0,fractionGroupSeparator:\"\u00a0\",fractionGroupSize:0};function m(e,n){var o,i,s,c,A,E,p=this;if(!(p instanceof m))return new m(e,n);if(null!=n&&g(n,2,64,r,\"base\")){if(n|=0,E=e+\"\",10==n)return p=new m(e instanceof m?e:E),M(p,u+p.e+1,l);if((c=\"number\"==typeof e)&&0*e!=0||!new RegExp(\"^-?\"+(o=\"[\"+ALPHABET.slice(0,n)+\"]+\")+\"(?:\\\\.\"+o+\")?$\",n<37?\"i\":\"\").test(E))return t(p,E,c,n);c?(p.s=1/e<0?(E=E.slice(1),-1):1,h&&E.replace(/^0\\.0*|\\./,\"\").length>15&&T(r,tooManyDigits,e),c=!1):p.s=45===E.charCodeAt(0)?(E=E.slice(1),-1):1,E=_(E,10,n,p.s)}else{if(e instanceof m)return p.s=e.s,p.e=e.e,p.c=(e=e.c)?e.slice():e,void(r=0);if((c=\"number\"==typeof e)&&0*e==0){if(p.s=1/e<0?(e=-e,-1):1,e===~~e){for(i=0,s=e;s>=10;s/=10,i++);return p.e=i,p.c=[e],void(r=0)}E=e+\"\"}else{if(!isNumeric.test(E=e+\"\"))return t(p,E,c);p.s=45===E.charCodeAt(0)?(E=E.slice(1),-1):1}}for((i=E.indexOf(\".\"))>-1&&(E=E.replace(\".\",\"\")),(s=E.search(/e/i))>0?(i<0&&(i=s),i+=+E.slice(s+1),E=E.substring(0,s)):i<0&&(i=E.length),s=0;48===E.charCodeAt(s);s++);for(A=E.length;48===E.charCodeAt(--A););if(E=E.slice(s,A+1),E)if(A=E.length,c&&h&&A>15&&(e>MAX_SAFE_INTEGER||e!==mathfloor(e))&&T(r,tooManyDigits,p.s*e),i=i-s-1,i>a)p.c=p.e=null;else if(i<f)p.c=[p.e=0];else{if(p.e=i,p.c=[],s=(i+1)%LOG_BASE,i<0&&(s+=LOG_BASE),s<A){for(s&&p.c.push(+E.slice(0,s)),A-=LOG_BASE;s<A;)p.c.push(+E.slice(s,s+=LOG_BASE));E=E.slice(s),s=LOG_BASE-E.length}else s-=A;for(;s--;E+=\"0\");p.c.push(+E)}else p.c=[p.e=0];r=0}var d,B;function _(e,t,r,o){var i,s,c,f,a,h,g,A=e.indexOf(\".\"),E=u,S=l;for(r<37&&(e=e.toLowerCase()),A>=0&&(c=p,p=0,e=e.replace(\".\",\"\"),g=new m(r),a=g.pow(e.length-A),p=c,g.c=toBaseOut(toFixedPoint(coeffToString(a.c),a.e),10,t),g.e=g.c.length),h=toBaseOut(e,r,t),s=c=h.length;0==h[--c];h.pop());if(!h[0])return\"0\";if(A<0?--s:(a.c=h,a.e=s,a.s=o,a=n(a,g,E,S,t),h=a.c,f=a.r,s=a.e),i=s+E+1,A=h[i],c=t/2,f=f||i<0||null!=h[i+1],f=S<4?(null!=A||f)&&(0==S||S==(a.s<0?3:2)):A>c||A==c&&(4==S||f||6==S&&1&h[i-1]||S==(a.s<0?8:7)),i<1||!h[0])e=f?toFixedPoint(\"1\",-E):\"0\";else{if(h.length=i,f)for(--t;++h[--i]>t;)h[i]=0,i||(++s,h=[1].concat(h));for(c=h.length;!h[--c];);for(A=0,e=\"\";A<=c;e+=ALPHABET.charAt(h[A++]));e=toFixedPoint(e,s)}return e}function O(e,n,t,r){var o,i,u,c,f;if(t=null!=t&&g(t,0,8,r,roundingMode)?0|t:l,!e.c)return e.toString();if(o=e.c[0],u=e.e,null==n)f=coeffToString(e.c),f=19==r||24==r&&u<=s?toExponential(f,u):toFixedPoint(f,u);else if(e=M(new m(e),n,t),i=e.e,f=coeffToString(e.c),c=f.length,19==r||24==r&&(n<=i||i<=s)){for(;c<n;f+=\"0\",c++);f=toExponential(f,i)}else if(n-=u,f=toFixedPoint(f,i),i+1>c){if(--n>0)for(f+=\".\";n--;f+=\"0\");}else if(n+=i-c,n>0)for(i+1==c&&(f+=\".\");n--;f+=\"0\");return e.s<0&&o?\"-\"+f:f}function N(e,n){var t,r,o=0;for(isArray(e[0])&&(e=e[0]),t=new m(e[0]);++o<e.length;){if(r=new m(e[o]),!r.s){t=r;break}n.call(t,r)&&(t=r)}return t}function b(e,n,t,r,o){return(e<n||e>t||e!=truncate(e))&&T(r,(o||\"decimal places\")+(e<n||e>t?\" out of range\":\" not an integer\"),e),!0}function w(e,n,t){var r=1,o=n.length;for(;!n[--o];n.pop());for(o=n[0];o>=10;o/=10,r++);return(t=r+t*LOG_BASE-1)>a?e.c=e.e=null:t<f?e.c=[e.e=0]:(e.e=t,e.c=n),e}var v,L,G,F,y;function T(e,n,t){var o=new Error([\"new BigNumber\",\"cmp\",\"config\",\"div\",\"divToInt\",\"eq\",\"gt\",\"gte\",\"lt\",\"lte\",\"minus\",\"mod\",\"plus\",\"precision\",\"random\",\"round\",\"shift\",\"times\",\"toDigits\",\"toExponential\",\"toFixed\",\"toFormat\",\"toFraction\",\"pow\",\"toPrecision\",\"toString\",\"BigNumber\"][e]+\"() \"+n+\": \"+t);throw o.name=\"BigNumber Error\",r=0,o}function M(e,n,t,r){var o,i,u,l,s,c,h,g=e.c,A=POWS_TEN;if(g){e:{for(o=1,l=g[0];l>=10;l/=10,o++);if(i=n-o,i<0)i+=LOG_BASE,u=n,s=g[c=0],h=s/A[o-u-1]%10|0;else if(c=mathceil((i+1)/LOG_BASE),c>=g.length){if(!r)break e;for(;g.length<=c;g.push(0));s=h=0,o=1,i%=LOG_BASE,u=i-LOG_BASE+1}else{for(s=l=g[c],o=1;l>=10;l/=10,o++);i%=LOG_BASE,u=i-LOG_BASE+o,h=u<0?0:s/A[o-u-1]%10|0}if(r=r||n<0||null!=g[c+1]||(u<0?s:s%A[o-u-1]),r=t<4?(h||r)&&(0==t||t==(e.s<0?3:2)):h>5||5==h&&(4==t||r||6==t&&(i>0?u>0?s/A[o-u]:0:g[c-1])%10&1||t==(e.s<0?8:7)),n<1||!g[0])return g.length=0,r?(n-=e.e+1,g[0]=A[(LOG_BASE-n%LOG_BASE)%LOG_BASE],e.e=-n||0):g[0]=e.e=0,e;if(0==i?(g.length=c,l=1,c--):(g.length=c+1,l=A[LOG_BASE-i],g[c]=u>0?mathfloor(s/A[o-u]%A[u])*l:0),r)for(;;){if(0==c){for(i=1,u=g[0];u>=10;u/=10,i++);for(u=g[0]+=l,l=1;u>=10;u/=10,l++);i!=l&&(e.e++,g[0]==BASE&&(g[0]=1));break}if(g[c]+=l,g[c]!=BASE)break;g[c--]=0,l=1}for(i=g.length;0===g[--i];g.pop());}e.e>a?e.c=e.e=null:e.e<f&&(e.c=[e.e=0])}return e}return m.another=constructorFactory,m.ROUND_UP=0,m.ROUND_DOWN=1,m.ROUND_CEIL=2,m.ROUND_FLOOR=3,m.ROUND_HALF_UP=4,m.ROUND_HALF_DOWN=5,m.ROUND_HALF_EVEN=6,m.ROUND_HALF_CEIL=7,m.ROUND_HALF_FLOOR=8,m.EUCLID=9,m.config=m.set=function(){var e,n,t=0,o={},i=arguments,m=i[0],d=m&&\"object\"==typeof m?function(){if(m.hasOwnProperty(n))return null!=(e=m[n])}:function(){if(i.length>t)return null!=(e=i[t++])};return d(n=\"DECIMAL_PLACES\")&&g(e,0,MAX,2,n)&&(u=0|e),o[n]=u,d(n=\"ROUNDING_MODE\")&&g(e,0,8,2,n)&&(l=0|e),o[n]=l,d(n=\"EXPONENTIAL_AT\")&&(isArray(e)?g(e[0],-MAX,0,2,n)&&g(e[1],0,MAX,2,n)&&(s=0|e[0],c=0|e[1]):g(e,-MAX,MAX,2,n)&&(s=-(c=0|(e<0?-e:e)))),o[n]=[s,c],d(n=\"RANGE\")&&(isArray(e)?g(e[0],-MAX,-1,2,n)&&g(e[1],1,MAX,2,n)&&(f=0|e[0],a=0|e[1]):g(e,-MAX,MAX,2,n)&&(0|e?f=-(a=0|(e<0?-e:e)):h&&T(2,n+\" cannot be zero\",e))),o[n]=[f,a],d(n=\"ERRORS\")&&(e===!!e||1===e||0===e?(r=0,g=(h=!!e)?b:intValidatorNoErrors):h&&T(2,n+notBool,e)),o[n]=h,d(n=\"CRYPTO\")&&(!0===e||!1===e||1===e||0===e?e?(e=\"undefined\"==typeof crypto,!e&&crypto&&(crypto.getRandomValues||crypto.randomBytes)?A=!0:h?T(2,\"crypto unavailable\",e?void 0:crypto):A=!1):A=!1:h&&T(2,n+notBool,e)),o[n]=A,d(n=\"MODULO_MODE\")&&g(e,0,9,2,n)&&(E=0|e),o[n]=E,d(n=\"POW_PRECISION\")&&g(e,0,MAX,2,n)&&(p=0|e),o[n]=p,d(n=\"FORMAT\")&&(\"object\"==typeof e?S=e:h&&T(2,n+\" not an object\",e)),o[n]=S,o},m.max=function(){return N(arguments,o.lt)},m.min=function(){return N(arguments,o.gt)},m.random=(d=9007199254740992,B=Math.random()*d&2097151?function(){return mathfloor(Math.random()*d)}:function(){return 8388608*(1073741824*Math.random()|0)+(8388608*Math.random()|0)},function(e){var n,t,r,o,l,s=0,c=[],f=new m(i);if(e=null!=e&&g(e,0,MAX,14)?0|e:u,o=mathceil(e/LOG_BASE),A)if(crypto.getRandomValues){for(n=crypto.getRandomValues(new Uint32Array(o*=2));s<o;)l=131072*n[s]+(n[s+1]>>>11),l>=9e15?(t=crypto.getRandomValues(new Uint32Array(2)),n[s]=t[0],n[s+1]=t[1]):(c.push(l%1e14),s+=2);s=o/2}else if(crypto.randomBytes){for(n=crypto.randomBytes(o*=7);s<o;)l=281474976710656*(31&n[s])+1099511627776*n[s+1]+4294967296*n[s+2]+16777216*n[s+3]+(n[s+4]<<16)+(n[s+5]<<8)+n[s+6],l>=9e15?crypto.randomBytes(7).copy(n,s):(c.push(l%1e14),s+=7);s=o/7}else A=!1,h&&T(14,\"crypto unavailable\",crypto);if(!A)for(;s<o;)l=B(),l<9e15&&(c[s++]=l%1e14);for(o=c[--s],e%=LOG_BASE,o&&e&&(l=POWS_TEN[LOG_BASE-e],c[s]=mathfloor(o/l)*l);0===c[s];c.pop(),s--);if(s<0)c=[r=0];else{for(r=-1;0===c[0];c.splice(0,1),r-=LOG_BASE);for(s=1,l=c[0];l>=10;l/=10,s++);s<LOG_BASE&&(r-=LOG_BASE-s)}return f.e=r,f.c=c,f}),n=function(){function e(e,n,t){var r,o,i,u,l=0,s=e.length,c=n%SQRT_BASE,f=n/SQRT_BASE|0;for(e=e.slice();s--;)i=e[s]%SQRT_BASE,u=e[s]/SQRT_BASE|0,r=f*i+u*c,o=c*i+r%SQRT_BASE*SQRT_BASE+l,l=(o/t|0)+(r/SQRT_BASE|0)+f*u,e[s]=o%t;return l&&(e=[l].concat(e)),e}function n(e,n,t,r){var o,i;if(t!=r)i=t>r?1:-1;else for(o=i=0;o<t;o++)if(e[o]!=n[o]){i=e[o]>n[o]?1:-1;break}return i}function t(e,n,t,r){var o=0;for(;t--;)e[t]-=o,o=e[t]<n[t]?1:0,e[t]=o*r+e[t]-n[t];for(;!e[0]&&e.length>1;e.splice(0,1));}return function(r,o,i,u,l){var s,c,f,a,h,g,A,E,p,S,d,B,_,O,N,b,w,v=r.s==o.s?1:-1,L=r.c,G=o.c;if(!(L&&L[0]&&G&&G[0]))return new m(r.s&&o.s&&(L?!G||L[0]!=G[0]:G)?L&&0==L[0]||!G?0*v:v/0:NaN);for(E=new m(v),p=E.c=[],c=r.e-o.e,v=i+c+1,l||(l=BASE,c=bitFloor(r.e/LOG_BASE)-bitFloor(o.e/LOG_BASE),v=v/LOG_BASE|0),f=0;G[f]==(L[f]||0);f++);if(G[f]>(L[f]||0)&&c--,v<0)p.push(1),a=!0;else{for(O=L.length,b=G.length,f=0,v+=2,h=mathfloor(l/(G[0]+1)),h>1&&(G=e(G,h,l),L=e(L,h,l),b=G.length,O=L.length),_=b,S=L.slice(0,b),d=S.length;d<b;S[d++]=0);w=G.slice(),w=[0].concat(w),N=G[0],G[1]>=l/2&&N++;do{if(h=0,s=n(G,S,b,d),s<0){if(B=S[0],b!=d&&(B=B*l+(S[1]||0)),h=mathfloor(B/N),h>1)for(h>=l&&(h=l-1),g=e(G,h,l),A=g.length,d=S.length;1==n(g,S,A,d);)h--,t(g,b<A?w:G,A,l),A=g.length,s=1;else 0==h&&(s=h=1),g=G.slice(),A=g.length;if(A<d&&(g=[0].concat(g)),t(S,g,d,l),d=S.length,-1==s)for(;n(G,S,b,d)<1;)h++,t(S,b<d?w:G,d,l),d=S.length}else 0===s&&(h++,S=[0]);p[f++]=h,S[0]?S[d++]=L[_]||0:(S=[L[_]],d=1)}while((_++<O||null!=S[0])&&v--);a=null!=S[0],p[0]||p.splice(0,1)}if(l==BASE){for(f=1,v=p[0];v>=10;v/=10,f++);M(E,i+(E.e=f+c*LOG_BASE-1)+1,u,a)}else E.e=c,E.r=+a;return E}}(),v=/^(-?)0([xbo])(?=\\w[\\w.]*$)/i,L=/^([^.]+)\\.$/,G=/^\\.([^.]+)$/,F=/^-?(Infinity|NaN)$/,y=/^\\s*\\+(?=[\\w.])|^\\s+|\\s+$/g,t=function(e,n,t,o){var i,u=t?n:n.replace(y,\"\");if(F.test(u))e.s=isNaN(u)?null:u<0?-1:1;else{if(!t&&(u=u.replace(v,function(e,n,t){return i=\"x\"==(t=t.toLowerCase())?16:\"b\"==t?2:8,o&&o!=i?e:n}),o&&(i=o,u=u.replace(L,\"$1\").replace(G,\"0.$1\")),n!=u))return new m(u,i);h&&T(r,\"not a\"+(o?\" base \"+o:\"\")+\" number\",n),e.s=null}e.c=e.e=null,r=0},o.absoluteValue=o.abs=function(){var e=new m(this);return e.s<0&&(e.s=1),e},o.ceil=function(){return M(new m(this),this.e+1,2)},o.comparedTo=o.cmp=function(e,n){return r=1,compare(this,new m(e,n))},o.decimalPlaces=o.dp=function(){var e,n,t=this.c;if(!t)return null;if(e=((n=t.length-1)-bitFloor(this.e/LOG_BASE))*LOG_BASE,n=t[n])for(;n%10==0;n/=10,e--);return e<0&&(e=0),e},o.dividedBy=o.div=function(e,t){return r=3,n(this,new m(e,t),u,l)},o.dividedToIntegerBy=o.divToInt=function(e,t){return r=4,n(this,new m(e,t),0,1)},o.equals=o.eq=function(e,n){return r=5,0===compare(this,new m(e,n))},o.floor=function(){return M(new m(this),this.e+1,3)},o.greaterThan=o.gt=function(e,n){return r=6,compare(this,new m(e,n))>0},o.greaterThanOrEqualTo=o.gte=function(e,n){return r=7,1===(n=compare(this,new m(e,n)))||0===n},o.isFinite=function(){return!!this.c},o.isInteger=o.isInt=function(){return!!this.c&&bitFloor(this.e/LOG_BASE)>this.c.length-2},o.isNaN=function(){return!this.s},o.isNegative=o.isNeg=function(){return this.s<0},o.isZero=function(){return!!this.c&&0==this.c[0]},o.lessThan=o.lt=function(e,n){return r=8,compare(this,new m(e,n))<0},o.lessThanOrEqualTo=o.lte=function(e,n){return r=9,-1===(n=compare(this,new m(e,n)))||0===n},o.minus=o.sub=function(e,n){var t,o,i,u,s=this,c=s.s;if(r=10,e=new m(e,n),n=e.s,!c||!n)return new m(NaN);if(c!=n)return e.s=-n,s.plus(e);var f=s.e/LOG_BASE,a=e.e/LOG_BASE,h=s.c,g=e.c;if(!f||!a){if(!h||!g)return h?(e.s=-n,e):new m(g?s:NaN);if(!h[0]||!g[0])return g[0]?(e.s=-n,e):new m(h[0]?s:3==l?-0:0)}if(f=bitFloor(f),a=bitFloor(a),h=h.slice(),c=f-a){for((u=c<0)?(c=-c,i=h):(a=f,i=g),i.reverse(),n=c;n--;i.push(0));i.reverse()}else for(o=(u=(c=h.length)<(n=g.length))?c:n,c=n=0;n<o;n++)if(h[n]!=g[n]){u=h[n]<g[n];break}if(u&&(i=h,h=g,g=i,e.s=-e.s),n=(o=g.length)-(t=h.length),n>0)for(;n--;h[t++]=0);for(n=BASE-1;o>c;){if(h[--o]<g[o]){for(t=o;t&&!h[--t];h[t]=n);--h[t],h[o]+=BASE}h[o]-=g[o]}for(;0==h[0];h.splice(0,1),--a);return h[0]?w(e,h,a):(e.s=3==l?-1:1,e.c=[e.e=0],e)},o.modulo=o.mod=function(e,t){var o,i,u=this;return r=11,e=new m(e,t),!u.c||!e.s||e.c&&!e.c[0]?new m(NaN):!e.c||u.c&&!u.c[0]?new m(u):(9==E?(i=e.s,e.s=1,o=n(u,e,0,3),e.s=i,o.s*=i):o=n(u,e,0,E),u.minus(o.times(e)))},o.negated=o.neg=function(){var e=new m(this);return e.s=-e.s||null,e},o.plus=o.add=function(e,n){var t,o=this,i=o.s;if(r=12,e=new m(e,n),n=e.s,!i||!n)return new m(NaN);if(i!=n)return e.s=-n,o.minus(e);var u=o.e/LOG_BASE,l=e.e/LOG_BASE,s=o.c,c=e.c;if(!u||!l){if(!s||!c)return new m(i/0);if(!s[0]||!c[0])return c[0]?e:new m(s[0]?o:0*i)}if(u=bitFloor(u),l=bitFloor(l),s=s.slice(),i=u-l){for(i>0?(l=u,t=c):(i=-i,t=s),t.reverse();i--;t.push(0));t.reverse()}for(i=s.length,n=c.length,i-n<0&&(t=c,c=s,s=t,n=i),i=0;n;)i=(s[--n]=s[n]+c[n]+i)/BASE|0,s[n]=BASE===s[n]?0:s[n]%BASE;return i&&(s=[i].concat(s),++l),w(e,s,l)},o.precision=o.sd=function(e){var n,t,r=this,o=r.c;if(null!=e&&e!==!!e&&1!==e&&0!==e&&(h&&T(13,\"argument\"+notBool,e),e!=!!e&&(e=null)),!o)return null;if(t=o.length-1,n=t*LOG_BASE+1,t=o[t]){for(;t%10==0;t/=10,n--);for(t=o[0];t>=10;t/=10,n++);}return e&&r.e+1>n&&(n=r.e+1),n},o.round=function(e,n){var t=new m(this);return(null==e||g(e,0,MAX,15))&&M(t,~~e+this.e+1,null!=n&&g(n,0,8,15,roundingMode)?0|n:l),t},o.shift=function(e){var n=this;return g(e,-MAX_SAFE_INTEGER,MAX_SAFE_INTEGER,16,\"argument\")?n.times(\"1e\"+truncate(e)):new m(n.c&&n.c[0]&&(e<-MAX_SAFE_INTEGER||e>MAX_SAFE_INTEGER)?n.s*(e<0?0:1/0):n)},o.squareRoot=o.sqrt=function(){var e,t,r,o,i,s=this,c=s.c,f=s.s,a=s.e,h=u+4,g=new m(\"0.5\");if(1!==f||!c||!c[0])return new m(!f||f<0&&(!c||c[0])?NaN:c?s:1/0);if(f=Math.sqrt(+s),0==f||f==1/0?(t=coeffToString(c),(t.length+a)%2==0&&(t+=\"0\"),f=Math.sqrt(t),a=bitFloor((a+1)/2)-(a<0||a%2),f==1/0?t=\"1e\"+a:(t=f.toExponential(),t=t.slice(0,t.indexOf(\"e\")+1)+a),r=new m(t)):r=new m(f+\"\"),r.c[0])for(a=r.e,f=a+h,f<3&&(f=0);;)if(i=r,r=g.times(i.plus(n(s,i,h,1))),coeffToString(i.c).slice(0,f)===(t=coeffToString(r.c)).slice(0,f)){if(r.e<a&&--f,t=t.slice(f-3,f+1),\"9999\"!=t&&(o||\"4999\"!=t)){+t&&(+t.slice(1)||\"5\"!=t.charAt(0))||(M(r,r.e+u+2,1),e=!r.times(r).eq(s));break}if(!o&&(M(i,i.e+u+2,0),i.times(i).eq(s))){r=i;break}h+=4,f+=4,o=1}return M(r,r.e+u+1,l,e)},o.times=o.mul=function(e,n){var t,o,i,u,l,s,c,f,a,h,g,A,E,p,S,d=this,B=d.c,_=(r=17,e=new m(e,n)).c;if(!(B&&_&&B[0]&&_[0]))return!d.s||!e.s||B&&!B[0]&&!_||_&&!_[0]&&!B?e.c=e.e=e.s=null:(e.s*=d.s,B&&_?(e.c=[0],e.e=0):e.c=e.e=null),e;for(o=bitFloor(d.e/LOG_BASE)+bitFloor(e.e/LOG_BASE),e.s*=d.s,c=B.length,h=_.length,c<h&&(E=B,B=_,_=E,i=c,c=h,h=i),i=c+h,E=[];i--;E.push(0));for(p=BASE,S=SQRT_BASE,i=h;--i>=0;){for(t=0,g=_[i]%S,A=_[i]/S|0,l=c,u=i+l;u>i;)f=B[--l]%S,a=B[l]/S|0,s=A*f+a*g,f=g*f+s%S*S+E[u]+t,t=(f/p|0)+(s/S|0)+A*a,E[u--]=f%p;E[u]=t}return t?++o:E.splice(0,1),w(e,E,o)},o.toDigits=function(e,n){var t=new m(this);return e=null!=e&&g(e,1,MAX,18,\"precision\")?0|e:null,n=null!=n&&g(n,0,8,18,roundingMode)?0|n:l,e?M(t,e,n):t},o.toExponential=function(e,n){return O(this,null!=e&&g(e,0,MAX,19)?1+~~e:null,n,19)},o.toFixed=function(e,n){return O(this,null!=e&&g(e,0,MAX,20)?~~e+this.e+1:null,n,20)},o.toFormat=function(e,n){var t=O(this,null!=e&&g(e,0,MAX,21)?~~e+this.e+1:null,n,21);if(this.c){var r,o=t.split(\".\"),i=+S.groupSize,u=+S.secondaryGroupSize,l=S.groupSeparator,s=o[0],c=o[1],f=this.s<0,a=f?s.slice(1):s,h=a.length;if(u&&(r=i,i=u,u=r,h-=r),i>0&&h>0){for(r=h%i||i,s=a.substr(0,r);r<h;r+=i)s+=l+a.substr(r,i);u>0&&(s+=l+a.slice(r)),f&&(s=\"-\"+s)}t=c?s+S.decimalSeparator+((u=+S.fractionGroupSize)?c.replace(new RegExp(\"\\\\d{\"+u+\"}\\\\B\",\"g\"),\"$&\"+S.fractionGroupSeparator):c):s}return t},o.toFraction=function(e){var t,r,o,u,s,c,f,g,A,E=h,p=this,S=p.c,d=new m(i),B=r=new m(i),_=f=new m(i);if(null!=e&&(h=!1,c=new m(e),h=E,(E=c.isInt())&&!c.lt(i)||(h&&T(22,\"max denominator \"+(E?\"out of range\":\"not an integer\"),e),e=!E&&c.c&&M(c,c.e+1,1).gte(i)?c:null)),!S)return p.toString();for(A=coeffToString(S),u=d.e=A.length-p.e-1,d.c[0]=POWS_TEN[(s=u%LOG_BASE)<0?LOG_BASE+s:s],e=!e||c.cmp(d)>0?u>0?d:B:c,s=a,a=1/0,c=new m(A),f.c[0]=0;g=n(c,d,0,1),o=r.plus(g.times(_)),1!=o.cmp(e);)r=_,_=o,B=f.plus(g.times(o=B)),f=o,d=c.minus(g.times(o=d)),c=o;return o=n(e.minus(r),_,0,1),f=f.plus(o.times(B)),r=r.plus(o.times(_)),f.s=B.s=p.s,u*=2,t=n(B,_,u,l).minus(p).abs().cmp(n(f,r,u,l).minus(p).abs())<1?[B.toString(),_.toString()]:[f.toString(),r.toString()],a=s,t},o.toNumber=function(){return+this},o.toPower=o.pow=function(e,n){var t,o,u,s=mathfloor(e<0?-e:+e),c=this;if(null!=n&&(r=23,n=new m(n)),!g(e,-MAX_SAFE_INTEGER,MAX_SAFE_INTEGER,23,\"exponent\")&&(!isFinite(e)||s>MAX_SAFE_INTEGER&&(e/=0)||parseFloat(e)!=e&&!(e=NaN))||0==e)return t=Math.pow(+c,e),new m(n?t%n:t);for(n?e>1&&c.gt(i)&&c.isInt()&&n.gt(i)&&n.isInt()?c=c.mod(n):(u=n,n=null):p&&(t=mathceil(p/LOG_BASE+2)),o=new m(i);;){if(s%2){if(o=o.times(c),!o.c)break;t?o.c.length>t&&(o.c.length=t):n&&(o=o.mod(n))}if(s=mathfloor(s/2),!s)break;c=c.times(c),t?c.c&&c.c.length>t&&(c.c.length=t):n&&(c=c.mod(n))}return n?o:(e<0&&(o=i.div(o)),u?o.mod(u):t?M(o,p,l):o)},o.toPrecision=function(e,n){return O(this,null!=e&&g(e,1,MAX,24,\"precision\")?0|e:null,n,24)},o.toString=function(e){var n,t=this,r=t.s,o=t.e;return null===o?r?(n=\"Infinity\",r<0&&(n=\"-\"+n)):n=\"NaN\":(n=coeffToString(t.c),n=null!=e&&g(e,2,64,25,\"base\")?_(toFixedPoint(n,o),0|e,10,r):o<=s||o>=c?toExponential(n,o):toFixedPoint(n,o),r<0&&t.c[0]&&(n=\"-\"+n)),n},o.truncated=o.trunc=function(){return M(new m(this),this.e+1,1)},o.valueOf=o.toJSON=function(){var e,n=this,t=n.e;return null===t?n.toString():(e=coeffToString(n.c),e=t<=s||t>=c?toExponential(e,t):toFixedPoint(e,t),n.s<0?\"-\"+e:e)},o.isBigNumber=!0,null!=e&&m.config(e),m}function bitFloor(e){var n=0|e;return e>0||e===n?n:n-1}function coeffToString(e){var n,t,r=1,o=e.length,i=e[0]+\"\";for(;r<o;){for(n=e[r++]+\"\",t=LOG_BASE-n.length;t--;n=\"0\"+n);i+=n}for(o=i.length;48===i.charCodeAt(--o););return i.slice(0,o+1||1)}function compare(e,n){var t,r,o=e.c,i=n.c,u=e.s,l=n.s,s=e.e,c=n.e;if(!u||!l)return null;if(t=o&&!o[0],r=i&&!i[0],t||r)return t?r?0:-l:u;if(u!=l)return u;if(t=u<0,r=s==c,!o||!i)return r?0:!o^t?1:-1;if(!r)return s>c^t?1:-1;for(l=(s=o.length)<(c=i.length)?s:c,u=0;u<l;u++)if(o[u]!=i[u])return o[u]>i[u]^t?1:-1;return s==c?0:s>c^t?1:-1}function intValidatorNoErrors(e,n,t){return(e=truncate(e))>=n&&e<=t}function isArray(e){return\"[object Array]\"==Object.prototype.toString.call(e)}function toBaseOut(e,n,t){var r,o,i=[0],u=0,l=e.length;for(;u<l;){for(o=i.length;o--;i[o]*=n);for(i[r=0]+=ALPHABET.indexOf(e.charAt(u++));r<i.length;r++)i[r]>t-1&&(null==i[r+1]&&(i[r+1]=0),i[r+1]+=i[r]/t|0,i[r]%=t)}return i.reverse()}function toExponential(e,n){return(e.length>1?e.charAt(0)+\".\"+e.slice(1):e)+(n<0?\"e\":\"e+\")+n}function toFixedPoint(e,n){var t,r;if(n<0){for(r=\"0.\";++n;r+=\"0\");e=r+e}else if(t=e.length,++n>t){for(r=\"0\",n-=t;--n;r+=\"0\");e+=r}else n<t&&(e=e.slice(0,n)+\".\"+e.slice(n));return e}function truncate(e){return e=parseFloat(e),e<0?mathceil(e):mathfloor(e)}BigNumber=constructorFactory(),BigNumber.default=BigNumber.BigNumber=BigNumber,\"function\"==typeof define&&define.amd?define(function(){return BigNumber}):\"undefined\"!=typeof module&&module.exports?module.exports=BigNumber:(globalObj||(globalObj=\"undefined\"!=typeof self?self:Function(\"return this\")()),globalObj.BigNumber=BigNumber);\n\nvar globalObj = {};\n\nfunction main() {\n var nums = readline().split(' ');\n BigNumber.config({ DECIMAL_PLACES: 999 })\n const frac =\n new BigNumber(new BigNumber(nums[0]).div(new BigNumber(nums[1])));\n var decimal = `${String(frac).slice(2)}0`;\n var c = nums[2];\n\n var index = decimal.indexOf(c);\n\n // console.log('dec', decimal);\n // console.log(index === -1 ? -1 : index + 1);\n\n print(index === -1 || index > 997 ? -1 : index + 1);\n}\n\nmain();\n", "src_uid": "0bc7bf67b96e2898cfd8d129ad486910"}
{"source_code": "input1=readline();\ninput=readline();\ncnt=0\nfor ( index = 1; index < input.length; index++) {\n element = input[index];\n if(element===input[index-1])cnt++;\n}\nprint(cnt)\n\n", "src_uid": "d561436e2ddc9074b98ebbe49b9e27b8"}
{"source_code": "function solve(){\n var a = readline();\n var last = 1;\n var res = 0;\n for(var i = 1; i < a.length; i++){\n if(a[i] != a[i-1]){\n if(last % 2 == 0) ++res;\n last = 1;\n } else {\n last++;\n }\n }\n if(last % 2 == 0) ++res;\n print(res);\n}\nsolve();", "src_uid": "8b26ca1ca2b28166c3d25dceb1f3d49f"}
{"source_code": "function checkAlenasMoney(n, a, b, c)\n{\n function increase(n1, n2)\n {\n return n1 - n2;\n }\n var arr = [a, b, c];\n var k = 0;\n while ((n + k) % 4 !== 0)\n {\n k++;\n }\n if (k === 0) return 0;\n else\n {\n if (k === 1) \n {\n arr = [a, c + b, 3 * c];\n return arr.sort(increase)[0];\n }\n if (k === 2)\n {\n arr = [b, 2 * a, 2 * c];\n return arr.sort(increase)[0];\n }\n if (k === 3) \n {\n arr = [c, 3 * a, b + a, 2 * c + a];\n return arr.sort(increase)[0];\n }\n }\n}\n\n{\n var input = readline();\n input = input.split(' ');\n print(checkAlenasMoney(+input[0], +input[1], +input[2], +input[3]));\n}", "src_uid": "c74537b7e2032c1d928717dfe15ccfb8"}
{"source_code": "String.prototype.lpad = function(padString, length) {\n var str = this;\n while (str.length < length)\n str = padString + str;\n return str;\n};\n\nvar currentTime = readline().split(\":\");\ncurrentTime[0] = parseInt(currentTime[0]);\ncurrentTime[1] = parseInt(currentTime[1]);\nvar sleepLength = readline().split(\":\");\nsleepLength[0] = parseInt(sleepLength[0]);\nsleepLength[1] = parseInt(sleepLength[1]);\n\nvar sleepTimeHours = (currentTime[0] - sleepLength[0]);\nvar sleepTimeMinutes = (currentTime[1] - sleepLength[1]);\n\nif (sleepLength[1] > currentTime[1]) {\n sleepTimeHours--;\n}\n\nif (sleepTimeHours < 0) sleepTimeHours = 24 + sleepTimeHours;\nif (sleepTimeMinutes < 0) sleepTimeMinutes = 60 + sleepTimeMinutes;\n\nvar sleepTime = sleepTimeHours.toString().lpad(\"0\", 2) + \":\" + sleepTimeMinutes.toString().lpad(\"0\", 2);\n\nprint(sleepTime);\n", "src_uid": "595c4a628c261104c8eedad767e85775"}
{"source_code": "var p = readline().split(\" \").map(Number);\nprint((p[1] - p[0])/(p[2] + p[3]));", "src_uid": "f34f3f974a21144b9f6e8615c41830f5"}
{"source_code": "var values = readline().split(' ').map((elements)=>{\n\treturn parseInt(elements)\n})\nvar circleDistance = 2*values[0]\nvar path = Math.ceil( Math.sqrt(\n\tMath.pow(values[1] - values[3],2) + Math.pow(values[2] - values[4],2)\n\t)/circleDistance)\nprint(path)", "src_uid": "698da80c7d24252b57cca4e4f0ca7031"}
{"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 const arr = d.split(' ').map(Number);\n let point = Infinity;\n\n for (let i = 0; i <= 2; i++) {\n if (point + i > arr[i]) {\n point = arr[i] - i;\n }\n }\n\n console.log(point * 3 + 3);\n});", "src_uid": "03ac8efe10de17590e1ae151a7bae1a5"}
{"source_code": "var n = (parseInt(readline()) + 1)%6,\n x = parseInt(readline())\n\n//console.log(x,n)\nswitch (x) {\n case 0:\n switch (n) {\n case 0:\n case 1:\n print(0)\n break;\n case 2:\n case 3:\n print(1)\n break;\n case 4:\n case 5:\n print(2)\n break;\n }\n break;\n\n case 1:\n switch (n) {\n case 0:\n case 3:\n print(2)\n break;\n case 2:\n case 5:\n print(0)\n break;\n case 4:\n case 1:\n print(1)\n break;\n }\n break;\n\n case 2:\n switch (n) {\n case 0:\n case 5:\n print(1)\n break;\n case 4:\n case 3:\n print(0)\n break;\n case 2:\n case 1:\n print(2)\n break;\n }\n break;\n}\n", "src_uid": "7853e03d520cd71571a6079cdfc4c4b0"}
{"source_code": "var input = readline()\nvar touched = Array(parseInt(input)).fill(false)\nvar step = 1\n\n\nfor(var i=0;i<=input;i++){\n step += i\n \tif(step>input) step-=input\n \ttouched[step]=true\n}\n\nvar isAllVisited=true\nfor(var i=1;i<=input;i++){ \n if(!touched[i]) isAllVisited=false\n}\n\nisAllVisited? print(\"YES\"):print(\"NO\")", "src_uid": "4bd174a997707ed3a368bd0f2424590f"}
{"source_code": "'use strict'\n\nlet lll = readline()\n\nlet max = 0\n\nfor (let i = 0; i < lll.length; i++)\n for (let j = max + 1; j < lll.length - i; j++) \n if (lll.lastIndexOf(lll.slice(i, i + j)) != i) \n max = j\n\n\nprint(max)", "src_uid": "13b5cf94f2fabd053375a5ccf3fd44c7"}
{"source_code": "var n = +readline();\n\nvar min = 0;\nfor(var i = 6, j = 7; ; i += 7, j += 7){\n if(i <= n){\n min++;\n }else break;\n if(j <= n){\n min++;\n }else break;\n}\n\nvar max = 0;\nfor(var i = 1, j = 2; ; i += 7, j += 7){\n if(i <= n){\n max++;\n }else break;\n if(j <= n){\n max++;\n }else break;\n}\n\nwrite(min, max);", "src_uid": "8152daefb04dfa3e1a53f0a501544c35"}
{"source_code": "l=readline();\ng=readline().split('');\n\nvar toS=0, toF=0;\n\nfor (i=0; i<(l-1); i++) {\n if (g[i]==\"S\" && g[i] != g[i+1]) toF++;\n if (g[i]==\"F\" && g[i] != g[i+1]) toS++\n}\n\nif (toF>toS) print(\"YES\")\nelse print(\"NO\")\n\n\n", "src_uid": "ab8a2070ea758d118b3c09ee165d9517"}
{"source_code": "var t = [31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31];\n \nvar inp = readline().split(' ');\nvar n = inp[0];\nvar type = inp[2];\n\nif (type == \"week\") {\n var current = 5;\n var a = 0;\n for (var i = 0; i < 366; ++i) {\n if(current == n)\n ++a;\n ++current;\n if(current > 7)\n current = 1;\n }\n print(a);\n} else {\n var a = 0;\n for (var i = 0; i < 12; ++i) {\n a += n <= t[i];\n \n }\n print(a);\n}", "src_uid": "9b8543c1ae3666e6c163d268fdbeef6b"}
{"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 let [n, k] = d.split(' ').map(Number);\n\n let mid = Math.floor(n / 2);\n let x = mid % (k + 1);\n let a = (mid - x) / (k + 1);\n let b = a * k;\n let c = n - a - b;\n\n console.log(`${a} ${b} ${c}`);\n});\n", "src_uid": "405a70c3b3f1561a9546910ab3fb5c80"}
{"source_code": "(function() {\n var s = readline();\n \n if (s.length < 26) {\n print(-1);\n return 0;\n }\n \n const alph = 'abcdefghijklmnopqrstuvwxyz';\n \n var sIdx = 0;\n var resultString = '';\n \n for (var i = 0; i < alph.length; i++) {\n if (sIdx >= s.length) {\n print(-1);\n return 0;\n }\n \n var aLetter = alph[i];\n var searchNeeded = true;\n \n while (searchNeeded && sIdx < s.length) {\n var sLetter = s[sIdx];\n \n if (sLetter <= aLetter) {\n resultString += aLetter;\n searchNeeded = false;\n } else {\n resultString += sLetter;\n }\n \n sIdx++;\n }\n }\n \n for (var i = sIdx; i < s.length; i++) {\n resultString += s[i];\n }\n \n print(resultString);\n return 0;\n})();", "src_uid": "f8ad543d499bcc0da0121a71a26db854"}
{"source_code": "var N = parseInt(readline());\nvar arr = readline().split(\"\");\nvar localCounter = 0;\nvar res = 0;\n\narr.map(function(el) {\n if (el === 'x') {\n localCounter++;\n if (localCounter > 2) {\n res++;\n }\n } else {\n localCounter = 0;\n }\n});\n\nprint(res);", "src_uid": "8de14db41d0acee116bd5d8079cb2b02"}
{"source_code": "var s = readline();\nvar t = readline();\n\nvar b = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p',\n\t'q','r','s','t','u','v','w','x','y','z'];\n\nvar ans=\"\";\nvar p = 1;\nfor(var i=s.length-1; i>=0; i--){\n\tfor(var ind=0; b[ind]!=s[i]; ind++);\n\tif(ind+p>=b.length){\n\t\tind = 0 + p - 1;\n\t\tp = 1;\n\t}else{\n\t\tind = ind+p;\n\t\tp = 0;\n\t}\n\t\n\tans+=b[ind];\n}\nvar ansRev=\"\";\n\tfor(var i=s.length-1; i>=0; i--)\n\t\tansRev+=ans[i];\nif(p!=0 || ansRev>=t)\n\tprint('No such string');\nelse{\n\tprint(ansRev);\n}", "src_uid": "47618510d2a17b1cc1e6a688201d51a3"}
{"source_code": "function abs(q)\n{\n if (q>0){return q;}\n return -q\n}\n\ns=readline().split(' ').map(function(x){return +x;})\na=+s[0]\nb=+s[1]\ns=readline().split(' ').map(function(x){return +x;})\nc=+s[0]\nd=+s[1]\nu=0\nif (a==c||b==d)\n{\n u=2\n}\nprint(abs(a-c)*2+abs(b-d)*2+4+u)", "src_uid": "f54ce13fb92e51ebd5e82ffbdd1acbed"}
{"source_code": "process.stdin.resume();\nprocess.stdin.setEncoding('utf-8');\n\nlet inp = 0\nprocess.stdin.on(\"data\",input=>{\n inp = input\n})\nprocess.stdin.on(\"end\",input=>{\n inp = inp.replace(/\\s*$/, '').split(\"\\n\").map(str => str.replace(/\\s*$/, ''));\n \n \n main();\n \n})\n\n\n\n\nfunction main(){\n n = inp[0].split(\" \")[0]\n k = inp[0].split(\" \")[1]\n \n let allscores = inp[1].split(\" \").map(item=>{return parseInt(item)})\n \n let gecen = allscores.filter((item)=>{return item >= allscores[k-1]}).filter(item=>{return item>0})\n console.log(gecen.length)\n \n}", "src_uid": "193ec1226ffe07522caf63e84a7d007f"}
{"source_code": "print(readline()*3/2);", "src_uid": "031e53952e76cff8fdc0988bb0d3239c"}
{"source_code": "/**\nPolycarp has just invented a new binary protocol for data transmission. He is encoding positive integer decimal number to binary string using following algorithm:\n\nEach digit is represented with number of '1' characters equal to the value of that digit (for 0 it is zero ones).\nDigits are written one by one in order corresponding to number and separated by single '0' character.\nThough Polycarp learnt how to encode the numbers, he has no idea how to decode them back. Help him calculate the decoded number.\n\nInput\nThe first line contains one integer number n (1\u2009\u2264\u2009n\u2009\u2264\u200989) \u2014 length of the string s.\n\nThe second line contains string s \u2014 sequence of '0' and '1' characters, number in its encoded format. It is guaranteed that the number corresponding to the string is positive and doesn't exceed 109. The string always starts with '1'.\n\nOutput\nPrint the decoded number.\n\nExamples\ninput\n3\n111\noutput\n3\ninput\n9\n110011101\noutput\n2031\n\n */\n\nlet inputString = '';\n\nprocess.stdin.on('data', inputStdin => {\n inputString += inputStdin;\n});\n\nprocess.stdin.on('end', _ => {\n inputString = inputString.trim().split('\\n').map(string => {\n return string.trim();\n });\n\n let lengthOfString = Number(inputString[0]);\n let string = inputString[1];\n\n solution(lengthOfString, string);\n\n});\n\nfunction solution(lengthOfString, string) {\n\n let onesCount = 0;\n let zeorCount = '';\n let digit = [];\n\n for (let index = 0; index < lengthOfString; index++) {\n\n if (string[index] == '1') {\n\n onesCount++;\n\n if (zeorCount.length > 1)\n digit.push(zeorCount.substring(0, zeorCount.length - 1));\n\n zeorCount = '';\n }\n\n if (string[index] == '0') {\n\n zeorCount += '0';\n\n if (onesCount)\n digit.push(onesCount.toString());\n\n onesCount = 0;\n }\n }\n\n if (onesCount)\n digit.push(onesCount.toString());\n\n if (zeorCount.length )\n digit.push(zeorCount);\n\n console.log(digit.join(\"\"));\n\n}", "src_uid": "a4b3da4cb9b6a7ed0a33a862e940cafa"}
{"source_code": "var arr1=readline().split(\" \");\nvar arr2=readline().split(\" \");\nvar n=readline();\nvar ans1=parseInt(parseInt(arr1[0])+parseInt(arr1[1])+parseInt(arr1[2]));\nvar ans2=parseInt(parseInt(arr2[0])+parseInt(arr2[1])+parseInt(arr2[2]));\nvar x =Math.ceil(parseFloat(ans1/5));\nvar y =Math.ceil(parseFloat(ans2/10));\nif(parseInt(n)>=parseInt(x+y)){\n print(\"YES\");\n}\nelse{\n print(\"NO\");\n}", "src_uid": "fe6301816dea7d9cea1c3a06a7d1ea7e"}
{"source_code": "var read = require('readline').createInterface({\n input: process.stdin,\n output: process.stdout\n});\nvar obj;\nvar inLine = [];\nread.on('line', function(input){inLine.push(input);});\nread.on('close', function(){\n obj = init(inLine);\n console.error(\"\\n\");\n var start = Date.now();\n Main();\n var end = Date.now() - start;\n myerr(\"time : \" + (end) + \"ms\");\n myerr(\"memory : \" + Math.round(process.memoryUsage().heapTotal / 1024) + \"KB\");\n});\nfunction makeClone(obj){return 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 var returnObj = {\n list : input, index : 0, max : input.length,\n hasNext : function(){return (this.index < this.max);},\n next : function(){\n if(!this.hasNext()){\n\n throw \"ArrayIndexOutOfBoundsException \u3053\u308c\u4ee5\u4e0a\u306a\u3044\u3088\";\n }\n else{\n var returnInput = this.list[this.index];\n this.index++;\n return returnInput;\n }\n }};\n return returnObj;\n}\nfunction myout(s){console.log(s);}\nfunction myerr(s){console.error(\"debug:\" + require(\"util\").inspect(s,false,null));}\n //[no]\u8981\u7d20\u306e\u6271\u3044\u3002\u6570\u5024\u578b\n //\u4e0d\u660e\u5024\u3001\u7570\u5e38\u6642:\u5f15\u6570\u305d\u306e\u307e\u307e\u8fd4\u3059 1:\u6570\u5024\u3078\u5909\u63db\n //2:\u534a\u89d2SP\u3067\u5206\u5272 4:\u534a\u89d2SP\u3067\u5206\u5272\u3057\u3001\u6570\u5024\u914d\u5217\u3078\n //6:1\u6587\u5b57\u3067\u5206\u5272 7:1\u6587\u5b57\u3067\u5206\u5272\u3057\u3001\u6570\u5024\u914d\u5217\u3078\n //8:\u534a\u89d2SP\u3067\u7d50\u5408 9:\u6539\u884c\u3067\u7d50\u5408 0:\u6587\u5b57\u306a\u3057\u3067\u7d50\u5408\nfunction myconv(i,no){\n try{\n switch(no){\n case 1:return parseInt(i);\n case 2:return i.split(\" \");\n case 4:return i.split(\" \").map(Number);\n case 6:return i.split(\"\");\n case 7:return i.split(\"\").map(Number);\n case 8:return i.join(\" \");\n case 9:return i.join(\"\\n\");\n case 0:return i.join(\"\");\n default:return i;\n }\n }\n catch(e){\n return i;\n }\n}\nfunction Main(){\n var output = [];\n\n var ul = next();\n var arr = nextIntArray() ;\n var brr = nextIntArray() ; \n arr.sort() ;\n brr.sort();\n var crr = arr.filter(x=>brr.includes(x));\n if(crr.length > 0) {\n myout(crr[0]) ;\n }\n else {\n var l = Math.min(arr[0],brr[0]) ;\n var h = Math.max(arr[0],brr[0]) ;\n myout(l+\"\"+h)\n }\n \n}", "src_uid": "3a0c1b6d710fd8f0b6daf420255d76ee"}
{"source_code": "var N = parseInt(readline());\nvar ar = readline().split(' ').map(function(a) {return parseInt(a);});\nar.sort(function(a, b) { return a-b;});\n\nvar sum = 0;\nfor (var i = 0; i < ar.length; i++) {\n sum += ar[i];\n}\n\nvar r = 0;\nvar navg = Math.round( sum / ar.length );\n\nfor (var i = 0; i < ar.length && navg < 5; i++) {\n sum -= ar[i];\n sum += 5;\n navg = Math.round( sum / ar.length );\n r++;\n}\n\nprint(r);\n", "src_uid": "715608282b27a0a25b66f08574a6d5bd"}
{"source_code": "\"use strict\";\nArray.prototype.contains = function(el){\n return this.indexOf(el) > -1;\n};\n\nvar rotateArray = function rotateArray(arr){ \n arr.unshift(arr.pop());\n return arr;\n};\n\nprint(function(input){ \n input = input.split('');\n var len = input.length;\n var arr = [];\n var i = 0;\n var count = 0;\n while (i < len) {\n //print(i, len);\n input = rotateArray(input); \n var add = input.join('');\n if (!arr.contains(add)){\n count++; \n arr.push(add);\n //print(\"we here with\", input);\n //print(arr);\n }\n i++;\n }\n return count;\n}.apply(null, readline().split(\" \")));\n\n", "src_uid": "8909ac99ed4ab2ee4d681ec864c7831e"}
{"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;\nlet a, b;\n\nrl.on('line', (d) => {\n if (c === 0) {\n c++;\n a = +d;\n return;\n }\n\n b = +d;\n const a1 = Math.floor(Math.abs(a - b) / 2);\n const b1 = Math.ceil(Math.abs(a - b) / 2);\n const leftSum = a1 * (a1 + 1) / 2;\n const rigthSum = b1 * (b1 + 1) / 2;\n const ans = leftSum + rigthSum;\n\n console.log(ans);\n\n c++;\n});\n", "src_uid": "d3f2c6886ed104d7baba8dd7b70058da"}
{"source_code": "var line = readline();\nvar isOne = false;\nvar counter = 0;\nvar found = false;\nfor (var i = 0; i < line.length; i++) {\n if ((line[i] === '1' && isOne) || (line[i] === '0' && !isOne)) {\n counter++;\n } else {\n counter = 1;\n isOne = (line[i] === '1');\n }\n if (counter === 7) {\n print('YES');\n found = true;\n break;\n }\n}\nif (!found) {\nprint('NO');\n}", "src_uid": "ed9a763362abc6ed40356731f1036b38"}
{"source_code": "// https://codeforces.com/problemset/problem/596/A\n// Big O:\n// Time complexity:\n// Space complexity:\n\n// Read input\nvar readline = require(\"readline\");\nvar rl = readline.createInterface({\n input: process.stdin,\n output: process.stdout\n});\n\nlet numberOfVertices;\nlet vertices = [];\nrl.on('line', (input) => {\n if (!numberOfVertices) {\n numberOfVertices = parseInt(input);\n return;\n }\n\n const verticesArray = input.split(\" \").map(Number)\n const x = verticesArray[0];\n const y = verticesArray[1];\n vertices.push({ x, y });\n\n if (vertices.length === numberOfVertices) {\n console.log(findRectangleArea(numberOfVertices, vertices));\n rl.close();\n }\n\n});\n\n// Problem\nfunction findRectangleArea(numberOfVertices, vertices) {\n\n const xPositions = new Set();\n const yPositions = new Set();\n\n for (let vertex of vertices) {\n xPositions.add(vertex.x);\n yPositions.add(vertex.y);\n }\n\n if (xPositions.size < 2 || yPositions.size < 2) {\n return -1;\n }\n\n const xPositionsArray = Array.from(xPositions)\n const yPositionsArray = Array.from(yPositions)\n\n return Math.abs((xPositionsArray[0] - xPositionsArray[1]) * (yPositionsArray[0] - yPositionsArray[1]));\n}", "src_uid": "ba49b6c001bb472635f14ec62233210e"}
{"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', stdin => inputString += stdin);\r\n\r\nprocess.stdin.on('end', _ => {\r\n inputString = inputString.trim().split('\\n').map(s => s.trim());\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 [r, c] = readline().split(' ');\r\n r = BigInt(r);\r\n c = BigInt(c);\r\n if (c == BigInt(1)) {\r\n output(r - BigInt(1));\r\n } else {\r\n output((c - BigInt(1)) * r);\r\n }\r\n /*}*/\r\n}", "src_uid": "a91aab4c0618d036c81022232814ef44"}
{"source_code": "function main() {\n var input = readline().split(' ').map(Number);\n var n = input[0];\n var t = input[1];\n \n var count = 0;\n \n function isBigEnough(element, index, array) {\n return element >= 1;\n }\n \n var array = [t];\n count += array.filter(isBigEnough).length;\n for (var i = 2; i <= n; ++i) {\n var next_array = [];\n for (var j = 0; j < i; ++j) {\n var value = 0;\n if (j - 1 >= 0) {\n value += Math.max(0, array[j - 1] - 1);\n }\n if (j < array.length) {\n value += Math.max(0, array[j] - 1);\n }\n value /= 2;\n next_array.push(value);\n }\n array = next_array;\n count += array.filter(isBigEnough).length;\n }\n \n print(count);\n}\n\nmain();", "src_uid": "b2b49b7f6e3279d435766085958fb69d"}
{"source_code": "var a = readline()\n\nvar dict = \"aouie\"\nvar b = true\n\nfor(var i = 0;i < a.length;i++){\n\tif(dict.indexOf(a[i]) == -1){\n\t\tif(dict.indexOf(a[i + 1]) != -1 || a[i] == \"n\"){\n\t\t\tcontinue;\n\t\t} else {\n\t\t\tb = false\n\t\t\tbreak\n\t\t}\n\t} \n}\n\nif(b && (dict.indexOf(a[a.length - 1]) != -1 || a[a.length - 1] == \"n\")){\n\tprint(\"YES\")\n} else {\n\tprint(\"NO\")\n}", "src_uid": "a83144ba7d4906b7692456f27b0ef7d4"}
{"source_code": "let inputString = '';\nlet currentLine = 0;\nprocess.stdin.on('data', data => {\n\tinputString += data;\n});\nprocess.stdin.on('end', function () {\n\tinputString = inputString\n\t\t.trim()\n\t\t.split('\\n')\n\t\t.map(str => str.trim());\n\tmain();\n});\n\nfunction readLine() {\n\treturn inputString[currentLine++];\n}\n\nconst store = {};\n\nfunction main() {\n\tlet [n, m] = readLine()\n\t\t.split(' ')\n\t\t.map(x => x >> 0);\n\n\tif (m > n) {\n\t\tconsole.log(-1);\n\t\treturn;\n\t}\n\n\tlet steps = (n & 1) === 0 ? n >> 1 : (n >> 1) + 1;\n\n\tif (steps % m === 0) {\n\t\tconsole.log(steps);\n\t\treturn;\n\t}\n\n\tlet found = false;\n\twhile (steps <= n) {\n\t\tsteps++;\n\t\tif (steps % m === 0) {\n\t\t\tfound = true;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tfound ? console.log(steps) : console.log(-1);\n}\n", "src_uid": "0fa526ebc0b4fa3a5866c7c5b3a4656f"}
{"source_code": "function getOutput(n, a, x, b, y) {\n const maxNumberOfSteps = n;\n for (var currentMinute = 0; currentMinute < maxNumberOfSteps; currentMinute++) {\n var danielCurrentStation = (a + currentMinute) % maxNumberOfSteps;\n if (danielCurrentStation === 0) {\n danielCurrentStation = n;\n }\n var vladCurrentStation = (b - currentMinute) % maxNumberOfSteps;\n if (vladCurrentStation < 0) {\n vladCurrentStation = n + vladCurrentStation;\n }\n if (vladCurrentStation === 0) {\n vladCurrentStation = n;\n }\n if (danielCurrentStation === vladCurrentStation) {\n return 'YES';\n }\n if (danielCurrentStation === x || vladCurrentStation === y) {\n break;\n }\n }\n return 'NO';\n}\n\nfunction main() {\n var line;\n while (line = readline()) {\n line = line.split(' ');\n var n = parseInt(line[0]);\n var a = parseInt(line[1]);\n var x = parseInt(line[2]);\n var b = parseInt(line[3]);\n var y = parseInt(line[4]);\n print(getOutput(n, a, x, b, y));\n }\n}\n\nmain();", "src_uid": "5b889751f82c9f32f223cdee0c0095e4"}
{"source_code": "var num = readline();\n\n// var num = '1000000000'\n\n\nfunction multiplyNines(num) {\n var hi = 1;\n for (var i = 0; i < num.length-1; i++) {\n hi *= 9;\n }\n\n return hi + ''\n}\n\nfunction allNines(num) {\n var arr=[]\n for (var i = 0; i < num.length-1; i++) {\n arr.push(9);\n }\n\n return parseInt(arr.join(''))\n}\n\nfunction main(num) {\n //add less than 2 case\n if (num.length === 1) {\n return parseInt(num);\n } else if (num[0] === '1') {\n return multiplyNines(num)\n } else {\n return Math.max(parseInt(num[0])*main(num.split('').slice(1).join('')), (parseInt(num[0]) - 1)*parseInt(multiplyNines(num)));\n }\n}\n\nwrite(main(num))", "src_uid": "38690bd32e7d0b314f701f138ce19dfb"}
{"source_code": "var n = parseInt(readline());\nvar arr = readline().split(' ').map(Number);\n\nvar max = arrayMax(arr);\nvar min = arrayMin(arr);\n\nvar startIndex = 0;\nvar endIndex = 0;\n\n\tvar startCounting = false;\n\n\tfor (var i = 0; i < n; i++) {\n\t\tif ((arr[i] == max || arr[i] == min) && !startCounting)\n\t\t{\n\t\t\tstartCounting = true;\n\t\t\tstartIndex = i;\n\t\t\ti++;\n\t\t}\n\t\tif ((arr[i] == max || arr[i] == min) && startCounting)\n\t\t{\n\n\t\t\tstartCounting = false;\n\t\t\tendIndex = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\nvar maxarr = [];\nmaxarr.push(endIndex - startIndex);\nmaxarr.push(endIndex);\nmaxarr.push(startIndex);\nmaxarr.push(arr.length - 1 - startIndex);\nmaxarr.push(arr.length - 1 - endIndex);\n\nfunction arrayMin(array) {\n var len = array.length, min = Infinity;\n while (len--) {\n if (array[len] < min) {\n min = array[len];\n }\n }\n return min;\n};\n\nfunction arrayMax(array) {\n var len = array.length, max = -Infinity;\n while (len--) {\n if (array[len] > max) {\n max = array[len];\n }\n }\n return max;\n};\n\nprint(arrayMax(maxarr));", "src_uid": "1d2b81ce842f8c97656d96bddff4e8b4"}
{"source_code": "var a = readline().split(\" \").map(Number);\nvar flag=true;\nvar moves = 1;\nvar path =\"\"+a[1];\nwhile(a[1] > a[0]) {\n moves++;\n if (a[1]% 2 === 0) {\n a[1]=a[1]/2;\n } else if(a[1]%10 === 1) {\n a[1]= (a[1]-1)/10;\n } else { \n print(\"NO\");\n flag=false;\n break;\n }\n if (a[1] < a[0]) {\n print(\"NO\");\n flag=false;\n break;\n }\n path = a[1]+\" \"+path;\n}\nif (flag) {\n print('YES');\n print(moves);\n print(path);\n}\n\n", "src_uid": "fc3adb1a9a7f1122b567b4d8afd7b3f3"}
{"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 [n, len] = readLine()\n .split(\" \")\n .map((n) => parseInt(n));\n const arr = readLine()\n .split(\" \")\n .map((n) => parseInt(n));\n arr.sort((a, b) => a - b);\n let min = Number.MAX_SAFE_INTEGER;\n\n for (let i = 0; i <= len - n; i++) {\n const [low, high] = [arr[i], arr[i + n - 1]];\n min = Math.min(min, high - low);\n }\n\n console.log(min);\n}\n", "src_uid": "7830aabb0663e645d54004063746e47f"}
{"source_code": "var n = +readline();\n\nvar pos = {1: 'A', 3: 'B', 2: 'C', 0: 'D'};\nvar hm = {1: 0, 3: 2, 2: 1, 0: 1};\nvar mod = n % 4;\n\nwrite(hm[mod], mod === 2 ? 'B' : 'A');", "src_uid": "488e809bd0c55531b0b47f577996627e"}
{"source_code": "// Sample code to perform I/O:\n\nprocess.stdin.resume();\nprocess.stdin.setEncoding(\"utf-8\");\nvar stdin_input = \"\";\n\nprocess.stdin.on(\"data\", function (input) {\n stdin_input += input; // Reading input from STDIN\n});\n\nprocess.stdin.on(\"end\", function () {\n main(stdin_input);\n});\n\nfunction main(input) {\n let output = nameLookUp(input);\n process.stdout.write(output); // Writing output to STDOUT\n}\n\n// Warning: Printing unwanted or ill-formatted data to output will cause the test cases to fail\n\n// Write your code here\nfunction nameLookUp(str) {\n let input = str.trim().split('\\n');\n let numeric = input[0].split(' ');\n let seconds = +numeric[1];\n let bg = input[1].split('');\n let newbg = [...bg];\n for (let i = 0; i < seconds; i++) {\n\n for (let i = 1; i < bg.length; i++) {\n if (bg[i - 1] < bg[i]) {\n let temp = bg[i - 1];\n newbg[i - 1] = bg[i];\n newbg[i] = temp;\n }\n }\n bg = newbg;\n newbg = [...bg];\n }\n return bg.join('').toString();\n}\n", "src_uid": "964ed316c6e6715120039b0219cc653a"}
{"source_code": "var nk = readline().split(' ').map(el => parseInt(el, 10)),\n num = nk[0];\n \nfor(var i=1; i<=nk[1]; i++) {\n if(num%10 === 0) num /= 10;\n else num--;\n}\n \nprint(num);", "src_uid": "064162604284ce252b88050b4174ba55"}
{"source_code": "var arr = readline().split(\" \", 2);\nif (arr[0] === arr[1]) {\n print(arr[0]);\n} else {\n print(\"1\");\n}", "src_uid": "9c5b6d8a20414d160069010b2965b896"}
{"source_code": "var s = []\nfor(var i=0;i<8;i++) s.push(readline());\nvar get = function(s, x, y) {\n if(s[x][y] == 'W') {\n for(var i=x-1;i>=0;i--) if(s[i][y] == 'B') return -1;\n return x;\n } else if(s[x][y] == 'B') {\n for(var i=x+1;i<8;i++) if(s[i][y] == 'W') return -1;\n return 7 - x;\n } else {\n return -1;\n }\n};\nvar getw = function(s) {\n for(var i=0;i<8;i++) {\n for(var j=0;j<8;j++) {\n if(s[i][j] == 'W' && get(s, i, j) != -1) return i;\n }\n }\n return -1;\n}\nvar getb = function(s) {\n for(var i=7;i>=0;i--) {\n for(var j=0;j<8;j++) {\n if(s[i][j] == 'B' && get(s, i, j) != -1) return 7-i;\n }\n }\n return -1;\n}\nvar answ = getw(s);\nvar ansb = getb(s);\nif(ansb == -1 || answ <= ansb) print(\"A\");\nelse print(\"B\");\n// print(answ, \",\" , ansb);\n\n\n", "src_uid": "0ddc839e17dee20e1a954c1289de7fbd"}
{"source_code": "var names = new Array(\"Sheldon\", \"Leonard\", \"Penny\", \"Rajesh\", \"Howard\");\nvar n = parseInt(readline());\n\nn += 4;\n\nvar pow = Math.floor(Math.log(Math.floor(n * 2 / 5))/Math.log(2));\nvar pos = Math.floor((n - Math.pow(2, pow) * 5 / 2) / Math.pow(2, pow - 1));\n\nprint(names[pos]);\n", "src_uid": "023b169765e81d896cdc1184e5a82b22"}
{"source_code": "try {require('codef');} catch (e){};\nfunction readLineAsArray(separator){\n return readline().split(typeof separator == \"undefined\" ? ' ' : separator)\n}\nfunction readLineAsIntegerArray(separator){\n return readLineAsArray(separator).map(function(v){return +v});\n}\n\nvar arr = readLineAsIntegerArray('');\nvar length = arr.length;\nvar res = [];\n\nwhile(1){\n var tepm = 0;\n arr.forEach(function(v, k){\n if (v > 0) {\n tepm += Math.pow(10, length - k - 1);\n arr[k]--;\n }\n });\n if (tepm == 0) break; else res.push(tepm);\n}\nwrite(res.length + \"\\n\" + res.join(' '));\n", "src_uid": "033068c5e16d25f09039e29c88474275"}
{"source_code": "var n = +readline(),\ninput = readline().split(\" \"), min1 = +input[0], max1 = +input[1],\ninput = readline().split(\" \"), min2 = +input[0], max2 = +input[1],\ninput = readline().split(\" \"), min3 = +input[0], max3 = +input[1];\nvar i, j, k;\n\ncycle:\nfor(i = max1; i >= min1; i--){\n\n\tif((n - i) < (min2 + min3)){\n\t\tcontinue;\n\t}\n\t\n\tj = (n-i > max2) ? max2 : n-i;\n\tfor( ; j >= min2; j--){\n\t\tif((n - i - j) < min3){\n\t\t\tcontinue;\n\t\t}\n\n\t\tk = n - i - j;\n\n\t\twrite(i + \" \" + j + \" \" + k);\n\n\t\tbreak cycle;\n\t}\n}", "src_uid": "3cd092b6507079518cf206deab21cf97"}
{"source_code": "var num = readline().split(' ');\nvar l = parseInt(num[0]);\nvar r = parseInt(num[1]);\nif(r > l){\n\tprint(2);\n}else if(r == l){\n\tprint(l);\n}", "src_uid": "a8d992ab26a528f0be327c93fb499c15"}
{"source_code": "print(function(a) {\n\tvar sum = a.reduce(function(a, b) {return a + b;});\n\tif (sum % 2 === 1) return 'Impossible';\n\tsum = sum / 2;\n\n\tvar ans = [0, 0, 0];\n\tfor (var i = 0; i < 3; i++) {\n\t\tans[i] = sum - a[(i + 2) % 3];\n\t\tif (ans[i] > a[i]) return 'Impossible';\n\t}\n\treturn ans.join(' ');\n\n}(readline().split(' ').map(Number)));", "src_uid": "b3b986fddc3770fed64b878fa42ab1bc"}
{"source_code": "//Input\n// var firstLine = \"Is it a melon?\"; //R: NO\n// var firstLine = \"Is it an apple?\"; //R: YES\n// var firstLine = \" Is it a banana ?\"; //R: YES\n// var firstLine = \"Is it an apple and a banana simultaneouSLY?\"; //R: YES\n\n\nvar firstLine = readline();\n\nretorno = eval(firstLine);\n\n//Solution\nfunction eval(firstLine){\n var str = firstLine;\n\n write(sleuth(str));\n // console.log(sleuth(str));\n return \"Hola\";\n};\n\nfunction sleuth(str){\n str = str.toLowerCase();\n //console.log(str);\n var vowels = \"aeiouy\";\n var char = \"\";\n var len = str.length;\n var answer = \"NO\";\n for(var i = len ; i >= 0 ; i--){\n if(str[i] >= \"a\" && str[i] <= \"z\"){\n char = str[i];\n break;\n };\n };\n if(char == \"a\" || char == \"e\" || char == \"i\" || char == \"o\" || char == \"u\" || char == \"y\"){\n answer = \"YES\"\n };\n return answer;\n};\n\n\n\n", "src_uid": "dea7eb04e086a4c1b3924eff255b9648"}
{"source_code": "var tokens = [];\nvar numTokens = 0;\nfunction next(){\n\twhile(numTokens>=tokens.length){\n\t\ttokens = readline().split(/[\\s]+/);\n\t\tnumTokens = 0;\n\t}\n\treturn tokens[numTokens++];\n}\nfunction invertir(n){\n\treturn n.split(\"\").reverse().join(\"\"); \n}\nfunction impri(n){\n\tif(n<10) return \"0\"+n;\n\treturn \"\"+n;\n}\n\nfunction cumple(h,m){\n\tif(h<24 && m < 60)\n\t\treturn invertir(impri(h)) == impri(m);\n\treturn false;\n}\nfunction solve(h){\n\twhile(h < 24*60 ){\n\t\tc = Math.floor(h/60);\n\t\tif(cumple(c,h-c*60))\n\t\t\treturn h;\n\t\th++;\n\t}\n\treturn 0;\n}\nfunction main(){\n\tvar a = next();\n\tvar h = parseInt(a.substring(0,2),10)*60\t+ parseInt(a.substring(3,5),10);\n\th = solve(h+1);\n\tvar c = Math.floor(h/60);\n\tvar x = c;\n\tvar y = h - c*60;\n\tprint(impri(x)+\":\"+impri(y));\n}\nmain();\n", "src_uid": "158eae916daa3e0162d4eac0426fa87f"}
{"source_code": "var n = parseInt(readline());\nvar m = parseInt(readline());\nvar result = m % Math.pow(2, n);\nprint(result);", "src_uid": "c649052b549126e600691931b512022f"}
{"source_code": "print(function(a, b) {\n\tvar i, x, ans = [0, 0, 0];\n\tfor (i = 1; i <= 6; i++) {\n\t\tx = Math.abs(i - a) - Math.abs(i - b);\n\t\tans[x < 0 ? 0 : x === 0 ? 1 : 2]++;\n\t}\n\treturn ans.join(' ');\n}.apply(0, readline().split(' ').map(Number)));\n", "src_uid": "504b8aae3a3abedf873a3b8b127c5dd8"}
{"source_code": "var alphabet = ['a', 'b', 'c', 'd', 'e', 'f']\n\nvar input = readline().split(' ')\n\nvar n = input[0]\n\nvar strings = generateStrings(n)\n\nvar q = input[1]\n\nvar ops = {}\n\nfor (var i = 0; i < q; i++) {\n\n input = readline().split(' ')\n ops[input[0]] = input[1]\n\n}\n\nprint(\n strings\n .filter(function (string) {\n for (var i = 0; string.length > 1; i++) {\n var op = string.slice(0, 2)\n if (!ops[op]) { return false }\n string = ops[op] + string.slice(2)\n }\n return string === 'a'\n })\n .length\n)\n\n\nfunction generateStrings (NN) {\n\n var strings = []\n\n var K = NN - 1, k = 0,\n N = alphabet.length, n = 0,\n out = [],\n stack = []\n\n function next(){\n while (true) {\n while (n < alphabet.length) {\n out[k] = alphabet[n++];\n if (k == K) return out.slice(0);\n else {\n if (n < alphabet.length) {\n stack.push(k);\n stack.push(n);\n }\n k++;\n n = 0;\n }\n }\n if (stack.length == 0) break;\n\n n = stack.pop();\n k = stack.pop();\n }\n return false;\n }\n\n var str\n\n while (str = next()) {\n strings.push(str.join(''))\n }\n\n return strings\n\n}\n", "src_uid": "c42abec29bfd17de3f43385fa6bea534"}
{"source_code": "\nvar line = readline().split(' ');\nvar d = parseInt( line[0] );\nvar sumTime = parseInt( line[1] );\n\nvar minTime = [];\nvar maxTime = [];\nvar minSum = 0;\nvar maxSum = 0;\n\n\nfor(var i=0; i<d; i++){\n\tline = readline().split(' ');\n\tvar min = parseInt( line[0] );\n\tvar max = parseInt( line[1] );\n\tminTime.push(min);\n\tmaxTime.push(max);\n\tminSum += min;\n\tmaxSum += max;\n}\n\nif( sumTime >= minSum && sumTime<= maxSum){\n\tprint('YES');\n\tvar time=maxSum;\n\tvar ret = [];\n\tfor(var i=0; i<d; i++){\n\t\tif( time == sumTime){\n\t\t\tret[i] = maxTime[i];\n\t\t}else{\n\t\t\tret[i] = minTime[i];\n\t\t\ttime -= maxTime[i]-minTime[i];\n\t\t\tif( time < sumTime){\n\t\t\t\tret[i] = minTime[i] + sumTime - time;\n\t\t\t\ttime += sumTime - time;\n\t\t\t}\n\t\t}\n\t}\n\tprint( ret.join(' ') );\n}else{\n\tprint('NO');\n}", "src_uid": "f48ff06e65b70f49eee3d7cba5a6aed0"}
{"source_code": "const id = Number(readline());\nprint(\"1001010111001010\"[id - 1]);\n", "src_uid": "6f9767b63a01424f939d85b597cf42f3"}
{"source_code": "s = readline();\n\nprint(25 * (s.length + 1) + 1);", "src_uid": "556684d96d78264ad07c0cdd3b784bc9"}
{"source_code": "var obj = [];\nobj[0] = parseInt(readline());\nobj[1] = parseInt(readline());\nobj[2] = parseInt(readline());\nvar max = obj[0] > Math.floor(obj[1]/2) ? 1 : 0;\nmax = Math.floor(obj[max]/(max*2||1)) > Math.floor(obj[2]/4) ? 2 : max;\nobj[max] = obj[max] - obj[max]%(max*2||1);\nvar sum = 0;\nvar one = obj[max]/(max*2||1);\n\nfor (var i = 0; i < 3; i++) {\n sum += one*(i*2||1);\n}\n\nprint(sum);\n", "src_uid": "82a4a60eac90765fb62f2a77d2305c01"}
{"source_code": "'use strict'\n\nconst {EOL} = require('os')\n\nlet ipt = ''\nprocess.stdin.on('data', s => ipt += s)\nprocess.stdin.on('end', () => {\n const n = +ipt.split(EOL).slice(0, -1)[0]\n let o = 'ROY'\n let r = (n - 3) / 4 | 0\n for (let i = 0; i < r; i++) o += 'GBIV'\n o += 'GBIV'.slice(0, (n - 3) % 4)\n console.log(o)\n})", "src_uid": "dc3817c71b1fa5606f316e5e94732296"}
{"source_code": "function trim(s) {\n\treturn s.replace(/^\\s+|\\s+$/gm, '');\n}\n\nfunction tokenize(s) {\n\treturn trim(s).split(/\\s+/);\n}\n\nfunction tokenizeIntegers(s) {\n\tvar tokens = tokenize(s);\n\tfor (var i = 0; i < tokens.length; i += 1) {\n\t\ttokens[i] = parseInt(tokens[i], 10);\n\t};\n\treturn tokens;\n}\n\nfunction gcd(a, b) {\n\twhile (a != 0 && b != 0) {\n\t\tif (a > b) {\n\t\t\ta %= b;\n\t\t}\n\t\telse {\n\t\t\tb %= a;\n\t\t}\n\t}\n\treturn Math.max(a, b);\n}\n\nfunction solve(screenWidth, screenHeight, movieWidth, movieHeight) {\n\tvar bottom = movieWidth*screenHeight,\n\t\ttop = bottom - movieHeight*screenWidth,\n\t\tfactor = gcd(top, bottom);\n\treturn { top: top/factor, bottom: bottom/factor };\n}\n\nfunction main() {\n\tvar data = tokenizeIntegers(readline()),\n\t\tscreenWidth = data[0], screenHeight = data[1],\n\t\tmovieWidth = data[2], movieHeight = data[3];\n\n\tif (screenWidth*movieHeight < movieWidth*screenHeight) {\n\t\tvar solution = solve(screenWidth, screenHeight, movieWidth, movieHeight);\n\t}\n\telse {\n\t\tvar solution = solve(screenHeight, screenWidth, movieHeight, movieWidth);\n\t}\n\n\tprint(solution.top + \"/\" + solution.bottom);\n}\n\nmain();\n", "src_uid": "b0f435fc2f7334aee0d07524bc37cb1e"}
{"source_code": "function main(){\n var n = +readline();\n for(var i = 0; i < n; ++i){\n var c = readline().split('');\n var l = 1;\n if(c.length === 2) l = 3;\n if(c.length === 3) l = 6;\n if(c.length === 4) l = 10;\n print(l + ((+c[0] - 1) * 10));\n }\n}\n\nmain();", "src_uid": "289a55128be89bb86a002d218d31b57f"}
{"source_code": "var line = readline().split(' ');\nvar n = parseInt(line[0]);\nvar v = parseInt(line[1]);\nvar arr = readline().split(' ');\nvar a = [];\nvar cur = [];\nvar sum = 0;\nfor (var i = 0; i < arr.length; i ++)\n{\n a[i] = parseInt(arr[i]);\n cur[i] = a[i]%2===0?a[i]/2:parseInt(a[i]/2)+1;\n sum += cur[i];\n}\nif (sum > v)\n{\n print(-1);\n}\nelse\n{\n while(v-sum > 0)\n {\n var max = 0;\n var maxi = 0;\n for (var i = 0; i < a.length; i ++)\n {\n if (a[i] > max && cur[i]!=a[i])\n {\n max = a[i];\n maxi = i;\n }\n }\n var put = Math.min(Math.min(v-sum), (a[maxi]-cur[maxi]));\n cur[maxi]+=put;\n sum+=put;\n }\n \n print( cur.join(\" \") );\n}\n", "src_uid": "5d3bb9e03f4c5c8ecb6233bd5f90f3a3"}
{"source_code": "let i = ''\n\nprocess.stdin.on('data',c => {\n i += c\n})\n\nprocess.stdin.on('end', () => {\n const { EOL } = require('os')\n const lines = i.split(EOL) /*your input text, split by lines*/\n\n\n let citiesCount = parseInt(lines[0].split(\" \")[0])\n let limakCity = parseInt(lines[0].split(\" \")[1])\n\n let criminals = lines[1].split(\" \").map( value => {\n return parseInt(value)\n })\n\n let distanceCount = 0\n let caughtCriminalsCount = 0\n let passedCities = {}\n\n let limakCityIndex = limakCity - 1\n\n for(i = 0; i < citiesCount ; i++){\n\n distanceCount = Math.abs(i - limakCityIndex)\n\n let leftCityIndex = limakCityIndex - distanceCount\n let rightCityIndex = distanceCount + limakCityIndex\n\n if (passedCities[rightCityIndex] === true || passedCities[leftCityIndex] === true) {\n continue\n }\n\n if (distanceCount === 0) {\n caughtCriminalsCount = caughtCriminalsCount + criminals[i]\n passedCities[i] = true\n distanceCount++\n continue\n }\n\n let rightCriminalCount = 0\n let leftCriminalCount = 0\n\n if (leftCityIndex >= 0) {\n passedCities[leftCityIndex] = true\n leftCriminalCount = criminals[leftCityIndex]\n } else {\n leftCriminalCount = -1\n }\n\n if (rightCityIndex < citiesCount) {\n passedCities[rightCityIndex] = true\n rightCriminalCount = criminals[rightCityIndex]\n } else {\n rightCriminalCount = -1\n }\n\n if (rightCriminalCount + leftCriminalCount === 2) {\n caughtCriminalsCount = caughtCriminalsCount + 2\n } else if (rightCriminalCount === 1 && leftCriminalCount === -1) {\n caughtCriminalsCount = caughtCriminalsCount + 1\n } else if (leftCriminalCount === 1 && rightCriminalCount === -1){\n caughtCriminalsCount = caughtCriminalsCount + 1\n }\n\n distanceCount++\n }\n console.log(caughtCriminalsCount)\n})", "src_uid": "4840d571d4ce6e1096bb678b6c100ae5"}
{"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", "src_uid": "5cd113a30bbbb93d8620a483d4da0349"}
{"source_code": "var importanceInPetriciumusCifera = function ( base, number ) {\n var rest,\n importance;\n rest = number;\n importance = 0;\n while ( rest % base === 0 && rest > base) {\n\n rest /= base;\n ++importance;\n }\n if ( rest === base ) {\n return importance;\n }\n};\n\nvar k = parseInt( readline(), 10 );\nvar l = parseInt( readline(), 10 );\nvar importance = importanceInPetriciumusCifera( k, l );\nif ( typeof importance !== \"undefined\" ) {\n print( \"YES\" );\n print( importance );\n} else {\n print( \"NO\" );\n}\n", "src_uid": "8ce89b754aa4080e7c3b2c3b10f4be46"}
{"source_code": "var whoWinsFromTwo = function(n, p, winner)\n {\n if ((n === 1) || (p === 1)) return winner;\n else {\n winner = -winner;\n return whoWinsFromTwo(n - 1, p - 1, winner);\n }\n }\nvar input1 = readline();\ninput1 = input1.split(' ');\nvar person = 1;\nvar result = whoWinsFromTwo(+input1[0], +input1[1], person);\nif (result < 0) print('Malvika');\nelse print('Akshat');", "src_uid": "a4b9ce9c9f170a729a97af13e81b5fe4"}
{"source_code": "var n = parseInt(readline());\nvar ar = readline().split(' ').map((v)=>{return parseInt(v);}).sort((a,b)=>(b-a));\n\nvar marked = {0: true}\nvar markeda = {0: true}\n\nvar a = ar[0]\n\nar.forEach((o, i)=>{\n if (!markeda[o] && a%o==0) {\n markeda[o] = true;\n marked[i] = true;\n }\n})\n\nvar b = ar.filter((x, i)=>(!marked[i]))[0]\nprint(a, b)\n", "src_uid": "868407df0a93085057d06367aecaf9be"}
{"source_code": "print(readline().toLowerCase().replace(/[aeiouy]/g,'').split('').map(i => `.${i}`).join(''))", "src_uid": "db9520e85b3e9186dd3a09ff8d1e8c1b"}
{"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 const arr = d.split(' ').map(Number);\n let ans = 0;\n const max = Math.max(...arr);\n\n for (let i = 0; i < arr.length - 1; i++) {\n for (let j = i + 1; j < arr.length; j++) {\n if (arr[i] + arr[j] <= max) {\n ans = max - (arr[i] + arr[j]) + 1;\n }\n }\n }\n\n console.log(ans);\n});\n", "src_uid": "3dc56bc08606a39dd9ca40a43c452f09"}
{"source_code": "let input = [];\n \nconst RL = require('readline').createInterface({\n input : process.stdin,\n output : process.stdout\n});\n\nRL.on('line', (line) => {\n let count_a = 0; [...line].forEach( i => {if(i === 'a') count_a++} );\n if(count_a > line.length - count_a)\n console.log(line.length);\n else\n console.log( line.length - ( line.length-count_a - count_a ) -1)\n});\n\nRL.on('close', () => {\n});\n\n", "src_uid": "84cb9ad2ae3ba7e912920d7feb4f6219"}
{"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}) ", "src_uid": "11e6559cfb71b8f6ca88242094b17a2b"}
{"source_code": "ar = [];\nn = +readline();\nreadline().split('').map(Number).forEach(x=>{\n if (x !== 0) ar.push(x);\n});\nfound = (ar.length === 0)?true:false;\nsum = 0;\nfor (i = 0;i<ar.length-1 && !found;i++){\n sum += ar[i];\n cur = 0;\n restart = true;\n for (j = i+1;j<ar.length;j++){\n cur += ar[j];\n if (cur === sum){\n cur = 0;\n } else if (cur > sum) break;\n }\n found = cur === 0;\n}\nprint(found?'YES':'NO');", "src_uid": "410296a01b97a0a39b6683569c84d56c"}
{"source_code": "'use strict';\n\u00a0\n//const fs = require('fs');\n\u00a0\nprocess.stdin.resume();\nprocess.stdin.setEncoding('utf-8');\n\u00a0\nlet inputString = '';\nlet currentLine = 0;\n\u00a0\nprocess.stdin.on('data', inputStdin => {\n inputString += inputStdin;\n});\n\u00a0\nprocess.stdin.on('end', _ => {\n inputString = inputString.replace(/\\s*$/, '')\n .split('\\n')\n .map(str => str.replace(/\\s*$/, ''));\n\u00a0\n main();\n});\n\u00a0\nfunction readLine() {\n return inputString[currentLine++];\n}\nfunction main() {\n var n = parseInt(readLine(), 10);\n var coins = [];\n coins.push(n);\n for (var i = n - 1; i > 0; i--) {\n if ((n % i) == 0) {\n coins.push(i);\n n = i;\n }\n }\n console.log(coins.join(\" \"));\n \n}", "src_uid": "2fc946bb72f56b6d86eabfaf60f9fa63"}
{"source_code": "function main() {\n let line = stdin[0].split(' ');\n let n = parseInt(line[0], 10);\n let p = parseInt(line[1], 10);\n let k = parseInt(line[2], 10);\n\n const lo = Math.max(p - k, 1);\n const hi = Math.min(p + k, n);\n \n let str = [];\n \n if (lo !== 1) str.push(\"<<\")\n \n for (let i = lo; i <= hi; ++i) {\n if (i === p) {\n str.push(`(${i})`);\n } else {\n str.push(i + '')\n }\n }\n \n if (hi !== n) str.push(\">>\")\n \n console.log(str.join(' '));\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);\n", "src_uid": "526e2cce272e42a3220e33149b1c9c84"}
{"source_code": "var n=+readline();\nvar s=readline();\nvar ans=0;\ns.replace(/B/g, function(_, i){\n\tans+=Math.pow(2, i);\n});\nprint(ans);\n", "src_uid": "d86a1b5bf9fe9a985f7b030fedd29d58"}
{"source_code": "const readline = require('readline');\n\nconst rl = readline.createInterface({\n input: process.stdin,\n output: process.stdout\n});\nlet n = 0 ;\nlet columns ;\n\nrl.on(\"line\", (input)=>{\n if(!n) n = parseInt(input.split(\" \"))\n else\n {\n columns = input.split(\" \");\n columns.sort((a,b)=>{return a-b});\n columns.forEach(element => {\n console.log(element);\n });\n rl.close();\n }\n\n})", "src_uid": "ae20712265d4adf293e75d016b4b82d8"}
{"source_code": "const memo = {};\n\nfunction resolve(k, arr, n) {\n if (memo[arr.join('')] !== undefined) {\n return memo[arr.join('')];\n }\n if (parseInt(arr[0], 10) % 2 === 0 || parseInt(arr[k - 1], 10) % 2 === 0) {\n memo[arr.join('')] = false;\n return false;\n } else {\n if (k % 2 !== 0 && n % 2 !== 0) {\n memo[arr.join('')] = true;\n return true;\n } else {\n for (var i = 0; i < k; i += 2) {\n if (parseInt(arr[i], 10) % 2 !== 0) {\n if (resolve(arr.slice(i + 1).length, arr.slice(i + 1), n + 1)) {\n memo[arr.join('')] = true;\n return true;\n }\n }\n }\n\n for (var i = k - 1; i >= 0; i -= 2) {\n if (parseInt(arr[i], 10) % 2 !== 0) {\n if (resolve(arr.slice(0, i).length, arr.slice(0, i), n + 1)) {\n memo[arr.join('')] = true;\n return true;\n }\n }\n }\n memo[arr.join('')] = false;\n return false;\n }\n }\n}\n\nconst k = parseInt(readline(), 10);\nconst arr = readline().split(' ');\n\nconst result = resolve(k, arr, 1);\n\nprint(result ? 'Yes' : 'No' + '\\n');", "src_uid": "2b8c2deb5d7e49e8e3ededabfd4427db"}
{"source_code": "var firstDay = getDayNumber(readline());\nvar secondDay = getDayNumber(readline());\n\nprint(firstDay === secondDay || (firstDay + 2) % 7 === secondDay % 7 || (firstDay + 3) % 7 === secondDay % 7 ? \"YES\" : \"NO\");\n\nfunction getDayNumber(dayName) {\n switch (dayName.trim()) {\n case \"monday\":\n return 1;\n case \"tuesday\":\n return 2;\n case \"wednesday\":\n return 3;\n case \"thursday\":\n return 4;\n case \"friday\":\n return 5;\n case \"saturday\":\n return 6;\n case \"sunday\":\n return 7;\n }\n}", "src_uid": "2a75f68a7374b90b80bb362c6ead9a35"}
{"source_code": "'use strict'\n\nlet lll = readline().split(' ').map(v => parseInt(v))\nlet a = lll[0]\nlet b = lll[1]\n\nlet min = String(a).split('').reduce((r, v) => Math.max(r, v), 0)\nmin = String(b).split('').reduce((r, v) => Math.max(r, v), min)\nmin++\n\nlet max = 0\nfor (let i = min; i < 14; i++) {\n let da = parseInt(a, i)\n let db = parseInt(b, i)\n let ds = da + db\n let bs = from10(ds, i)\n max = Math.max(max, String(bs).length)\n}\n\nprint(max)\n\nfunction from10 (x, b) {\n let res = ''\n let n = 0\n while (Math.pow(b, ++n) <= x) {}\n while (n--) {\n let a = x / Math.pow(b, n) | 0\n if (b > 9) {\n res += 'a'\n } else {\n res += a\n }\n x -= a * Math.pow(b, n)\n }\n return res\n}", "src_uid": "8ccfb9b1fef6a992177cc49bd56fab7b"}
{"source_code": "function trim(s) {\n\treturn s.replace(/^\\s+|\\s+$/gm, '');\n}\n\nfunction tokenize(s) {\n\treturn trim(s).split(/\\s+/);\n}\n\nfunction tokenizeIntegers(s) {\n\tvar tokens = tokenize(s);\n\tfor (var i = 0; i < tokens.length; i += 1) {\n\t\ttokens[i] = parseInt(tokens[i]);\n\t};\n\treturn tokens;\n}\n\nfunction main() {\n\tvar integers = tokenizeIntegers(readline());\n\tvar fromR = integers[0], fromC = integers[1];\n\tvar toR = integers[2], toC = integers[3];\n\t\n\tvar rook = (fromR == toR || fromC == toC ? 1 : 2);\n\n\tif ((fromR+fromC)%2 != (toR+toC)%2) {\n\t\tvar bishop = 0;\n\t}\n\telse {\n\t\tvar bishop = (Math.abs(fromR - toR) == Math.abs(fromC - toC) ? 1 : 2);\n\t}\n\n\tvar dr = Math.abs(fromR - toR), dc = Math.abs(fromC - toC);\n\tvar king = dr + dc - Math.min(dr, dc);\n\n\tprint(rook, bishop, king);\n}\n\nmain();\n", "src_uid": "7dbf58806db185f0fe70c00b60973f4b"}
{"source_code": "var triangles=[0]\nwhile(triangles[triangles.length-1]<=100000)\n{\n triangles.push(triangles[triangles.length-1]+triangles.length);\n}\n\nvar n=+readline()\nvar nows='qwertyuiopasdfghjklzxcvbnm'\nvar now=0\nres=''\nif (7==n)\n{\n print(\"skorobogatova\")\n}\nelse if (0==n)\n{\n print(\"danil\")\n}\nelse\n{\n var i=triangles.length-1;\n while(n)\n {\n while(triangles[i]>n){i--;}\n n-=triangles[i]\n for (var j=0;j<=i;j++)\n {\n res+=nows[now];\n }\n now++;\n }\n}\nprint(res)", "src_uid": "b991c064562704b6106a6ff2a297e64a"}
{"source_code": "/*\n Pick your own problems you fuck faced cunt.\n*/\nvar radix=parseInt(readline());\nfor(var i = 1;i < radix; ++i){\n for(var j = 1;j < radix; ++j){\n write((i*j).toString(radix)+\" \");\n }\n print();\n}", "src_uid": "a705144ace798d6b41068aa284d99050"}
{"source_code": "var n = Number(readline());\nvar k = 1, sum = 0;\nwhile (sum < n - k) {\n sum += k++;\n}\nprint(n - sum);", "src_uid": "1db5631847085815461c617854b08ee5"}
{"source_code": "var line = readline().split(' ');\nvar n = parseInt(line[0]);\nvar k = parseInt(line[1]);\nvar arr = readline().split(' ');\nvar list = [];\n\nif (n === arr.length) {\n\nfor (var i = 0; i < arr.length; i++) {\n \n if (k % arr[i] === 0) {\n list.push(arr[i]);\n }\n \n}\n\nprint(k / Math.max.apply(Math, list));\n\n}", "src_uid": "80520be9916045aca3a7de7bc925af1f"}
{"source_code": "var n =readline()\n\nvar nLeft,nRight,qLeft,qRight\n\nvar aPos=n.indexOf('A')\nvar sum=0\n\n\n\nwhile(aPos!=-1){\n nLeft=n.substring(0,aPos)\n nRight=n.substring(aPos+1,n.length)\n \n qLeft=(nLeft.match(/Q/g) || []).length\n qRight=(nRight.match(/Q/g) || []).length\n sum+= qLeft*qRight\n n=nLeft+nRight\n aPos=n.indexOf('A')\n}\nprint(sum)\n", "src_uid": "8aef4947322438664bd8610632fe0947"}
{"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 console.log(findTheNumberOfLinesForLady(numberOfSquares));\n process.exit();\n});\n\nfunction findTheNumberOfLinesForLady(forTheNumberOfSquaress) {\n let a = Math.sqrt(forTheNumberOfSquaress);\n let b = Math.trunc(a);\n if (a == b) return (a + a);\n if (b * (b + 1) >= forTheNumberOfSquaress) return b + b + 1;\n return b + b + 2;\n}", "src_uid": "eb8212aec951f8f69b084446da73eaf7"}
{"source_code": "function getInput() {\n var line = readline();\n var lines = [line];\n while (line = readline()) {\n lines.push(line);\n }\n return lines;\n}\n\nfunction main() {\n var lines = getInput().map(item => item.split(' '));\n var durationA = Number(lines[0][1]);\n var durationB = Number(lines[1][1]);\n var repeatB = Number(lines[1][0]);\n\n // first bus run at 5:00.\n var firstBusTime = 5 * 60;\n // start time in minutes.\n var startTime = lines[2][0].split(':').map(Number);\n startTime = startTime[0] * 60 + startTime[1];\n\n var x1 = startTime;\n var y1 = x1 + durationA;\n\n var count = 0;\n for (var x2 = firstBusTime; x2 < 24 * 60; x2 += repeatB) {\n var y2 = x2 + durationB;\n var x = Math.max(x1, x2);\n var y = Math.min(y1, y2);\n\n if (x < y) {\n count++;\n }\n }\n\n print(count);\n}\n\nmain()", "src_uid": "1c4cf1c3cb464a483511a8a61f8685a7"}
{"source_code": "print(readline().split('WUB').join(' '))", "src_uid": "edede580da1395fe459a480f6a0a548d"}
{"source_code": "\"use strict\";[]\n/*** Custom Header For JAVASCRIPT ***/\nvar min = Math.min\nvar max = Math.max\n\n//_f should be primitive\nvar nDArray = function(_a, _f)\n{\n\tif(!Array.isArray(_a)) return null;\n\tif(_a.length==1)\n\t{\n\t\tvar _ret = [];\n\t\twhile(_ret.push(_f)<_a[0]);\n\t\treturn _ret\n\t}\n\tvar _ret = [];\n\twhile(_ret.push(nDArray(_a.slice(1),_f))<_a[0]);\n\treturn _ret;\n}\n\n\nvar INF = 1e9+9;\n/*** End of Custom Header ***/\nvar main = function()\n{\n\tvar N = +readline()\n\tvar A = (\"0 \"+readline()).split(\" \").map(Number)\n\tvar dp = nDArray([N+1,3],0)\n\tdp[0][0] = 0;\n\tdp[0][1] = INF;\n\tdp[0][2] = INF;\n\tfor(var i=1; i<=N; i++)\n\t{\n\t\tdp[i][0] = 1 + min(dp[i-1][0], min(dp[i-1][1], dp[i-1][2]) );\n\t\tdp[i][1] = min(dp[i-1][0], dp[i-1][2]);\n\t\tdp[i][2] = min(dp[i-1][0], dp[i-1][1]);\n\t\tif(A[i]==2 || A[i]==0) dp[i][2]=INF;\n\t\tif(A[i]==1 || A[i]==0) dp[i][1]=INF;\n\t}\n\tvar ans = min(dp[N][0], min(dp[N][1],dp[N][2]));\n\twrite(ans)\n}\n\n\nmain()\n", "src_uid": "08f1ba79ced688958695a7cfcfdda035"}
{"source_code": "const readline = require('readline');\n\n// Create readline Interface\nconst rl = readline.createInterface({\n input: process.stdin,\n output: process.stdout\n});\n\nlet grid = [];\n// Read Inputs\n\nrl.on('line', lineInput => {\n grid.push(lineInput);\n})\nrl.on('close', () => { \n let r = grid[0].split(\" \")[0];\n let c = grid[0].split(\" \")[1];\n\n \n // rows\n let clearRows = 0, rows = [];\n for (let i = 1; i <= r; i++) {\n const row = grid[i];\n rows.push(row)\n if (!row.split('').includes('S'))\n clearRows++;\n }\n\n // cols\n let clearCols = 0;\n for (let i = 0; i < c; i++) {\n let f = 0;\n for (let j = 0; j < r; j++) {\n const box = rows[j].split('')[i];\n if (box === 'S') { f = 1; break; }\n }\n if (!f)\n clearCols++;\n }\n let overlaps = clearCols * clearRows;\n let ans = ((clearCols * r) + (clearRows * c)) - overlaps\n\n console.log(ans)\n\n});", "src_uid": "ebaf7d89c623d006a6f1ffd025892102"}
{"source_code": "n=+readline()\na=readline().split(' ').map(function(x){return +x;})\nvar res=0;\nfor (var i=0;i<=n;i++)\n{\n var x0=0;\n var x1=0;\n for (var j=0;j<i;j++)\n {\n x0+=1-a[j];\n }\n for (var j=i;j<n;j++)\n {\n x1+=a[j];\n }\n if (x0+x1>res){res=x0+x1;}\n}\nprint(res)", "src_uid": "c7b1f0b40e310f99936d1c33e4816b95"}
{"source_code": ";(function () {\n\tprint(function (n) {\n\n\t\tfor (var i = 1; i <= 4; i++) {\n\t\t\tvar l = readline().split(' ').map(Number),\n\t\t\t\tx = Math.min(l[0], l[1]),\n\t\t\t\ty = Math.min(l[2], l[3]);\n\n\t\t\tif (x + y <= n) {\n\t\t\t\treturn [i, x, n - x].join(' ');\n\t\t\t}\n\t\t}\n\n\t\treturn -1;\n\n\t}(+readline()));\n}.call(this));\n", "src_uid": "6e7ee0da980beb99ca49a5ddd04089a5"}
{"source_code": "'use strict';\n\nprocess.stdin.resume();\nprocess.stdin.setEncoding('utf-8');\n\nlet inputString = '';\nlet currentLine = 0;\n\nprocess.stdin.on('data', inputStdin => {\n inputString += inputStdin;\n});\n\nprocess.stdin.on('end', _ => {\n inputString = inputString.trim().split('\\n').map(string => {\n return string.trim();\n });\n\n main();\n});\n\nfunction readLine() {\n return inputString[currentLine++];\n}\n\nfunction printResult(x) {\n process.stdout.write(x);\n}\n\nfunction main() {\n const arrPoints = new Array(8);\n for (let i = 0; i < 8; i++) {\n let rl = readLine().split(' ').map(Number);\n arrPoints[i] = new Point(rl[0], rl[1]);\n }\n\n eightPointSet(arrPoints);\n}\n\nfunction Point(x, y)\n{\n this.x = x;\n this.y = y;\n}\n\nconst comparePoints = (a, b) => {\n if (a.x < b.x || (a.x === b.x && a.y < b.y)) {\n return -1;\n }\n if (a.x > b.x || (a.x === b.x && a.y > b.y)) {\n return 1;\n }\n return 0;\n}\n\n/**\n * eightPointSet\n *\n * 2 4 7\n * 1 6\n * 0 3 5\n *\n * => Equal\n * x0 = x0 = x2\n * x3 = x4\n * x5 = x6 = x7\n * y0 = y3 = y5\n * y1 = y6\n * y2 = y4 = y7\n *\n * => Not equal\n * x0 != x3\n * x3 != x5\n * y0 != y1\n * y1 != y2\n */\nconst eightPointSet = (a) => {\n a.sort(comparePoints);\n if (a[0].x === a[1].x && a[1].x === a[2].x\n && a[3].x === a[4].x\n && a[5].x === a[6].x && a[6].x === a[7].x\n && a[0].y === a[3].y && a[3].y === a[5].y\n && a[1].y === a[6].y\n && a[2].y === a[4].y && a[4].y === a[7].y\n\n && a[0].x !== a[3].x\n && a[3].x !== a[5].x\n && a[0].y !== a[1].y\n && a[1].y !== a[2].y) {\n printResult('respectable');\n } else {\n printResult('ugly');\n }\n};", "src_uid": "f3c96123334534056f26b96f90886807"}
{"source_code": "var input = readline().split(\" \"), a = input[0], b = input[1], counter = 0;\n\nfor(;a > 0 && b > 0;){\n\tif(a >= b){\n\t\tcounter += Math.floor(a/b);\n\t\ta = a % b;\n\t}\n\telse{\n\t\tcounter += Math.floor(b/a);\n\t\tb = b % a;\n\t}\n}\nwrite(counter);", "src_uid": "ce698a0eb3f5b82de58feb177ce43b83"}
{"source_code": ";(function () {\n\tprint(function () {\n\t\tvar s = readline().split(''), l = [];\n\t\tfor (var i = 0; i < 8; i++) {\n\t\t\tl.push(s.splice(0, 10).join(''));\n\t\t}\n\n\t\tvar n = [], s = 10;\n\t\twhile (s--) {\n\t\t\tn.push(readline());\n\t\t}\n\n\t\tl.forEach(function (e, i) {\n\t\t\tl[i] = n.indexOf(e);\n\t\t});\n\n\t\treturn l.join('');\n\t}());\n}.call(this));", "src_uid": "0f4f7ca388dd1b2192436c67f9ac74d9"}
{"source_code": "var cards = readline().split(' ').map(Number);\n\nvar duplicates = {};\n\nfor (var i = 0; i < cards.length; i++) {\n\tif (cards[i] in duplicates) {\n\t\tif (duplicates[cards[i]] < 3) {\n\t\t\tduplicates[cards[i]] += 1; //but only up to 3!!\n\t\t}\n\t} else {\n\t\tduplicates[cards[i]] = 1;\n\t}\n}\n\nvar sum = 0;\nvar max_sum = 0;\n\nfor (var key in duplicates) {\n\tif (duplicates[key] > 1) {\n\t\tsum = key * duplicates[key];\n\t\tif (sum > max_sum) {\n\t\t\tmax_sum = sum;\n\t\t}\n\t}\n}\n\nvar cards_sum = 0;\nvar min_sum = 0;\n\nfor (var i = 0; i < cards.length; i++) {\n\tcards_sum += cards[i];\n}\n\nmin_sum = cards_sum - max_sum;\n\nprint(min_sum);", "src_uid": "a9c17ce5fd5f39ffd70917127ce3408a"}
{"source_code": "var a = +readline();\n\nwhile(String(a).split('').map(e => +e).reduce((a,b) => a + b) % 4 != 0) a ++;\nwrite(a)", "src_uid": "bb6fb9516b2c55d1ee47a30d423562d7"}
{"source_code": "var keyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\", mistake = readline(), string = readline(), answer = [];\n\nif( mistake == \"R\" ){\n\tfor(i = 0; i < string.length; i++){\n\t\tanswer.push(keyboard[keyboard.indexOf(string[i])-1]);\n\t}\n\twrite(answer.join(\"\"));\n}\nelse{\n\tfor(i = 0; i < string.length; i++){\n\t\tanswer.push(keyboard[keyboard.indexOf(string[i])+1]);\n\t}\n\twrite(answer.join(\"\"));\n}", "src_uid": "df49c0c257903516767fdb8ac9c2bfd6"}
{"source_code": "function calculateProb(str1, str2) {\n var num = parseInt(str1);\n var arr = str2.split(\"\").map(function(x) { return parseInt(x); });\n var ob = {};\n\n for (var i = 0; i < arr.length; i++) {\n if (!ob[arr[i]]) {\n ob[arr[i]] = 0;\n }\n\n ob[arr[i]]++;\n }\n\n var min = 0;\n\n for (var j = 0; j < 10; j++) {\n if (j === 0) {\n min = ob[j] || 0;\n } else {\n if (ob[j] < min) min = ob[j];\n }\n\n }\n\n ob[8] = ob[8] ? ob[8] : 0;\n\n return Math.min(ob[8], Math.floor(num / 11));\n}\n\nvar s1 = readline();\nvar s2 = readline();\n\nprint(calculateProb(s1, s2));\n", "src_uid": "259d01b81bef5536b969247ff2c2d776"}
{"source_code": "const readline = require('readline');\nconst rl = readline.createInterface({\n input: process.stdin,\n output: process.stdout,\n terminal: false\n});\nconst arr = [];\n\nrl.on('line', (data) => {\n arr.push(+data);\n});\n\nrl.on('close', () => {\n const [a, b, c, d, e, f] = arr;\n\n let suite2 = Math.min(b, c, d);\n let suite1 = Math.min(a, d - suite2);\n if (f > e) {\n suite2 = Math.min(b, c, d);\n suite1 = Math.min(a, d - suite2);\n }\n else {\n suite1 = Math.min(a, d);\n suite2 = Math.min(b, c, d - suite1);\n }\n\n const price1 = suite1 * e < 0 ? 0 : suite1 * e;\n const price2 = suite2 * f < 0 ? 0 : suite2 * f;\n const ans = price1 + price2;\n\n console.log(ans);\n});\n", "src_uid": "84d9e7e9c9541d997e6573edb421ae0a"}
{"source_code": "function main() {\n var line1 = readline();\n var data = readline().split(' ').map(Number);\n data.sort((a, b) => a-b);\n for (var k = data.length-1; k >= 2 && data[k-2] > 0 ; --k) {\n if ( data[k-2]+data[k-1] > data[k] )\n return print(\"YES\")\n }\n return print(\"NO\")\n}\n\n\n\n\nmain()", "src_uid": "897bd80b79df7b1143b652655b9a6790"}
{"source_code": "!function(t){var n={};function r(e){if(n[e])return n[e].exports;var o=n[e]={i:e,l:!1,exports:{}};return t[e].call(o.exports,o,o.exports,r),o.l=!0,o.exports}r.m=t,r.c=n,r.d=function(t,n,e){r.o(t,n)||Object.defineProperty(t,n,{enumerable:!0,get:e})},r.r=function(t){\"undefined\"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(t,Symbol.toStringTag,{value:\"Module\"}),Object.defineProperty(t,\"__esModule\",{value:!0})},r.t=function(t,n){if(1&n&&(t=r(t)),8&n)return t;if(4&n&&\"object\"==typeof t&&t&&t.__esModule)return t;var e=Object.create(null);if(r.r(e),Object.defineProperty(e,\"default\",{enumerable:!0,value:t}),2&n&&\"string\"!=typeof t)for(var o in t)r.d(e,o,function(n){return t[n]}.bind(null,o));return e},r.n=function(t){var n=t&&t.__esModule?function(){return t.default}:function(){return t};return r.d(n,\"a\",n),n},r.o=function(t,n){return Object.prototype.hasOwnProperty.call(t,n)},r.p=\"\",r(r.s=49)}([function(t,n,r){var e=r(26)(\"wks\"),o=r(14),i=r(2).Symbol,u=\"function\"==typeof i;(t.exports=function(t){return e[t]||(e[t]=u&&i[t]||(u?i:o)(\"Symbol.\"+t))}).store=e},function(t,n,r){var e=r(2),o=r(11),i=r(5),u=r(17),c=r(27),f=function(t,n,r){var a,s,l,p,v=t&f.F,y=t&f.G,h=t&f.S,d=t&f.P,g=t&f.B,b=y?e:h?e[n]||(e[n]={}):(e[n]||{}).prototype,x=y?o:o[n]||(o[n]={}),m=x.prototype||(x.prototype={});for(a in y&&(r=n),r)l=((s=!v&&b&&void 0!==b[a])?b:r)[a],p=g&&s?c(l,e):d&&\"function\"==typeof l?c(Function.call,l):l,b&&u(b,a,l,t&f.U),x[a]!=l&&i(x,a,p),d&&m[a]!=l&&(m[a]=l)};e.core=o,f.F=1,f.G=2,f.S=4,f.P=8,f.B=16,f.W=32,f.U=64,f.R=128,t.exports=f},function(t,n){var r=t.exports=\"undefined\"!=typeof window&&window.Math==Math?window:\"undefined\"!=typeof self&&self.Math==Math?self:Function(\"return this\")();\"number\"==typeof __g&&(__g=r)},function(t,n,r){t.exports=!r(9)(function(){return 7!=Object.defineProperty({},\"a\",{get:function(){return 7}}).a})},function(t,n,r){var e=r(12),o=r(39),i=r(15),u=Object.defineProperty;n.f=r(3)?Object.defineProperty:function(t,n,r){if(e(t),n=i(n,!0),e(r),o)try{return u(t,n,r)}catch(t){}if(\"get\"in r||\"set\"in r)throw TypeError(\"Accessors not supported!\");return\"value\"in r&&(t[n]=r.value),t}},function(t,n,r){var e=r(4),o=r(16);t.exports=r(3)?function(t,n,r){return e.f(t,n,o(1,r))}:function(t,n,r){return t[n]=r,t}},function(t,n,r){var e=r(29),o=r(30);t.exports=function(t){return e(o(t))}},function(t,n,r){var e=r(30);t.exports=function(t){return Object(e(t))}},function(t,n){t.exports=function(t){return\"object\"==typeof t?null!==t:\"function\"==typeof t}},function(t,n){t.exports=function(t){try{return!!t()}catch(t){return!0}}},function(t,n){var r={}.hasOwnProperty;t.exports=function(t,n){return r.call(t,n)}},function(t,n){var r=t.exports={version:\"2.5.7\"};\"number\"==typeof __e&&(__e=r)},function(t,n,r){var e=r(8);t.exports=function(t){if(!e(t))throw TypeError(t+\" is not an object!\");return t}},function(t,n){t.exports=!1},function(t,n){var r=0,e=Math.random();t.exports=function(t){return\"Symbol(\".concat(void 0===t?\"\":t,\")_\",(++r+e).toString(36))}},function(t,n,r){var e=r(8);t.exports=function(t,n){if(!e(t))return t;var r,o;if(n&&\"function\"==typeof(r=t.toString)&&!e(o=r.call(t)))return o;if(\"function\"==typeof(r=t.valueOf)&&!e(o=r.call(t)))return o;if(!n&&\"function\"==typeof(r=t.toString)&&!e(o=r.call(t)))return o;throw TypeError(\"Can't convert object to primitive value\")}},function(t,n){t.exports=function(t,n){return{enumerable:!(1&t),configurable:!(2&t),writable:!(4&t),value:n}}},function(t,n,r){var e=r(2),o=r(5),i=r(10),u=r(14)(\"src\"),c=Function.toString,f=(\"\"+c).split(\"toString\");r(11).inspectSource=function(t){return c.call(t)},(t.exports=function(t,n,r,c){var a=\"function\"==typeof r;a&&(i(r,\"name\")||o(r,\"name\",n)),t[n]!==r&&(a&&(i(r,u)||o(r,u,t[n]?\"\"+t[n]:f.join(String(n)))),t===e?t[n]=r:c?t[n]?t[n]=r:o(t,n,r):(delete t[n],o(t,n,r)))})(Function.prototype,\"toString\",function(){return\"function\"==typeof this&&this[u]||c.call(this)})},function(t,n,r){var e=r(41),o=r(32);t.exports=Object.keys||function(t){return e(t,o)}},function(t,n){t.exports={}},function(t,n){t.exports=function(t){if(\"function\"!=typeof t)throw TypeError(t+\" is not a function!\");return t}},function(t,n){var r={}.toString;t.exports=function(t){return r.call(t).slice(8,-1)}},function(t,n,r){var e=r(42),o=Math.min;t.exports=function(t){return t>0?o(e(t),9007199254740991):0}},function(t,n){n.f={}.propertyIsEnumerable},function(t,n,r){var e=r(23),o=r(16),i=r(6),u=r(15),c=r(10),f=r(39),a=Object.getOwnPropertyDescriptor;n.f=r(3)?a:function(t,n){if(t=i(t),n=u(n,!0),f)try{return a(t,n)}catch(t){}if(c(t,n))return o(!e.f.call(t,n),t[n])}},function(t,n,r){\"use strict\";t.exports=r(13)||!r(9)(function(){var t=Math.random();__defineSetter__.call(null,t,function(){}),delete r(2)[t]})},function(t,n,r){var e=r(11),o=r(2),i=o[\"__core-js_shared__\"]||(o[\"__core-js_shared__\"]={});(t.exports=function(t,n){return i[t]||(i[t]=void 0!==n?n:{})})(\"versions\",[]).push({version:e.version,mode:r(13)?\"pure\":\"global\",copyright:\"\u00a9 2018 Denis Pushkarev (zloirock.ru)\"})},function(t,n,r){var e=r(20);t.exports=function(t,n,r){if(e(t),void 0===n)return t;switch(r){case 1:return function(r){return t.call(n,r)};case 2:return function(r,e){return t.call(n,r,e)};case 3:return function(r,e,o){return t.call(n,r,e,o)}}return function(){return t.apply(n,arguments)}}},function(t,n,r){var e=r(4).f,o=r(10),i=r(0)(\"toStringTag\");t.exports=function(t,n,r){t&&!o(t=r?t:t.prototype,i)&&e(t,i,{configurable:!0,value:n})}},function(t,n,r){var e=r(21);t.exports=Object(\"z\").propertyIsEnumerable(0)?Object:function(t){return\"String\"==e(t)?t.split(\"\"):Object(t)}},function(t,n){t.exports=function(t){if(void 0==t)throw TypeError(\"Can't call method on \"+t);return t}},function(t,n,r){var e=r(26)(\"keys\"),o=r(14);t.exports=function(t){return e[t]||(e[t]=o(t))}},function(t,n){t.exports=\"constructor,hasOwnProperty,isPrototypeOf,propertyIsEnumerable,toLocaleString,toString,valueOf\".split(\",\")},function(t,n){n.f=Object.getOwnPropertySymbols},function(t,n,r){var e=r(21);t.exports=Array.isArray||function(t){return\"Array\"==e(t)}},function(t,n,r){var e=r(41),o=r(32).concat(\"length\",\"prototype\");n.f=Object.getOwnPropertyNames||function(t){return e(t,o)}},function(t,n,r){var e=r(10),o=r(7),i=r(31)(\"IE_PROTO\"),u=Object.prototype;t.exports=Object.getPrototypeOf||function(t){return t=o(t),e(t,i)?t[i]:\"function\"==typeof t.constructor&&t instanceof t.constructor?t.constructor.prototype:t instanceof Object?u:null}},function(t,n,r){var e=r(2),o=r(11),i=r(13),u=r(38),c=r(4).f;t.exports=function(t){var n=o.Symbol||(o.Symbol=i?{}:e.Symbol||{});\"_\"==t.charAt(0)||t in n||c(n,t,{value:u.f(t)})}},function(t,n,r){n.f=r(0)},function(t,n,r){t.exports=!r(3)&&!r(9)(function(){return 7!=Object.defineProperty(r(40)(\"div\"),\"a\",{get:function(){return 7}}).a})},function(t,n,r){var e=r(8),o=r(2).document,i=e(o)&&e(o.createElement);t.exports=function(t){return i?o.createElement(t):{}}},function(t,n,r){var e=r(10),o=r(6),i=r(54)(!1),u=r(31)(\"IE_PROTO\");t.exports=function(t,n){var r,c=o(t),f=0,a=[];for(r in c)r!=u&&e(c,r)&&a.push(r);for(;n.length>f;)e(c,r=n[f++])&&(~i(a,r)||a.push(r));return a}},function(t,n){var r=Math.ceil,e=Math.floor;t.exports=function(t){return isNaN(t=+t)?0:(t>0?e:r)(t)}},function(t,n,r){var e=r(12),o=r(56),i=r(32),u=r(31)(\"IE_PROTO\"),c=function(){},f=function(){var t,n=r(40)(\"iframe\"),e=i.length;for(n.style.display=\"none\",r(57).appendChild(n),n.src=\"javascript:\",(t=n.contentWindow.document).open(),t.write(\"<script>document.F=Object<\\/script>\"),t.close(),f=t.F;e--;)delete f.prototype[i[e]];return f()};t.exports=Object.create||function(t,n){var r;return null!==t?(c.prototype=e(t),r=new c,c.prototype=null,r[u]=t):r=f(),void 0===n?r:o(r,n)}},function(t,n,r){\"use strict\";var e=r(61),o=r(62),i=r(19),u=r(6);t.exports=r(63)(Array,\"Array\",function(t,n){this._t=u(t),this._i=0,this._k=n},function(){var t=this._t,n=this._k,r=this._i++;return!t||r>=t.length?(this._t=void 0,o(1)):o(0,\"keys\"==n?r:\"values\"==n?t[r]:[r,t[r]])},\"values\"),i.Arguments=i.Array,e(\"keys\"),e(\"values\"),e(\"entries\")},function(t,n,r){var e=r(1),o=r(46)(!1);e(e.S,\"Object\",{values:function(t){return o(t)}})},function(t,n,r){var e=r(18),o=r(6),i=r(23).f;t.exports=function(t){return function(n){for(var r,u=o(n),c=e(u),f=c.length,a=0,s=[];f>a;)i.call(u,r=c[a++])&&s.push(t?[r,u[r]]:u[r]);return s}}},function(t,n,r){\"use strict\";var e=r(4),o=r(16);t.exports=function(t,n,r){n in t?e.f(t,n,o(0,r)):t[n]=r}},function(t,n,r){\"use strict\";var e=r(9);t.exports=function(t,n){return!!t&&e(function(){n?t.call(null,function(){},1):t.call(null)})}},function(t,n,r){\"use strict\";function e(t,n){return function(t){if(Array.isArray(t))return t}(t)||function(t,n){var r=[],e=!0,o=!1,i=void 0;try{for(var u,c=t[Symbol.iterator]();!(e=(u=c.next()).done)&&(r.push(u.value),!n||r.length!==n);e=!0);}catch(t){o=!0,i=t}finally{try{e||null==c.return||c.return()}finally{if(o)throw i}}return r}(t,n)||function(){throw new TypeError(\"Invalid attempt to destructure non-iterable instance\")}()}r(50),r(51),r(59),r(60),r(44),r(45),r(65),r(71),r(75),r(78),r(80);var o=function(){for(var t=arguments.length,n=new Array(t),r=0;r<t;r++)n[r]=arguments[r];return function(){for(var t=arguments.length,r=new Array(t),e=0;e<t;e++)r[e]=arguments[e];return n.reduce(function(t,n){return n(t)},r)}},i=function(t){return t.split(\" \")},u=o(readline,function(t){return i(t).map(function(t){return parseInt(t,10)})}),c=o(readline,i),f=e(u(),2),a=(f[0],f[1]),s=e(c(),1)[0],l=Array.from(s).reduce(function(t,n,r){return t[n]||(t[n]=[]),t[n].push(r),t},{}),p=e(Object.values(l).reduce(function(t,n){var r=n[0],e=n[n.length-1]+1;return t[r]||(t[r]=0),t[e]||(t[e]=0),t[r]++,t[e]--,t},[]).reduce(function(t,n){var r=e(t,2),o=r[0]+n;return[o,r[1]||o>a]},[0,!1]),2)[1];write(p?\"YES\":\"NO\")},function(t,n,r){r(37)(\"asyncIterator\")},function(t,n,r){\"use strict\";var e=r(2),o=r(10),i=r(3),u=r(1),c=r(17),f=r(52).KEY,a=r(9),s=r(26),l=r(28),p=r(14),v=r(0),y=r(38),h=r(37),d=r(53),g=r(34),b=r(12),x=r(8),m=r(6),S=r(15),O=r(16),w=r(43),_=r(58),j=r(24),P=r(4),E=r(18),A=j.f,T=P.f,L=_.f,M=e.Symbol,k=e.JSON,F=k&&k.stringify,I=v(\"_hidden\"),N=v(\"toPrimitive\"),R={}.propertyIsEnumerable,C=s(\"symbol-registry\"),D=s(\"symbols\"),G=s(\"op-symbols\"),V=Object.prototype,W=\"function\"==typeof M,H=e.QObject,J=!H||!H.prototype||!H.prototype.findChild,K=i&&a(function(){return 7!=w(T({},\"a\",{get:function(){return T(this,\"a\",{value:7}).a}})).a})?function(t,n,r){var e=A(V,n);e&&delete V[n],T(t,n,r),e&&t!==V&&T(V,n,e)}:T,z=function(t){var n=D[t]=w(M.prototype);return n._k=t,n},B=W&&\"symbol\"==typeof M.iterator?function(t){return\"symbol\"==typeof t}:function(t){return t instanceof M},U=function(t,n,r){return t===V&&U(G,n,r),b(t),n=S(n,!0),b(r),o(D,n)?(r.enumerable?(o(t,I)&&t[I][n]&&(t[I][n]=!1),r=w(r,{enumerable:O(0,!1)})):(o(t,I)||T(t,I,O(1,{})),t[I][n]=!0),K(t,n,r)):T(t,n,r)},Y=function(t,n){b(t);for(var r,e=d(n=m(n)),o=0,i=e.length;i>o;)U(t,r=e[o++],n[r]);return t},q=function(t){var n=R.call(this,t=S(t,!0));return!(this===V&&o(D,t)&&!o(G,t))&&(!(n||!o(this,t)||!o(D,t)||o(this,I)&&this[I][t])||n)},Q=function(t,n){if(t=m(t),n=S(n,!0),t!==V||!o(D,n)||o(G,n)){var r=A(t,n);return!r||!o(D,n)||o(t,I)&&t[I][n]||(r.enumerable=!0),r}},$=function(t){for(var n,r=L(m(t)),e=[],i=0;r.length>i;)o(D,n=r[i++])||n==I||n==f||e.push(n);return e},X=function(t){for(var n,r=t===V,e=L(r?G:m(t)),i=[],u=0;e.length>u;)!o(D,n=e[u++])||r&&!o(V,n)||i.push(D[n]);return i};W||(c((M=function(){if(this instanceof M)throw TypeError(\"Symbol is not a constructor!\");var t=p(arguments.length>0?arguments[0]:void 0),n=function(r){this===V&&n.call(G,r),o(this,I)&&o(this[I],t)&&(this[I][t]=!1),K(this,t,O(1,r))};return i&&J&&K(V,t,{configurable:!0,set:n}),z(t)}).prototype,\"toString\",function(){return this._k}),j.f=Q,P.f=U,r(35).f=_.f=$,r(23).f=q,r(33).f=X,i&&!r(13)&&c(V,\"propertyIsEnumerable\",q,!0),y.f=function(t){return z(v(t))}),u(u.G+u.W+u.F*!W,{Symbol:M});for(var Z=\"hasInstance,isConcatSpreadable,iterator,match,replace,search,species,split,toPrimitive,toStringTag,unscopables\".split(\",\"),tt=0;Z.length>tt;)v(Z[tt++]);for(var nt=E(v.store),rt=0;nt.length>rt;)h(nt[rt++]);u(u.S+u.F*!W,\"Symbol\",{for:function(t){return o(C,t+=\"\")?C[t]:C[t]=M(t)},keyFor:function(t){if(!B(t))throw TypeError(t+\" is not a symbol!\");for(var n in C)if(C[n]===t)return n},useSetter:function(){J=!0},useSimple:function(){J=!1}}),u(u.S+u.F*!W,\"Object\",{create:function(t,n){return void 0===n?w(t):Y(w(t),n)},defineProperty:U,defineProperties:Y,getOwnPropertyDescriptor:Q,getOwnPropertyNames:$,getOwnPropertySymbols:X}),k&&u(u.S+u.F*(!W||a(function(){var t=M();return\"[null]\"!=F([t])||\"{}\"!=F({a:t})||\"{}\"!=F(Object(t))})),\"JSON\",{stringify:function(t){for(var n,r,e=[t],o=1;arguments.length>o;)e.push(arguments[o++]);if(r=n=e[1],(x(n)||void 0!==t)&&!B(t))return g(n)||(n=function(t,n){if(\"function\"==typeof r&&(n=r.call(this,t,n)),!B(n))return n}),e[1]=n,F.apply(k,e)}}),M.prototype[N]||r(5)(M.prototype,N,M.prototype.valueOf),l(M,\"Symbol\"),l(Math,\"Math\",!0),l(e.JSON,\"JSON\",!0)},function(t,n,r){var e=r(14)(\"meta\"),o=r(8),i=r(10),u=r(4).f,c=0,f=Object.isExtensible||function(){return!0},a=!r(9)(function(){return f(Object.preventExtensions({}))}),s=function(t){u(t,e,{value:{i:\"O\"+ ++c,w:{}}})},l=t.exports={KEY:e,NEED:!1,fastKey:function(t,n){if(!o(t))return\"symbol\"==typeof t?t:(\"string\"==typeof t?\"S\":\"P\")+t;if(!i(t,e)){if(!f(t))return\"F\";if(!n)return\"E\";s(t)}return t[e].i},getWeak:function(t,n){if(!i(t,e)){if(!f(t))return!0;if(!n)return!1;s(t)}return t[e].w},onFreeze:function(t){return a&&l.NEED&&f(t)&&!i(t,e)&&s(t),t}}},function(t,n,r){var e=r(18),o=r(33),i=r(23);t.exports=function(t){var n=e(t),r=o.f;if(r)for(var u,c=r(t),f=i.f,a=0;c.length>a;)f.call(t,u=c[a++])&&n.push(u);return n}},function(t,n,r){var e=r(6),o=r(22),i=r(55);t.exports=function(t){return function(n,r,u){var c,f=e(n),a=o(f.length),s=i(u,a);if(t&&r!=r){for(;a>s;)if((c=f[s++])!=c)return!0}else for(;a>s;s++)if((t||s in f)&&f[s]===r)return t||s||0;return!t&&-1}}},function(t,n,r){var e=r(42),o=Math.max,i=Math.min;t.exports=function(t,n){return(t=e(t))<0?o(t+n,0):i(t,n)}},function(t,n,r){var e=r(4),o=r(12),i=r(18);t.exports=r(3)?Object.defineProperties:function(t,n){o(t);for(var r,u=i(n),c=u.length,f=0;c>f;)e.f(t,r=u[f++],n[r]);return t}},function(t,n,r){var e=r(2).document;t.exports=e&&e.documentElement},function(t,n,r){var e=r(6),o=r(35).f,i={}.toString,u=\"object\"==typeof window&&window&&Object.getOwnPropertyNames?Object.getOwnPropertyNames(window):[];t.exports.f=function(t){return u&&\"[object Window]\"==i.call(t)?function(t){try{return o(t)}catch(t){return u.slice()}}(t):o(e(t))}},function(t,n,r){var e=r(1);e(e.S,\"Array\",{isArray:r(34)})},function(t,n,r){for(var e=r(44),o=r(18),i=r(17),u=r(2),c=r(5),f=r(19),a=r(0),s=a(\"iterator\"),l=a(\"toStringTag\"),p=f.Array,v={CSSRuleList:!0,CSSStyleDeclaration:!1,CSSValueList:!1,ClientRectList:!1,DOMRectList:!1,DOMStringList:!1,DOMTokenList:!0,DataTransferItemList:!1,FileList:!1,HTMLAllCollection:!1,HTMLCollection:!1,HTMLFormElement:!1,HTMLSelectElement:!1,MediaList:!0,MimeTypeArray:!1,NamedNodeMap:!1,NodeList:!0,PaintRequestList:!1,Plugin:!1,PluginArray:!1,SVGLengthList:!1,SVGNumberList:!1,SVGPathSegList:!1,SVGPointList:!1,SVGStringList:!1,SVGTransformList:!1,SourceBufferList:!1,StyleSheetList:!0,TextTrackCueList:!1,TextTrackList:!1,TouchList:!1},y=o(v),h=0;h<y.length;h++){var d,g=y[h],b=v[g],x=u[g],m=x&&x.prototype;if(m&&(m[s]||c(m,s,p),m[l]||c(m,l,g),f[g]=p,b))for(d in e)m[d]||i(m,d,e[d],!0)}},function(t,n,r){var e=r(0)(\"unscopables\"),o=Array.prototype;void 0==o[e]&&r(5)(o,e,{}),t.exports=function(t){o[e][t]=!0}},function(t,n){t.exports=function(t,n){return{value:n,done:!!t}}},function(t,n,r){\"use strict\";var e=r(13),o=r(1),i=r(17),u=r(5),c=r(19),f=r(64),a=r(28),s=r(36),l=r(0)(\"iterator\"),p=!([].keys&&\"next\"in[].keys()),v=function(){return this};t.exports=function(t,n,r,y,h,d,g){f(r,n,y);var b,x,m,S=function(t){if(!p&&t in j)return j[t];switch(t){case\"keys\":case\"values\":return function(){return new r(this,t)}}return function(){return new r(this,t)}},O=n+\" Iterator\",w=\"values\"==h,_=!1,j=t.prototype,P=j[l]||j[\"@@iterator\"]||h&&j[h],E=P||S(h),A=h?w?S(\"entries\"):E:void 0,T=\"Array\"==n&&j.entries||P;if(T&&(m=s(T.call(new t)))!==Object.prototype&&m.next&&(a(m,O,!0),e||\"function\"==typeof m[l]||u(m,l,v)),w&&P&&\"values\"!==P.name&&(_=!0,E=function(){return P.call(this)}),e&&!g||!p&&!_&&j[l]||u(j,l,E),c[n]=E,c[O]=v,h)if(b={values:w?E:S(\"values\"),keys:d?E:S(\"keys\"),entries:A},g)for(x in b)x in j||i(j,x,b[x]);else o(o.P+o.F*(p||_),n,b);return b}},function(t,n,r){\"use strict\";var e=r(43),o=r(16),i=r(28),u={};r(5)(u,r(0)(\"iterator\"),function(){return this}),t.exports=function(t,n,r){t.prototype=e(u,{next:o(1,r)}),i(t,n+\" Iterator\")}},function(t,n,r){\"use strict\";var e=r(27),o=r(1),i=r(7),u=r(66),c=r(67),f=r(22),a=r(47),s=r(68);o(o.S+o.F*!r(70)(function(t){Array.from(t)}),\"Array\",{from:function(t){var n,r,o,l,p=i(t),v=\"function\"==typeof this?this:Array,y=arguments.length,h=y>1?arguments[1]:void 0,d=void 0!==h,g=0,b=s(p);if(d&&(h=e(h,y>2?arguments[2]:void 0,2)),void 0==b||v==Array&&c(b))for(r=new v(n=f(p.length));n>g;g++)a(r,g,d?h(p[g],g):p[g]);else for(l=b.call(p),r=new v;!(o=l.next()).done;g++)a(r,g,d?u(l,h,[o.value,g],!0):o.value);return r.length=g,r}})},function(t,n,r){var e=r(12);t.exports=function(t,n,r,o){try{return o?n(e(r)[0],r[1]):n(r)}catch(n){var i=t.return;throw void 0!==i&&e(i.call(t)),n}}},function(t,n,r){var e=r(19),o=r(0)(\"iterator\"),i=Array.prototype;t.exports=function(t){return void 0!==t&&(e.Array===t||i[o]===t)}},function(t,n,r){var e=r(69),o=r(0)(\"iterator\"),i=r(19);t.exports=r(11).getIteratorMethod=function(t){if(void 0!=t)return t[o]||t[\"@@iterator\"]||i[e(t)]}},function(t,n,r){var e=r(21),o=r(0)(\"toStringTag\"),i=\"Arguments\"==e(function(){return arguments}());t.exports=function(t){var n,r,u;return void 0===t?\"Undefined\":null===t?\"Null\":\"string\"==typeof(r=function(t,n){try{return t[n]}catch(t){}}(n=Object(t),o))?r:i?e(n):\"Object\"==(u=e(n))&&\"function\"==typeof n.callee?\"Arguments\":u}},function(t,n,r){var e=r(0)(\"iterator\"),o=!1;try{var i=[7][e]();i.return=function(){o=!0},Array.from(i,function(){throw 2})}catch(t){}t.exports=function(t,n){if(!n&&!o)return!1;var r=!1;try{var i=[7],u=i[e]();u.next=function(){return{done:r=!0}},i[e]=function(){return u},t(i)}catch(t){}return r}},function(t,n,r){\"use strict\";var e=r(1),o=r(72)(1);e(e.P+e.F*!r(48)([].map,!0),\"Array\",{map:function(t){return o(this,t,arguments[1])}})},function(t,n,r){var e=r(27),o=r(29),i=r(7),u=r(22),c=r(73);t.exports=function(t,n){var r=1==t,f=2==t,a=3==t,s=4==t,l=6==t,p=5==t||l,v=n||c;return function(n,c,y){for(var h,d,g=i(n),b=o(g),x=e(c,y,3),m=u(b.length),S=0,O=r?v(n,m):f?v(n,0):void 0;m>S;S++)if((p||S in b)&&(d=x(h=b[S],S,g),t))if(r)O[S]=d;else if(d)switch(t){case 3:return!0;case 5:return h;case 6:return S;case 2:O.push(h)}else if(s)return!1;return l?-1:a||s?s:O}}},function(t,n,r){var e=r(74);t.exports=function(t,n){return new(e(t))(n)}},function(t,n,r){var e=r(8),o=r(34),i=r(0)(\"species\");t.exports=function(t){var n;return o(t)&&(\"function\"!=typeof(n=t.constructor)||n!==Array&&!o(n.prototype)||(n=void 0),e(n)&&null===(n=n[i])&&(n=void 0)),void 0===n?Array:n}},function(t,n,r){r(76)(\"split\",2,function(t,n,e){\"use strict\";var o=r(77),i=e,u=[].push;if(\"c\"==\"abbc\".split(/(b)*/)[1]||4!=\"test\".split(/(?:)/,-1).length||2!=\"ab\".split(/(?:ab)*/).length||4!=\".\".split(/(.?)(.?)/).length||\".\".split(/()()/).length>1||\"\".split(/.?/).length){var c=void 0===/()??/.exec(\"\")[1];e=function(t,n){var r=String(this);if(void 0===t&&0===n)return[];if(!o(t))return i.call(r,t,n);var e,f,a,s,l,p=[],v=(t.ignoreCase?\"i\":\"\")+(t.multiline?\"m\":\"\")+(t.unicode?\"u\":\"\")+(t.sticky?\"y\":\"\"),y=0,h=void 0===n?4294967295:n>>>0,d=new RegExp(t.source,v+\"g\");for(c||(e=new RegExp(\"^\"+d.source+\"$(?!\\\\s)\",v));(f=d.exec(r))&&!((a=f.index+f[0].length)>y&&(p.push(r.slice(y,f.index)),!c&&f.length>1&&f[0].replace(e,function(){for(l=1;l<arguments.length-2;l++)void 0===arguments[l]&&(f[l]=void 0)}),f.length>1&&f.index<r.length&&u.apply(p,f.slice(1)),s=f[0].length,y=a,p.length>=h));)d.lastIndex===f.index&&d.lastIndex++;return y===r.length?!s&&d.test(\"\")||p.push(\"\"):p.push(r.slice(y)),p.length>h?p.slice(0,h):p}}else\"0\".split(void 0,0).length&&(e=function(t,n){return void 0===t&&0===n?[]:i.call(this,t,n)});return[function(r,o){var i=t(this),u=void 0==r?void 0:r[n];return void 0!==u?u.call(r,i,o):e.call(String(i),r,o)},e]})},function(t,n,r){\"use strict\";var e=r(5),o=r(17),i=r(9),u=r(30),c=r(0);t.exports=function(t,n,r){var f=c(t),a=r(u,f,\"\"[t]),s=a[0],l=a[1];i(function(){var n={};return n[f]=function(){return 7},7!=\"\"[t](n)})&&(o(String.prototype,t,s),e(RegExp.prototype,f,2==n?function(t,n){return l.call(t,this,n)}:function(t){return l.call(t,this)}))}},function(t,n,r){var e=r(8),o=r(21),i=r(0)(\"match\");t.exports=function(t){var n;return e(t)&&(void 0!==(n=t[i])?!!n:\"RegExp\"==o(t))}},function(t,n,r){\"use strict\";var e=r(1),o=r(79);e(e.P+e.F*!r(48)([].reduce,!0),\"Array\",{reduce:function(t){return o(this,t,arguments.length,arguments[1],!1)}})},function(t,n,r){var e=r(20),o=r(7),i=r(29),u=r(22);t.exports=function(t,n,r,c,f){e(n);var a=o(t),s=i(a),l=u(a.length),p=f?l-1:0,v=f?-1:1;if(r<2)for(;;){if(p in s){c=s[p],p+=v;break}if(p+=v,f?p<0:l<=p)throw TypeError(\"Reduce of empty array with no initial value\")}for(;f?p>=0:l>p;p+=v)p in s&&(c=n(c,s[p],p,a));return c}},function(t,n,r){r(81),r(45),r(83),r(84),r(85),r(86),r(87),t.exports=r(11).Object},function(t,n,r){var e=r(1),o=r(82),i=r(6),u=r(24),c=r(47);e(e.S,\"Object\",{getOwnPropertyDescriptors:function(t){for(var n,r,e=i(t),f=u.f,a=o(e),s={},l=0;a.length>l;)void 0!==(r=f(e,n=a[l++]))&&c(s,n,r);return s}})},function(t,n,r){var e=r(35),o=r(33),i=r(12),u=r(2).Reflect;t.exports=u&&u.ownKeys||function(t){var n=e.f(i(t)),r=o.f;return r?n.concat(r(t)):n}},function(t,n,r){var e=r(1),o=r(46)(!0);e(e.S,\"Object\",{entries:function(t){return o(t)}})},function(t,n,r){\"use strict\";var e=r(1),o=r(7),i=r(20),u=r(4);r(3)&&e(e.P+r(25),\"Object\",{__defineGetter__:function(t,n){u.f(o(this),t,{get:i(n),enumerable:!0,configurable:!0})}})},function(t,n,r){\"use strict\";var e=r(1),o=r(7),i=r(20),u=r(4);r(3)&&e(e.P+r(25),\"Object\",{__defineSetter__:function(t,n){u.f(o(this),t,{set:i(n),enumerable:!0,configurable:!0})}})},function(t,n,r){\"use strict\";var e=r(1),o=r(7),i=r(15),u=r(36),c=r(24).f;r(3)&&e(e.P+r(25),\"Object\",{__lookupGetter__:function(t){var n,r=o(this),e=i(t,!0);do{if(n=c(r,e))return n.get}while(r=u(r))}})},function(t,n,r){\"use strict\";var e=r(1),o=r(7),i=r(15),u=r(36),c=r(24).f;r(3)&&e(e.P+r(25),\"Object\",{__lookupSetter__:function(t){var n,r=o(this),e=i(t,!0);do{if(n=c(r,e))return n.set}while(r=u(r))}})}]);", "src_uid": "216323563f5b2dd63edc30cb9b4849a5"}
{"source_code": "solve();\n\nfunction solve() {\n var c1 = 2, c2 = 5, c3 = 8, o1, o2, o3, ans = 0;\n var n, k;\n var input = readline().split(' ').map(Number);\n n = input[0];\n k = input[1];\n c1 *= n;\n c2 *= n;\n c3 *= n;\n o1 = c1 % k;\n o2 = c2 % k;\n o3 = c3 % k;\n ans += o1 ? (c1 - o1) / k + 1 : c1 / k;\n ans += o2 ? (c2 - o2) / k + 1 : c2 / k;\n ans += o3 ? (c3 - o3) / k + 1 : c3 / k;\n print(ans);\n}", "src_uid": "d259a3a5c38af34b2a15d61157cc0a39"}
{"source_code": "var flights = +readline();\nif (flights === 1) {\n\tprint(\"contest\");\n}\nelse {\n\tvar home = readline();\n\tvar fa = [];\n\tvar pair;\n\tvar inx;\n\tfor (var i = 0; i < flights; i++) {\n\t\tpair = readline().split(\"->\");\n\t\tinx = hasPair(pair, fa);\n\t\tif (inx !== -1) {\n\t\t\tfa.splice(inx, 1);\n\t\t}\n\t\telse {\n\t\t\tfa.push(pair);\n\t\t}\n\t}\n\tprint(fa.length > 0 ? \"contest\" : \"home\");\n}\nfunction hasPair(w, a) {\n\tvar c;\n\tfor (var x = 0, l = a.length; x < l; x++) {\n\t\tc = a[x];\n\t\tif (c && c[0] === w[1] && c[1] === w[0]) {\n\t\t\treturn x;\n\t\t}\n\t}\n\treturn -1;\n}", "src_uid": "51d1c79a52d3d4f80c98052b6ec77222"}
{"source_code": "\n var tmp = readline().split(' ').map(x => parseInt(x));\n var a = tmp[0];\n var b = tmp[1];\n\n var turn = true;\n var curr = 1;\n while(true) {\n if(turn) {\n if(a < curr) {\n break;\n }\n a -= curr;\n curr += 1;\n } else {\n if(b < curr) {\n break;\n }\n b -= curr;\n curr += 1;\n }\n turn = !turn;\n }\n print(turn ? 'Vladik' : 'Valera')", "src_uid": "87e37a82be7e39e433060fd8cdb03270"}
{"source_code": "var sum=readline().split(\" \").reduce((a,b)=>{return +a + +b;});\nif(sum%5!==0||sum===0)\n print(\"-1\");\nelse\n print(sum/5);\n", "src_uid": "af1ec6a6fc1f2360506fc8a34e3dcd20"}
{"source_code": "var cnt=new Array();\n\nfor(var i=0;i<=1000;i++){\n cnt[i]=new Array();\n for(var j=1;j<=2;j++) cnt[i][j]=0;\n \n}\n\nvar line = readline().split(' ');\nvar n=line[0];\nvar m=line[1];\n\nline = readline().split(' ');\nfor(var i=0;i<n;i++){\n var x=parseInt(line[i]);\n cnt[i%m][x]++;\n} \n\nvar ans=0;\n\nfor(var i=0;i<m;i++)\n ans+=Math.min(cnt[i][1],cnt[i][2]);\n\nprint(ans);", "src_uid": "5f94c2ecf1cf8fdbb6117cab801ed281"}
{"source_code": "var n=parseInt(readline());\nvar answer=0;\nvar n2=1;\nwhile(n!=0){\n var i=n%10;\n n=(n-i)/10;\n var num=0;\n if(i == 4){\n num=1;\n }else{\n num=2;\n }\n answer+=num*n2;\n n2*=2;\n}\nprint(answer)\n", "src_uid": "6a10bfe8b3da9c11167e136b3c6fb2a3"}
{"source_code": "var line = readline().split(' ');\n\nvar x = parseInt(line[0]);\nvar y = parseInt(line[1]);\n\nif( y<=1 && x != 0 ){\n print('No');\n} else {\n if(y == x + 1){\n print(\"Yes\")\n } else {\n if(x > y && (x - y + 1)% 2 == 0){\n print('Yes');\n } else {\n print('No');\n }\n }\n}\n\n\n\n", "src_uid": "1527171297a0b9c5adf356a549f313b9"}
{"source_code": "\nvar len = parseInt(readline());\nvar str = readline();\n\nif (isGood(str)) {\n print(\"1\");\n print(str);\n} else {\n var res = breakItDown(str, len);\n print(res.length)\n print(res.join(\" \"))\n}\n\n\nfunction breakItDown(str, len) {\n var left = str.substr(0, len / 2);\n var right = str.substr(len / 2);\n var slidingWindowIndex = 0;\n\n while (!isGood(left)) {\n slidingWindowIndex++;\n left += right.charAt(0);\n }\n\n right = right.substr(slidingWindowIndex);\n\n return [left, right];\n}\n\nfunction isGood(str) {\n return count(str, 1) != count(str, 0)\n}\n\nfunction count(str, num) {\n var _count = 0;\n for (var i = 0; i < str.length; i++)\n _count += str.charAt(i) == num ? 1 : 0;\n return _count\n}", "src_uid": "4ebed264d40a449602a26ceef2e849d1"}
{"source_code": ";(function () {\n\t\n\tvar n = readline().split(' ');\n\tvar m = +n[1];\n\tn = +n[0];\n\n\tvar a = readline().split(' ').map(Number);\n\n\tvar w = 0;\n\tvar x = 0;\n\tfor (var i = 0; i < n; i++) {\n\t\tw += a[i];\n\n\t\tif (w > m) {\n\t\t\tx++;\n\t\t\tw = a[i];\n\t\t} else if (w == m) {\n\t\t\tx++;\n\t\t\tw = 0;\n\t\t}\n\t}\n\n\tif (w) x++;\n\n\tprint(x);\n\n}).call(this);", "src_uid": "5c73d6e3770dff034d210cdd572ccf0f"}
{"source_code": "const solve = (n) => {\n let res = 1;\n for (let i = 1; i <= n; i++) {\n res *= i;\n }\n res /= n;\n res /= (n >> 1);\n return res;\n};\n\nconst main = () => {\n const readline = require('readline');\n const rl = readline.createInterface({\n input: process.stdin,\n output: process.stdout\n });\n rl.on('line', (line) => {\n console.log(solve(Number(line)));\n });\n};\n\nmain()", "src_uid": "ad0985c56a207f76afa2ecd642f56728"}
{"source_code": "let data = '';\nprocess.stdin.on('data', c => data += c);\n\nconst solution = () => {\n\tlet line = data.split('\\n');\n\tlet n = parseInt(line[0],10);\n\tlet a = line[1].split(' ').map(v => parseInt(v,10));\n\tlet c = 0;\n\twhile(a.length > 0){\n\t\tc++;\n\t\tlet t = [];\n\t\tlet min = Math.min(...a);\n\t\tfor(let i of a){\n\t\t\tif (i%min !== 0){\n\t\t\t\tt.push(i);\n\t\t\t}\n\t\t}\n\t\ta = t;\n\t\t\n\t}\n\tconsole.log(c);\n};\n\nprocess.stdin.on('end',solution);", "src_uid": "63d9b7416aa96129c57d20ec6145e0cd"}
{"source_code": "s=readline().split(' ')\nvar n = s[0];\nvar k = s[1];\nvar x = s[2];\na=readline().split(' ').map(function(v){return +v;})\nres=k*x\nfor (var i=0;i<n-k;i++){\n res+=a[i]\n}\nprint(res)", "src_uid": "92a233f8d9c73d9f33e4e6116b7d0a96"}
{"source_code": "var num = parseInt(readline())\nvar response = Math.floor(num / 5)\nif(num % 5 > 0) response++\nprint(response)", "src_uid": "4b3d65b1b593829e92c852be213922b6"}
{"source_code": "var nums = readline().split(\" \").map(function(x) { return parseInt(x); });\nvar w1 = nums[0];\nvar h1 = nums[1];\nvar w2 = nums[2];\nvar h2 = nums[3];\nvar ans = 0;\n//if (w1 === w2)\n\tans = w1*2 + (h1+h2)*2 + 4;\n//else\n//\tans = w1 + w2 + \nwrite(ans);\n", "src_uid": "b5d44e0041053c996938aadd1b3865f6"}
{"source_code": "function toInt(x) {\n\treturn parseInt(x);\n}\n\nvar ar = readline().split(' ').map(toInt);\nvar sum = 0;\nvar res = 'NO';\nvar fg = true;\n\nfor (var i = 0; i < 6; i++) {\n\tsum += ar[i];\n}\n\nif (sum % 2 != 0) {\n\tprint('NO');\n fg = false;\n} else {\n\tsum /= 2;\n}\n\nfor (var i = 0; i < 6; i++) {\n\tfor (var j = 0; j < 6; j++) {\n\t\tfor (var k = 0; k < 6; k++) {\n\t\t\tif ((i != j && i != k && j != k) && (ar[i] + ar[j] + ar[k] == sum)) {\n\t\t\t\tres = 'YES';\n\t\t\t}\n\t\t}\n\t}\n}\n\nif (fg)\n print(res);", "src_uid": "2acf686862a34c337d1d2cbc0ac3fd11"}
{"source_code": "var n = parseInt(readline());\n\nvar ret = 1;\n\nfor(var i=2; i<=n; i++) {\n ret += (i-1)*4;\n}\n\nprint(ret);", "src_uid": "758d342c1badde6d0b4db81285be780c"}
{"source_code": "var s = readline();\n\nvar l = s.length, m = -1, n = 0, i = 0, ss = \"\", out = \"\";\n\nfor(i = 0; i< l; i++)\n{\n if( s.charCodeAt(i) > m )\n {\n m = s.charCodeAt(i);\n n = 0\n }\n else if( s.charCodeAt(i) == m )\n {\n n++;\n }\n}\n\nss = String.fromCharCode(m); \nn++;\n\nfor(i = 0; i< n; i++)\n{\n out = out + ss;\n}\n\nprint(out);\n", "src_uid": "9a40e9b122962a1f83b74ddee6246a40"}
{"source_code": "function main() {\n let line = stdin[0].split(' ');\n let k = parseInt(line[1], 10);\n let items = stdin[1].split(' ').map(i => parseInt(i, 10));\n let allItems = {}, max = 0;\n\n for (let i = 0; i < items.length; ++i) {\n if (!(items[i] in allItems)) allItems[items[i]] = 0;\n ++allItems[items[i]];\n }\n \n for (let p in allItems) {\n max = Math.max(allItems[p], max);\n }\n \n const uniqCount = Object.keys(allItems).length;\n \n while (max % k != 0) { max++; }\n \n console.log(uniqCount * max - items.length);\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);\n", "src_uid": "c03ff0bc6a8c4ce5372194e8ea18527f"}
{"source_code": "var n = parseInt(readline());\nvar dirs = [];\nfor (var i = 0; i < n; i++) {\n dirs[i] = readline().split(' ');\n dirs[i][0] = parseInt(dirs[i][0]);\n}\n\nvar yPos = 0;\nresult = 'YES';\nvar i = 0;\nfor (; i < n; i++) {\n var dist = dirs[i][0];\n var dir = dirs[i][1];\n if (yPos === 0 && dir !== 'South') {\n result = 'NO';\n break;\n }\n if (yPos === 20000 && dir !== 'North') {\n result = 'NO';\n break;\n }\n if (dir === 'South') {\n yPos += dist;\n } else if (dir === 'North') {\n yPos -= dist;\n }\n if (yPos < 0 || yPos > 20000) {\n result = 'NO';\n break;\n }\n}\n\nprint(yPos === 0 ? result : 'NO');", "src_uid": "11ac96a9daa97ae1900f123be921e517"}
{"source_code": "main();\n\nfunction main(){\n var x = parseInt(readline());\n\n var guess=Math.round(Math.sqrt(x));\n //print(guess);\n\n for(var i=guess;i>=1;i--){\n if(x%i===0){\n //print(\"no remainder\");\n //print(lcm(i,x/i));\n if(x==lcm(i,x/i)){print(i+\" \"+x/i);return;}\n }//whole number divisor\n}\n \n}//main, added for return\n\nfunction lcm(a,b){\n return a*b/gcd(a,b);\n}\n\nfunction gcd(a,b){\n while(a>0){\n var temp=a;\n a=b%a;\n b=temp;\n }\n return b;\n}\n\n\n\n\n", "src_uid": "e504a04cefef3da093573f9df711bcea"}
{"source_code": "const find = (tasks, reserved) => {\n let bad = tasks * 2;\n let good = 0;\n let perTask = 5;\n\n const sum = (tasksCount) => \n (2 * perTask + perTask * (tasksCount - 1)) \n / 2 \n * tasksCount \n + reserved;\n\n while (bad - good > 1) {\n let middle = (good + bad) >> 1;\n\n if (sum(middle) <= 240) {\n good = middle;\n } else {\n bad = middle;\n }\n }\n\n console.log(Math.min(good, tasks));\n};\n\nlet _input = \"\";\n\nprocess.stdin.on(\"data\", function (input) {\n _input += input;\n});\n\nprocess.stdin.on(\"end\", function () {\n find(..._input.split('\\n')[0].split(' ').map(Number));\n});", "src_uid": "41e554bc323857be7b8483ee358a35e2"}
{"source_code": "var numbers = readline().split(\" \").map(function(x) { return parseInt(x); });\nvar n = numbers[0], m = numbers[1], a = numbers[2], b = numbers[3];\n\nif (n % m === 0) {\n print(0);\n} else {\n var destroy = (n - Math.floor(n / m) * m) * b;\n var build = (Math.ceil(n / m) * m - n) * a;\n print(Math.min(destroy, build));\n}\n", "src_uid": "c05d753b35545176ad468b99ff13aa39"}
{"source_code": "var s = readline().split(' '); \nvar n = Number(s[0]);\nvar m = Number(s[1]);\nvar a = Number(s[2]);\nvar b = Number(s[3]);\n\nvar out = 0;\nvar k = 0;\n\nif(b/m >= a/1)\n{\n out = a*n;\n}\nelse\n{\n k = (n - n % m);\n out = (k/m)*b;\n if( (n-k)*a > b)\n {\n out = out + b; \n }\n else\n {\n out = out + (n-k)*a;\n }\n}\n\n\nprint(out);\n\n\n\n\n\n\n", "src_uid": "faa343ad6028c5a069857a38fa19bb24"}
{"source_code": "var dataitr;\r\nvar stdin_input = \"\";\r\nprocess.stdin.resume();\r\nprocess.stdin.setEncoding(\"ascii\");\r\nprocess.stdin.on(\"data\", function (input) { stdin_input += input; });\r\nprocess.stdin.on(\"end\", function () { dataitr = stdin_input.split('\\n').values(); main(); });\r\n\r\nconst rl = () => dataitr.next().value.trim();\r\nconst rn = () => Number(rl());\r\nconst ra = () => rl().split(' ');\r\nconst rna = () => ra().map(x => Number(x));\r\n\r\nconst MOD = 1000000007n;\r\n\r\nfunction fast_pow(a, p)\r\n{\r\n\tlet res = 1n;\r\n\twhile (p) {\r\n\t\tif (p % 2n == 0) {\r\n\t\t\ta = a * a % MOD;\r\n\t\t\tp /= 2n;\r\n\t\t} else {\r\n\t\t\tres = res * a % MOD;\r\n\t\t\tp--;\r\n\t\t}\r\n\t}\r\n\treturn res;\r\n}\r\n\r\nfunction main () {\r\n\tconst k = rn();\r\n\r\n\tconst ans = fast_pow(4n, 2n**BigInt(k)-2n) * 6n % MOD;\r\n\r\n\tconsole.log(ans.toString());\r\n}\r\n\r\n", "src_uid": "5144b9b281ea4087d8334d91c3c8bda4"}
{"source_code": "\nlet _inputLines;\nlet _lineNumber = 0;\nlet inputReader = _inputReader ();\n\nfunction _main() {\n\t\n\t_inputLines = _inputData.trim().split('\\n').map((string) => {\n\t\treturn string.trim();\n\t});;\n\tlet n = inputReader.readNumber();\n\tlet a =1,b=1,c=0;\n\tlet flag = true;\n\twhile(n--){\n\t\tlet num = inputReader.readNumber();\n\t\tif(num===1){\n\t\t\tif(a===1){\n\t\t\t\tif(b===1){\n\t\t\t\t\tb=0;\n\t\t\t\t\tc=1;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tc=0;\n\t\t\t\t\tb=1;\n\t\t\t\t}\n\t\t\t} \n\t\t\telse{\n\t\t\t\tflag=false;\n\t\t\t}\n\t\t} \n\t\telse if(num===2){\n\t\t\tif(b===1){\n\t\t\t\tif(a===1){\n\t\t\t\t\ta=0;\n\t\t\t\t\tc=1;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tc=0;\n\t\t\t\t\ta=1;\n\t\t\t\t}\n\t\t\t} \n\t\t\telse{\n\t\t\t\tflag=false;\n\t\t\t}\n\t\t} \n\t\tif(num===3){\n\t\t\tif(c===1){\n\t\t\t\tif(b===1){\n\t\t\t\t\tb=0;\n\t\t\t\t\ta=1;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\ta=0;\n\t\t\t\t\tb=1;\n\t\t\t\t}\n\t\t\t} \n\t\t\telse{\n\t\t\t\tflag=false;\n\t\t\t}\n\t\t}\n\t}\n\t\n\t\n\t\n\tif(flag)\n\t\tconsole.log(\"YES\");\n\telse\n\t\tconsole.log(\"NO\");\n\t//console.log(obj);\n\t\n\n}\n\nvar _inputData = '';\nfunction cacheInput(data) {\n\t_inputData += data;\n}\n\nprocess.stdin.resume();\nprocess.stdin.setEncoding('utf8');\nprocess.stdin.on('data', cacheInput).on('end', _main);\n\nfunction _inputReader () {\n\tfunction readNumber(){\n\t\treturn Number(_inputLines[_lineNumber++]);\n\t}\n\t\t\n\t\n\treturn {\n\t\treadNumber,\n\t}\n}", "src_uid": "6c7ab07abdf157c24be92f49fd1d8d87"}
{"source_code": "\nvar min = Math.min;\nvar max = Math.max;\n\nvar each = function (a, f) {\n\tArray.apply(null, Array(a)).map(function (a, i) {return i;}).map(f);\n}\n\nvar n = +readline();\nvar g = [];\nvar ans = 0;\n\neach(n, function (i) {\n\tg.push(readline().split(' '));\n});\n\neach(n, function (i) {\n\teach(n, function (j) {\n\t\teach(n, function (k){\n\t\t\tg[j][k] = min(+g[j][k], +g[j][i] + g[i][k]);\n\t\t});\n\t});\n});\n\neach(n, function (i) { \n\teach(n, function (j) {\n\t\tans = max(ans, +g[i][j]);\n\t});\n});\n\nprint(ans);", "src_uid": "bbd210065f8b32de048a2d9b1b033ed5"}
{"source_code": "var s=readline();\nvar t=readline();\nvar i=0;\nt.split('').forEach(function(v){\n\tif(s[i]===v) i++;\n});\nprint(i+1);", "src_uid": "f5a907d6d35390b1fb11c8ce247d0252"}
{"source_code": "var N = readline();\nvar data = readline().split(' ');\nvar kondidate = new Array();\nvar bribed=0;\nvar maxNumber = 0;\nvar isResult=0;\nfor (i=0;i<N;i++){\n\tkondidate[i] = parseInt(data[i]);\n\n}\nvar maxValue = kondidate[0];\n\n//write('\\n');\nwhile (isResult<N-1){\n\tisResult=N-1;\n\tvar maxNumber = 0;\n\tvar maxValue = kondidate[0] ;\n\t\n\t//\u043d\u0430\u0445\u043e\u0434\u0438\u043c \u0437\u0430 \u043a\u043e\u0433\u043e \u0431\u043e\u043b\u044c\u0448\u0435 \u0432\u0441\u0435\u0433\u043e \u043f\u0440\u043e\u0433\u043e\u043b\u043e\u0441\u043e\u0432\u0430\u043b\u043e\n\tfor (i=1;i<N;i++){\n\t\tif (maxValue<=kondidate[i]){\n\t\t\tmaxNumber=i;\n\t\t\tmaxValue=kondidate[i];\n\t\t\tisResult--;\n\t\t}\n\t}\n\t\n\t//\u0441\u043d\u0438\u043c\u0430\u0435\u043c \u043e\u0434\u0438\u043d \u0433\u043e\u043b\u043e\u0441 \u0441 \u043e\u043f\u043f\u043e\u043d\u0435\u043d\u0442\u0430, \u043d\u0430\u0431\u0440\u0430\u0432\u0448\u0435\u0433\u043e \u043c\u0430\u043a\u0441\u0438\u043c\u0443\u043c \u0433\u043e\u043b\u043e\u0441\u043e\u0432\n\tif (maxNumber!=0){\n\t\tkondidate[0]++;\n\t\tbribed++;\n\t\tkondidate[maxNumber]--;\n\t}\n}\n\nwrite(bribed);", "src_uid": "aa8fabf7c817dfd3d585b96a07bb7f58"}
{"source_code": "function numCapitals(word) {\n var total = 0;\n for (var i = 0; i < word.length; i++) {\n if (/[A-Z]/.test(word[i])) {\n total++;\n }\n }\n return total;\n}\n\nfunction main() {\n var n = readline();\n var words = readline().split(' ');\n\n var max = words.reduce((max, curr) => {\n var count = numCapitals(curr);\n if (count > max) {\n return count;\n }\n return max;\n }, -1);\n\n print(max);\n}\n\nmain();\n", "src_uid": "d3929a9acf1633475ab16f5dfbead13c"}
{"source_code": "var input = readline().split(' ').map(function(x){return Number(x)});\nvar a = input[0];\nvar b = input[1];\nvar res = 1;\nfor(var i = 1 ; i <= Math.min(a,b) ; i++){\n res *= i;\n}\nprint(res);", "src_uid": "7bf30ceb24b66d91382e97767f9feeb6"}
{"source_code": "const readLine = require(\"readline\").createInterface({\n input: process.stdin,\n output: process.stdout,\n});\n\nconst input = [];\n\nfunction splitAndParseInt(line) {\n return line.split(\" \").map((x) => parseInt(x));\n}\n\nreadLine.on(\"line\", (line) => input.push(line));\nreadLine.on(\"close\", () => {\n let string1 = input[0].toLowerCase();\n let string2 = input[1].toLowerCase();\n console.log(string1.localeCompare(string2))\n});", "src_uid": "ffeae332696a901813677bd1033cf01e"}
{"source_code": "var row = readline().split(\" \").map(function(x) { return parseInt(x); });\nvar k1 = row[0];\nvar k2 = row[1];\nvar k3 = row[2];\n\nvar max = k1;\nif(max < k2)\n\tmax = k2;\nif(max < k3)\n\tmax = k3;\n\nvar mid;\nvar min;\nif(max == k1) {\n\tif (k2 > k3) {\n\t\tmid = k2;\n\t\tmin = k3;\n\t} else {\n\t\tmin = k2;\n\t\tmid = k3;\n\t}\n} else if(max == k2) {\n\tif (k1 > k3) {\n\t\tmid = k1;\n\t\tmin = k3;\n\t} else {\n\t\tmid = k3;\n\t\tmin = k1;\n\t}\n} else {\n\tif (k1 > k2) {\n\t\tmid = k1;\n\t\tmin = k2;\n\t} else {\n\t\tmid = k2;\n\t\tmin = k1;\n\t}\n}\n\nvar minLoop = lcm(k1, lcm(k2, k3));\n\nvar result = \"YES\";\nfor(var i = 0; i < minLoop; i++) {\n\tif(i % max == 0 || (i-1) % mid == 0 || (i-2) % min == 0) {\n\t\t//Nothing\n\t} else {\n\t\tresult = \"NO\";\n\t\tbreak;\n\t}\n}\n\nif(result == \"NO\") {\nresult = \"YES\";\nfor(var i = 0; i < minLoop; i++) {\n\tif(i % max == 0 || (i-1) % min == 0 || (i-2) % mid == 0) {\n\t\t//Nothing\n\t} else {\n\t\tresult = \"NO\";\n\t\tbreak;\n\t}\n}\n}\n\n\n\nwrite(result);\n\nfunction gcd(a, b) {\n return !b ? a : gcd(b, a % b);\n}\n\nfunction lcm(a, b) {\n return (a * b) / gcd(a, b); \n}", "src_uid": "df48af9f5e68cb6efc1214f7138accf9"}
{"source_code": "var ints = function() {\n\treturn readline().split(' ').map(function(x) {\n\t\treturn parseInt(x)\n\t})\n}\n\nvar numbers = ints()\n\tk = numbers[0],\n\ta = numbers[1],\n\tb = numbers[2],\n\tinvalid = (a < k && b < k) || (a < k && b % k > 0) || (b < k && a % k > 0)\n\nprint(invalid ? -1 : Math.floor(a / k) + Math.floor(b / k))\n", "src_uid": "6e3b8193d1ca1a1d449dc7a4ad45b8f2"}
{"source_code": "function trim(s) {\n\treturn s.replace(/^\\s+|\\s+$/gm, '');\n}\n\nfunction tokenize(s) {\n\treturn trim(s).split(/\\s+/);\n}\n\nfunction tokenizeIntegers(s) {\n\tvar tokens = tokenize(s);\n\tfor (var i = 0; i < tokens.length; i += 1) {\n\t\ttokens[i] = parseInt(tokens[i]);\n\t};\n\treturn tokens;\n}\n\nfunction main() {\n\tvar integers = tokenizeIntegers(readline());\n\tvar maxBoxes = integers[0], brandNum = integers[1];\n\n\tvar brands = [];\n\t\n\tfor (var i = 0; i < brandNum; i += 1) {\n\t\tvar integers = tokenizeIntegers(readline());\n\t\tbrands.push({ boxes: integers[0], matches: integers[1] });\n\t}\n\n\tbrands.sort(function(a, b) {\n\t\treturn a.matches - b.matches;\n\t});\n\n\tvar matches = 0;\n\n\tfor (var i = brands.length-1; i >= 0 && maxBoxes > 0; i -= 1) {\n\t\tvar boxes = Math.min(brands[i].boxes, maxBoxes);\n\t\tmatches += boxes*brands[i].matches;\n\t\tmaxBoxes -= boxes;\n\t}\n\n\tprint(matches);\n}\n\nmain();\n", "src_uid": "c052d85e402691b05e494b5283d62679"}
{"source_code": "function main() {\n var lines = [];\n for(var i=0;i<4;i++){\n lines.push(readline());\n }\n var winning = [\".xx\", 'x.x', 'xx.'];\n\n for(var j=0;j<4;j++){\n var line = \"\";\n for(var i=0;i<4;i++){\n line += lines[i][j];\n }\n lines.push(line);\n }\n lines.push(lines[0][0] + lines[1][1] + lines[2][2] + lines[3][3])\n lines.push(lines[0][1] + lines[1][2] + lines[2][3])\n lines.push(lines[1][0] + lines[2][1] + lines[3][2])\n\n lines.push(lines[0][3] + lines[1][2] + lines[2][1] + lines[3][0])\n lines.push(lines[1][3] + lines[2][2] + lines[3][1])\n lines.push(lines[0][2] + lines[1][1] + lines[2][0])\n\n for(var i=0;i<lines.length;i++){\n for(var j=0;j<3;j++){\n if(lines[i].indexOf(winning[j])!=-1){\n print(\"YES\");\n return;\n }\n }\n }\n print(\"NO\");\n\n}\n\nmain()", "src_uid": "ca4a77fe9718b8bd0b3cc3d956e22917"}
{"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 const [n, k] = d.split(' ').map(BigInt);\n const ans = n / k;\n\n if (ans % 2n === 0n) {\n console.log('NO');\n }\n else {\n console.log('YES');\n }\n\n});\n", "src_uid": "05fd61dd0b1f50f154eec85d8cfaad50"}
{"source_code": "'use strict'\n\nconst {EOL} = require('os')\n\nlet ipt = ''\nprocess.stdin.on('data', s => ipt += s)\nprocess.stdin.on('end', () => {\n const [ils] = ipt.split(EOL).slice(0, -1)\n const [a, b, c, d, e, f] = ils.split(' ')\n\n let r = 1\n let g1, g2\n\n const cast = (r, a, b) => {\n if (a == 0 && b == 0) {\n return 0\n }\n else if (a == 0) {\n return Infinity\n }\n return r / a * b\n }\n\n r = cast(r, a, b)\n r = cast(r, c, d)\n g1 = r\n r = cast(r, e, f)\n r = cast(r, a, b)\n r = cast(r, c, d)\n g2 = r\n\n console.log(g2 == Infinity || g2 > g1 ? 'Ron' : 'Hermione')\n})", "src_uid": "44d608de3e1447f89070e707ba550150"}
{"source_code": "t=+readline();\r\nwhile(t--){\r\n r=readline().split` `\r\n n=+r[0],m=+r[1],k=+r[2];\r\n if(n%2==0 && m%2==0){\r\n print(k%2==0?\"YES\":\"NO\");\r\n }\r\n else if(n%2==1 && m%2==0){\r\n if(k<m/2)print(\"NO\");\r\n else{\r\n k=k-m/2;\r\n print(k%2==0?\"YES\":\"NO\");\r\n }\r\n }\r\n else{\r\n if(k%2==0 && k<=(n*m)/2-n/2)print(\"YES\");\r\n else print(\"NO\");\r\n }\r\n}", "src_uid": "4d0c0cc8faca62eb6384f8135b30feb8"}
{"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;\nconst can = {\n 0: 1,\n 3: 1,\n 7: 1,\n};\n\nfor (let i = 0; i <= 100; i++) {\n if (can[i]) {\n can[i + 3] = 1;\n can[i + 7] = 1;\n }\n}\n\nrl.on('line', (d) => {\n if (c === 0) {\n c++;\n return;\n }\n\n if (can[+d]) {\n console.log('YES');\n }\n else {\n console.log('NO');\n }\n\n // let n = +d;\n // let ans = 'NO';\n\n // while (n > 0) {\n // if (n % 7 === 0) {\n // ans = 'YES';\n // break;\n // }\n\n // if (n % 3 === 0) {\n // ans = 'YES';\n // break;\n // }\n\n // n -= 7;\n // }\n\n // n = +d;\n // while (n > 0) {\n // if (n % 7 === 0) {\n // ans = 'YES';\n // break;\n // }\n\n // if (n % 3 === 0) {\n // ans = 'YES';\n // break;\n // }\n\n // n -= 3;\n // }\n\n // console.log(ans);\n\n c++;\n});\n", "src_uid": "cfd1182be98fb5f0c426f8b68e48d452"}
{"source_code": "(function () {\n\t'use strict';\n\n\tvar assessment = 0;\n\n\tfor (var i = 0; i < 8; i++)\n\t\treadline().split('').forEach(function (a) {\n\t\t\tassessment += getWeight(a);\n\t\t});\n\n\tprint(\n\t\tassessment > 0 ? 'Black'\n\t\t: (assessment < 0 ? 'White' : 'Draw')\n\t);\n\n}).call(this);\n\nfunction getWeight (a) {\n\tif (a.toLowerCase() === a)\n\t\tswitch (a) {\n\t\t\tcase 'q': return 9;\n\t\t\tcase 'r': return 5;\n\t\t\tcase 'b': return 3;\n\t\t\tcase 'n': return 3;\n\t\t\tcase 'p': return 1;\n\t\t}\n\telse\n\t\tswitch (a) {\n\t\t\tcase 'Q': return -9;\n\t\t\tcase 'R': return -5;\n\t\t\tcase 'B': return -3;\n\t\t\tcase 'N': return -3;\n\t\t\tcase 'P': return -1;\n\t\t}\n\n\treturn 0\n}", "src_uid": "44bed0ca7a8fb42fb72c1584d39a4442"}
{"source_code": "\n var s = readline();\n\n var len = s.length;\n var res = 0;\n for(var i = 0; i < len; i += 1) {\n for(var j = i; j < len + 1; j += 1) {\n var t = s.slice(i, j);\n if(t !== t.split('').reverse().join('')) {\n // console.log(t);\n res = Math.max(t.length, res);\n }\n }\n }\n print(res);", "src_uid": "6c85175d334f811617e7030e0403f706"}
{"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\tlet _input = parseInt(input[0], 10)\n\tlet result = 0\n\tconst _return_ = (num, min) => {\n\t\tconst it1 = num / min\n\t\tconst it2 = Math.floor(it1) // \u043f\u043e\u043b\u0443\u0447\u0430\u0435\u043c \u0446\u0435\u043b\u043e\u0435 \u0447\u0438\u0441\u043b\u043e\n\t\tconst it3 = min * it2 // \u043a\u0430\u043a\u043e\u0435 \u043a\u043e\u043b-\u0432\u043e \u0435\u0434\u0435\u043d\u0438\u0446 \u043c\u043e\u0436\u043d\u043e \u043e\u0442\u043d\u044f\u0442\u044c\n\t\tconst it4 = num - it3 // \u043e\u0441\u0442\u0430\u0442\u043e\u043a\n\t\tresult += it2\n\t\treturn it4\n\t}\n\tconst count_min = (now) => {\n\t\tif (now >= 100) {\n\t\t\tcount_min(_return_(now, 100))\n\t\t} else {\n\t\t\tif (now >= 20) {\n\t\t\t\tcount_min(_return_(now, 20))\n\t\t\t} else {\n\t\t\t\tif (now >= 10) {\n\t\t\t\t\tcount_min(_return_(now, 10))\n\t\t\t\t} else {\n\t\t\t\t\tif (now >= 5) {\n\t\t\t\t\t\tcount_min(_return_(now, 5))\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif (now > 0) {\n\t\t\t\t\t\t\tcount_min(_return_(now, 1))\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcount_min(_input)\n\tconsole.log(result)\n})", "src_uid": "8e81ad7110552c20297f08ad3e5f8ddc"}
{"source_code": "var nk = readline().split(' ').map(Number),\n n = nk[0],\n maxDays = nk[1];\nvar inputInstr = readline().split(' ').map(Number);\n\nvar instrMap = [];\n\nfor (var i = 0; i < n; i++) {\n instrMap.push({\n val: inputInstr[i],\n idx: i\n });\n}\n\ninstrMap.sort(function (i1, i2) {\n return i1.val > i2.val;\n});\n\nvar sum = 0;\n maxInstr = 0,\n indexes = [];\n\nfor (var j = 0; j < n; j++) {\n if ( sum + instrMap[j].val > maxDays ) {\n break;\n } else {\n sum += instrMap[j].val;\n indexes.push(instrMap[j].idx + 1);\n maxInstr++;\n }\n}\n\nprint( maxInstr );\nindexes.length ? print(indexes.join(' ')) : null;\n\n\n\n", "src_uid": "dbb164a8dd190e63cceba95a31690a7c"}
{"source_code": "let 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\n\nRL.on('close', () => {\n let {0:n, 1:c} = {...input[0].split(' ')};\n n = parseInt(n); c = parseInt(c);\n let points = []; input[1].split(' ').forEach( i => points.push(parseInt(i)) );\n let times = []; input[2].split(' ').forEach( i => times.push(parseInt(i)) );\n let secondTimes = []; times.forEach(i => secondTimes.push(parseInt(i)));\n\n let firstPlayer = 0; let secondPlayer = 0;\n let j = n-1;\n\n for(let i = 0; i < n; i++) {\n firstPlayer += max(0, points[i] - c*times[i]);\n secondPlayer += max(0, points[j] - c*secondTimes[j]);\n \n if(i + 1 != n) {\n times[i+1] += times[i];\n }\n if(j - 1 >= 0) {\n secondTimes[j-1] += secondTimes[j];\n }\n j--;\n //console.log(`fp = ${firstPlayer}; sp = ${secondPlayer}`);\n }\n\n if(firstPlayer > secondPlayer) {\n console.log('Limak');\n } else if(secondPlayer > firstPlayer) {\n console.log('Radewoosh');\n } else \n console.log('Tie')\n});\n\nfunction max(a, b) {\n return (a > b) ? a : b;\n}\n", "src_uid": "8c704de75ab85f9e2c04a926143c8b4a"}
{"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", "src_uid": "3b520c15ea9a11b16129da30dcfb5161"}
{"source_code": "function main() {\n var firstLine = readline().split(/\\s/gi).map(Number),\n secondLine = readline().split(/\\s/gi).map(Number),\n thirdLine = readline().split(/\\s/gi).map(Number),\n a1 = firstLine[0], b1 = firstLine[1],\n a2 = secondLine[0], b2 = secondLine[1],\n a3 = thirdLine[0], b3 = thirdLine[1],\n result = \"NO\",\n combine = [];\n\n if(b1 > a1) {\n var temp = a1;\n a1 = b1;\n b1 = temp;\n }\n\n combine.push({\n \"a\" : a2 + a3,\n \"b\" : Math.max(b2, b3)\n });\n combine.push({\n \"a\" : a2 + b3,\n \"b\" : Math.max(b2, a3)\n });\n combine.push({\n \"a\" : b2 + a3,\n \"b\" : Math.max(a2, b3)\n });\n combine.push({\n \"a\" : b2 + b3,\n \"b\" : Math.max(a2, a3)\n });\n\n combine.filter(function(com, index) {\n var aX = com.a,\n bX = com.b,\n temp;\n\n if(bX > aX) {\n temp = aX;\n aX = bX;\n bX = temp;\n }\n\n if(aX <= a1 && bX <= b1) {\n result = \"YES\";\n return true;\n }\n });\n\n print(result);\n};\n\nmain();", "src_uid": "2ff30d9c4288390fd7b5b37715638ad9"}
{"source_code": "let i = ''\nprocess.stdin.on('data', c => i += c)\nprocess.stdin.on('end', () => {\n const {EOL} = require('os')\n const lines = i.split(EOL) /*your input text, split by lines*/\n let input = lines[0].split(\" \").map(value => {\n return parseInt(value)\n })\n\n let aCount = input[0]\n let bCount = input[1]\n let abCount = input[2]\n\n if (bCount > aCount) {\n let maximumACount = aCount\n let maximumBCount = aCount + 1\n let maximumABCountSeperated = abCount * 2\n let maximumLength = maximumACount + maximumBCount + maximumABCountSeperated\n console.log(maximumLength)\n } else if (bCount < aCount) {\n let maximumACount = bCount + 1\n let maximumBCount = bCount\n let maximumABCountSeperated = abCount * 2\n let maximumLength = maximumACount + maximumBCount + maximumABCountSeperated\n console.log(maximumLength)\n } else if (aCount === bCount) {\n let maximumACount = aCount\n let maximumBCount = bCount\n let maximumABCountSeperated = abCount * 2\n let maximumLength = maximumACount + maximumBCount + maximumABCountSeperated\n console.log(maximumLength)\n }\n})\n", "src_uid": "609f131325c13213aedcf8d55fc3ed77"}
{"source_code": "n = readline();\nvar arr = new Array();\narr = readline();\nfunction dificult(n, arr) {\n k = 0;\n for (i = 0; i < arr.length; i++) {\n if (arr[i] == 1) {\n print ('HARD');\n k++;\n break;\n } \n }\n if (k == 0) print ('EASY');\n}\ndificult(n, arr)", "src_uid": "060406cd57739d929f54b4518a7ba83e"}
{"source_code": "var arr = [];\nfor (var i = 0; i < 4; i++) {\n var line = readline();\n var lineChars = line.split('');\n for (var j = 0; j < lineChars.length; j++) {\n if (!arr[i]) {\n arr[i] = [];\n }\n arr[i][j] = lineChars[j];\n }\n}\n\nvar testPosition = function(x, y) {\n if (x + 1 == 4 || y + 1 == 4) {\n return false;\n }\n if (arr[x][y] == arr[x][y + 1] && arr[x][y] == arr[x + 1][y] && arr[x][y] == arr[x + 1][y + 1]) {\n return true;\n }\n return false;\n};\n\nvar testSquare = function() {\n for (var i = 0; i < 4; i++) {\n for (var j = 0; j < 4; j++) {\n if (testPosition(i, j)) {\n return true;\n }\n }\n }\n};\n\nvar change = function(x, y) {\n if (x + 1 == 4 || y + 1 == 4) {\n return false;\n }\n var colors = {\n firstColor: {\n color: '',\n found: 0\n },\n secondColor: {\n color: '',\n found: 0\n }\n };\n colors.firstColor.color = arr[x][y];\n for (var ix = x; ix <= x + 1; ix++) {\n for (var jy = y; jy <= y + 1; jy++) {\n if (colors.firstColor.color === arr[ix][jy]) {\n colors.firstColor.found += 1;\n } else {\n if (colors.secondColor.color === '')\n colors.secondColor.color = arr[ix][jy];\n colors.secondColor.found += 1;\n }\n }\n }\n if (colors.secondColor.found === 1 || colors.firstColor.found === 1) {\n return true;\n }\n return false;\n};\n\nvar testChange = function() {\n for (var i = 0; i < 4; i++) {\n for (var j = 0; j < 4; j++) {\n if (change(i, j)) {\n return true;\n }\n }\n }\n};\n\nif (testSquare()) {\n print('YES');\n} else {\n\n if (testChange()) {\n print('YES');\n } else {\n print('NO');\n }\n}\n", "src_uid": "01b145e798bbdf0ca2ecc383676d79f3"}
{"source_code": "\nvar firstLine = readline().split(' ');\nvar n = parseInt(firstLine[0]);\nvar k = parseInt(firstLine[1]);\nvar str = readline();\nfor(var i = Math.min(str.indexOf('G'), str.indexOf('T')) + k; i < str.length;i += k){\n if (str[i] === '#'){\n print(\"NO\"); break;\n }\n if (str[i] === 'G' || str[i] === 'T'){\n print('YES');break;\n }\n}\nif (i > str.length - 1)print(\"NO\");\n", "src_uid": "189a9b5ce669bdb04b9d371d74a5dd41"}
{"source_code": "const rdline = require('readline');\r\n\r\nconst rl = rdline.createInterface({\r\n input: process.stdin\r\n});\r\n\r\nlet lines = [];\r\nrl.on('line', (line) => {\r\n lines.push(line);\r\n}).on('close', () => {\r\n // input in lines\r\n solve();\r\n});\r\n\r\nlet line = 0;\r\nconst readline = () => lines[line++];\r\n\r\nsolve = () => {\r\n const t = parseInt(readline());\r\n for (let i = 0; i < t; i++) {\r\n var b = parseInt(readline());\r\n var k = 9;\r\n var output = [];\r\n while (b > k){\r\n output.unshift(k);\r\n b = b - k;\r\n k = k - 1;\r\n } if (b > 0) {\r\n output.unshift(b)\r\n }\r\n console.log(output.join(''))\r\n }\r\n}", "src_uid": "fe126aaa93acaca8c8559bc9e7e27b9f"}
{"source_code": "function trim(s) {\n return s.replace(/^\\s+|\\s+$/gm, '');\n}\n\nfunction tokenize(s) {\n return trim(s).split(/\\s+/);\n}\n\nfunction tokenizeIntegers(s) {\n var tokens = tokenize(s);\n for (var i = 0; i < tokens.length; i += 1) {\n tokens[i] = parseInt(tokens[i]);\n };\n return tokens;\n}\n\nfunction main() {\n var integers = tokenizeIntegers(readline());\n var A = integers[0], B = integers[1];\n print(A + B);\n}\n\nmain();", "src_uid": "b6e3f9c9b124ec3ec20eb8fcea075add"}
{"source_code": "X=readline().split(' ').map(Number)\nx=Math.min(X[0],X[1])\nprint(x, Math.floor((X[0]-x)/2)+Math.floor((X[1]-x)/2))", "src_uid": "775766790e91e539c1cfaa5030e5b955"}
{"source_code": "var input = readline().split(\" \");\nvar n = input[0];\nvar k = input[1];\nvar res = 0;\nfor (var i = 1; i <= k; ++i) {\n var mid = n - i * 2;\n if (mid >= 0) {\n res += mid * 2 + 1;\n }\n}\nwrite(res)", "src_uid": "ea36ca0a3c336424d5b7e1b4c56947b0"}
{"source_code": "const readline = require('readline');\n\nconst rl = readline.createInterface({\n input: process.stdin,\n output: process.stdout\n});\n\n\nvar IsPrime = function (num) {\n if (num == 2)\n return true;\n if (num < 2 || num % 2 == 0)\n return false;\n var limit = parseInt(Math.sqrt(num));\n for (i = 3; i <= limit; i += 2) {\n if (num % i == 0)\n return false;\n }\n return true;\n}\n\nvar prev = 2,\n n, k, counter = 0,\n helper;\n\nrl.on('line', (input) => {\n var temp = input.split(' ').map(item => parseInt(item));\n n = temp[0];\n k = temp[1];\n\n for (let i = 3; i <= n; i++) {\n if (IsPrime(i)) {\n helper = prev + i + 1;\n if (IsPrime(helper) && helper <= n)\n counter++;\n prev = i;\n }\n }\n console.log((counter >= k) ? \"YES\" : \"NO\");\n rl.close();\n});", "src_uid": "afd2b818ed3e2a931da9d682f6ad660d"}
{"source_code": "var s = readline();\nvar d = 0;\n\nfor(var idx=0;idx<s.length/2;idx++)\n{\n if(s[idx]!==s[s.length-idx-1])\n d++;\n}\n\nif(d===1 || (d===0 && s.length%2===1))\n print(\"YES\");\nelse\n print(\"NO\");", "src_uid": "fe74313abcf381f6c5b7b2057adaaa52"}
{"source_code": "var num = readline().split(\" \").map(x => parseInt(x));\nvar n = num[0];\nvar k = num[1];\n\nfunction find(n, k) {\n var _n = n;\n var _k = k;\n var count = Math.pow(2, n) - 1\n var midPos = Math.ceil(count*0.5)\n \n if (k == midPos) {\n print(n);\n } else {\n _n = n - 1;\n if (k > midPos) {\n _k = k - midPos;\n }\n find(_n, _k);\n }\n}\n\nfind(n, k)", "src_uid": "0af400ea8e25b1a36adec4cc08912b71"}
{"source_code": "var a = readline().split('');\n\nvar ans = +a[0]==9 ? a[0] : String(Math.min(+a[0],9-a[0]));\na = a.slice(1,a.length);\n\nfor(var i=0; i<a.length; i++){\n //if(+a[i]==9 && i==0) { ans+=a[i]; continue; }\n if(9-a[i]<+a[i]) a[i] = 9-a[i];\n ans+=a[i];\n}\n\nprint(ans);", "src_uid": "d5de5052b4e9bbdb5359ac6e05a18b61"}
{"source_code": "var a = readline().split(' ').map(e=>Number(e));\n\nif(a[2] > a[1] && a[2] <= a[0]){\n\tprint(a[1]);\n} else if (a[2] <= a[1]){\n\tprint(a[2]);\n} else if (a[2] > a[0]){\n\tprint(a[1]-(a[2]-a[0]));\n}", "src_uid": "7e614526109a2052bfe7934381e7f6c2"}
{"source_code": "var K, P;\n\nvar s=readline().split(' ')\n\nK = parseInt(s[0])\nP = parseInt(s[1])\n\nvar i = 1;\nvar sum = 0;\n\nwhile (i <= K) {\n var now = i.toString(10);\n var temp = now;\n temp += m_reverse(now);\n sum = (sum + parseInt(temp)) % P;\n i++;\n}\n\nprint(sum);\n\nfunction m_reverse(str) {\n var r_str = \"\";\n for (var i = str.length - 1; i >= 0; i--) {\n r_str += str[i];\n }\n\n return r_str;\n}", "src_uid": "00e90909a77ce9e22bb7cbf1285b0609"}
{"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;\nlet n, d;\n\nrl.on('line', (data) => {\n if (c === 0) {\n c++;\n [n, d] = data.split(' ').map(Number);\n return;\n }\n\n const arr = data.split('').map(Number);\n let ans = 0;\n let best = 0;\n let inc = 1;\n\n for (let i = 1; i < arr.length; i++) {\n if (arr[i] === 1) {\n best = Math.max(best, i);\n }\n\n if (inc === d || i + 1 === arr.length) {\n if (best === 0) {\n ans = -1;\n break;\n }\n else {\n ans++;\n i = best;\n best = 0;\n inc = 0;\n }\n }\n\n inc++;\n }\n\n console.log(ans);\n\n c++;\n});\n", "src_uid": "c08d2ecdfc66cd07fbbd461b1f069c9e"}
{"source_code": "/**\n * Created by Utilisateur on 25/03/2016.\n */\n\nvar h = readline().split(' '),\n h0 = h1 = parseInt(h[0]),\n h2 = parseInt(h[1]),\n ab = readline().split(' '),\n a = parseInt(ab[0]),\n b = parseInt(ab[1]),\n t = 14,\n d = 0\n\nif ((a<b && (h1+8*a < h2)) || (a==b && (h1+8*a < h2))) {\n d = -1\n} else {\n\n while (h1 < h2) {\n if (t >= 10 && t < 22) h1 += a\n else h1 -= b\n if (++t >= 24) {\n t = 0\n d++\n }\n }\n}\n\nprint(d)\n", "src_uid": "2c39638f07c3d789ba4c323a205487d7"}
{"source_code": "(function () {\n var read = {\n number: function () {\n return +readline();\n },\n arr: function (divider) {\n return readline().split(divider ? divider : '');\n },\n arrNumber: function (divider) {\n return readline()\n .split(divider ? divider : '')\n .map(item => +item);\n }\n }\n\n var alph = {\n A: 1,\n B: 2,\n C: 3,\n D: 4,\n E: 5,\n F: 6,\n G: 7,\n H: 8,\n I: 9,\n J: 10,\n K: 11,\n L: 12,\n M: 13,\n N: 14,\n O: 15,\n P: 16,\n Q: 17,\n R: 18,\n S: 19,\n T: 20,\n U: 21,\n V: 22,\n W: 23,\n X: 24,\n Y: 25,\n Z: 26\n };\n\n function getR(a, b) {\n if(b < a) {\n var t = b;\n b = a;\n a = t;\n }\n var v1 = b - a;\n var v2 = (26 - b) + a;\n return v1 < v2 ? v1 : v2;\n }\n\n var n = read.number();\n var s = readline();\n\n var counts = [];\n for(var i = 0; i < n - 3; i++) {\n counts[i] = 0;\n counts[i] += getR(alph[s[i]], alph['A']);\n counts[i] += getR(alph[s[i + 1]], alph['C']);\n counts[i] += getR(alph[s[i + 2]], alph['T']);\n counts[i] += getR(alph[s[i + 3]], alph['G']);\n }\n var min = counts[0];\n for(var i = 1; i < n - 3; i++) {\n if(counts[i] < min)\n min = counts[i];\n }\n\n print(min);\n}());\n", "src_uid": "ee4f88abe4c9fa776abd15c5f3a94543"}
{"source_code": "(function () {\n var read = {\n number: function () {\n return +readline();\n },\n arr: function (divider) {\n return readline().split(divider ? divider : '');\n },\n arrNumber: function (divider) {\n return readline()\n .split(divider ? divider : '')\n .map(item => +item);\n }\n }\n\n var n = read.number();\n var a = [...new Set(read.arrNumber(' '))];\n\n var max = a[0], min = a[0];\n a.forEach(i => {\n if(i > max) max = i;\n if(i < min) min = i;\n });\n\n mid = min + (max - min)/2\n\n var midUse = false;\n var minuse = false;\n var maxuse = false\n \n for(var f = 0; f < a.length; f++) {\n var i = a[f]\n if(i === mid) {\n midUse = true;\n }\n else if(i === max) {\n minuse = true;\n }\n else if(i === min) {\n maxuse = true;\n }\n else {\n print(-1);\n return;\n }\n }\n\n if(midUse) {\n print(max - mid)\n }\n else {\n if((max - min) %2 === 1)\n print(max - min);\n else {\n print((max - min) / 2)\n }\n }\n}());\n", "src_uid": "d486a88939c132848a7efdf257b9b066"}
{"source_code": "(()=>{\"use strict\";var t={675:(t,r)=>{Object.defineProperty(r,\"__esModule\",{value:!0}),Array.prototype.sortAsc=function(){return this.sort(((t,r)=>t-r))},Array.prototype.sortDesc=function(){return this.sort(((t,r)=>r-t))},Array.prototype.max=function(){return Math.max(...this)},Array.prototype.min=function(){return Math.min(...this)},Array.prototype.sum=function(){let t=0;for(let r=0;r<this.length;++r)t+=this[r];return t},Array.prototype.avg=function(){return this.sum()/this.length}},312:function(t,r,e){var n=this&&this.__importDefault||function(t){return t&&t.__esModule?t:{default:t}};Object.defineProperty(r,\"__esModule\",{value:!0});const o=n(e(747));let u=\"\",s=[],i=0,a=\"\";const l=\"local\"===process.argv[2],c=t=>{if(l)return s=o.default.readFileSync(\"input.txt\").toString().trim().split(\"\\n\").map((t=>t.trim())),t(),void o.default.writeFileSync(\"output.txt\",a);process.stdin.resume(),process.stdin.setEncoding(\"utf-8\"),process.stdin.on(\"data\",(t=>{u+=t})),process.stdin.on(\"end\",(r=>{s=u.trim().split(\"\\n\").map((t=>t.trim())),t(),console.log(a)}))};function f(){return s[i++]}function p(){return f().split(\" \").map((t=>parseFloat(t)))}function d(){return f().split(\"\")}r.default={runMain:c,runEachTest:t=>{c((()=>{let[r]=p();for(;r>0;)t(),r--}))},readline:f,nextNumbers:p,nextNumbersMatrix:function(t){let r=[];for(let e=0;e<t;++e)r.push(p());return r},nextCharacters:d,nextCharacterMatrix:function(t){let r=[];for(let e=0;e<t;++e)r.push(d());return r},nextIntervalArray:function(t){let r=[];for(let e=0;e<t;++e){const[t,e]=p();r.push({a:t,b:e})}return r},put:function(t){a+=t},puts:function(t){a+=t+\"\\n\"},debug:function(t){l&&console.log(t)}}},965:function(t,r,e){var n=this&&this.__importDefault||function(t){return t&&t.__esModule?t:{default:t}};Object.defineProperty(r,\"__esModule\",{value:!0}),e(675);const o=n(e(312));o.default.runMain((function(){let[t,r,e,n,u]=o.default.nextNumbers(),s=r/e,i=s;for(;s>=n;){if(s-=n,!(s>=u)){i+=u-s;break}s-=u}i+=(t-r)/e,o.default.put(i)}))},747:t=>{t.exports=require(\"fs\")}},r={};!function e(n){if(r[n])return r[n].exports;var o=r[n]={exports:{}};return t[n].call(o.exports,o,o.exports,e),o.exports}(965)})();", "src_uid": "e4a4affb439365c843c9f9828d81b42c"}
{"source_code": "var a1 = Number(readline());\nvar a2 = Number(readline());\nvar k1 = Number(readline());\nvar k2 = Number(readline());\nif (k1 > k2) {\n var t = a1;\n a1 = a2;\n a2 = t;\n t = k1;\n k1 = k2;\n k2 = t;\n}\nconst n = Number(readline());\nconst a = Math.min(Math.floor(n / k1), a1);\nconst b = Math.min(Math.floor(Math.max(n - a * k1, 0) / k2), a2);\nprint(`${Math.min(Math.max(n - (a1 * (k1 - 1) + a2 * (k2 - 1)), 0), a1 + a2)} ${a + b}`);\n", "src_uid": "2be8e0b8ad4d3de2930576c0209e8b91"}
{"source_code": "var t = readline().split(' ').map(a => +a);\nvar output = 'IMPOSSIBLE';\n\nfor(var i=0; i<4; i++){\n\n\tvar a = t.splice(0, 1);\n\ta = parseInt(a);\n\tt.push(a);\n\n\tif ((t[0] + t[1] > t[2]) && (t[0] + t[2] > t[1]) && (t[1] + t[2] > t[0])) {\n\toutput = 'TRIANGLE';\n\tbreak;\n\t} else if ((t[0] + t[1] == t[2]) || (t[0] + t[2] == t[1]) || (t[1] + t[2] == t[0])) {\n\toutput = 'SEGMENT';\n\t}\n}\n\nprint(output);", "src_uid": "8f5df9a41e6e100aa65b9fc1d26e447a"}
{"source_code": "// Sample code to perform I/O:\n\nprocess.stdin.resume();\nprocess.stdin.setEncoding(\"utf-8\");\nvar stdin_input = \"\";\n\nprocess.stdin.on(\"data\", function (input) {\n stdin_input += input; // Reading input from STDIN\n});\n\nprocess.stdin.on(\"end\", function () {\n main(stdin_input);\n});\n\nfunction main(input) {\n let output = nameLookUp(input);\n process.stdout.write(output); // Writing output to STDOUT\n}\n\n// Warning: Printing unwanted or ill-formatted data to output will cause the test cases to fail\n\n// Write your code here\nfunction nameLookUp(str) {\n let inputs = str.trim().split('\\n');\n let oneNum = inputs[0].trim();\n let twoNum = inputs[1].trim();\n let num = [];\n for (let i = 0; i < oneNum.length; i++) {\n let bit = String(oneNum[i] ^ twoNum[i]);\n num.push(bit);\n }\n\n return num.join('').toString();\n}\n", "src_uid": "3714b7596a6b48ca5b7a346f60d90549"}
{"source_code": "const { on } = require('process');\nconst readline = require('readline');\n\nconst rl = readline.createInterface({\n input: process.stdin,\n output: process.stdout\n});\n\nvar check = function (s) {\n let sLen = s.length;\n if (sLen == 0 || sLen > 16)\n return false;\n for (let i = 0; i < sLen; i++) {\n if (!(s[i] >= 'a' && s[i] <= 'z' ||\n s[i] >= 'A' && s[i] <= 'Z' ||\n s[i] >= '0' && s[i] <= '9' ||\n s[i] == '_'))\n return false;\n }\n return true;\n}\n\nvar checkHost = function (hostName) {\n let hostLen = hostName.length;\n if (hostLen == 0 || hostLen > 32)\n return false;\n let cont = hostName.split(\".\");\n for (let i = 0; i < cont.length; i++) {\n if (!check(cont[i]))\n return false;\n }\n return true;\n}\n\nrl.on('line', (input) => {\n let isUser = false, isHost = false, isResource = false;\n let atIndex = input.indexOf(\"@\");\n if (atIndex != -1) {\n let userName = input.substring(0, atIndex);\n isUser = check(userName);\n let slashIndex = input.indexOf(\"/\");\n let hostName = (slashIndex != -1) ? input.substring(atIndex + 1, slashIndex) : input.substring(atIndex + 1);\n isHost = checkHost(hostName);\n isResource = (slashIndex == -1) ? true : check(input.substring(slashIndex + 1));\n }\n console.log((isUser && isHost && isResource) ? \"YES\" : \"NO\");\n rl.close();\n});\n", "src_uid": "2a68157e327f92415067f127feb31e24"}
{"source_code": "//var t1=prompt('\u0412\u0432\u0435\u0434\u0438\u0442\u0435 \u0432\u0440\u0435\u043c\u044f \u043d\u0430\u0447\u0430\u043b\u0430 \u043a\u043e\u043d\u0442\u0435\u0441\u0442\u0430');\n//var t2=prompt('\u0412\u0432\u0435\u0434\u0438\u0442\u0435 \u0432\u0440\u0435\u043c\u044f \u043e\u043a\u043e\u043d\u0447\u0430\u043d\u0438\u044f \u043a\u043e\u043d\u0442\u0435\u0441\u0442\u0430');\nvar t1=readline();\nvar t2=readline();\n\nvar h1=Number(t1.slice(0,2));\nvar m1=Number(t1.slice(3,5));\nvar h2=Number(t2.slice(0,2));\nvar m2=Number(t2.slice(3,5));\n//console.log('Start '+h1+':'+m1);\n//console.log('End '+h2+':'+m2);\n\nvar interval=((h2-h1)*60+m2-m1)/2;\n\n\n\nm3=m1+interval;\ndh=Math.floor(m3/60);\nh3=h1+dh;\nh3=h3-24*Math.floor(h3/24);\nm3=m3-dh*60;\n\nif(h3<10) {\nh3='0'+h3;\n}\nif (m3<10){\nm3='0'+m3;\n}\n\nprint(h3+':'+m3);\n//console.log('\u0421\u0435\u0440\u0435\u0434\u0438\u043d\u0430 \u043a\u043e\u043d\u0442\u0435\u0441\u0442\u0430 '+h3+':'+m3);\n", "src_uid": "f7a32a8325ce97c4c50ce3a5c282ec50"}
{"source_code": "print(readline().match(/h.*e.*l.*l.*o/i)?\"YES\":\"NO\");", "src_uid": "c5d19dc8f2478ee8d9cba8cc2e4cd838"}
{"source_code": "var nums = readline().split(' ');\nvar n = parseInt(nums[0]);\nvar a = parseInt(nums[1]);\nvar b = parseInt(nums[2]);\nvar k = parseInt(nums[3]);\nvar MOD = 1000000007;\n\nif(a>b)\n{\n a = n - a + 1;\n n = n - b;\n}\nelse\n{\n n = b - 1;\n}\n\nvar aa = new Array();\nvar s = new Array();\n\nfor(var i=0; i<2; i++)\n{\n aa[i] = new Array();\n\taa[i][0] = 0;\n\ts[i] = new Array();\n\ts[i][0] = 0;\n}\n\nfor(var i=1;i<=n;i++)\n{\n aa[0][i] = 0;\n}\naa[0][a] = 1;\nfor(var i=1;i<a;i++)\n{\n s[0][i] = 0;\n}\nfor(var i=a;i<=n;i++)\n{\n s[0][i] = 1;\n}\n\nvar t2 = 0, t1 = 1;\nwhile(k--)\n{\n var t = t2;\n\tt2 = t1;\n t1 = t;\n for(var i = 1; i <= n; i++)\n {\n\t t = ((i+n)>>1);\n aa[t2][i] = (s[t1][t]-aa[t1][i])%MOD;\n\t\ts[t2][i] = (s[t2][i-1]+aa[t2][i])%MOD;\n\t}\n}\nif(s[t2][n]<0)\n{\n s[t2][n] += MOD;\n}\nprint(s[t2][n]);", "src_uid": "142b06ed43b3473513995de995e19fc3"}
{"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 let a = arr[0];\n let b = 0;\n let mid = Math.floor(a / 2);\n const ans = [1];\n\n for (let i = 1; i < arr.length; i++) {\n if (arr[i] > mid) {\n b += arr[i];\n }\n else {\n a += arr[i];\n ans.push(i + 1);\n }\n }\n\n if (a <= b) {\n console.log(0);\n }\n else {\n console.log(ans.length);\n console.log(ans.join(' '));\n }\n\n c++;\n});\n", "src_uid": "0a71fdaaf08c18396324ad762b7379d7"}
{"source_code": "async function solve() {\n let s = await line()\n const vk = s.split('VK').length - 1\n s = s.split('VK').join('X')\n const vv = s.split('VV').length > 1\n const kk = s.split('KK').length > 1\n\n print(vk + (vv || kk ? 1 : 0))\n}\n\n// read the input\nconst readline = require('readline')\nconst _lines = []\nlet _lineIndex = 0\nlet _ended = false\nconst _rl = readline.createInterface(process.stdin)\n_rl.on('line', line => _lines.push(line))\n_rl.on('end', () => (ended = true))\nconst wait = ms => new Promise(resolve => setTimeout(resolve, ms))\nconst line = async () => {\n while (!_ended && _lines.length <= _lineIndex) await wait(10)\n const result = _lines[_lineIndex].trim()\n _lines[_lineIndex] = null\n _lineIndex++\n return result\n}\nconst words = async () => (await line()).split(' ')\nconst chars = async () => (await line()).split('')\nconst int = async () => parseInt(await line())\nconst ints = async () => (await words()).map(x => parseInt(x))\nconst big = async () => BigInt(await line())\nconst bigs = async () => (await words()).map(x => BigInt(x))\n\nconst print = console.log\n\nsolve()\n", "src_uid": "578bae0fe6634882227ac371ebb38fc9"}
{"source_code": "var arr = new Array(1,2,3,4,6,8,9,12,16,18,24,27,32,36,48,54,64,72,81,96,108,128,144,162,192,216,243,256,288,324,384,432,486,512,576,648,729,768,864,972,1024,1152,1296,1458,1536,1728,1944,2048,2187,2304,2592,2916,3072,3456,3888,4096,4374,4608,5184,5832,6144,6561,6912,7776,8192,8748,9216,10368,11664,12288,13122,13824,15552,16384,17496,18432,19683,20736,23328,24576,26244,27648,31104,32768,34992,36864,39366,41472,46656,49152,52488,55296,59049,62208,65536,69984,73728,78732,82944,93312,98304,104976,110592,118098,124416,131072,139968,147456,157464,165888,177147,186624,196608,209952,221184,236196,248832,262144,279936,294912,314928,331776,354294,373248,393216,419904,442368,472392,497664,524288,531441,559872,589824,629856,663552,708588,746496,786432,839808,884736,944784,995328,1048576,1062882,1119744,1179648,1259712,1327104,1417176,1492992,1572864,1594323,1679616,1769472,1889568,1990656,2097152,2125764,2239488,2359296,2519424,2654208,2834352,2985984,3145728,3188646,3359232,3538944,3779136,3981312,4194304,4251528,4478976,4718592,4782969,5038848,5308416,5668704,5971968,6291456,6377292,6718464,7077888,7558272,7962624,8388608,8503056,8957952,9437184,9565938,10077696,10616832,11337408,11943936,12582912,12754584,13436928,14155776,14348907,15116544,15925248,16777216,17006112,17915904,18874368,19131876,20155392,21233664,22674816,23887872,25165824,25509168,26873856,28311552,28697814,30233088,31850496,33554432,34012224,35831808,37748736,38263752,40310784,42467328,43046721,45349632,47775744,50331648,51018336,53747712,56623104,57395628,60466176,63700992,67108864,68024448,71663616,75497472,76527504,80621568,84934656,86093442,90699264,95551488,100663296,102036672,107495424,113246208,114791256,120932352,127401984,129140163,134217728,136048896,143327232,150994944,153055008,161243136,169869312,172186884,181398528,191102976,201326592,204073344,214990848,226492416,229582512,241864704,254803968,258280326,268435456,272097792,286654464,301989888,306110016,322486272,339738624,344373768,362797056,382205952,387420489,402653184,408146688,429981696,452984832,459165024,483729408,509607936,516560652,536870912,544195584,573308928,603979776,612220032,644972544,679477248,688747536,725594112,764411904,774840978,805306368,816293376,859963392,905969664,918330048,967458816,1019215872,1033121304,1073741824,1088391168,1146617856,1162261467,1207959552,1224440064,1289945088,1358954496,1377495072,1451188224,1528823808,1549681956,1610612736,1632586752,1719926784,1811939328,1836660096,1934917632);\nvar cnt = 0;\nvar line = readline().split(\" \");\nvar l = line[0];\nvar r = line[1];\nfor(var i =0;i<= 325;i++){\n if (arr[i]>=l && arr[i]<= r)\n {\n cnt += 1;\n }\n \n}\nprint (cnt)", "src_uid": "05fac54ed2064b46338bb18f897a4411"}
{"source_code": "var n = readline();\nvar str = readline().split(\" \").sort((x,y)=>{return x-y}).reverse();\nvar x = 0;\nvar res=0;\nfor (var i=0; i<str.length+1; i++){\n\tif(res>=n){\n\tprint(i);\n\tx=1;\n\tbreak;\n\t}\n\tres+=+str[i];\n}\nif (x==0) print(-1);", "src_uid": "59dfa7a4988375febc5dccc27aca90a8"}
{"source_code": "const readline = require('readline');\n\nlet secondLine = false;\n\n\n// Create readline Interface\nconst rl = readline.createInterface({\n input: process.stdin,\n output: process.stdout\n});\n\nlet inputs = [];\n\n\n\nrl.on('line', lineInput => {\n inputs.push(lineInput);\n})\n\n\n// Read Inputs\nrl.on('close', () => {\n const line1 = inputs[0].split(' ');\n const songs = inputs[1].split(' ');\n const D = parseInt(line1[1].split(' ')[0]);\n let spareTime = 0;\n let neededDurationForSongs = 0;\n for (let i = 0; i < songs.length; i++) {\n neededDurationForSongs += parseInt(songs[i]);\n }\n\n spareTime = (songs.length - 1) * 10;\n\n if (neededDurationForSongs + spareTime > D)\n return console.log(-1)\n\n let durationsForJokes = D - neededDurationForSongs;\n\n return console.log(Math.floor(durationsForJokes / 5))\n});", "src_uid": "b16f5f5c4eeed2a3700506003e8ea8ea"}
{"source_code": "\nprocess.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').map(a => a.replace(/(\\r\\n|\\n|\\r)/gm, ''))\n\n const n = readInt(arr)\n const a = arr[0]\n\n let l = 0, r = 0\n for(let i = 0; i < n; i++) {\n if(a[i] == 'L') l ++\n else r++\n }\n\n wr(l + r + 1)\n})\n\nfunction wr(...x) {\n console.log(...x)\n}\n\nfunction sort(a, inc = true) {\n if(inc) a.sort((a, b) => a - b)\n else a.sort((a, b) => b - a)\n}\n\nfunction readInt(a, i) {\n if(i === undefined) return parseInt(a.shift())\n else return parseInt(a[i])\n}\nfunction readInts(a, i) {\n if(i === undefined) return arr.shift().split(' ').map(a => parseInt(a))\n else return arr[i].split(' ').map(a => parseInt(a))\n}\n", "src_uid": "098ade88ed90664da279fe8a5a54b5ba"}
{"source_code": "var finput = readline();\nvar minput = readline();\nvar sinput = readline();\n\nvar players = ['F', 'M', 'S'];\nvar inputs = [finput, minput, sinput];\nvar rocks = 0, ss = 0, papers = 0\nfor (var i = 0; i < inputs.length; i++) {\n if (inputs[i] == 'rock') rocks++;\n if (inputs[i] == 'scissors') ss++;\n if (inputs[i] == 'paper') papers++;\n}\n\nvar winnerFlag = false;\nif (rocks == 2 && papers == 1) {write(players[inputs.indexOf('paper')])}\nelse if (ss == 2 && rocks == 1) {write(players[inputs.indexOf('rock')])}\nelse if (papers == 2 && ss == 1) {write(players[inputs.indexOf('scissors')])}\nelse write('?');\n\n", "src_uid": "072c7d29a1b338609a72ab6b73988282"}
{"source_code": "\nvar n=+readline();\nvar a=readline().split(' ').map(function(v){return+v;});\n\nvar chest=0;\nfor(var i=0;i<n;i+=3){\n\tchest+=a[i];\n}\nvar biceps=0;\nfor(var i=1;i<n;i+=3){\n\tbiceps+=a[i];\n}\nvar back=0;\nfor(var i=2;i<n;i+=3){\n\tback+=a[i];\n}\nswitch(Math.max(chest, biceps, back)){\n\tcase chest:\n\t\tprint('chest');\n\t\tbreak;\n\tcase biceps:\n\t\tprint('biceps');\n\t\tbreak;\n\tcase back:\n\t\tprint('back');\n\t\tbreak;\n}", "src_uid": "579021de624c072f5e0393aae762117e"}
{"source_code": "var trump = readline();\nvar cards = readline().split(\" \");\n\nvar yes = \"YES\", no = \"NO\", ranks = [\"6\", \"7\", \"8\", \"9\", \"T\", \"J\", \"Q\", \"K\", \"A\"];\nvar answer = no;\n\nif (cards[0][1] == trump && cards[1][1] != trump) {\n answer = yes;\n}\n\nif (cards[1][1] == cards[0][1] && ranks.indexOf(cards[0][0]) > ranks.indexOf(cards[1][0])) {\n answer = yes;\n}\n\nprint(answer);", "src_uid": "da13bd5a335c7f81c5a963b030655c26"}
{"source_code": "var params = readline().split(' ').map(function(num){\n return parseInt(num)\n});\n\nvar buy = readline().split(' ').map(function(num){\n return parseInt(num)\n});\n\n\nvar sells = readline().split(' ').map(function(num){\n return parseInt(num)\n});\n\nfunction max(arr) {\n var max = -Infinity\n for (var i = 0; i < arr.length; i++) {\n if (arr[i] > max)\n max = arr[i]\n }\n return max\n}\n\nfunction minArr(arr) {\n var min = Infinity\n for (var i = 0; i < arr.length; i++) {\n if (arr[i] < min)\n min = arr[i]\n }\n return min\n}\n\n// var params = [2, 2, 50]\n\n// var buy = [5, 7]\n\n// var sells = [4, 2]\n\nvar minBuy = minArr(buy);\nvar maxSell = max(sells);\n\nif (minBuy >= maxSell) \n write(params[2])\n\nelse if (minBuy > params[2])\n write(params[2])\n\nelse {\n var moneyAfterBuying = params[2] % minBuy;\n var stocks = Math.floor(params[2] / minBuy);\n var moneyAfterSelling = moneyAfterBuying + (stocks*maxSell);\n\n write(moneyAfterSelling);\n}\n", "src_uid": "42f25d492bddc12d3d89d39315d63cb9"}
{"source_code": "var arr = readline().split(\" \").map(function(v) {return +v;});\nvar n = arr[0]-arr[1];\n\nvar c = 0;\nfor(var i = 1; i <= Math.sqrt(n); i++) {\n if(n%i !== 0) continue;\n\n count(i);\n if(i*i!==n)\n count(n/i);\n}\n\nfunction count(n) {\n if(n > arr[1])\n c++;\n}\n\nif(n===0)\n print(\"infinity\");\nelse\n print(c);\n", "src_uid": "6e0715f9239787e085b294139abb2475"}
{"source_code": "var ip = readline().split(' ').map(Number);\nvar n = ip[0], k= ip[1];\nif (k <= n){\n print(Math.floor((k-1)/2));\n} else if ((k+1)/2 <= n){\n print(Math.floor((n-(k-n)+1)/2));\n}else\nprint(0)", "src_uid": "98624ab2fcd2a50a75788a29e04999ad"}
{"source_code": "var num = readline().split(\" \").map(x => parseInt(x)); // num will be an array [1,2,3]\nvar a = num[0];\nvar b = num[1];\nvar c = num[2];\nvar result = [];\nvar count = 0;\n \nfor (var i = 1; i < 81; i++) {\n var buf = b * Math.pow(i, a) + c;\n if (buf > 1E9) continue;\n \n var sumBufNumbers = buf.toString().split('').reduce(function(a,b){\n return +a + +b;\n });\n if (i == sumBufNumbers) {\n result.push(buf);\n count++;\n }\n}\n \nprint(count);\nresult.forEach(element => print(element));", "src_uid": "e477185b94f93006d7ae84c8f0817009"}
{"source_code": "var name = readline();\nvar obj = {};\n\narr = name.split('');\narr.forEach(function(w) {\n obj[w] = w;\n});\n\nvar len = 0;\nfor (var key in obj) {\n len++;\n}\n\nprint(len % 2 == 0? 'CHAT WITH HER!': 'IGNORE HIM!');", "src_uid": "a8c14667b94b40da087501fd4bdd7818"}
{"source_code": "const r = Number(readline());\nsearch: for (var aHalf = 0.5; aHalf <= 5; aHalf += 0.5)\n for (var h = 1; h <= 10; h++)\n if (Math.abs(aHalf * h / Math.hypot(aHalf, h) - r) <= 0.000001) {\n print(`${aHalf * 2} ${h}`);\n break search;\n }\n", "src_uid": "879ac20ae5d3e7f1002afe907d9887df"}
{"source_code": "var s = readline().split(\" \");\nvar n = Number(s[0]), k = Number(s[1]);\n\nvar mid = Math.ceil(n/2);\nif (k > mid) {\n print((k-mid) * 2);\n}\nelse {\n print(k*2 - 1);\n}", "src_uid": "1f8056884db00ad8294a7cc0be75fe97"}
{"source_code": "var g = readline().split(\" \");\n\nvar k = Number(g[0]);\nvar n = Number(g[1]);\nvar s = Number(g[2]);\nvar p = Number(g[3]);\n\nprint(Math.ceil(Math.ceil(n/s)*k/p))", "src_uid": "73f0c7cfc06a9b04e4766d6aa61fc780"}
{"source_code": "function main() {\n\tvar capi = \"ABCD\"\n\tvar choi = []\n\tvar good = []\n\n\tfor (var i = 0; i < 4; i++) {\n\t\tchoi[i] = readline().substr(2)\n\t}\n\n\tfor (var i = 0; i < 4; i++) {\n\t\tvar flag = 2\n\t\tfor (var j = 0; j < 4; j++) {\n\t\t\tif (i != j && choi[i].length < choi[j].length * 2) {\n\t\t\t\tflag--;\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\tfor (var j = 0; j < 4; j++) {\n\t\t\tif (i != j && choi[i].length * 2 > choi[j].length) {\n\t\t\t\tflag--;\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\tif (flag > 0) {\n\t\t\tgood.push(capi[i])\n\t\t}\n\t}\n\n\t//print(good)\n\tif (good.length == 1)\n\t\tprint(good[0])\n\telse\n\t\tprint('C')\n}\n\nmain()\n", "src_uid": "30725e340dc07f552f0cce359af226a4"}
{"source_code": "var n = +readline();\nprint((n % 2 === 0) ? n/2 : -1*((n+1)/2));", "src_uid": "689e7876048ee4eb7479e838c981f068"}
{"source_code": "(function(){var r,n,e,i,t;r=function(r,n,e){var i,t,a,f,u,l;f=new Uint32Array(r+1);f[0]=1;a=new Uint32Array(r+1);a[0]=0;for(i=u=0;0<=r?u<=r:u>=r;i=0<=r?++u:--u){for(t=l=1;1<=n?l<=n:l>=n;t=1<=n?++l:--l){if(i-t>=0){f[i]+=f[i-t];if(t>=e){a[i]+=f[i-t]}else{a[i]+=a[i-t]}f[i]%=1000000007;a[i]%=1000000007}}}return a[r]};t=readline().split(\" \");i=Number(t[0]);e=Number(t[1]);n=Number(t[2]);print(r(i,e,n))}).call(this);", "src_uid": "894a58c9bba5eba11b843c5c5ca0025d"}
{"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', (str) => {\n str = str.replace(/--/g, 2);\n str = str.replace(/-\\./g, 1);\n str = str.replace(/\\./g, 0);\n\n console.log(str);\n});\n", "src_uid": "46b5a1cd1bd2985f2752662b7dbb1869"}
{"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;\nlet m;\n\nconst distance = (x1, x2, y1, y2) => {\n return (x1 - x2)**2n + (y1 - y2)**2n;\n}\n\nrl.on('line', (d) => {\n if (c === 0) {\n c++;\n m = BigInt(d);\n return;\n }\n\n const [x, y] = d.split(' ').map(BigInt);\n const white = distance(1n, x, 1n, y);\n const black = distance(m, x, m, y);\n\n if (black < white) {\n console.log('Black');\n }\n else {\n console.log('White');\n }\n\n c++;\n});\n", "src_uid": "b8ece086b35a36ca873e2edecc674557"}
{"source_code": "\nvar tmp = readline().split(' ');\nvar n = tmp[0];\nvar k = parseInt(tmp[1]);\nvar r = 0;\nfor(var i = n.length - 1; i >= 0; i -= 1) {\n if(n[i] === '0') {\n k -= 1;\n } else {\n r += 1;\n }\n if(k === 0) {\n break;\n }\n}\n\nif(k > 0) {\n r = n.length - 1;\n}\n\nprint(r);\n", "src_uid": "7a8890417aa48c2b93b559ca118853f9"}
{"source_code": "/**\n * Problem - http://codeforces.com/contest/1084/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 numFloors = Number(readLine());\n let floors = readLine().split(' ').map(Number);\n let minCost = Number.POSITIVE_INFINITY;\n\n for ( let i = 0 ; i < numFloors ; i++ ) {\n let currentX = i;\n let currentCost = 0;\n floors.forEach( function( numPeople, currentFloor ) {\n currentCost = currentCost + numPeople * 2 * ( Math.abs ( currentX - currentFloor ) + Math.abs( currentFloor ) + Math.abs( -currentX ) );\n } );\n if ( currentCost < minCost ) {\n minCost = currentCost;\n }\n }\n process.stdout.write(String(minCost));\n process.exit();\n}", "src_uid": "a5002ddf9e792cb4b4685e630f1e1b8f"}
{"source_code": "const CODEFORCES_NODE = \"cf\";\nconst CODEFORCES_V8 = \"cf-v8\";\nconst BEAKJOON = \"bj\";\nconst TEST = \"test\";\nvar SITE = CODEFORCES_NODE;\nprocess.argv.forEach(function(val, index, array) {\n // console.log(index + ': ' + val);\n if (val.startsWith(\"site\")) {\n switch (val.split(\"=\")[1]) {\n case \"test\":\n // console.log('change site to test')\n SITE = TEST;\n break;\n case \"cf-node\":\n // console.log('change site to cf')\n SITE = CODEFORCES_NODE;\n break;\n case \"cf\":\n // console.log('change site to cf')\n SITE = CODEFORCES_NODE;\n break;\n case \"cf-v8\":\n // console.log('change site to cf')\n SITE = CODEFORCES_V8;\n break;\n case \"bj\":\n // console.log('change site to bj')\n SITE = BEAKJOON;\n break;\n }\n }\n});\n\nconst DEBUG = SITE == \"test\";\nconst newLine = '\\n';\nif(CODEFORCES_NODE){ //NODE doesn't have readline so make it\n var readline;\n var print;\n print = console.log;\n var it;\n}\nvar ans;\nvar text = \"\";\nvar lineCount = 0;\nvar lines;\nfunction solve() {\n const [n,b] = readInts();\n const arr = readInts();\n it(n, b);\n it(arr);\n //\uba3c\uc800 \ud640\uc9dd \uc30d\uc744 \uc804\ubd80 \uc138\uba74\uc11c \ub3d9\uc2dc\uc5d0 cost\ub3c4 \uc140 \uc218 \uc788\ub098? \n //\uadf8\ub807\ub2e4\uba74 \uac01 cuttable point\uc5d0 \ub300\ud574 \uc138\uc790! \n var countingGroup = false;\n var balance = 0;\n var cutpoints = [];\n for (let i = 0; i < arr.length; i++) {\n const el = arr[i];\n if(el % 2 == 0)\n balance += 1;\n else\n balance -= 1;\n if(!countingGroup){\n //balance\ub294 \ub2f9\uc5f0\ud788 \uc548\ub9de\uc744 \uac83.\n it('counting started', i);\n countingGroup = true;\n }\n else if(countingGroup && balance == 0){\n if(i+1 == arr.length){\n break;\n }\n countingGroup = false;\n cutpoints.push({'pos': i+1, 'price': Math.abs(arr[i+1] - arr[i])});\n it('counting stopped', i);\n }\n }\n it(cutpoints);\n cutpoints.sort((x,y)=>{\n return x.price - y.price;\n });\n if(cutpoints.length == 0){\n print(0);\n return;\n }\n const prices = cutpoints.map((x)=>{return x.price;});\n it(prices);\n var cost = 0;\n var cur = 0;\n while (cost < b) {\n cost += prices[cur];\n cur++;\n if(cost > b){\n cur-=1;\n break;\n }\n if(cur == prices.length){\n break;\n }\n }\n print(cur);\n}\nfunction* getlines(text) {\n var lines = text.split(/\\r?\\n/);\n for (let line of lines) {\n yield line + newLine;\n }\n}\nfunction readline() {\n return lines.next().value.trim();\n}\nfunction readInts() {\n return readline()\n .split(\" \")\n .map(function(x) {\n return parseInt(x);\n });\n}\nvar input;\nif (DEBUG) {\n var fs = require(\"fs\");\n input = fs.createReadStream(\"input.txt\", {encoding:\"utf8\"});\n it = print;\n // lines = getlines(fs.readFileSync(\"input.txt\", \"utf8\"));\n // let data = \"\";\n // data += readline().toString();\n\n // data += readline().toString();\n // require(\"fs\").writeFile(\"output.txt\", data, \"utf8\", function(err) {\n // console.log(\"\ube44\ub3d9\uae30\uc801 \ud30c\uc77c \uc4f0\uae30 \uc644\ub8cc\");\n // });\n // console.log(process.stdin);\n}\nelse {\n input = process.stdin;\n it = function it(params) {\n return 0;\n }\n}\nif (CODEFORCES_NODE) {\n function inputListener(line) {\n if (!line) {\n closing();\n }\n lineCount++;\n text += line + \"\\r\\n\";\n }\n function closing(){\n lines = getlines(text);\n solve();\n process.exit();\n }\n function readlines() {\n const readline = require(\"readline\");\n const rl = readline.createInterface({\n input,\n output: process.stdout,\n terminal: false\n });\n rl.on(\"line\", inputListener);\n rl.on('close', closing);\n }\n readlines();\n}\n// console.log('hallo!!!')\n", "src_uid": "b3f8e769ee7719ea5c9f458428b16a4e"}
{"source_code": "//var print = require('./print');\n//var readline = require('./readline');\n\nvar n = parseInt(readline());\n\nvar v = [[31,28,31,30,31,30,31,31,30,31,30,31, 31,28,31,30,31,30,31,31,30,31,30,31, 31,28,31,30,31,30,31,31,30,31,30,31, 31,28,31,30,31,30,31,31,30,31,30,31, 31,28,31,30,31,30,31,31,30,31,30,31],\n [31,28,31,30,31,30,31,31,30,31,30,31, 31,28,31,30,31,30,31,31,30,31,30,31, 31,28,31,30,31,30,31,31,30,31,30,31, 31,28,31,30,31,30,31,31,30,31,30,31, 31,29,31,30,31,30,31,31,30,31,30,31],\n [31,28,31,30,31,30,31,31,30,31,30,31, 31,28,31,30,31,30,31,31,30,31,30,31, 31,28,31,30,31,30,31,31,30,31,30,31, 31,29,31,30,31,30,31,31,30,31,30,31, 31,28,31,30,31,30,31,31,30,31,30,31],\n [31,28,31,30,31,30,31,31,30,31,30,31, 31,28,31,30,31,30,31,31,30,31,30,31, 31,29,31,30,31,30,31,31,30,31,30,31, 31,28,31,30,31,30,31,31,30,31,30,31, 31,28,31,30,31,30,31,31,30,31,30,31],\n [31,28,31,30,31,30,31,31,30,31,30,31, 31,29,31,30,31,30,31,31,30,31,30,31, 31,28,31,30,31,30,31,31,30,31,30,31, 31,28,31,30,31,30,31,31,30,31,30,31, 31,28,31,30,31,30,31,31,30,31,30,31],\n [31,29,31,30,31,30,31,31,30,31,30,31, 31,28,31,30,31,30,31,31,30,31,30,31, 31,28,31,30,31,30,31,31,30,31,30,31, 31,28,31,30,31,30,31,31,30,31,30,31, 31,28,31,30,31,30,31,31,30,31,30,31]]\n\n\nvar args = readline().split(' ');\nvar highCount = 0;\nfor(var i=0;i<args.length;i++){\n if(args[i] == '29'){\n highCount++;\n }\n}\nvar check = false;\nif(highCount <= 1){\n for(var k = 0;k<v.length;k++){\n for(var i=0;i<v[k].length;i++){\n var j1 = 0;\n var j2 = i;\n while(j2< v[k].length && j1 < n && args[j1] == v[k][j2]){\n j1++;\n j2++;\n }\n if(j1==n){\n check = true;\n }\n }\n }\n}\nif(check){\n print('YES');\n}\nelse{\n print('NO');\n}\n", "src_uid": "d60c8895cebcc5d0c6459238edbdb945"}
{"source_code": "var params = readline().split(' ').map(Number);\nvar a = params[0];\nvar b = params[1];\nvar c = params[2];\n\nif((a === b) || (c !== 0 && ((b - a) % c === 0) && ((b - a) / c > 0)))\n\tprint(\"YES\");\nelse\n\tprint(\"NO\");", "src_uid": "9edf42c20ddf22a251b84553d7305a7d"}
{"source_code": "var tiles = readline().split(\" \").map(function(x) { return (x) });\ntiles.sort();\n\nvar first = tiles[0][1];\nvar second = tiles[1][1];\nvar third = tiles[2][1];\n \nvar firstNo = tiles[0][0];\nvar secondNo = tiles[1][0];\nvar thirdNo = tiles[2][0];\n\nif (first != second && first != third && second != third){\n print (2);\n}\nelse if (first == second && first == third && second == third){\n if ((firstNo == secondNo && firstNo == thirdNo && secondNo == thirdNo) || (secondNo - firstNo == 1 && thirdNo - secondNo == 1)){\n print(0);\n }\n else if ((secondNo - firstNo > 2 && secondNo != thirdNo) && (thirdNo - secondNo > 2 && firstNo != secondNo)){\n print(2);\n }\n else {\n print(1);\n }\n}\nelse if (first == second){\n if(secondNo - firstNo < 3){\n print(1);\n }\n else {\n print(2);\n }\n}\nelse if (second == third){\n if(thirdNo - secondNo < 3){\n print(1);\n }\n else {\n print(2);\n }\n}\nelse if (first == third){\n if(thirdNo - firstNo < 3){\n print(1);\n }\n else {\n print(2);\n }\n}", "src_uid": "7e42cebc670e76ace967e01021f752d3"}
{"source_code": "\nprocess.stdin.resume();\nprocess.stdin.setEncoding('utf-8');\n\nlet inputString = '';\nlet currentLine = 0;\n\nprocess.stdin.on('data', inputStdin => {\n inputString += inputStdin;\n});\n\nprocess.stdin.on('end', _ => {\n inputString = inputString.replace(/\\s*$/, '')\n .split('\\n')\n .map(str => str.replace(/\\s*$/, ''));\n\n main();\n});\n\nfunction readLine() {\n return inputString[currentLine++];\n}\n\n\n\nfunction main() {\n \n \n const friends = readLine().split(' ').map(aTemp => parseInt(aTemp, 10));\n \n let distance = 0;\n\n for (let i = 1; i < friends.length; i++) {\n let current = friends[i];\n\n let index = i;\n\n while (index >= 0 && current < friends[index - 1]) {\n friends[index] = friends[index - 1];\n index--\n \n }\n friends[index] = current;\n }\n distance = friends[2] - friends[0];\n console.log(distance);\n\n \n}", "src_uid": "7bffa6e8d2d21bbb3b7f4aec109b3319"}
{"source_code": "var n = +readline(), result = n;\n\nfor(i = 1; i < n; i++){\n\tresult += i * (n - i);\n}\n\nwrite(result);", "src_uid": "6df251ac8bf27427a24bc23d64cb9884"}
{"source_code": "var n = parseInt(readline());\nvar s = readline();\nvar arr = [];\nvar result = \"\";\nvar subArr;\n\nfor(var i = 0; i < n; i++)\n{\n arr.push(s[i]);\n}\n\nfor(var i = 1; i < n + 1; i++)\n{\n if(n % i == 0)\n {\n subArr = arr.slice(0, i);\n subArr.reverse();\n\n for(var j = 0; j < i; j++)\n {\n arr[j] = subArr[j];\n }\n }\n}\n\nfor(var i = 0; i < n; i++)\n{\n result += arr[i];\n}\n\nprint(result);", "src_uid": "1b0b2ee44c63cb0634cb63f2ad65cdd3"}
{"source_code": "let i = ''\nprocess.stdin.on('data', c => i += c)\nprocess.stdin.on('end', () => {\n const {EOL} = require('os')\n const lines = i.split(EOL) /*your input text, split by lines*/\n let count = lines[0];\n\n \tlet putted = 0;\n\n\twhile (count > 0) {\n\t if (count % 2 == 1) {\n\t putted += 1;\n\t }\n\t count = parseInt(count / 2)\n\t}\n\n\tconsole.log(putted);\n})\n\n", "src_uid": "03e4482d53a059134676f431be4c16d2"}
{"source_code": "(function main() {\n var s = readline();\n var re = /^(http|ftp)(.+)ru(.*)$/;\n var res = re.exec(s);\n var rs = res[1] + '://' + res[2] + '.ru';\n if (res[3]) \n rs += '/' + res[3];\n print(rs)\n})();", "src_uid": "4c999b7854a8a08960b6501a90b3bba3"}
{"source_code": "\n\n(function main(){\n var line = readline().split(' ');\n var a = line[0];\n var b = line[1];\n\n var one = parseInt(a);\n var two = parseInt(b);\n if(two > one){\n\tvar t = one;\n\tone = two;\n\ttwo = t;\n // var [one,two] = [two,one];\n }\n if(one%two != 0 ){\n print(-1);\n }\n else{\n chuone(one/two,0);\n }\n})()\n\nfunction chuone(a,sum){\n if(a == 1){\n //console.log(0);\n print(0);\n return;\n }\n if((a/2 == 1 && a%2 == 0) || (a/3 == 1 && a%3 == 0)){\n sum++;\n print(sum);\n //console.log(sum);\n return;\n }\n if(a%2 != 0 && a%3 != 0){\n print(-1);\n //console.log(-1);\n }\n else if(a%2 == 0){\n a = a/2;\n sum++;\n chuone(a,sum);\n }\n else if(a%3 == 0){\n a = a/3;\n sum++;\n chuone(a,sum);\n }\n}\n", "src_uid": "3f9980ad292185f63a80bce10705e806"}
{"source_code": "/**\n * \nA word or a sentence in some language is called a pangram if all the characters of the alphabet of this \nlanguage appear in it at least once. Pangrams are often used to demonstrate fonts in printing or test the output devices.\n\nYou are given a string consisting of lowercase and uppercase Latin letters.\n Check whether this string is a pangram. We say that the string contains a letter of the Latin alphabet \n if this letter occurs in the string in uppercase or lowercase.\n \n */\n'use strict';\n\nprocess.stdin.resume();\nprocess.stdin.setEncoding('utf-8');\nlet inputString = '';\nlet currentLine = 0;\n\nprocess.stdin.on('data', inputStdin => {\n inputString += inputStdin;\n});\n\nprocess.stdin.on('end', _ => {\n inputString = inputString.trim().split('\\n').map(string => {\n return string.trim();\n });\n\n pangram(inputString[0], inputString[1]);\n});\n\nfunction readline() {\n return inputString[currentLine++];\n}\n\nfunction pangram(stringLength, word) {\n\n\n let line = readline()\n let alphabet = 'abcdefghijklmnopqrstuvwxyz'.split('');\n let stringToMap = {};\n let occurance = {};\n word = word.toLowerCase();\n\n for (let index = 0; index < stringLength; index++) {\n stringToMap[word[index]] = 1;\n }\n\n for (let index = 0; index < alphabet.length; index++) {\n if (stringToMap[alphabet[index]])\n occurance[alphabet[index]] = 1\n }\n\n if (Object.keys(occurance).length == alphabet.length)\n console.log('YES');\n\n else\n console.log('NO');\n}\n\n", "src_uid": "f13eba0a0fb86e20495d218fc4ad532d"}
{"source_code": "\n'use strict';\n\nprocess.stdin.resume();\nprocess.stdin.setEncoding('utf-8');\n\nlet inputString = '';\nlet currentLine = 0;\n\nprocess.stdin.on('data', inputStdin => {\n inputString += inputStdin;\n});\n\nprocess.stdin.on('end', _ => {\n inputString = inputString.trim().split('\\n').map(string => {\n return string.trim();\n });\n\n main();\n});\n\nfunction readline() {\n return inputString[currentLine++];\n}\n\n\nfunction main() {\n let [Limak , Bob] = readline().split(\" \");\n let years =1;\n while (true){\n \n Limak*=3;\n Bob*=2;\n if (Limak > Bob)\n break;\n\n years++\n }\n console.log(years);\n return ; \n}", "src_uid": "a1583b07a9d093e887f73cc5c29e444a"}
{"source_code": "\"use strict\";\n\nvar n = parseInt(readline());\n\nvar m = parseInt(readline());\n\nvar arr = [];\nfor(let i = 0; i<n; i++) { \n arr.push(parseInt(readline()));\n}\nfunction sortnum(a,b) {\n return a - b;\n}\narr.sort(sortnum);\nvar maxppl = arr[n-1];\n\nvar maxk = maxppl+m;\nfor(let i = 0; i<n; i++) {\n if(m===0) break;\n let remain = maxppl-arr[i];\n m -= Math.min(m, remain);\n}\nvar mink = maxppl;\nmink += parseInt(m/n);\nif(m%n>0) {\n mink += 1;\n}\nprint(`${mink} ${maxk}`);", "src_uid": "78f696bd954c9f0f9bb502e515d85a8d"}
{"source_code": "'use strict'\n\nvar a = readline();\nvar b = readline();\n\nif(b.indexOf(a[0])!==-1||b.indexOf(a[1])!==-1)\n print('YES');\nelse\n print('NO');\n", "src_uid": "699444eb6366ad12bc77e7ac2602d74b"}
{"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 len = +readLine() + 1;\n let count = 0;\n const sum = readLine()\n .split(\" \")\n .reduce((sum, n) => sum + +n, 0);\n\n for (let i = 1; i <= 5; i++) {\n if ((sum + i) % len !== 1) count++;\n }\n console.log(count);\n}\n", "src_uid": "ff6b3fd358c758324c19a26283ab96a4"}
{"source_code": "const readline = require('readline');\nconst rl = readline.createInterface({\n input: process.stdin,\n output: process.stdout,\n terminal: false\n});\nlet count = 0;\n\nrl.on('line', (data) => {\n let [a, b, c, d] = data.split(' ').map(Number);\n let p1Points = Math.max(3*a/10, a - (a / 250) * c);\n let p2Points = Math.max(3*b/10, b - (b / 250) * d);\n\n if (p1Points === p2Points) {\n console.log('Tie');\n }\n else if (p1Points > p2Points) {\n console.log('Misha');\n }\n else {\n console.log('Vasya');\n }\n\n count++;\n});\n", "src_uid": "95b19d7569d6b70bd97d46a8541060d0"}
{"source_code": ";(function () {\n\n\tprint(function (x, y, n) {\n\t\tx = [x, y, y - x, -x, -y, x - y][n % 6]; y = 1000000007;\n\t\twhile (x < 0) { x = y + x;}\n\t\treturn x % y;\n\t}.apply(0, readline().split(' ').map(Number).concat(+readline() - 1)));\n\n}).call(this);", "src_uid": "2ff85140e3f19c90e587ce459d64338b"}
{"source_code": "main(readline());\n\nfunction parseNMA(n, m, a){\n return Math.ceil(n/a) * Math.ceil(m/a);\n}\n\nfunction main(line){\n var nma = line.split(\" \");\n var n = parseInt(nma[0]);\n var m = parseInt(nma[1]);\n var a = parseInt(nma[2]);\n print(parseNMA(n, m, a));\n}\n", "src_uid": "ef971874d8c4da37581336284b688517"}
{"source_code": "\nfunction main()\n{\n var a = {};\n var s = readline().split('');\n var c = Array(4).fill(0);\n \n for ( var i=0 ; i<s.length ; i++ )\n {\n var b = i%4;\n if ( s[i] == '!' ) c[b]++;\n else a[s[i]] = b;\n }\n \n print( c[a[\"R\"]] + \" \" + c[a[\"B\"]] + \" \" + c[a[\"Y\"]] + \" \" + c[a[\"G\"]] );\n} main();\n\n\n\n\n\n\n\n\n\n", "src_uid": "64fc6e9b458a9ece8ad70a8c72126b33"}
{"source_code": "// Plate Game - https://codeforces.com/problemset/problem/197/A\n\nconst readline = require(\"readline\").createInterface({\n input: process.stdin,\n output: process.stdout,\n});\n\nreadline.question(\"\", (_input) => {\n const input = _input.split(\" \").map(Number);\n digiGame(input[0], input[1], input[2]);\n});\n\nconst 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", "src_uid": "90b9ef939a13cf29715bc5bce26c9896"}
{"source_code": "var numbers = readline().split(' ').map(Number)\n\nvar ref = {}\nfor (var i = 1; i <= numbers[0]; i++) {\n var n = 5 - (i % 5)\n if (ref.hasOwnProperty(n)) {\n ref[n] += 1\n } else {\n ref[n] = 1\n }\n}\n\nvar nbOfPair = 0\nfor (var i = 1; i <= numbers[1]; i++) {\n var n = i % 5\n if (ref.hasOwnProperty(n)) {\n nbOfPair += ref[n]\n } else if (n === 0 && ref[5]) {\n nbOfPair += ref[5]\n }\n}\n\nprint(nbOfPair)", "src_uid": "df0879635b59e141c839d9599abd77d2"}
{"source_code": "var arr = readline().split(' ');\nvar n = parseInt(arr[0]);\nvar k = parseInt(arr[1]);\nvar arr = readline().split(' ');\nvar sum = 0;\nfor (var i = 0; i < arr.length; i ++)\n{\n sum += parseInt(arr[i]);\n}\nvar i = 0;\nwhile(sum/(n+i) < (k-0.5))\n{\n i ++;\n sum += k;\n}\nprint(i);\n", "src_uid": "f22267bf3fad0bf342ecf4c27ad3a900"}
{"source_code": "function main()\n{\n var tmp = readline().split(\" \").map(function (x){ return parseInt(x); });\n var x = tmp[0],\n t = tmp[1],\n a = tmp[2],\n b = tmp[3],\n da = tmp[4],\n db = tmp[5];\n if ( x == 0 )\n {\n print(\"YES\");\n return;\n }\n for ( var i = 0; i < t; i++ )\n {\n for ( var j = 0; j < t; j++ )\n {\n if ( a+b == x || a == x || b == x )\n {\n print(\"YES\");\n return;\n }\n b -= db;\n }\n a -= da;\n b = tmp[3];\n }\n print(\"NO\");\n}\n\nmain();\n", "src_uid": "f98168cdd72369303b82b5a7ac45c3af"}
{"source_code": "function pd(x) {\n for (var i = 2; i <= x; i++) {\n if (i * i > x) break;\n if (x % i === 0) return 0;\n }\n return 1;\n\n}\n\n\nt = +readline();\n\nif (t % 2 === 0) {\n if (pd(t) == 1) {\n print(\"1\");\n }\n else {\n print(\"2\");\n }\n}\nelse {\n if (pd(t)) {\n print(\"1\");\n }\n else if (pd(t - 2) === 1) {\n print(\"2\");\n }\n\n else if (pd(t - 2) === 0) {\n print(\"3\")\n }\n\n}", "src_uid": "684ce84149d6a5f4776ecd1ea6cb455b"}
{"source_code": "var n=+readline();\nvar a=readline().split(' ').map(Number);\nvar sum=a.reduce(function(a, b){return a+b;});\n\nvar s0=0;\nvar s1=0;\nvar a0=[];\nvar a1=[];\nfor(var i=0; i<n+2; i++){\n\tif(a[i]==1){\n\t\ts1++;\n\t}else{\n\t\ts0++;\n\t}\n\ta0[i]=s0;\n\ta1[i]=s1;\n}\nvar ans=-100;\nfor(var i=0; i<n; i++){\n\tvar left1=a1[i-1]||0;\n\tvar left0=a0[i-1]||0;\n\tfor(var j=i; j<n; j++){\n\t\tans=Math.max(ans, left1+a0[j]-left0+a1[n-1]-(a1[j]||0));\n\t}\n}\nprint(ans);", "src_uid": "9b543e07e805fe1dd8fa869d5d7c8b99"}
{"source_code": ";(function () {\n\n\tvar m = [];\n\tfor (var i = 0; i < 5; i++) m.push(readline().split(' ').map(Number));\n\n\tvar t = 0, k = [];\n\tfor (var a = 0; a < 5; a++)\n\t\tfor (var b = 0; b < 5; b++)\n\t\t\tfor (var c = 0; c < 5; c++)\n\t\t\t\tfor (var d = 0; d < 5; d++)\n\t\t\t\t\tfor (var e = 0; e < 5; e++)\n\t\t\t\t\t\tif (dif(a, b, c, d, e))\n\t\t\t\t\t\t\tt = Math.max(t, sum(a, b, c, d, e));\n\n\tprint(t);\n\n\tfunction sum (a, b, c, d, e) {\n\t\treturn 0\n\t\t\t+ m[a][b]\u2009+\u2009m[b][a]\u2009+\u2009m[c][d]\n\t\t\t+\u2009m[d][c] +\u2009m[c][b]\u2009+\u2009m[b][c]\n\t\t\t+\u2009m[d][e]\u2009+\u2009m[e][d] +\u2009m[c][d]\n\t\t\t+\u2009m[d][c] +\u2009m[d][e]\u2009+\u2009m[e][d];\n\t}\n\n\tfunction dif (a, b, c, d, e) {\n\t\tvar m = {}; m[a] = true; m[b] = true;\n\t\tm[c] = true; m[d] = true; m[e] = true;\n\t\treturn Object.keys(m).length === 5;\n\t}\n\n}).call(this);", "src_uid": "be6d4df20e9a48d183dd8f34531df246"}
{"source_code": ";(function () {\n\t\n\tvar s = readline().split(' ').map(Number);\n\n\tprint( 4 * ( Math.pow(s[0]*s[1] / s[2] , 0.5) + Math.pow(s[0]*s[2] / s[1] , 0.5) + Math.pow(s[1] * s[2] / s[0] , 0.5) ) );\n\n}).call(this);", "src_uid": "c0a3290be3b87f3a232ec19d4639fefc"}
{"source_code": "var line = readline().split(' ');\nvar w = line[0];\nvar h = line[1];\nvar k = line[2];\nvar ans = 0;\nfor (var i = 1; i <= k; i++) {\n var a = w - 4*(i -1);\n var b = h - 4*(i -1);\n ans += 2*a + 2*(b-2);\n}\nwrite(ans);", "src_uid": "2c98d59917337cb321d76f72a1b3c057"}
{"source_code": "var s = readline();\nvar t = readline().split('');\n\nt.reverse();\n\nif(s == t.join('')) {\n write('YES');\n} else {\n write('NO');\n}", "src_uid": "35a4be326690b58bf9add547fb63a5a5"}
{"source_code": "n=readline().split(\" \").map(Number);a=n[1];r=Math.pow(2,n[0]);e=!!0;l=0;while(r-1){if(a>r/2==e){l++;e=!e}else{l+=r}if(a>r/2){a-=r/2}r/=2}print(l);\n\n", "src_uid": "3dc25ccb394e2d5ceddc6b3a26cb5781"}
{"source_code": "var num = readline().split(\" \").map(x => parseInt(x));\nvar n,m,count;\nn=num[0],m=num[1],count=0;\nfor(var i = 0;i<=n+m;i++){\n for(var j = 0;j<=n+m;j++){\n if(i*i+j == n &&j*j+i ==m){\n count =count+1;\n }\n }\n}\n \nprint(count);", "src_uid": "03caf4ddf07c1783e42e9f9085cc6efd"}
{"source_code": "var b = [];\nb.push(\"33044033\");\nb.push(\"33044033\");\nb.push(\"22033022\");\nb.push(\"22033022\");\nb.push(\"11022011\");\nb.push(\"11022011\");\nvar a = [];\nvar n = 6;\nvar max = 0;\nvar bi = -1, bj = -1;\nfor(var i = 0; i < n; i++) {\n a.push(readline().split(\"\"));\n for(var j = 0; j < 8; j++) {\n if(a[i][j] == '.') {\n if(b[i][j] > max) {\n max = b[i][j];\n bi = i; bj = j;\n }\n }\n }\n}\nfor(var i = 0; i < n; i++) {\n var pr = \"\";\n for(var j = 0; j < 8; j++) {\n if(bi == i && bj == j) {\n pr += \"P\";\n }\n else {\n pr += a[i][j];\n }\n }\n print(pr);\n}", "src_uid": "35503a2aeb18c8c1b3eda9de2c6ce33e"}
{"source_code": "function trim(s) {\n\treturn s.replace(/^\\s+|\\s+$/gm, '');\n}\n\nfunction tokenize(s) {\n\treturn trim(s).split(/\\s+/);\n}\n\nfunction tokenizeIntegers(s) {\n\tvar tokens = tokenize(s);\n\tfor (var i = 0; i < tokens.length; i += 1) {\n\t\ttokens[i] = parseInt(tokens[i], 10);\n\t};\n\treturn tokens;\n}\n\nfunction main() {\n\tvar data = tokenizeIntegers(readline()),\n\t\tballNum = data[0], colorNum = data[1], ball = data[2],\n\t\tballs = tokenizeIntegers(readline()),\n\t\tmaxDestroyed = 0;\n\tfor (var pos = 1; pos < ballNum; ++pos) {\n\t\tvar countDestroyed = -1,\n\t\t\tdestroy = [];\n\t\tfor (var i = 0; i < ballNum; ++i) {\n\t\t\tif (i == pos) {\n\t\t\t\tdestroy.push(ball);\n\t\t\t}\n\t\t\tdestroy.push(balls[i]);\n\t\t}\n\t\twhile (destroy.length != 0) {\n\t\t\tvar color = destroy[0], count = 1;\n\t\t\tfor (var i = 1; i < destroy.length; ++i) {\n\t\t\t\tif (destroy[i] == color) {\n\t\t\t\t\t++count;\n\t\t\t\t\tif (count == 3) {\n\t\t\t\t\t\tvar begin = i-2, end = i;\n\t\t\t\t\t\twhile (end+1 < destroy.length && destroy[end+1]==color){\n\t\t\t\t\t\t\t++end;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcountDestroyed += end-begin+1;\n\t\t\t\t\t\tvar newDestroy = [];\n\t\t\t\t\t\tfor (var j = 0; j < destroy.length; ++j) {\n\t\t\t\t\t\t\tif (j < begin || j > end) {\n\t\t\t\t\t\t\t\tnewDestroy.push(destroy[j]);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdestroy = newDestroy;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tcolor = destroy[i];\n\t\t\t\t\tcount = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (count < 3) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tmaxDestroyed = Math.max(maxDestroyed, countDestroyed);\n\t}\n\tprint(maxDestroyed);\n}\n\nmain();\n", "src_uid": "d73d9610e3800817a3109314b1e6f88c"}
{"source_code": "var b = readline().split(\" \");\nvar path = 0;\nvar f = 0;\n\tif(+b[0]<+b[1])\n\t{\n\tpath+=+b[0];\n\tif (+b[0]+b[1]*2<+b[2]+Number(b[1]))\n\t\tpath +=+b[0]+b[1]*2;\n\t\telse if (+b[0]+b[2]*2<+b[2]+Number(b[1]))\n\t\tpath += +b[0]+b[2]*2;\n\t\telse \n\t\tpath +=+b[2]+Number(b[1]);\n\t}\n\telse {path+=+b[1];//\n\tif (+b[1]+b[0]*2<+b[2]+Number(b[0]))\n\t\tpath +=+b[1]+b[0]*2;\n\t\telse if (+b[1]+b[2]*2<+b[2]+Number(b[0]))\n\t\tpath += +b[1]+b[2]*2;\n\t\telse \n\t\tpath +=+b[2]+Number(b[0]);\n\t}\n\t\nprint(path);", "src_uid": "26cd7954a21866dbb2824d725473673e"}
{"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;\nlet n, k;\n\nrl.on('line', (d) => {\n if (c === 0) {\n c++;\n [n, k] = d.split(' ').map(Number);\n return;\n }\n\n const arr = d.split(' ').map(Number);\n\n let sum = 0;\n let days = 0;\n while (k > 0 && days < n) {\n sum += arr[days];\n let maxCandies = Math.min(8, sum);\n\n k -= maxCandies;\n sum -= maxCandies;\n days++;\n }\n\n if (k > 0) {\n console.log(-1);\n }\n else {\n console.log(days);\n }\n\n c++;\n});\n", "src_uid": "24695b6a2aa573e90f0fe661b0c0bd3a"}
{"source_code": "var row = readline().split(\" \").map(function(x) { return parseInt(x); });\nvar n = row[0];\nvar k = row[1];\n\nvar a = [];\na = readline().split(\" \").map(function(x) { return parseInt(x); });\n\nvar b = [];\nb = readline().split(\" \").map(function(x) { return parseInt(x); });\n\nvar result = true;\nvar max = 0;\n\n//Check unique\nfor(var i = 0; i < b.length; i++) {\n\tfor(var j = 0; j < a.length; j++) {\n\t\tif(parseInt(b[i]) == parseInt(a[j]))\n\t\t\tresult = false;\n\t}\n}\n\nif(result) {\n\t//Check increase\n\tb.sort();\n\tb.reverse();\n\tvar bNum = 0;\n\n\tfor(var i = 0; i < a.length; i++) {\n\t\tif(parseInt(a[i]) == 0) {\n\t\t\ta[i] = b[bNum];\n\t\t\tbNum++;\n\t\t}\n\t}\n\n\tfor(var i = 0; i < a.length - 1; i++) {\n\t\tif(parseInt(a[i]) > parseInt(a[i+1]))\n\t\t\tresult = false;\n\t}\n\n\tif(!result)\n\t\tprint(\"YES\");\n\telse\n\t\tprint(\"NO\");\n}\n\n\n", "src_uid": "40264e84c041fcfb4f8c0af784df102a"}
{"source_code": "var line=readline().split(\" \");\nn=parseInt(line[0]) - 1;\nm=parseInt(line[1]);\n\na=n%(m-1);\nb=(n-a)/(m-1)*m;\nprint(a+b+1);", "src_uid": "42b25b7335ec01794fbb1d4086aa9dd0"}
{"source_code": "var n = readline();\nvar s = readline().split('').map(Number);\nvar s1 = s.slice(0, n);\nvar s2 = s.slice(n);\ns1.sort((a,b) => a-b);\ns2.sort((a,b) => a-b);\nvar count = 0;\nvar ans = '';\nfor (var i=0; i<n; i++){\n\tif (s1[i] > s2[i]) count++;\n\telse if (s1[i] == s2[i]) ans = 'NO';\n}\nif ((count == 0 || count == n) && ans != 'NO') print ('YES');\n\telse print ('NO');\n", "src_uid": "e4419bca9d605dbd63f7884377e28769"}
{"source_code": "/**\n * Codeforces Challenge #1204B\n * @ennukee\n * \n * Time Elapsed: 5.64ms (test cases)\n */\n\nconst MODE = \"SUBMIT\";\nconst CF_1204_B = (n, l, r) => {\n /**\n * n, n-1, ..., n-l, 2^1, ..., 2^(l-1)\n * 2^1, ..., 2^(r-1), 2^(r-1), ..., 2^(r-1)\n * \n * 5, 2, 3\n * => 1, 1, 1, 2\n * => 1, 2, 4, 4, 4 \n */\n const low_bound = 1 * (n - l + 1) + [...Array(l).keys()].slice(1).reduce((a, c) => a + Math.pow(2, c), 0);\n const high_bound = [...Array(r).keys()].reduce((a, c) => a + Math.pow(2, c), 0) + (n - r) * Math.pow(2, r - 1);\n return `${low_bound} ${high_bound}`;\n}\n\n/**\n * \n * Submission standard input read-in\n * \n */\n\nif (MODE === \"SUBMIT\") {\n var readline = require('readline');\n\n var rl = readline.createInterface({\n input: process.stdin,\n output: process.stdout\n });\n\n rl.question(\"\", function(answer) {\n const parsed = answer.split(' ').map(i => parseInt(i));\n console.log(CF_1204_B(...parsed));\n rl.close();\n });\n}\n\n/**\n * \n * Test cases and benchmarking code below this point\n * \n * Unrelated to the solution code\n * \n */\n\nif (MODE === \"TEST\") {\n const { performance } = require('perf_hooks');\n let timer = performance.now();\n\n // Assumptions:\n // 1 <= n <= 1000\n // 1 <= l <= r <= min(n, 20)\n // [n, l, r]\n const test_cases = [\n [4, 2, 2],\n [5, 1, 5]\n ]\n test_cases.forEach(( v ) => {\n console.log( CF_1204_B( ...v ) );\n });\n\n timer = performance.now() - timer;\n console.log(`Time elapsed for test case: ${timer.toFixed(2)}ms`)\n}", "src_uid": "ce220726392fb0cacf0ec44a7490084a"}
{"source_code": "var s = readline().split(' ');\nvar s1 = readline().split(' ');\nvar x1=s[0], y1=s[1], x2=s[2], y2=s[3], x=s1[0], y=s1[1];\n \nif (Math.abs(y2-y1) % y == 0 && Math.abs(x2-x1) % x == 0 && Math.abs(y2-y1)/y%2 == Math.abs(x2-x1)/x%2){\n print('YES');\n}\nelse {\n print('NO');\n}", "src_uid": "1c80040104e06c9f24abfcfe654a851f"}
{"source_code": "var points = [];\nvar input = readline().split( \" \" ).map( i => parseInt( i, 10 ) );\npoints[ 0 ] = { x: input[ 0 ], y: input[ 1 ] };\ninput = readline().split( \" \" ).map( i => parseInt( i, 10 ) );\npoints[ 1 ] = { x: input[ 0 ], y: input[ 1 ] };\ninput = readline().split( \" \" ).map( i => parseInt( i, 10 ) );\npoints[ 2 ] = { x: input[ 0 ], y: input[ 1 ] };\n\nvar variants = [];\nfor ( var i = 0; i < points.length; ++i ) {\n var anglePoint = points[ i ];\n var nextPoint = points[ (i + 1) % points.length ];\n var shiftPoint = points[ (i + 2) % points.length ];\n var shift = { x: nextPoint.x - anglePoint.x, y: nextPoint.y - anglePoint.y };\n variants.push( { x: shiftPoint.x + shift.x, y: shiftPoint.y + shift.y } );\n}\n\nvar result = \"\";\nfor ( var i = 0; i < variants.length; ++i ) {\n result += variants[ i ].x + \" \" + variants[ i ].y + \"\\n\";\n}\nprint( variants.length );\nprint( result );", "src_uid": "7725f9906a1b87bf4e866df03112f1e0"}
{"source_code": "\"use strict\";\n\nprocess.stdin.resume();\nprocess.stdin.setEncoding(\"utf-8\");\n\nlet inputString = \"\";\nlet currentLine = 0;\n\nprocess.stdin.on(\"data\", (inputStdin) => {\n inputString += inputStdin;\n});\n\nprocess.stdin.on(\"end\", (_) => {\n inputString = inputString\n .trim()\n .split(\"\\n\")\n .map((string) => {\n return string.trim();\n });\n\n main();\n});\n\nfunction readline() {\n return inputString[currentLine++];\n}\n// Make a Snippet for the code above this and then write your logic in main();\n\nfunction main() {\n \n const x = readline()\n .split(\" \")\n .map((x) => +x);\n \n \n\n \n \n \n carrotCakes(x[0],x[1],x[2],x[3]);\n}\n\nfunction carrotCakes(n, t, k, d) {\n\n let t1 = (n * t) / k;\n\n let tt1 = 0;\n let cakesBox2 = 0;\n let ovenTimer11 = 0;\n\n while (cakesBox2 < n) {\n if (ovenTimer11 === t - 1) {\n ovenTimer11 = 0;\n cakesBox2 += k;\n } else {\n ovenTimer11++;\n }\n\n tt1++;\n }\n\n // let t2 = t1 / 2 + d - Math.abs(t - d);\n\n // let k1 = Math.floor(d * k) / t;\n\n // let k1 = (d * k) / t;\n\n // let t2 = ((n - k1) * t) / (2 * k) + d;\n\n // let t2 = d < t ? ((n - k1) * t) / (2 * k) + d : t1 / 2 + d;\n // console.log(t1, t1);\n\n let t2 = 0;\n let cakesBox = 0;\n let ovenTimer1 = 0;\n let ovenTimer2 = 0;\n\n while (cakesBox < n) {\n if (ovenTimer1 === t - 1) {\n ovenTimer1 = 0;\n cakesBox += k;\n } else {\n ovenTimer1++;\n }\n\n if (t2 >= d) {\n if (ovenTimer2 === t - 1) {\n ovenTimer2 = 0;\n cakesBox += k;\n } else {\n ovenTimer2++;\n }\n }\n t2++;\n }\n\n console.log(t2 < tt1 ? \"YES\" : \"NO\");\n}\n", "src_uid": "32c866d3d394e269724b4930df5e4407"}
{"source_code": "var n = parseInt(readline());\n\nprint(Math.round(n / 10) * 10);", "src_uid": "29c4d5fdf1328bbc943fa16d54d97aa9"}
{"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', (str) => {\n let letters = 'abcdefghijklmnopqrstuvwxyz';\n let ans = 0;\n\n for (let i = 0; i < str.length; i++) {\n let c = str[i];\n\n let idx = 0;\n while (letters[idx] !== c) {\n idx = (idx + 1) % 26;\n\n if (letters[idx] === c) {\n ans += Math.min(idx, 26 - idx);\n break;\n }\n }\n\n letters = letters.slice(idx) + letters.slice(0, idx);\n }\n\n console.log(ans);\n});\n", "src_uid": "ecc890b3bdb9456441a2a265c60722dd"}
{"source_code": "function trim(s) {\n\treturn s.replace(/^\\s+|\\s+$/gm, '');\n}\n\nfunction tokenize(s) {\n\treturn trim(s).split(/\\s+/);\n}\n\nfunction tokenizeIntegers(s) {\n\tvar tokens = tokenize(s);\n\tfor (var i = 0; i < tokens.length; i += 1) {\n\t\ttokens[i] = parseInt(tokens[i]);\n\t};\n\treturn tokens;\n}\n\nfunction main() {\n\tvar pointNum = parseInt(readline());\n\tvar points = tokenizeIntegers(readline());\n\n\tfor (var i = 3; i < pointNum; ++i) {\n\t\tvar leftA = Math.min(points[i-1], points[i]),\n\t\t\trightA = Math.max(points[i-1], points[i]);\n\t\tfor (var j = i-2; j > 0; --j) {\n\t\t\tvar leftB = Math.min(points[j-1], points[j]),\n\t\t\t\trightB = Math.max(points[j-1], points[j]);\n\t\t\tif (Math.min(rightA, rightB) <= Math.max(leftA, leftB)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (leftA >= leftB && rightA <= rightB) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (leftB >= leftA && rightB <= rightA) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tprint(\"yes\");\n\t\t\treturn;\n\t\t}\n\t}\n\n\tprint(\"no\");\n}\n\nmain();\n", "src_uid": "f1b6b81ebd49f31428fe57913dfc604d"}
{"source_code": "var s = +readline(),\n max = 0,\n res\n\nfor (var i = 1 ; i < s/2 ; i++) {\n if ((i/(s-i)) > max && pgcd(s-i,i) == 1) {\n max = i/(s-i)\n res = i\n }\n}\n\nprint([res, s-res].join(' '))\n\nfunction pgcd(a, b) {\n if (b === 0) return a\n return pgcd(b,a%b)\n}\n", "src_uid": "0af3515ed98d9d01ce00546333e98e77"}
{"source_code": "var kitten,s=[];\nvar l=readline().split(' ');\nvar F=parseInt(l[0]),I=parseInt(l[1]),T=parseInt(l[2]);\nfor (var i=0;i<F;i++)s[i]=readline();\nvar a=0;\nfor(var j=0;j<I;j++){\nvar c=0;\nfor(i=0;i<F;i++)if(s[i][j]=='Y')c++;\nif(c>=T)a++;\n}\nprint(a);", "src_uid": "4c978130187e8ae6ca013d3f781b064e"}
{"source_code": "var strN = readline(),\n\t\t\tnumN = parseInt(strN);\n\n\t\t\n\t\t\tfor(var i = 1;; i++)\t{\n\t\t\t\tvar temp = numN + i;\n\n\t\t\t\tif(temp.toString().indexOf('8') >= 0)\t{\n\t\t\t\t\tprint(i);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}", "src_uid": "4e57740be015963c190e0bfe1ab74cb9"}
{"source_code": "var getNums = function() {\n\treturn readline().split(' ').map(function(a) {return parseInt(a)});\n};\n\nvar d = getNums();\n\nvar n = d[0];\nvar x1 = d[1];\nvar y1 = d[2];\nvar x2 = d[3];\nvar y2 = d[4];\n\nfunction getZ(x, y, n) {\n\tif (y === 0) {\n\t\tz = x;\n\t} else if(x === n) {\n\t\tz = n + y;\n\t} else if (y == n) {\n\t\tz = 2 * n + (n - x);\n\t} else {\n\t\tz = 3 * n + (n - y);\n\t}\n\treturn z;\n}\n\nvar z1 = getZ(x1, y1, n);\nvar z2 = getZ(x2, y2, n);\n\nvar s1 = Math.abs(z1 - z2);\nvar s2 = Math.min(z1, z2) + 4 * n - Math.max(z1, z2);\n\nprint(Math.min(s1, s2));", "src_uid": "685fe16c217b5b71eafdb4198822250e"}
{"source_code": "var el = readline();\nvar ans = Number( 8 );\nvar num = el[1];\n\nel = el[0];\n\t\nif((num == 1 && el == 'a') || (num == 1 && el =='h') || (num == 8 && el == 'a') || (num == 8 && el =='h'))\n ans -= 5;\nelse if(num == 1 || num == 8 || el == 'a' || el == 'h')\n ans -= 3;\n\t\nprint(ans);\n", "src_uid": "6994331ca6282669cbb7138eb7e55e01"}
{"source_code": "var arr = readline().split(' ');\nvar n = arr[0];\nvar k = arr[1];\n\nvar ans = [];\n\nfor (var i = 2; i * i <= n; ++i) {\n\tvar cnt = 0;\n\t\n\twhile (n % i == 0 && ans.length + 1 < k) {\n\t\tans[ans.length] = i;\n\t\tn /= i;\n\t}\n}\n\nif (n > 1) {\n\tans[ans.length] = n;\n}\n\nif (ans.length != k) {\n\tprint(-1);\n} else {\n\tvar ansstr = ans.join(' ');\n\tprint(ansstr);\n}\n", "src_uid": "bd0bc809d52e0a17da07ccfd450a4d79"}
{"source_code": "\nvar s = readline().split('');\nvar t = readline().split('');\nvar map1 = {\n\ta:0,\n\tb:1,\n\tc:2,\n\td:3,\n\te:4,\n\tf:5,\n\tg:6,\n\th:7\n};\nvar map2 = {\n\t'8':0,\n\t'7':1,\n\t'6':2,\n\t'5':3,\n\t'4':4,\n\t'3':5,\n\t'2':6,\n\t'1':7\n}\ns[0] = map1[s[0]];\ns[1] = map2[s[1]];\nt[0] = map1[t[0]];\nt[1] = map2[t[1]];\n\nvar i=s[0];\nvar j=s[1];\nvar count = 0;\nvar out = []\nwhile(i!=t[0] || j!=t[1]){\n\tvar x1='';\n\tvar x2='';\n\tif(s[0]<t[0]&&i<t[0]){\n\t\tx1='R';\n\t\ti++;\n\t}else if(s[0]>t[0]&&i>t[0]){\n\t\tx1='L';\n\t\ti--;\n\t}\n\tif(s[1]<t[1]&&j<t[1]){\n\t\tx2='D';\n\t\tj++;\n\t}else if(s[1]>t[1]&&j>t[1]){\n\t\tx2='U';\n\t\tj--;\n\t}\n\tcount++;\n\tout.push(x1+x2);\n}\nprint(count);\nout.forEach(function(step){ print(step); });", "src_uid": "d25d454702b7755297a7a8e1f6f36ab9"}
{"source_code": "var g = Number(readline());\n\nvar str = \"\";\nfor(i=1;i<=g;i++){\n str += String(i);\n}\n\nprint(str[g-1]);", "src_uid": "1503d761dd4e129fb7c423da390544ff"}
{"source_code": "let inputString = '';\nlet currentLine = 0;\nprocess.stdin.on('data', data => {\n\tinputString += data;\n});\nprocess.stdin.on('end', function () {\n\tinputString = inputString\n\t\t.trim()\n\t\t.split('\\n')\n\t\t.map(str => str.trim());\n\tmain();\n});\n\nfunction readLine() {\n\treturn inputString[currentLine++];\n}\n\nfunction main() {\n\tconst exp = readLine().split('+').sort().join('+');\n\tconsole.log(exp);\n}\n", "src_uid": "76c7312733ef9d8278521cf09d3ccbc8"}
{"source_code": "var s = readline().split(\" \", 2).map(Number), sum = 0;\nwhile(s[0] > 0 && s[1] > 0 && s[0] + s[1] > 2) {\n if (s[0] > s[1]) {\n s[1]++;\n s[0] -= 2;\n } else {\n s[0]++;\n s[1] -=2;\n }\n sum++;\n}\nprint(sum);", "src_uid": "ba0f9f5f0ad4786b9274c829be587961"}
{"source_code": "print((d=readline())>36?-1:'8'.repeat(d/2)+(d%2?6:''))", "src_uid": "0c9973792c1976c5710f88e3520cda4e"}
{"source_code": "var n = readline();\nvar a = readline();\nvar b = readline();\nvar c = readline();\n\nif ( n <= 1 ) print(0);\nelse if ( n === 2 ) print(Math.min(a,b));\nelse print(Math.min(a,b) + Math.min(a, Math.min(b,c)) * (n-2))\n", "src_uid": "6058529f0144c853e9e17ed7c661fc50"}
{"source_code": "// triangleNumbers[44722] < 10^9 (max input given in problem)\nconst MAX_INPUT_SIZE = 44722;\nconst triangleNumbers = new Array(MAX_INPUT_SIZE);\nvar sum = 0;\n\nfor(var i = 0; i < MAX_INPUT_SIZE; i++){\n sum = sum + i;\n triangleNumbers[i] = sum;\n}\n\nfunction binarySearch(arr, searchVal){\n var low = 0;\n var high = arr.length - 1;\n\n while(low <= high) {\n var midpoint = low + Math.floor((high-low)/2);\n if(arr[midpoint] === searchVal){\n return midpoint;\n }\n else if(arr[midpoint] < searchVal){\n low = midpoint + 1;\n }\n else if(arr[midpoint] > searchVal){\n high = midpoint - 1;\n }\n }\n return -(low + 1);\n}\n\nfunction solution(n){\n // returns how deep in triangleNumbers array to search until\n var limit = Math.abs(binarySearch(triangleNumbers, n));\n\n for(var i = 1 ; i < limit; i++){\n var someIndex = binarySearch(triangleNumbers, n-triangleNumbers[i]);\n if(someIndex > 0) {\n print(\"YES\");\n return;\n }\n }\n print(\"NO\");\n}\n\nconst n = readline();\nsolution(parseInt(n));", "src_uid": "245ec0831cd817714a4e5c531bffd099"}
{"source_code": "function trim(s) {\n\treturn s.replace(/^\\s+|\\s+$/gm, '');\n}\n\nfunction tokenize(s) {\n\treturn trim(s).split(/\\s+/);\n}\n\nfunction tokenizeIntegers(s) {\n\tvar tokens = tokenize(s);\n\tfor (var i = 0; i < tokens.length; i += 1) {\n\t\ttokens[i] = parseInt(tokens[i], 10);\n\t};\n\treturn tokens;\n}\n\nfunction main() {\n\tvar n = parseInt(readline()), apples = tokenizeIntegers(readline()),\n\t\tcounts = { 100: 0, 200: 0 };\n\tfor (var i = 0; i < n; ++i) {\n\t\tcounts[apples[i]] += 1;\n\t}\n\tif (counts[200] % 2 == 0) {\n\t\tprint(counts[100] % 2 == 0 ? \"YES\" : \"NO\");\n\t} else {\n\t\tif (counts[100] < 2) {\n\t\t\tprint(\"NO\");\n\t\t} else {\n\t\t\tprint((counts[100] - 2) % 2 == 0 ? \"YES\": \"NO\");\n\t\t}\n\t}\n}\n\nmain();\n", "src_uid": "9679acef82356004e47b1118f8fc836a"}
{"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 let idx = 1;\n let ans = Infinity;\n\n while (idx < arr.length - 1) {\n let height = -Infinity;\n\n for (let i = 0; i < arr.length - 1; i++) {\n if (idx === i) {\n continue;\n }\n\n const nextItem = i + 1 === idx ? i + 2 : i + 1;\n height = Math.max(height, arr[nextItem] - arr[i]);\n }\n\n ans = Math.min(ans, height);\n idx++;\n }\n\n console.log(ans);\n\n c++;\n});\n", "src_uid": "8a8013f960814040ac4bf229a0bd5437"}
{"source_code": "\"use strict\";\nvar input = '';\nvar inputResolve;\nvar inputPromise = new Promise(resolve => inputResolve = resolve);\nprocess.stdin.on('data', c => input += c);\nprocess.stdin.on('end', () => {\n inputResolve();\n});\n(async () => {\n // var time = Date.now();\n await inputPromise;\n var inputs = input.split(/\\r?\\n/);\n var n = +inputs[0];\n var s = 0;\n for (let i = 1; i <= 1024; i++) {\n if (+i.toString(2) <= n)\n s++;\n }\n console.log(s);\n})();\n", "src_uid": "64a842f9a41f85a83b7d65bfbe21b6cb"}
{"source_code": "var line = readline()\nvar total = [];\nfor (var i = 0; i < line.length; i++) {\n total.push(0);\n}\n\nfunction add(index, v) {\n total[index] += v;\n if (index >= 1) {\n total[index - 1] += v;\n }\n if (index < total.length - 2) {\n total[index + 1] += v;\n }\n}\n\nfor (var i = 0; i < line.length; i++) {\n if (line[i] === 'A') {\n add(i, 1);\n }\n if (line[i] === 'B') {\n add(i, 2);\n }\n if (line[i] === 'C') {\n add(i, 4);\n }\n}\n\nvar ok = false;\n\nfor (var i = 0; i < line.length; i++) {\n if (total[i] === 7) {\n ok = true;\n }\n}\nprint(ok ? 'YES' : 'NO');", "src_uid": "ba6ff507384570152118e2ab322dd11f"}
{"source_code": "var arr = readline().split(' ').map(function (i) {\n return parseInt(i);\n}),\nn = arr[0],\nm = arr[1],\nz = arr[2];\n\nfunction UCLN (a, b) {\n var temp;\n while (b !== 0) {\n temp = a % b;\n a = b;\n b = temp;\n }\n return a;\n\n}\n\nfunction BCNN (x, y) {\n return x * y / UCLN(x, y);\n}\n\nprint(Math.floor(z / BCNN(n, m)));", "src_uid": "e7ad55ce26fc8610639323af1de36c2d"}
{"source_code": "var m = readline().split('');\n\nvar r = 0;\n\nfor (var index in m){\n\t\t\n\tvar i = m[index];\n\n if('0123456789'.indexOf(i) != -1){\n if(i % 2 == 1){\n r++;\n }\n continue;\n }\n \n if('aeiou'.indexOf(i) != -1){\n r++;\n }\n}\n\nprint(r);", "src_uid": "b4af2b8a7e9844bf58ad3410c2cb5223"}
{"source_code": "'use strict'\nconst n = parseInt(readline())\nconst s = readline().split('')\n\nlet out = Array(n).fill(-1)\nlet ok = true\n\nfor (let i = n - 1; i >= 0; --i) {\n if (out[i] === -1) {\n out[i] = 1\n }\n\n for (let j = i - 1; j >= 0; --j) {\n if (s[j] > s[i]) {\n if (out[j] === -1) {\n out[j] = 0\n } else if (out[j] === out[i]) {\n ok = false\n break\n }\n }\n }\n}\n\nprint(ok ? 'YES' : 'NO')\nprint(ok ? out.join(''): '')", "src_uid": "9bd31827cda83eacfcf5e46cdeaabe2b"}
{"source_code": "// My first java script code :D\nif(readline()==2) print(2); else print(1);", "src_uid": "c30b372a9cc0df4948dca48ef4c5d80d"}
{"source_code": "var in1 = readline().split(' ');\nin1.forEach(function(e, i, arr){\n in1[i] = parseInt(e);\n});\nvar in2 = readline().split(' ');\nin2.forEach(function(e, i, arr){\n in2[i] = parseInt(e);\n});\nin1[0] -= in2[0];\nin1[1] -= in2[1];\nin1[2] -= in2[2];\nif(in1[0] > 0) in1[0] = parseInt(in1[0]/2);\nif(in1[1] > 0) in1[1] = parseInt(in1[1]/2);\nif(in1[2] > 0) in1[2] = parseInt(in1[2]/2);\nif(in1[0]+in1[1]+in1[2] >= 0) print(\"YES\");\nelse print(\"NO\");\n", "src_uid": "1db4ba9dc1000e26532bb73336cf12c3"}
{"source_code": "var n = parseInt(readline());\nvar floor = (n / 2) | 0;\nvar ceil = n - floor;\nvar ways = ceil * (ceil + 1 - n % 2);\nprint(ways);", "src_uid": "f8af5dfcf841a7f105ac4c144eb51319"}
{"source_code": "var getVals = function () { return readline().split(' '); };\n\nvar getNums = function () {\n\treturn readline().split(' ').map(function (a) { return parseInt(a) });\n};\n\nvar inp = getNums();\n\nvar igroki = inp.slice(0, 2);\nvar n = inp[2];\n\nfunction gcd(a, b) {\n\tif (a === 0 || b === 0) {\n\t\treturn(Math.max(a, b));\n\t}\n\tfor (var i = Math.min(a, b); i >= 0; i--) {\n\t\tif (a % i === 0 && b % i === 0) {\n\t\t\treturn i;\n\t\t}\n\t}\n}\n\nfunction nextIgrok(a) {\n\treturn a === 0 ? 1 : 0;\n}\n\nfunction printWinner(igrok, n) {\n\tvar min = gcd(igroki[igrok], n);\n\tvar nextIgrokOrWinner = nextIgrok(igrok);\n\tif (min <= n) {\n\t\tn -= min;\n\t\tprintWinner(nextIgrokOrWinner, n)\n\t} else {\n\t\tprint(nextIgrokOrWinner);\n\t\treturn;\n\t}\n}\n\nprintWinner(0, n);", "src_uid": "0bd6fbb6b0a2e7e5f080a70553149ac2"}
{"source_code": "function hasBlackItem(line) {\n var count = 0;\n for(var i = 0; i < line.length; i++) {\n if(line[i] === 'B') {\n count++;\n }\n }\n if(count < 8) {\n return count;\n }\n else {\n return 1;\n }\n}\nvar count = 0;\nvar lineres = 0;\nwhile((lineres = readline())) {\n lineres = hasBlackItem(lineres);\n count += lineres;\n if(lineres > 1) {\n break;\n }\n}\nwhile((lineres = readline())) {\n lineres = hasBlackItem(lineres);\n if(lineres === 1) {\n count++;\n }\n}\nprint(count);", "src_uid": "8b6ae2190413b23f47e2958a7d4e7bc0"}
{"source_code": "print(function() {\n\tvar i, ans = 'YES';\n\tfor (i = 0; i < 8; i++)\n\t\treadline().split('').reduce(function(a, b) {\n\t\t\tif (a === b) ans = 'NO';\n\t\t\treturn b;\n\t\t});\n\treturn ans;\n}());", "src_uid": "ca65e023be092b2ce25599f52acc1a67"}
{"source_code": "n = parseInt(readline());\nfor (var a = 0; a < n/1234567 + 2; a++) {\n\tfor(var b = 0; b < n/123456 + 2; b++){\n\t\tif(n - 1234567*a - 123456*b >= 0 && (n - 1234567*a - 123456*b) % 1234 == 0){\n\t\t\t//print(n - 1234567*a - 123456*b);\n\t\t\tprint(\"YES\");\n\t\t\tquit();\n\t\t};\n\t};\n};\nprint(\"NO\");", "src_uid": "72d7e422a865cc1f85108500bdf2adf2"}
{"source_code": "function trim(s) {\n\treturn s.replace(/^\\s+|\\s+$/gm, '');\n}\n\nfunction tokenize(s) {\n\treturn trim(s).split(/\\s+/);\n}\n\nfunction tokenizeIntegers(s) {\n\tvar tokens = tokenize(s);\n\tfor (var i = 0; i < tokens.length; i += 1) {\n\t\ttokens[i] = parseInt(tokens[i], 10);\n\t};\n\treturn tokens;\n}\n\nfunction solve() {\n\tfunction foundIn(a, b) {\n\t\tvar pos = 0;\n\t\tfor (var i = 0; i < b.length; ++i) {\n\t\t\tif (a.charAt(pos) == b.charAt(i)) {\n\t\t\t\tif (++pos == a.length) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\tvar s = trim(readline()),\n\t\tt = trim(readline());\n\tif (foundIn(t, s)) {\n\t\treturn 'automaton';\n\t}\n\ts = s.split('').sort().join('');\n\tt = t.split('').sort().join('');\n\tif (s == t) {\n\t\treturn 'array';\n\t}\n\tif (foundIn(t, s)) {\n\t\treturn 'both';\n\t}\n\treturn 'need tree';\n}\n\nprint(solve());\n", "src_uid": "edb9d51e009a59a340d7d589bb335c14"}
{"source_code": "// 620B - Brooks Mershon\nfunction segments(r) {\n var a = r[0], b = r[1],\n count = 0,\n digits = [6, 2, 5, 5, 4, 5, 6, 3, 7, 6];\n\n for (var i = a; i <= b; i++) {\n var display = i.toString().split('');\n for (var k = 0; k < display.length; k++) {\n count += digits[display[k]];\n }\n }\n\n return count;\n}\nvar range = readline().split(\" \").map(function(x) { return parseInt(x); });\nprint(segments(range));", "src_uid": "1193de6f80a9feee8522a404d16425b9"}
{"source_code": "var count = readline();\nvar sorted = readline().split(' ').map(s => parseInt(s)).sort((a, b) => {\n return a - b;\n});\n\nvar minSum = 25000;\n\nfor (var first = 0; first < sorted.length; first++) {\n for (var second = first + 1; second < sorted.length; second++) {\n var sum = 0;\n var i = 0;\n while (i < sorted.length) {\n if (i === first || i === second) {\n i++;\n continue;\n }\n\n var next = i + 1;\n while (next === first || next === second) {\n next++;\n }\n\n sum += sorted[next] - sorted[i];\n if (sum >= minSum) {\n break;\n }\n\n i = next + 1;\n }\n\n if (sum < minSum) {\n minSum = sum;\n }\n }\n}\n\nprint(minSum);", "src_uid": "76659c0b7134416452585c391daadb16"}
{"source_code": "'use strict';\nprocess.stdin.resume();\nprocess.stdin.setEncoding('utf-8');\nlet inputString='';\nlet currentLine=0;\nprocess.stdin.on('data',inputStdin=>{\n inputString+=inputStdin;\n});\nprocess.stdin.on('end',_=>{\n inputString=inputString.trim().split(\"\\n\").map(string=>{\n return string.trim();\n });\n main();\n});\nfunction readLine()\n{\n return inputString[currentLine++]; \n}\n\nfunction main()\n{\n const [n,k]=readLine().trim().split(' ').map(a=>{return +(a.trim());});\n let arr=readLine().trim().split(' ').map(a=>{return +(a.trim());});\n let ans=0;\n for(let i=0;i<n;++i)\n {\n if(arr[i]>k)\n {\n break;\n }\n ans++;\n if(i==n-1)\n {\n console.log(ans);\n return;\n }\n }\n for(let i=n-1;i>=0;--i)\n {\n if(arr[i]>k)\n {\n break;\n }\n ans++;\n }\n console.log(ans);\n}", "src_uid": "ecf0ead308d8a581dd233160a7e38173"}
{"source_code": "s=readline()\ns=s.replace(/Danil/g,\"1\")\ns=s.replace(/Olya/g,\"1\")\ns=s.replace(/Slava/g,\"1\")\ns=s.replace(/Ann/g,\"1\")\ns=s.replace(/Nikita/g,\"1\")\nres=0\nfor (i=0;i<s.length;i++)\n{\n if (s[i]=='1')\n {\n res++\n }\n}\nif(res==1)\n print(\"Yes\")\nelse\n print(\"No\")", "src_uid": "db2dc7500ff4d84dcc1a37aebd2b3710"}
{"source_code": "var input = readline().split(' ');\nvar inputString = String(input[0]);\nvar degree = inputString.length;\nvar result = degree === 1 ? 0 : Math.ceil(degree / 2);\nif (result && degree % 2 && !/1/.test(inputString.substring(1))) {\n result -= 1;\n}\nprint(result);", "src_uid": "d8ca1c83b431466eff6054d3b422ab47"}
{"source_code": "// var _i = 0;\n//\n// function readline() {\n// _i ++;\n//\n// switch (_i) {\n// case 1: return '4000 1 2 3';\n// }\n// }\n//\n// function write(value) {\n// console.log(value);\n// }\n\nvar list = readline().split(' ').map(function(currentValue) {\n return parseInt(currentValue);\n});\n\nvar n = parseInt(list[0]);\nvar a = parseInt(list[1]);\nvar b = parseInt(list[2]);\nvar c = parseInt(list[3]);\n\nvar max = 0;\nvar k;\n\nfor (var i = 0; i <= Math.floor(n / a); i ++) {\n for (var j = 0; j <= Math.floor(n / b); j ++) {\n if (n - a*i - b *j >= 0 && (n - a*i - b *j) % c == 0) {\n k = (n - a*i - b *j) / c;\n max = Math.max(max, i + j + k);\n }\n }\n}\n\nwrite(max);\n", "src_uid": "062a171cc3ea717ea95ede9d7a1c3a43"}
{"source_code": "\nvar x = readline().split(\" \").map( function (x) { return parseInt(x); } );\nvar n = 0, ans = -1;\n\nfor (var i = 0, str = readline(); i < str.length; i++)\n if (str.charAt(i) == '1') n++;\n\nfor (var i = 1; i <= n; i++) {\n var nm = parseInt(x[0] / i);\n var cost = (i - x[0] % i) * (x[1] + x[2] * Math.pow(nm - 1, 2)) +\n (x[0] % i) * (x[1] + x[2] * nm * nm);\n if (ans == -1 || cost < ans)\n ans = cost;\n}\n\nprint(ans);\n", "src_uid": "78d013b01497053b8e321fe7b6ce3760"}
{"source_code": "var readline = require('readline');\r\n\r\nvar rl = readline.createInterface({\r\n input: process.stdin,\r\n output: process.stdout\r\n});\r\n\r\nvar lines = [];\r\nlet i = 0;\r\nrl.on('line', (line) => {\r\n lines.push(line);\r\n i++;\r\n if(i>lines[0]){\r\n rl.close();\r\n }\r\n});\r\n\r\nrl.on('close', () => {\r\n for (let i = 1;i<=lines[0];i++){\r\n let g = lines[i];\r\n let e = 0,w=0;\r\n let p = 0;\r\n while(p!=g){\r\n if (p>g)\r\n w++;\r\n else\r\n e++;\r\n p = getP(e,w);\r\n }\r\n console.log(e+w);\r\n }\r\n});\r\nfunction getP (e,w){\r\n return (100*e/(w+e));\r\n}", "src_uid": "19a2bcb727510c729efe442a13c2ff7c"}
{"source_code": "const readline = require('readline')\n\n\nconst rl \t= readline.createInterface({\n\tinput:process.stdin,\n\toutput:process.stdout,\n})\n\nasync function getData() {\n\treturn new Promise((res,rej)=>{\n\t\tlet str = ''\n\t\trl.question(str,ans=>res(ans))\n\t})\n}\n\nfunction count(candies,freinds){\n\n\tlet residue\t=\tcandies%freinds\n\tlet temp\t=\t[]\n\tlet val = Math.floor(candies/freinds)\n\t\n\tfor(let i = 0; i< freinds;i++){\n\t\ttemp.push(val)\n\t}\n\n\tif(residue != 0){\n\t\tlet lengthTemp = temp.length\n\t\tlengthTemp--\n\t\tresidue--\n\t\tfor(let i = residue; i >= 0; i--)\ttemp[lengthTemp-i]++\n\n\t} \n\n\tconsole.info(temp.join(' '))\n\trl.close()\n\n}\n\nasync function main(){\n\tlet data = await getData()\n\n\tdata = data.trim().split(' ').map((el)=>{\n\t\treturn parseInt(el,10)\n\t})\n\n\tcount(...data)\n}\n\nmain()", "src_uid": "0b2c1650979a9931e00ffe32a70e3c23"}
{"source_code": "'use strict'\n\nlet s = readline()\nlet c = +readline()\nlet ms = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\n\nprint(ms[(ms.indexOf(s) + c) % 12])", "src_uid": "a307b402b20554ce177a73db07170691"}
{"source_code": ";(function () {\n\n\tvar n = +readline();\n\tvar a = readline().split(' ').map(Number);\n\n\tfunction finish() {\n\t\tvar f = a[0];\n\t\tfor (var i = 1; i < n; i++) if (a[i] != f) return false;\n\t\treturn true;\n\t}\n\n\twhile (!finish()) {\n\t\tvar min = Math.min.apply(null, a);\n\t\tfor (var i = 0; i < n; i++) {\n\t\t\tif (a[i] / min > 1) a[i] -= Math.floor(a[i] / min) * min;\n\t\t\tif (!a[i]) a[i] = min;\n\t\t}\n\t}\n\n\tprint(a.reduce(function (p, e) { return p + e; }, 0));\n\n}).call(this);", "src_uid": "042cf938dc4a0f46ff33d47b97dc6ad4"}
{"source_code": "var s=readline();\nvar c=\"CODEFORCES\";\nvar ls=s.length;\nvar isok=false;\nfor(var i=0;i<ls;i++){\n for(var j=i+1;j<ls+1;j++){\n\tif(s.substring(0,i)+s.substring(j) == c){\n\t isok=true;\n\t}\n }\n}\nprint(isok?\"YES\":\"NO\");\n", "src_uid": "bda4b15827c94b526643dfefc4bc36e7"}
{"source_code": "// Alternative\n// https://www.npmjs.com/package/competitive-programming-js\n\"use strict\"\n\nprocess.stdin.resume();\nprocess.stdin.setEncoding('utf-8');\nlet inputString = '';\nlet currentLine = 0;\nprocess.stdin.on('data', inputStdin => { inputString += inputStdin; });\nprocess.stdin.on('end', _ => {\n inputString = inputString.trim().split('\\n').map(string => {\n return string.trim();\n });\n main();\n});\nfunction input() { return inputString[currentLine++]; }\nconst println = (x = \"\") => process.stdout.write(String(x) + \"\\n\");\nconst print = x => { process.stdout.write(String(x)); }\n// >>>>>>>>>>>>> Main starts here <<<<<<<<<<<<<<\n\nfunction main() {\n let n = input();\n if (n[0] === '-') {\n if (n.length >= 3) {\n if (parseInt(n[n.length-1]) > parseInt(n[n.length-2])) {\n n = n.substr(0, n.length-1);\n } else {\n n = n.substr(0, n.length-2) + n[n.length-1];\n }\n } else {\n\n }\n };\n n = parseInt(n);\n println(n);\n}\n", "src_uid": "4b0a8798a6d53351226d4f06e3356b1e"}
{"source_code": "var arr=[];\nvar str=readline().split(\" \");\nfor(var i in str){\n\tarr.push(Number(str[i]));\n}\nvar fin=new Array(10);\nfor(var i=0;i<fin.length;i++){\n\tfin[i]=0;\n}\narr.forEach(function(i){\n\tfin[i]++;\n});\nvar tani=false;\nvar spilo=false;\nvar datvi=false;\nfor(var i=0;i<fin.length;i++){\n\tif(fin[i]>=4){\n\t\ttani=true;\n\t}\n\tif(fin[i]==2){\n\t\tspilo=true;\n\t}\n\tif(fin[i]==1){\n\t\tdatvi=true;\n\t}\n}\nif(tani){\n\tif(datvi)\n\t\tprint(\"Bear\");\n\telse\n\t\tprint(\"Elephant\");\n}else{\n\tprint(\"Alien\");\n}", "src_uid": "43308fa25e8578fd9f25328e715d4dd6"}
{"source_code": "process.stdin.setEncoding('utf-8')\r\nconst readline = require('readline')\r\n\r\nconst rl = readline.createInterface({\r\n input: process.stdin,\r\n output: process.stdout\r\n }\r\n)\r\n\r\nlet count = 1\r\nlet inputArr = []\r\n\r\nrl.on('line', data => {\r\n if (count === -1) {\r\n count = +data\r\n } else if (count !== 0) {\r\n inputArr.push(data.trim())\r\n count--\r\n }\r\n // max number 2^(53) - 1 ~~ 10^(15)\r\n if (count === 0) {\r\n main()\r\n process.exit(0)\r\n }\r\n})\r\n\r\nfunction main() {\r\n let num = Number(inputArr[0]), sum = num\r\n while (num >= 10) {\r\n sum = 0\r\n while (num > 0) {\r\n sum += num % 10\r\n num = Math.floor(num / 10)\r\n }\r\n num = sum\r\n }\r\n console.log(sum)\r\n}", "src_uid": "477a67877367dc68b3bf5143120ff45d"}
{"source_code": "/* TEST CASE\ninput\n6\nURLLDR\noutput\n2\ninput\n4\nDLUU\noutput\n0\ninput\n7\nRLRLRLR\noutput\n12\n */\nfunction main() {\n\tvar n = parseInt(readline());\n\tvar s = readline();\n\tvar answer = 0;\n\t\n\tfor (var i = 0; i < n; i++) {\n\t\tvar x = 0;\n\t\tvar y = 0;\n\t\tfor (var j = i; j < n; j++) {\n\t\t\tvar c = s.charCodeAt(j);\n\t\t\tif (c == 0x55 /*'U'*/) {\n\t\t\t\ty--;\n\t\t\t} else if (c == 0x44 /*'D'*/) {\n\t\t\t\ty++\n\t\t\t} else if (c == 0x4C /*'L'*/) {\n\t\t\t\tx--;\n\t\t\t} else if (c == 0x52 /*'R'*/) {\n\t\t\t\tx++;\n\t\t\t}\n\t\t\tif (x == 0 && y == 0) {\n\t\t\t\tanswer++;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tprint(answer);\n}\n\nmain();", "src_uid": "7bd5521531950e2de9a7b0904353184d"}
{"source_code": "process.stdin.resume();\nprocess.stdin.setEncoding('utf-8');\n\nlet inputString = '';\nlet currentLine = 0;\n\nprocess.stdin.on('data', inputStdin => {\n inputString += inputStdin;\n});\n\nprocess.stdin.on('end', _ => {\n inputString = inputString.trim().split('\\n').map(string => {\n return string.trim();\n });\n \n B();\n});\n\nfunction readline() {\n return inputString[currentLine++];\n}\n\nfunction pi(a) {\n return parseInt(a);\n}\n\nfunction ti(a){\n for(let i = 0; i < a.length; i++)\n a[i] = pi(a[i]);\n\n return a;\n}\n\nfunction A(){\n let t = pi(readline());\n while(t > 0){\n t--;\n let n = pi(readline());\n let ans = '';\n for(let i = 0; i < n; i++){\n ans += '1 ';\n }\n console.log(ans);\n }\n}\n\nfunction B(){\n let t = pi(readline());\n while(t > 0){\n t--;\n let n = pi(readline());\n\n if(n%2===0){\n console.log(n/2, n/2);\n continue;\n }\n\n let sq = Math.floor(Math.sqrt(n));\n let min = 999999999999999;\n let minPair = [];\n for(let i = 1; i <= sq; i++){\n if(n % i === 0){\n let j = n/i;\n let x = n-i;\n let y = n-j;\n\n if(x % i === 0){\n if(min > Math.max(x,i)){\n min = Math.max(x,i);\n minPair = [i,x]\n }\n }\n\n if(y % j === 0){\n if(min > Math.max(j,y)){\n min = Math.max(j,y);\n minPair = [j,y]\n }\n }\n }\n }\n console.log(minPair[0], minPair[1]);\n }\n}\n\nfunction C(){\n let t = pi(readline());\n while(t > 0){\n t--;\n let n = pi(readline());\n let a = ti(readline().split(' '));\n let map = new Array(600000);\n\n let b = JSON.parse(JSON.stringify(a));\n b.sort((a,b) => a-b);\n for(let i = 0; i < n; i++)\n map[b[i]] = i;\n\n let preCount = 0;\n let count = 0;\n let flag = false;\n for(let i = 0; i < n; i++){\n if(i === map[a[i]]){\n if(preCount === 1){\n if(!flag)\n count += 1;\n flag = true;\n }else if(preCount !== 0){\n count += 1;\n preCount = 0;\n }\n }else{\n preCount += 1;\n flag = false;\n }\n }\n console.log(count);\n }\n}\n", "src_uid": "3fd60db24b1873e906d6dee9c2508ac5"}
{"source_code": "var input = readline().split(' ');\nvar maxNumber = parseInt(input[0]);\nvar selectedByMisha = parseInt(input[1]);\nvar numbersToTheRightOfMisha = maxNumber - selectedByMisha;\nif (maxNumber == 1) {\n\tprint(1);\n}\nelse if (numbersToTheRightOfMisha > selectedByMisha - 1) {\n\tprint(selectedByMisha + 1);\n} else {\n\tprint(selectedByMisha - 1);\n}", "src_uid": "f6a80c0f474cae1e201032e1df10e9f7"}
{"source_code": "function main()\n{\n var n, m;\n\n var rr = readline().split(' ');\n\n n = parseInt(rr[0]);\n m = parseInt(rr[1]);\n\n var l = 0;\n\n while( m!=n)\n {\n if(m>n)\n {\n if(m%2==0) \n {\n m/=2;\n }\n else\n {\n m++;\n }\n l++;\n }\n else\n { \n l = l+(n-m);\n m = n;\n }\n }\n\n print(l);\n}\n\nmain();", "src_uid": "861f8edd2813d6d3a5ff7193a804486f"}
{"source_code": "(function() {\nvar INPUT = ``;\nvar OUTPUT = ``;\n \nvar main = function() {\"use strict\";\n // TODO\n var input = rdArN();\n var n = input[0];\n var k = input[1];\n var A = rdArN();\n \n var M = {0: []};\n for (var i = 0; i < n; ++i) {\n var a = A[i];\n var pr = 0;\n while (a > 0) {\n if (!M[a]) {\n M[a] = [];\n }\n M[a].push(pr);\n \n a = (a >> 1);\n ++pr;\n }\n M[0].push(pr);\n }\n //prOb(M)\n //return;\n var res = Infinity;\n for (var key in M) {\n //print(key)\n var ar = M[key];\n //print(ar.length, k)\n if (ar.length >= k) {\n var fullPrice = 0;\n ar.sortLt();\n for (var i = 0; i < k; ++i) {\n fullPrice += ar[i];\n }\n res = Math.min(res, fullPrice);\n }\n }\n print(res);\n};\n \nif(INPUT){INPUT=INPUT.split('\\n').reverse();\nreadline=()=>INPUT.pop();\nwrite=(...s)=>{OUTPUT+=[...s].join(' ')};\nprint=(...s)=>{write(...s);OUTPUT+='\\n'};}\nconst\nrdS=readline,\nrdN=()=>+rdS(),\nrdArS=()=>rdS().split(' '),\nrdArN=()=>rdArS().map(v=>+v),\nwr=write,\npr=print,\nprAr=(a)=>pr(...a),\nprOb=(o)=>pr(JSON.stringify(o,null,4)),\ncrAr=function(length,...fillArgs){return new Array(length).fill(...fillArgs);},\ngetPrimes=function(n){var sieve=crAr(n+1,true),primes=[],i,j;for(i=2,j=4;j<sieve.length;j=Math.pow(++i,2)){if(sieve[j]){for(;j<sieve.length;j+=i){sieve[j]=false;}}}for(i=2;i<sieve.length;++i){if(sieve[i]){primes.push(i);}}return primes;},\ngetPrimeFactors=function(n){var primes=getPrimes(Math.floor(Math.sqrt(n))),last=primes.push(n)-1,factors=[],i,p;for(i=0,p=primes[0];primes[last]>1;){if(primes[last]%p===0){primes[last]/=p;factors.push(p);}else{p=primes[++i];}}return factors;},\ndefineProperty=(o,pN,v)=>Object.defineProperty(o,pN,{value:v,writable:true,enumerable:false,configurable:true});\ndefineProperty(Array.prototype,'sortLt',function(){return this.sort((a,b)=>a-b);});\ndefineProperty(Array.prototype,'sortGt',function(){return this.sort((a,b)=>b-a);});\n \nmain();\nreturn OUTPUT;\n})();", "src_uid": "ed1a2ae733121af6486568e528fe2d84"}
{"source_code": "var s = readline().split(' ').map(Number).sort((a,b)=>a-b);\nvar m = (x,y)=>{var fun =(a)=>{var r=2*Math.floor(a/3); if (a%3==2){r++;} return r}; if (x<y) {var mi =Math.min(y-x,x); return (mi+fun(x-mi));} else {return fun(x);}};\nvar p = m.apply(null,s);\nprint(p);", "src_uid": "0718c6afe52cd232a5e942052527f31b"}
{"source_code": "var nums = readline().split(' ').map(function(x) { return parseInt(x); });\nvar first = (nums[0] -nums[2])\nvar second = (nums[1] - nums[2])\nvar cel = (first + second + nums[2])\n\nprint((first < 0 || second < 0) ? -1 : nums[3] > cel ? nums[3] - cel : -1 )", "src_uid": "959d56affbe2ff5dd999a7e8729f60ce"}
{"source_code": "var n = Number(readline());\nvar p = readline().split(' ').map(Number);\n\n// let n = 6;\n// let p = [1, 2, 6];\n\n// var n = 10;\n// var p = new Array(50).fill(0);\n\n// p = p.map(function(x, i) {\n// \treturn Number(i*2 + 2);\n// })\n\nvar b = 0,\n\tw = 0;\n\np.sort(function(a, b) {\n\treturn a - b;\n}).map(function(p, j) {\n\tb += Math.abs(p - ((j + 1)*2 - 1));\t\n\tw += Math.abs(p - (j + 1)*2);\n})\n\n// console.log(b > w ? w : b);\n\nprint(b > w ? w : b);", "src_uid": "0efe9afd8e6be9e00f7949be93f0ca1a"}
{"source_code": "var n = Number(readline());\nvar s = readline();\nvar a = [\"vaporeon\", \"jolteon\", \"flareon\", \"espeon\", \"umbreon\", \"leafeon\", \"glaceon\", \"sylveon\"];\nfor (var i = 0; i < 8; i++) {\n var t = false;\n if (a[i].length !== n) continue;\n for (var j = 0; j < n; j++) {\n if (s[j] !== '.' && s[j] !== a[i][j]) break;\n if (j === n - 1) {\n print(a[i]);\n t = true;\n }\n }\n}\n", "src_uid": "ec3d15ff198d1e4ab9fd04dd3b12e6c0"}
{"source_code": "const len = parseInt(readline());\nconst numbers = readline().split(\" \").map( x => parseInt(x));\n\nconst dict = {};\nconst sortable = [];\n\nnumbers.forEach((x, i) => {\n dict[x] = i;\n});\n\nfor (var x in dict) {\n sortable.push([x, dict[x]]);\n}\n\nvar sorted = sortable.sort(function(a, b) {\n return a[1] - b[1];\n});\n\nconst res = sorted.map( x => parseInt(x[0])).join(\" \");\n\nprint(sorted.length);\nprint(res);\n", "src_uid": "1b9d3dfcc2353eac20b84c75c27fab5a"}
{"source_code": "readline();\nvar a = readline().split( \" \" ).map( i => parseInt( i, 10 ) );\nvar i,\n sum,\n answer;\nsum = 0;\nfor ( i = 0; i < a.length; ++i ) {\n sum += a[ i ];\n}\n\nif ( sum != 0 ) {\n answer = \"YES\\n1\\n1 \" + a.length;\n} else {\n for ( i = 0; i < a.length && a[ i ] === 0; ++i ) { }\n if ( i != a.length ) {\n ++i;\n answer = \"YES\\n2\\n1 \" + i + \"\\n\" + (i + 1) + \" \" + a.length;\n } else {\n answer = \"NO\";\n }\n}\n\nprint( answer );", "src_uid": "3a9258070ff179daf33a4515def9897a"}
{"source_code": "\nfunction main() {\n\n var arr = readline().split(' ').map(Number);\n\n var k = arr[0], a = arr[1], b = arr[2], v = arr[3];\n\n var max_nuts = k * v;\n var res = 0;\n if (b < k - 1) {\n var remain = a - (b + 1) * v;\n res++;\n while (remain >= v) {\n remain -= v;\n res++;\n }\n if (remain > 0) {\n res++;\n }\n } else if (b >= k - 1) {\n\n if (Math.ceil(a / max_nuts) <= Math.floor(b / (k - 1))){\n res = Math.ceil(a / max_nuts);\n } else {\n\n\n var full_boxes = Math.floor(b / (k - 1));\n res += full_boxes;\n var left = a - full_boxes * max_nuts;\n var left_divisor = b - full_boxes * (k - 1);\n if (left_divisor > 0) {\n left = left - (left_divisor + 1) * v;\n res++;\n }\n\n while (left >= v) {\n left -= v;\n res++;\n }\n\n if (left > 0) {\n res++;\n }\n }\n }\n\n print(res);\n\n}\n\nmain();", "src_uid": "7cff20b1c63a694baca69bdf4bdb2652"}
{"source_code": "var input = readline().split(' ').map(Number);\n\nvar n = input[0];\nvar a = input[1] % n;\nvar b = (input[2] % n + n) % n;\n\nvar k = (b + a) % n;\n\nif (k === 0) {\n\tk = n;\n}\n\nprint(k);", "src_uid": "cd0e90042a6aca647465f1d51e6dffc4"}
{"source_code": "//var input = readline()\n\nvar ar = readline().split(' ').map(x => parseInt(x));\nvar a = ar[0], b = ar[1];\n\n\nif(a < b && Math.abs(a-b) == 1) {\n print(a +' '+ b);\n}\nelse if(a == 9 && b == 1) {\n print(9 +' '+ 10);\n}\nelse print(a == b ? a+'1' +' '+ b+'2' : -1);\n\n//", "src_uid": "3eff6f044c028146bea5f0dfd2870d23"}
{"source_code": "const readline = require('readline');\n\nconst rl = readline.createInterface({\n input: process.stdin,\n output: process.stdout\n});\n\n/*\n 012345678910\nstr = \"abcdZZZefgh\"\n\nstrart = 4\nlen = 3\n\n 012345\ninput=\"///one\"\n 01234\ninput=\"//one\"\n*/\nvar eraseAt = function (str, start, len) {\n return str.substring(0, start) + str.substring(start + len);\n}\n\nrl.on('line', (input) => {\n /*\n method I.\n for(let i=0; i<input.length-1; i++){\n if(input[i]=='/' && input[i+1]=='/'){\n input=eraseAt(input, i, 1);\n i--; \n } \n }\n \n if(input.length > 1 && input[input.length-1] == '/')\n input = eraseAt(input ,input.length-1, 1);\n \n console.log(input);\n rl.close();\n */\n let ans = \"\", len = input.length, met = false;\n for (let i = 0; i < len - 1; i++) {\n if (input[i] == '/' && input[i + 1] != '/')\n ans += '/';\n else if (input[i] != '/') {\n ans += input[i];\n met = true;\n }\n }\n if (!met || input[len - 1] != '/')\n ans += input[len - 1];\n\n console.log(ans);\n \n rl.close();\n});", "src_uid": "6c2e658ac3c3d6b0569dd373806fa031"}
{"source_code": "var numbers = readline().split(' ');\nvar a = numbers[0];\nvar b = numbers[1];\nvar c = numbers[2];\n \na = parseInt(a);\nb = parseInt(b);\nc = parseInt(c);\n \n \nif(b+c<a && a>b){print('+')}\nelse if(a<b && a+c<b){print('-')} \n else if( c>0 || b+c<a || a+c<b || a===b && b+c===a && a+c===b && a===b===c){print('?')} \n else if(a===b && a>=c && b>=c){print('0')}\n \n else print('?')", "src_uid": "66398694a4a142b4a4e709d059aca0fa"}
{"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 const [s, v1, v2, t1, t2] = d.split(' ').map(Number);\n const p1 = 2 * t1 + s * v1;\n const p2 = 2 * t2 + s * v2;\n\n if (p1 < p2) {\n console.log('First');\n }\n else if (p1 > p2) {\n console.log('Second');\n }\n else {\n console.log('Friendship');\n }\n});\n", "src_uid": "10226b8efe9e3c473239d747b911a1ef"}
{"source_code": "var a = readline().split(' ');\n\nvar count = Number(a[0]);\nvar place = Number(a[1]);\nvar diff = place > count / 2 ? count - place : place - 1;\n\nprint(count*2 + 1 + count - 1 + diff)", "src_uid": "24b02afe8d86314ec5f75a00c72af514"}
{"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 const obj = {\n 0: 0,\n 1: 4,\n 2: 4,\n 3: 4,\n 4: 4,\n 5: 4,\n 6: 4,\n 7: 4,\n 8: 4,\n 9: 4,\n 10: 15,\n 11: 4\n };\n\n const r = +d - 10;\n console.log(obj[r] || 0);\n});\n", "src_uid": "5802f52caff6015f21b80872274ab16c"}
{"source_code": "var input = readline().split(\" \"), n = +input[0], a = +input[1], b = +input[2],\ncnt = 0;\n\nfor(i = 1; i <= n; i++){\n\tif((n-i >= a) && (i-1 <= b)){\n\t\tcnt++;\n\t}\n}\n\nwrite(cnt);", "src_uid": "51a072916bff600922a77da0c4582180"}
{"source_code": "const readline = require('readline');\nconst rl = readline.createInterface({input: process.stdin});\nlet input = [];\nrl.on('line', function (line) {input.push(line);});\nrl.on('close', function() {\n input.forEach((row, index) => {\n input[index] = row.split(' ').map(i => Number(i));\n })\n \n let matrix = [[1,1,1], [1,1,1], [1,1,1]];\n \n \n for(let i = 0; i < input.length; i++) {\n for(let j = 0; j < input[i].length; j++) {\n if (input[i][j] != 0) {\n for (let n = 0; n < input[i][j]; n++) {\n matrix[i][j] = (matrix[i][j]) ? 0 : 1;\n \n // top\n if (matrix[i-1]) matrix[i-1][j] = (matrix[i-1][j]) ? 0 : 1;\n // bottom\n if (matrix[i+1]) matrix[i+1][j] = (matrix[i+1][j]) ? 0 : 1;\n \n // left\n if (matrix[j-1]) matrix[i][j-1] = (matrix[i][j-1]) ? 0 : 1;\n // right\n if (matrix[j+1]) matrix[i][j+1] = (matrix[i][j+1]) ? 0 : 1;\n }\n }\n }\n }\n \n let result = ''\n matrix.forEach((row) => result += row.join('') + '\\n');\n \n console.log(result);\n \n});\n\n", "src_uid": "b045abf40c75bb66a80fd6148ecc5bd6"}
{"source_code": "X=readline().split(' ').map(Number)\nn=X[0],x=X[1]\nA=0\nfor (i=1;i<=n;++i) {\n if (x % i == 0 && x/i<=n) A++\n}\nprint(A)\n", "src_uid": "c4b139eadca94201596f1305b2f76496"}
{"source_code": "function myFunc(n) {\n var result = n/3;\n result = parseInt(result);\n result *= 2;\n var ostatok = n%3;\n\n switch (ostatok) {\n case 1:\n case 2:\n result += 1;\n break;\n case 3:\n result += 2;\n }\n return result;\n}\n\n\nprint(myFunc(readline()));", "src_uid": "a993069e35b35ae158d35d6fe166aaef"}
{"source_code": "\nvar n=parseInt(readline());\nvar s=\"\";\nfor (var i =1;i<=n;i++) {\n\ts=s.concat(i);\n}print(s.charAt(n-1));", "src_uid": "2d46e34839261eda822f0c23c6e19121"}
{"source_code": "var line = readline().split(\" \"),\n digits = [],\n a = line[0],\n count = a.length,\n maxDigit = count-1, // \u043a\u0440\u0430\u0439\u043d\u0435\u0435 \u0447\u0438\u0441\u043b\u043e \u0441 \u043a\u043e\u0442\u043e\u0440\u043e\u0433\u043e \u043d\u0430\u0434\u043e \u043d\u0430\u0447\u0430\u0442\u044c\n countD = 0,\n newLine = a.split(\"\"); \n\n\nfunction sumDigits(number) {\n var s = 0;\n for (var c in number) {\n s += +number[c];\n }\n return s;\n};\n\ndigits.push(a);\nwhile (countD < count) {\n for (var i = 0; i < count; i++) { \n newLine[maxDigit] = 9; // \u0437\u0430\u043c\u0435\u043d\u0438\u043b\u0438 \u043d\u0430 9 \u0442\u0435\u043a\u0443\u0449\u0443\u044e 48 -> 49\n countD++; // \u0441\u0447\u0451\u0442\u0447\u0438\u043a \u0434\u0435\u0432\u044f\u0442\u043e\u043a\n newLine[(maxDigit-1)] = (new Number(newLine[maxDigit - 1]) > 0 ? --newLine[maxDigit - 1] : 0); // 49 -> 39\n --maxDigit; // \u043f\u0435\u0440\u0435\u0448\u043b\u0438 \u043e\u0442 \u043a\u0440\u0430\u0439\u043d\u0435\u0433\u043e \u0447\u0438\u0441\u043b\u0430 \u043a \u0441\u043b\u0435\u0434\u0443\u044e\u0449\u0435\u043c\u0443 \u0441 \u043a\u0440\u0430\u044f\n var n = newLine.join(\"\");\n (n <= line ? digits.push(n.replace(/^0+/img, \"\")) : \"\");\n }\n}\n\nvar max = sumDigits(digits[0]), maxValue = digits[0];\nfor (var i = 1, l = digits.length; i < l; ++i) {\n var item = sumDigits(digits[i]);\n if (max < item) {\n max = item;\n \n maxValue = digits[i];\n }\n}\n\nprint(maxValue);", "src_uid": "e55b0debbf33c266091e6634494356b8"}
{"source_code": "const readline = require('readline')\n\nconst rl = readline.createInterface({\n input: process.stdin,\n output: process.stdout\n})\nconst lines = []\nrl.on('line', (input) => {\n lines.push(input);\n})\nrl.on('close', () => {\n// (function() {\n // const lines = require('fs').readFileSync('test.in', 'utf8').split('\\n')\n let l = 0;\n let t = 1//+lines[l++]\n const output = []\n for (let i = 0; i < t; i++) {\n const n = +lines[l++]\n output[i] = solve(n)\n }\n console.log(output.join('\\n'))\n// })()\n})\n\nfunction solve(n) {\n return 2 - n * n\n}\n", "src_uid": "f76005f888df46dac38b0f159ca04d5f"}
{"source_code": "var arr = readline().split(' ').map(item => +item);\nvar n = arr[0]; k = arr[1];\nvar i = 0;\nvar sum = 0;\n\nwhile(n > 0) {\n i++;\n n--;\n sum += i;\n if(sum >= k && n === sum - k) {\n break;\n }\n}\n\nprint(n);", "src_uid": "17b5ec1c6263ef63c668c2b903db1d77"}
{"source_code": "'use strict'\n\nconst {EOL} = require('os')\n\nlet ipt = ''\nprocess.stdin.on('data', s => ipt += s)\nprocess.stdin.on('end', () => {\n let [p1, p2, p3, p4, a, b] = ipt.split(EOL)[0].split(' ').map(v => parseInt(v))\n let c = 0\n for (let i = a; i <= b; i++) {\n i % p4 % p3 % p2 % p1 == i && c++\n }\n\n console.log(c)\n})", "src_uid": "63b9dc70e6ad83d89a487ffebe007b0a"}
{"source_code": "var numBooks = parseInt(readline(), 10);\n\nvar numTmp = numBooks;\nvar maxDigits = 1;\nwhile ((numTmp = (numTmp / 10)) >= 1) {\n\tmaxDigits++;\n}\n\nvar numDigits = 0;\n\nfor (var i = 1; i < maxDigits; i++) {\n\tvar range = Math.pow(10, i) * 0.9;\n\tnumDigits += range * i;\n}\n\nnumDigits += (numBooks - (Math.pow(10, maxDigits - 1) - 1)) * maxDigits;\n\nprint(numDigits);\n", "src_uid": "4e652ccb40632bf4b9dd95b9f8ae1ec9"}
{"source_code": "n = +readline();\nif (n < 10){\n print(n);\n} else {\n ar = (n+'').split('').map(Number);\n acc = 9;\n digit = 1;\n while (acc < n){\n acc *= 10;\n acc += 9;\n digit++;\n }\n if (acc === n){\n print(digit*9);\n } else {\n acc = ar[0]-1;\n digit--;\n while (digit-->0){\n acc *= 10;\n acc +=9;\n }\n sum = 0;\n ((n - acc)+'').split('').map(Number).forEach(x=>sum+=x);\n (acc+'').split('').map(Number).forEach(x=>sum+=x);\n print(sum);\n }\n}", "src_uid": "5c61b4a4728070b9de49d72831cd2329"}
{"source_code": "const DEBUG = false;\nconst { EOL } = require('os');\nconst fs = require('fs');\n\nlet r = process.stdin;\nif (DEBUG) {\n r = fs.createReadStream('input');\n}\nlet data = '';\nr.on('data', c => (data += c));\nr.on('end', () => {\n const lines = data.split(EOL);\n let arr = [];\n let d;\n [arr[0], arr[1], arr[2], d] = lines[0].split(' ');\n arr[0] = parseInt(arr[0]);\n arr[1] = parseInt(arr[1]);\n arr[2] = parseInt(arr[2]);\n d = parseInt(d);\n arr = arr.sort(function(a, b) {\n return a - b;\n });\n let res = Math.max(0, d - (arr[1] - arr[0]));\n res += Math.max(0, d - (arr[2] - arr[1]));\n console.log(res);\n});\n", "src_uid": "47c07e46517dbc937e2e779ec0d74eb3"}
{"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", "src_uid": "7336b8becd2438f0439240ee8f9610ec"}
{"source_code": "function trim(s) {\n\treturn s.replace(/^\\s+|\\s+$/gm, '');\n}\n\nfunction tokenize(s) {\n\treturn trim(s).split(/\\s+/);\n}\n\nfunction tokenizeIntegers(s) {\n\tvar tokens = tokenize(s);\n\tfor (var i = 0; i < tokens.length; i += 1) {\n\t\ttokens[i] = parseInt(tokens[i]);\n\t};\n\treturn tokens;\n}\n\nfunction main() {\n\tvar pans = readline().trim().split('|');\n\tvar left = pans[0], right = pans[1];\n\tvar leftLen = left.length, rightLen = right.length;\n\tvar spare = readline().trim(), spareLen = spare.length;\n\tif ((leftLen + rightLen + spareLen) % 2 == 1) {\n\t\tprint(\"Impossible\");\n\t}\n\telse if (Math.abs(leftLen - rightLen) > spareLen) {\n\t\tprint (\"Impossible\");\n\t}\n\telse {\n\t\tif (leftLen < rightLen) {\n\t\t\tleft += spare.substring(0, rightLen-leftLen);\n\t\t}\n\t\telse {\n\t\t\tright += spare.substring(0, leftLen-rightLen);\n\t\t}\n\t\tspare = spare.substring(Math.abs(leftLen-rightLen));\n\t\tif (spare.length > 0) {\n\t\t\tleft += spare.substring(0, spare.length/2);\n\t\t\tright += spare.substring(spare.length/2);\n\t\t}\n\t\tprint(left+'|'+right);\n\t}\n}\n\nmain();\n", "src_uid": "917f173b8523ddd38925238e5d2089b9"}
{"source_code": "const {EOL} = require('os')\n\nlet ipt = ''\nprocess.stdin.on('data', s => ipt += s)\nprocess.stdin.on('end', () => {\n let [h, m] = ipt.split(EOL).slice(0, -1)[0].split(':').map(v => parseInt(v))\n if (h >= 12) h -= 12\n\n let y = m * 6\n let x = h * 30 + y / 12\n\n console.log(x, y)\n})", "src_uid": "175dc0bdb5c9513feb49be6644d0d150"}
{"source_code": "const readLine = require('readline').createInterface({\n input: process.stdin,\n output: process.stdout,\n});\nconst input = [];\nreadLine.on('line', line => input.push(line));\n\nreadLine.on('close', () => {\n const nums = input[0].split(' ').map(x => parseInt(x));\n let [k, n, w] = nums;\n let realSum = 0, i = 1;\n \n while (w > 0) {\n realSum += k*i;\n i += 1; w -= 1;\n }\n\n if (n >= realSum) console.log(0)\n else console.log(realSum - n);\n});", "src_uid": "e87d9798107734a885fd8263e1431347"}
{"source_code": "var n = +readline(),\n\tc = ('0 ' + readline()).split(' ').map(Number),\n\tx, y;\n\nreadline().split(' ').map(Number).reduce(function(a, b) {\n\tx = a;\n\ty = b;\n});\n\nvar sum = c.reduce(function(a, b) {\n\treturn a + b;\n});\n\nprint(function() {\n\tvar b = 0;\n\tfor (var i = 1; i <= n; i++) {\n\t\tif (b >= x && b <= y && sum - b >= x && sum - b <= y) {\n\t\t\treturn i;\n\t\t}\n\t\tb += c[i];\n\t}\n\treturn 0;\n}());", "src_uid": "e595a1d0c0e4bbcc99454d3148b4557b"}
{"source_code": "function zeros(num) {\n var z = 1;\n while (num % 10 === 0) {\n z *= 10;\n num /= 10;\n }\n\n return z;\n}\n\n\n\nvar inp = readline().split(' '), n = parseInt(inp[0]), k = Math.pow(10, parseInt(inp[1])), x = n, zerosx = zeros(x);\n\nwhile (zerosx < k) {\n if ((x / zerosx) % 10 === 5) {x *= 2}\n else if (((x / zerosx) % 10) % 2 == 0) {x *= 5}\n else {x *= 10}\n \n zerosx = zeros(x)\n}\n\nprint(x);", "src_uid": "73566d4d9f20f7bbf71bc06bc9a4e9f3"}
{"source_code": "n=+readline()\na=readline().split(' ').map(function(x){return +x;})\nvar d=a[1]-a[0]\nvar keks=1;\nfor (var i=2;i<n;i++)\n{\n if (a[i]-a[i-1]!=d)\n {\n keks=0;\n break;\n }\n}\nif (keks){print(d+a[n-1]);}else{print(a[n-1]);}", "src_uid": "d04fa4322a1b300bdf4a56f09681b17f"}
{"source_code": "(function() {\n var r = readline().split(\" \").map(Number);\n var c = readline().split(\" \").map(Number);\n var d = readline().split(\" \").map(Number);\n \n var r1 = r[0];\n var r2 = r[1];\n var c1 = c[0];\n var c2 = c[1];\n var d1 = d[0];\n var d2 = d[1];\n \n for (var i = 1; i <= 9; i++) {\n for (var j = 1; j <= 9; j++ ) {\n for (k = 1; k <= 9; k++) {\n for(l = 1; l <= 9; l++) {\n if (new Set([i, j, k, l]).size === 4) {\n if (i + j === r1 && k + l === r2 && i + k === c1 && j + l === c2 && i + l === d1 && j + k === d2) {\n print(`${i} ${j}`);\n print(`${k} ${l}`);\n return;\n }\n }\n }\n }\n }\n }\n \n print(\"-1\");\n})()", "src_uid": "6821f502f5b6ec95c505e5dd8f3cd5d3"}
{"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 n = parseInt(readLine());\n let pagesInWeekDays = readLine().split(' ').map(Number);\n // while (result < 100) {\n // result = result +\n // }\n function recursion(totalpagesPerWeak) {\n // console.log(totalpagesPerWeak);\n // let [\n // monday,\n // tuseday,\n // wednessday,\n // thursday,\n // friday,\n // saturday,\n // sunday,\n // ] = pagesInWeekDays;\n\n for (let i = 0; i < pagesInWeekDays.length; i++) {\n totalpagesPerWeak = totalpagesPerWeak + pagesInWeekDays[i];\n if (totalpagesPerWeak >= n) {\n console.log(i + 1);\n return;\n }\n }\n if (!(totalpagesPerWeak >= n)) {\n // console.log(n);\n // console.log(totalpagesPerWeak);\n // totalpagesPerWeak = n - totalpagesPerWeak; // 1\n recursion(totalpagesPerWeak);\n }\n }\n recursion(0);\n}\n", "src_uid": "007a779d966e2e9219789d6d9da7002c"}
{"source_code": "function main() {\n var data = readline().split(' ').map(Number);\n if(data[0] == 0 && data[1] == 0){\n return print(\"NO\");\n }\n if(Math.abs(data[0] - data[1]) <= 1){\n return print(\"YES\");\n }\n return print(\"NO\");\n}\n\n\nmain()", "src_uid": "ec5e3b3f5ee6a13eaf01b9a9a66ff037"}
{"source_code": "var a = readline().split(' ');\nvar n1 = parseInt(a[0]);\nvar n2 = parseInt(a[1]);\n\nvar s = (n1 > n2 ? \"First\" : \"Second\");\n\nprint(s);", "src_uid": "aed24ebab3ed9fd1741eea8e4200f86b"}
{"source_code": ";(function () {\n\n\tprint((function (a, b) {\n\t\treturn +(+a + +b).toString().replace(/0/g, '') === (+a.replace(/0/g, '') + +b.replace(/0/g, '') ) ? 'YES' : 'NO';\n\t}).apply(this, [readline(), readline()]));\n\n}).call(this);", "src_uid": "ac6971f4feea0662d82da8e0862031ad"}
{"source_code": "var n = +readline();\n if (n % 2 == 1) {\n n++;\n }\n \n print(n/2 -1 );", "src_uid": "dfe9446431325c73e88b58ba204d0e47"}
{"source_code": "m=Number(readline()) ;\narr=readline() ;\nans=\"1\"\nfor(j=0;j<m;j++)\n if(arr[j]==\"0\")\n ans+=\"0\"\nif(m>1)\n print(ans);\nelse\n print(arr)", "src_uid": "ac244791f8b648d672ed3de32ce0074d"}
{"source_code": "var input = readline();\nfunction count(str){\n\tf = 0;\n\ts = 0;\n\tfirst = 0;\n\tfor (i = 0; i < str.length; i++){\n\t\tif (str[i] == '4') \n\t\t\tf += 1;\n\t\t\tif (first == 0)\n\t\t\t\tfirst = 4\n\t\tif (str[i] == '7') \n\t\t\ts += 1;\n\t\t\tif (first == 0)\n\t\t\t\tfirst = 7\n\t}\n\tif (f==0 && s==0)\n\t\treturn -1;\n\tif (f == s)\n\t\treturn first\n\treturn (f > s) ? 4 : 7;\n}\n\nprint(count(input));", "src_uid": "639b8b8d0dc42df46b139f0aeb3a7a0a"}
{"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(25);\n});\n", "src_uid": "dcaff75492eafaf61d598779d6202c9d"}
{"source_code": "var ln = readline().split(' ').map(e => +e);\nvar std = ln[0], TIME = ln[1];\n\nvar ln = readline().split(' ').map(e => +e);\nvar dp = Array(std);\n\ndp[0] = ln[0];\nfor (var i=1; i<ln.length; i++) dp[i] = ln[i] + dp[i-1];\nfor (var i=0; i<ln.length; i++){\n var count = 0;\n if (dp[i] > TIME) {\n var sub = ln.slice(0, i).sort((a, b) => a - b);\n while (sub.length) {\n if (dp[i] > TIME) count ++, dp[i] -= sub.pop();\n else break;\n } \n }\n \n write(String(count) + ' ');\n}\n", "src_uid": "d3c1dc3ed7af2b51b4c49c9b5052c346"}
{"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;\nlet n, k;\n\nrl.on('line', (d) => {\n if (c === 0) {\n [n, k] = d.split(' ').map(Number);\n c++;\n return;\n }\n\n const arr = [...d];\n const obj = {};\n\n for (let i = 0; i < arr.length; i++) {\n if (obj[arr[i]]) {\n obj[arr[i]]++;\n }\n else {\n obj[arr[i]] = 1;\n }\n }\n\n const countArr = Object.values(obj);\n\n if (countArr.some((x) => x > k)) {\n console.log('NO');\n }\n else {\n console.log('YES');\n }\n\n c++;\n});\n", "src_uid": "ceb3807aaffef60bcdbcc9a17a1391be"}
{"source_code": "var n = parseInt(readline());\nif (3 > n)\n print(-1);\nelse for (var i=n; i>0; i--) \n print(i, ' ');", "src_uid": "fe8a0332119bd182a0a5b7758716317e"}
{"source_code": "function trim(s) {\n return s.replace(/^\\s+|\\s+$/gm, '')\n}\nfunction tokenizer(s) {\n return trim(s).split(/\\s+/);\n}\nfunction integers(s) {\n var tokens=tokenizer(s);\n for(var i=0; i<tokens.length; ++i) {\n tokens[i]=parseInt(tokens[i]);\n }\n return tokens;\n}\nfunction main() {\n var data=integers(readline());\n var n=data[0], m=data[1];\n var arr=new Array(n+1);\n var b=integers(readline());\n for(var i=0; i<m; ++i) {\n var x=b[i];\n for(var j=x; j<=n; ++j) {\n if(arr[j]==undefined) arr[j]=x;\n }\n }\n print(arr.slice(1).join(\" \"));\n}\nmain();\n ", "src_uid": "2e44c8aabab7ef7b06bbab8719a8d863"}
{"source_code": "const readline = require(\"readline\");\r\nconst rl = readline.createInterface({\r\n input: process.stdin,\r\n output: process.stdout\r\n})\r\nlet input = [];\r\nrl.on('line', line => {\r\n input.push(line);\r\n})\r\nrl.on('close', line => {\r\n var n = Number(input[0]);\r\n var source = input[1].split(\" \").map((i) => {\r\n return Number(i);\r\n });\r\n var arr = source.slice();\r\n var f = [];\r\n var sum = 0;\r\n for (var i = 0; i < arr.length; i++) {\r\n sum += arr[i];\r\n }\r\n if (sum % 2 === 1) {\r\n console.log(0);\r\n return;\r\n } \r\n f[0] = [];\r\n for (var j = 0; j < arr.length; j++) {\r\n f[0][j] = true;\r\n }\r\n for (var i = 1; i <= sum / 2; i++) {\r\n f[i] = [];\r\n for (var j = 0; j < arr.length; j++) {\r\n f[i][j] = f[i][j - 1]\r\n if (i - arr[j] >= 0) {\r\n f[i][j] = f[i][j] || f[i - arr[j]][j - 1];\r\n }\r\n }\r\n }\r\n if (!f[sum / 2][arr.length - 1]) {\r\n console.log(0);\r\n return;\r\n }\r\n for (var j = 0; j < arr.length; j++) {\r\n f[0][j] = true;\r\n }\r\n var index = -1;\r\n while (index === -1) {\r\n sum = 0;\r\n for (var i = 0; i < arr.length; i++) {\r\n sum += arr[i];\r\n if (arr[i] % 2 === 1) {\r\n index = i;\r\n } else {\r\n arr[i] /= 2;\r\n }\r\n } \r\n }\r\n if (sum % 2 === 1) {\r\n console.log(0);\r\n } else {\r\n console.log(1);\r\n console.log(index + 1);\r\n }\r\n});", "src_uid": "29063ad54712b4911c6bf871969ee147"}
{"source_code": "var a = +readline()\nif(a % 2 === 0){\n print(Math.pow(2, a/2));\n}\nelse{\n print(0);\n}", "src_uid": "4b7ff467ed5907e32fd529fb39b708db"}
{"source_code": "'use strict';\nlet n = parseInt(readline()),\n array = [4, 7, 47, 74];\n\nfor(let i = 4; i<=7; i+=3) {\n for(let j = 4; j<=7; j+=3) {\n for(let k = 4; k<=7; k+=3) {\n array.push(i*100 + j*10 + k);\n }\n }\n}\n\narray.map(function(happyNumber) {\n if(n % happyNumber === 0) {\n write('YES');\n n = undefined;\n }\n})\n\nif(n) {\n write('NO');\n}", "src_uid": "78cf8bc7660dbd0602bf6e499bc6bb0d"}
{"source_code": "var car = [\n '+------------------------+',\n '|#0.#4.#7.#10.#13.#16.#19.#22.#25.#28.#31.|D|)',\n '|#1.#5.#8.#11.#14.#17.#20.#23.#26.#29.#32.|.|',\n '|#2.......................|',\n '|#3.#6.#9.#12.#15.#18.#21.#24.#27.#30.#33.|.|)',\n '+------------------------+'\n].join('\\n')\n\nvar k = Number(readline())\n\n// take seat\nfor (var i=0; i<k; i++) {\n car = car.replace('#' + i + '.', 'O.')\n}\n\n// empty seat\nfor (var i=k; i<34; i++) {\n car = car.replace('#' + i + '.' , '#.')\n}\n\nprint(car)\n", "src_uid": "075f83248f6d4d012e0ca1547fc67993"}
{"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\u2191\u5165\u529b \u2193\u51fa\u529b');\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 \u201aThere 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 list = nextIntArray();\n\tvar max = Math.max.apply(null, list);\n\tfor(var i = max; i <= 300; i++){\n\t\tvar L = 0;\n\t\tvar R = 0;\n\t\tfor(var j = 0; j < N; j++){\n\t\t\tL += list[j];\n\t\t\tR += i - list[j];\n\t\t}\n\t\tif(L < R){\n\t\t\tmyout(i);\n\t\t\treturn;\n\t\t}\n\t}\n}\n", "src_uid": "d215b3541d6d728ad01b166aae64faa2"}
{"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', (data) => {\n let [a, b, c, d] = data.split(' ').map(Number);\n let x = Math.min(a, c, d);\n\n a -= x;\n c -= x;\n d -= x;\n\n let y = Math.min(a, b);\n\n console.log(x*256 + y*32);\n});\n", "src_uid": "082b31cc156a7ba1e0a982f07ecc207e"}
{"source_code": "'use strict';\n \nprocess.stdin.resume();\nprocess.stdin.setEncoding('utf-8');\n \nlet inputString = '';\nlet currentLine = 0;\n \nprocess.stdin.on('data', inputStdin => {\n inputString += inputStdin;\n});\n \nprocess.stdin.on('end', _ => {\n inputString = inputString.trim().split('\\n').map(string => {\n return string.trim();\n });\n \n main(); \n});\n \nfunction readline() {\n return inputString[currentLine++];\n}\n// Make a Snippet for the code above this and then write your logic in main();\n \n \nfunction main() {\n const x = readline();\n var line2 = readline(); \n \n \n // console log function here\n console.log(removeAdjacent(x, line2));\n}\n \n// function here\n\nfunction removeAdjacent(l, s) {\n\n\tlet sArr = Array.from(s);\n\n\t// create a dictionary where every letter in associated the its positions in the string, \n\t// and a linkde list where every element has a reference in the dictionary near the position here stored\n\n\tlet sll = {value:s[0], prev: null, next: null};\n\tlet lettersDict = {[s[0]]: [{position: 0, elem: sll}]};\n\tlet start = sll;\n\tlet currElemLinkedList = sll;\n\n\tfor (let i = 1; i < l; i++) {\n\t\tlet curr = s[i];\n\n\t\tcurrElemLinkedList.next = {value:curr, prev: currElemLinkedList, next: null};\n\t\tif (curr in lettersDict) {\n\t\t\tlettersDict[curr].push({position: i, elem: currElemLinkedList.next});\n\t\t}\n\t\telse {\n\t\t\tlettersDict[curr] = [{position: i, elem: currElemLinkedList.next}];\n\t\t}\n\n\t\tcurrElemLinkedList = currElemLinkedList.next;\n\t}\n\n\tlet end = currElemLinkedList;\n\n\t// order the keys of the dictionary by ascii value\n\tconst keys = Object.keys(lettersDict);\n\tkeys.sort((a, b) => {\n\t\treturn b.charCodeAt(0) - a.charCodeAt(0)\n\t});\n\n\t// for every entry in keys check the string for adjacents\n\treturn keys.reduce((acc, curr) => {\n\t\tlet nEliminated = 0;\n\n\n\t\tfor (let i = 0; i < lettersDict[curr].length; i++) {\n\t\t\tlet elem = lettersDict[curr][i].elem;\n\t\t\tif (elem) {\n\t\t\t\tlet position = lettersDict[curr][i].position;\n\n\t\t\t\tlet leftComparable = elem.prev && elem.prev.value;\n\t\t\t\tlet rightComparable = elem.next && elem.next.value;\n\n\t\t\t\tif ((leftComparable && (leftComparable.charCodeAt(0) - elem.value.charCodeAt(0) == -1)) ||\n\t\t\t\t\t(rightComparable && (rightComparable.charCodeAt(0) - elem.value.charCodeAt(0) == -1))) {\n\t\t\t\t\tnEliminated++;\n\n\t\t\t\t\tlettersDict[curr][i].elem = null;\n\t\t\t\t\tif (leftComparable === elem.value) {\n\t\t\t\t\t\ti -= 2\n\t\t\t\t\t}\n\t\t\t\t\tlet prev = elem.prev;\n\t\t\t\t\tlet next = elem.next;\n\t\t\t\t\tif (prev) {\n\t\t\t\t\t\tprev.next = next;\n\t\t\t\t\t}\n\t\t\t\t\tif (next) {\n\t\t\t\t\t\tnext.prev = prev;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t}\n\n\t\treturn acc + nEliminated;\n\t}, 0)\n}", "src_uid": "9ce37bc2d361f5bb8a0568fb479b8a38"}
{"source_code": ";(function () {\n\tprint(function (n, m) {\n\t\tvar k = 0;\n\n\t\tvar p = [];\n\t\twhile (n--) p.push(readline().split(''));\n\t\tn = p.length;\n\n\t\tfor (var i = 0; i < n; i++) {\n\t\t\tfor (var j = 0; j < m; j++) {\n\t\t\t\tif (p[i][j] === 'P' && isHaveWolf(i, j)) {\n\t\t\t\t\tk++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn k;\n\n\t\tfunction isHaveWolf (i, j) {\n\t\t\tif (i > 0 && p[i-1][j] === 'W') { p[i-1][j] = '.'; return true; }\n\t\t\telse if (i < n-1 && p[i+1][j] === 'W') { p[i+1][j] = '.'; return true; }\n\t\t\telse if (j > 0 && p[i][j-1] === 'W') { p[i][j-1] = '.'; return true; }\n\t\t\telse if (j < m-1 && p[i][j+1] === 'W') { p[i][j+1] = '.'; return true; }\n\n\t\t\treturn false;\n\t\t}\n\t}.apply(null, readline().split(' ').map(Number)));\n}.call(this));", "src_uid": "969b24ed98d916184821b2b2f8fd3aac"}
{"source_code": "var x = readline().split(' ');\nx[0] = x[0].replace(\"1\",\"2\"); x[0] = x[0].replace(/1/g,\"\");\nprint( (x[0].indexOf(\"2000000\") >= 0 && x[0].length > 6) ? \"yes\" : \"no\" );", "src_uid": "88364b8d71f2ce2b90bdfaa729eb92ca"}
{"source_code": "var N = parseInt(readline());\nvar q = [], tail, newTail;\nfor (var i = N; i--; ){\n newTail = 1;\n while (tail = q.pop()) {\n if (tail === newTail) {\n newTail += 1;\n } else {\n q.push(tail);\n break;\n }\n }\n q.push(newTail);\n}\nprint(q.join(' '));\n", "src_uid": "757cd804aba01dc4bc108cb0722f68dc"}
{"source_code": "var input = readline();\n\nvar numbers = parseInt(input.split(\"A\").join(\"\"));\nprint(numbers % 2 === 0 ? 0: 1);", "src_uid": "e52bc741bb72bb8e79cf392b2d15354f"}
{"source_code": "var s = readline();\n s = s.split('e');\n var nm = s[0].split('.');\n var a = nm[0];\n var b = nm[1];\n var c = parseInt(s[1]);\n var res = a;\n if(c >= b.length) {\n res += b;\n while(c > b.length) {\n c -= 1;\n res += '0';\n }\n } else {\n res += b.substr(0, c) + '.' + b.substr(c);\n }\n\n while(res[0] === '0') {\n res = res.substr(1);\n }\n if(res[0] === '.') {\n res = '0' + res;\n }\n if(res.indexOf('.') !== -1) {\n while(res[res.length - 1] === '0') {\n res = res.substr(0, res.length - 1);\n }\n }\n while(res[res.length - 1] === '.') {\n res = res.substr(0, res.length - 1);\n }\n print(res);\n\n", "src_uid": "a79358099f08f3ec50c013d47d910eef"}
{"source_code": "process.stdin.resume()\nprocess.stdin.setEncoding('utf-8')\n\nvar arr = ''\nprocess.stdin.on('data', (i) => {\n arr += i\n})\n\nprocess.stdin.on('end', () => {\n const n = parseInt(arr)\n const sq = Math.sqrt(n)\n let k = 0\n for(let i = 1; i <= sq; i++) {\n if(n % i == 0) {\n if(n / i == i) k ++\n else k +=2\n }\n }\n console.log(k)\n\n})", "src_uid": "7fc9e7d7e25ab97d8ebc10ed8ae38fd1"}
{"source_code": "readline();\nvar s = readline();\nvar ans = s.length;\nfor(var i = 1;i < s.length;i++)\n if(s.substr(0, i) == s.substr(0 + i, i)) {\n ans = s.length - i + 1;\n }\nprint(ans);", "src_uid": "ed8725e4717c82fa7cfa56178057bca3"}
{"source_code": "//var result = num => Math.floor(Number(num));\nvar n = readline(), str = readline();\nvar cnt = 0, max = 1;\nfor(var i = 0; i < str.length; i++) {\n str[i] === '0' ? cnt++ : cnt = 0;\n max = Math.max(max, cnt);\n if(str[i] === str[i + 1] && str[i] === '1') {\n max = 0;\n break;\n } \n}\nif(str[0] === str[1] && str[0] === '0') max = 0;\nif(str[n - 1] === str[n - 2] && str[n - 1] === '0') max = 0;\nif(n == 1 && str[0] === '0') max = 0;\nprint(max !== 0 && max <= 2 ? 'Yes' : 'No');", "src_uid": "c14d255785b1f668d04b0bf6dcadf32d"}
{"source_code": "f=readline()\nr=0\nfor (i=1;f;i+=9)\n{\n t=0\n a=i;\n while(a)\n {\n s=a%10\n t+=s\n a=(a-s)/10\n }\n if (t==10)\n {\n --f\n r=i\n }\n}\nprint(r)", "src_uid": "0a98a6a15e553ce11cb468d3330fc86a"}
{"source_code": "function main() {\n var fl = readline().split(/\\s/gi).map(Number),\n sl = readline().split(/\\s/gi).map(Number),\n a = fl[0], b = fl[1],\n c = sl[0], d = sl[1],\n result = -1;\n\n\tvar r = rick(a, b), m = morty(c, d);\n\n\tfor(var n = 0; n <= 1e4; n++)\t{\n\t\tvar s = r(n) - m(0);\n\n\t\tif(s >= 0 && s % (m(1) - m(0)) == 0)\t{\n\t\t\tresult = r(n);\n\t\t\tbreak;\n\t\t}\n\t}\n\n print(result);\n};\n\nfunction rick(a, b)\t{\n\treturn function(n)\t{\n\t\treturn b + (a * n);\n\t};\n};\n\nfunction morty(c, d)\t{\n\treturn function(n)\t{\n\t\treturn d + (c * n);\n\t};\n};\n\nmain();", "src_uid": "158cb12d45f4ee3368b94b2b622693e7"}
{"source_code": "var total = parseInt(readline())\nvar cards = readline().split(' ');\nvar sum = 0;\n\ncards.map(function(a) {\n\tsum += (+a);\n})\n\nvar one = sum * 2 / total;\nvar map = [];\nfor (var i = 0; i < total; ++i) {\n\tif (map[i]) continue;\n\tfor (var j = i + 1; j < total; ++j) {\n\t\tif (!map[j] && (+cards[i]) + (+cards[j]) == one) {\n\t\t\tmap[i] = map[j] = 1;\n\t\t\tprint((i+1) + ' ' + (j+1));\n\t\t\tbreak;\n\t\t}\n\t}\n}\n", "src_uid": "6e5011801ceff9d76e33e0908b695132"}
{"source_code": "var str = readline().split(\":\", 2);\nvar hours = Number(str[0]);\nvar minutes = Number(str[1]);\nvar num = Number(readline());\n\nminutes += num;\nif (minutes >= 60) {\n hours += (minutes - minutes % 60) / 60;\n minutes %= 60;\n}\nif (hours >= 24) {\n hours %= 24;\n}\n\nfunction toTime(num) {\n if (num >= 10) {\n return String(num);\n } else {\n return \"0\" + String(num);\n }\n}\n\nprint(toTime(hours) + \":\" + toTime(minutes));", "src_uid": "20c2d9da12d6b88f300977d74287a15d"}
{"source_code": "var n = parseInt(readline());\nvar s=0;\nvar a = new Array(n);\nfor(var i = 0;i<n;i++){\n a[i]= readline();\n a[i] = a[i].split(\" \");\n}\nfor(var i =0;i<n;i++){\n for(var j=0;j<n;j++){\n if(i == j){continue;}\n if(a[i][0] == a[j][1]){s++;}\n }\n}\nprint(s);", "src_uid": "745f81dcb4f23254bf6602f9f389771b"}
{"source_code": "\"use strict\";\n\nfunction main()\n{\n var n = parseInt(readline(), 10);\n \n var a = new Array(n);\n var b = new Array(n);\n var c = new Array(n);\n \n for (var size of readline().split(\" \"))\n {\n size = parseInt(size, 10);\n \n a[size+0] = true;\n b[size+1] = true;\n c[size+2] = true;\n }\n \n var ok = false;\n for (var i=3 ; i<=1003 ; i++)\n {\n if (a[i] && b[i] && c[i])\n {\n ok = true;\n break;\n }\n }\n \n print(ok ? \"YES\" : \"NO\");\n}\n\nmain();\n", "src_uid": "d6c876a84c7b92141710be5d76536eab"}
{"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 = Math.max(0, arr[arr.length - 1] - 25);\n\n console.log(ans);\n\n c++;\n});\n", "src_uid": "ef657588b4f2fe8b2ff5f8edc0ab8afd"}
{"source_code": "let 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\nRL.on('close', () => {\n let n = parseInt(input[0]);\n let code = input[1];\n \n if(code.length == 1){\n console.log(code.charAt(0)); process.exit();\n }\n \n let answer = ''\n let j = 0;\n for(let i = 0; i < n; i++, j+=i){\n answer += code.charAt(j);\n }\n console.log(answer);\n});\n\n", "src_uid": "08e8c0c37b223f6aae01d5609facdeaf"}
{"source_code": "function main() {\n let s = stdin[0];\n let r = '';\n\n let n = s.length;\n let start_index = parseInt( (n-1)/2 );\n\n r += s[start_index];\n\n let current_difference=1;\n while( 0 <= start_index+current_difference && start_index+current_difference < n ) {\n r += s[start_index+current_difference];\n if( current_difference>0 ) {\n current_difference = -current_difference;\n } else {\n current_difference = -current_difference + 1;\n }\n }\n\n\n console.log(r);\n};\n\n\nconst readline = require('readline');\nconst rl = readline.createInterface(process.stdin, process.stdout, null);\n\nvar stdin = [];\nrl.on('line', function (line) {stdin.push(line);});\nrl.on('close', main);\n\n", "src_uid": "992ae43e66f1808f19c86b1def1f6b41"}
{"source_code": "var a = readline().split(' ');\nprint(a[0] * a[1] % 2 ? (a[0] * a[1] - 1) / 2 : a[0] * a[1] / 2);", "src_uid": "e840e7bfe83764bee6186fcf92a1b5cd"}
{"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;\nlet n, m, k;\n\nrl.on('line', (d) => {\n if (c === 0) {\n c++;\n [n, m, k] = d.split(' ').map(Number);\n return;\n }\n\n const arr = [0, ...d.split(' ').map(Number)];\n let ans = 0;\n let L = m - 1;\n let R = m + 1;\n while (L > 0 || R < arr.length) {\n if (arr[L] !== 0 && arr[L] <= k) {\n ans = 10 * Math.abs(m - L);\n break;\n }\n\n if (arr[R] !== 0 && arr[R] <= k) {\n ans = 10 * Math.abs(m - R);\n break;\n }\n\n L--;\n R++;\n }\n\n console.log(ans);\n\n c++;\n});\n", "src_uid": "57860e9a5342a29257ce506063d37624"}
{"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('\u53c2\u6570\u4e0d\u80fd\u4e3a\u7a7a');\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", "src_uid": "0fdd91ed33431848614075ebe9d2ee68"}
{"source_code": "var input = readline().split(\" \"), t = +input[0], s = +input[1], q = +input[2];\n\nfor(i = 1; ; i++){\n\ts += Math.round(s * (q - 1));\n\tif(t <= s){\n\t\tbreak;\n\t}\n}\nwrite(i);", "src_uid": "0d01bf286fb2c7950ce5d5fa59a17dd9"}
{"source_code": "var a = [\n\t'O-|-OOOO',\n\t'O-|O-OOO',\n\t'O-|OO-OO',\n\t'O-|OOO-O',\n\t'O-|OOOO-',\n\t'-O|-OOOO',\n\t'-O|O-OOO',\n\t'-O|OO-OO',\n\t'-O|OOO-O',\n\t'-O|OOOO-'\n];\n\nprint(readline().split('').reverse().map(function(v){\n\treturn a[v];\n}).join('\\n'));", "src_uid": "c2e3aced0bc76b6484360563355d23a7"}
{"source_code": "var ln = readline().split(' ').map(e => +e);\nvar n = ln[0];\nvar mn = Math.min(ln[1], ln[2]);\n\nwrite(n <= mn ? 'Yes' : 'No');", "src_uid": "6cd07298b23cc6ce994bb1811b9629c4"}
{"source_code": "var t=+readline();\r\nwhile(t--){\r\n var input= readline();\r\n var arr= input.split(\" \").map(x=>+x);\r\n var a=arr[0];\r\n var b=arr[1];\r\n var res=1;\r\n for(var i=0; i<b; i++){\r\n res=res*a%(1000000000+7);\r\n }\r\n print(res);\r\n}\r\n", "src_uid": "2e7a9f3a97938e4a7e036520d812b97a"}
{"source_code": "function f(num) {\n ++num;\n while (num % 10 === 0) {\n num /= 10;\n }\n\n return num;\n}\n\nvar x = readline().split(' ').map((x) => Number(x));\nvar used = {};\nvar count = 0;\n\nwhile (!used[x]) {\n used[x] = true;\n ++count;\n\n x = f(x);\n};\n\nprint(count);", "src_uid": "055fbbde4b9ffd4473e6e716da6da899"}
{"source_code": "var n = Number(readline());\nvar res = 1;\n\nfor (var i=2; i<n; i++){\n\tif (n%i==0) \n\tres++;\n}\nprint(res);", "src_uid": "89f6c1659e5addbf909eddedb785d894"}
{"source_code": "var A = +readline()\n\nfunction toSys (n, b) {\n\tvar c = n\n\tvar d = 0\n\tvar r = []\n\twhile (c) {\n\t\td = c % b\n\t\tc = c / b | 0\n\t\tr.push(d)\n\t}\n\t//return r.reverse()\n\treturn r\n}\n\nvar s = 0\nfor (var i = 2; i < A; i++) {\n\ts += toSys(A, i).reduce(function (s, v) {return s + v})\n}\n\n\ns = toSimple(s)\nvar a = A - 2\n\nfor (var i = 0; i < s.length; i++) {\n\tif (!(a % s[i])) {\n\t\ta = a / s[i]\n\t\ts[i] = 1\n\t}\n}\n\nprint(s.reduce(function (r, a) {return a * r}, 1) + '/' + a)\n\nfunction toSimple (n) {\n\tvar r = []\n\tvar i = 2\n\twhile (n != 1) {\n\t\tif (!(n % i)) {\n\t\t\tr.push(i)\n\t\t\tn = n / i\n\t\t\ti = 1\n\t\t}\n\t\ti++\n\t}\n\treturn r\n}\n\n", "src_uid": "1366732dddecba26db232d6ca8f35fdc"}
{"source_code": "let inputString = '';\nlet currentLine = 0;\nprocess.stdin.on('data', data => {\n\tinputString += data;\n});\nprocess.stdin.on('end', function () {\n\tinputString = inputString\n\t\t.trim()\n\t\t.split('\\n')\n\t\t.map(str => str.trim());\n\tmain();\n});\n\nfunction readLine() {\n\treturn inputString[currentLine++];\n}\n\nconst store = {};\n\nfunction main() {\n\tlet n = readLine() >> 0;\n\n\tif (n === 0) {\n\t\tconsole.log(1);\n\t\treturn;\n\t}\n\n\tlet map = { 1: 8, 2: 4, 3: 2, 4: 6 };\n\tn = n % 4;\n\tif (n === 0) n = 4;\n\tconsole.log(map[n]);\n}\n", "src_uid": "4b51b99d1dea367bf37dc5ead08ca48f"}
{"source_code": "const readline = require('readline');\n\nconst rl = readline.createInterface({\n input: process.stdin,\n output: process.stdout\n});\n\nrl.on('line', d => {\n let arr = d.split(\"\");\n arr[0] = arr[0].toUpperCase();\n console.log(arr.join(\"\"));\n})", "src_uid": "29e0fc0c5c0e136ac8e58011c91397e4"}
{"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 num = +readLine();\n\n if (num === 0) console.log(`${0} ${0} ${0}`);\n else if (num === 1) console.log(`${0} ${0} ${1}`);\n else if (num === 2) console.log(`${0} ${1} ${1}`);\n else {\n const fib = [0, 1];\n let i = 2;\n let prevSum = fib[0] + fib[1];\n while (prevSum < num) {\n prevSum = fib[i - 1] + fib[i - 2];\n fib[i] = prevSum;\n i++;\n }\n i--;\n console.log(`${fib[i - 1]} ${fib[i - 3]} ${fib[i - 4]}`);\n }\n}\n", "src_uid": "db46a6b0380df047aa34ea6a8f0f93c1"}
{"source_code": "var bessi = readline()\n.split('')\n.concat(readline().split('').reverse())\n.filter(function (v) {\n return v !== 'X'\n})\n\nvar elsi = readline()\n.split('')\n.concat(readline().split('').reverse())\n.filter(function (v) {\n return v !== 'X'\n})\n\nvar friends = true\n\n\nvar b = bessi.indexOf('A')\nvar e = elsi.indexOf('A')\n\nfor (var i = 0 ; i < 3; i++) {\n if (bessi[b] !== elsi[e]) {\n friends = false\n break\n }\n\n b = ++b % 3\n e = ++e % 3\n\n}\n\nprint(friends ? \"YES\" : \"NO\")", "src_uid": "46f051f58d626587a5ec449c27407771"}
{"source_code": ";(function () {\n\t\n\tvar s = readline().split(' ').map(Number);\n\tvar n = s[0], x = s[1], y = s[2];\n\n\tvar r = Math.ceil(n * (y / 100)) - x;\n\n\tprint( ( r > 0 ) ? r : 0 );\n\n}).call(this);", "src_uid": "7038d7b31e1900588da8b61b325e4299"}
{"source_code": "var n = +readline();\n\nvar mod = 1000000007 * 1e5\n\nvar t1 = 0;\nvar t2 = 1;\nfor (var i = 2; i < n; i++) {\n\tvar tm1 = t2 * 2;\n\tvar tm2 = t1 * 3;\n\tt1 = t2;\n\tt2 = (tm1 + tm2);\n\tif (t2 > mod) {\n\t\tt2 %= mod;\n\t}\n}\n\n\nprint(n === 1 ? 0 : (3 * t2) % 1000000007);", "src_uid": "77627cc366a22e38da412c3231ac91a8"}
{"source_code": "var n = parseInt(readline());\n\tvar a = readline().split(\" \");\n\t//var a = s.split(\" \");\n\tvar len = a.length;\n\tvar flag;\n\tif(n == 1)\n\t{\n\t\tif(a[0] == 0)\n print(\"UP\");\n /* { \n \tflag = \"UP\";\n \treturn flag;\n }*/\n\t\telse if(a[0] == 15)\n\t\t\tprint(\"DOWN\");\n\t\t\t/*{\n\t\t\t\tflag = \"DOWN\";\n\t\t\t\treturn flag;\n\t\t\t}*/\n\t\telse{\n\t\t\tflag = -1;\n\t\t\t//return flag;\n\t\t\tprint(flag);\n\t\t} \n\t}\n\telse {\n\t\tif(a[len-2] == 14 && a[len-1] == 15){\n\t\t\tflag = \"DOWN\";\n\t\t\tprint(flag);\n\t\t\t//return flag;\n\t\t}\n\t\telse if(a[len-1] == 0 && a[len-2] == 1){\n\t\t\tflag = \"UP\";\n\t\t\tprint(flag);\n\t\t\t//return flag;\n\t\t}\n\t\telse if((a[len-1]-a[len-2]) > 0)\n\t\t{\n\t\t\tflag = \"UP\";\n\t\t\tprint(flag);\n\t\t\t//return flag;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tflag = \"DOWN\";\n\t\t\tprint(flag);\n\t\t\t//return flag;\n\t\t}\n\t}\n", "src_uid": "8330d9fea8d50a79741507b878da0a75"}
{"source_code": "var s = +readline();\nvar digits = {\n\t0: \"zero\",\n\t1: \"one\",\n\t2: \"two\",\n\t3: \"three\",\n\t4: \"four\",\n\t5: \"five\",\n\t6: \"six\",\n\t7: \"seven\",\n\t8: \"eight\",\n\t9: \"nine\",\n\t10: \"ten\",\n\t11: \"eleven\",\n\t12: \"twelve\",\n\t13: \"thirteen\",\n\t14: \"fourteen\",\n\t15: \"fifteen\",\n\t16: \"sixteen\",\n\t17: \"seventeen\",\n\t18: \"eighteen\",\n\t19: \"nineteen\",\n\t20: \"twenty\",\n\t30: \"thirty\",\n\t40: \"forty\",\n\t50: \"fifty\",\n\t60: \"sixty\",\n\t70: \"seventy\",\n\t80: \"eighty\",\n\t90: \"ninety\",\n};\n\nif(s <= 20){\n\twrite(digits[s]);\n}\nelse if(s % 10 == 0){\n\twrite(digits[s]);\n}\nelse{\n\twrite(digits[s - (s % 10)]);\n\twrite(\"-\");\n\twrite(digits[s % 10]);\n}", "src_uid": "a49ca177b2f1f9d5341462a38a25d8b7"}
{"source_code": "var numbers = readline().split(' ').map(Number);\nvar sequence = readline().split(' ').map(Number);\nvar fingerprints = readline().split(' ').map(Number);\n\nvar code = [];\nfor(var i = 0; i < numbers[0]; i++) {\n for(var j = 0; j < numbers[1]; j++) {\n if(sequence[i] === fingerprints[j]) {\n code.push(sequence[i]);\n break;\n }\n }\n}\n\nprint(code.join(' '));", "src_uid": "f9044a4b4c3a0c2751217d9b31cd0c72"}
{"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\n if (+d < 2) {\n console.log(-1);\n }\n else {\n if (+d % 2 === 0) {\n console.log(+d, +d);\n }\n else {\n console.log(+d - 1, +d - 1);\n }\n }\n});\n", "src_uid": "883f67177474d23d7a320d9dbfa70dd3"}
{"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 let watchedTime = 15;\n\n for (let i = 0; i < arr.length; i++) {\n if (watchedTime < arr[i]) {\n break;\n }\n else {\n watchedTime = arr[i];\n watchedTime += 15;\n }\n }\n\n console.log(Math.min(watchedTime, 90));\n\n c++;\n});\n", "src_uid": "5031b15e220f0ff6cc1dd3731ecdbf27"}
{"source_code": "var s1Map = { '+' : 0, '-' : 0 },\n\t\t\ts2Map = { '+' : 0, '-' : 0, '?' : 0 },\n\t\t\ttotalCase = 0,\n\t\t\tsolveCase = 0,\n\t\t\tresult = 0;\n\n\t\tvar factorial = function(n)\t{\n\t\t\tif(n == 0)\treturn 1;\n\t\t\tif(!arguments[1])\targuments[1] = n;\n\t\t\treturn n == 1 ? arguments[1] : factorial(n - 1, arguments[1] * (n - 1));\n\t\t};\n\n\t\tvar combination = function(n, k)\t{\n\t\t\tif(n < k || n === 0 || k < 0)\treturn 0;\n\t\t\tif(n === k)\treturn 1;\n\t\t\treturn factorial(n) / (factorial(k) * factorial(n - k));\n\t\t};\n\n\t\tprint.call(undefined, (function()\t{\n\t\t\treadline().split('').forEach(function(ch)\t{\n\t\t\t\ts1Map[ch] += 1;\n\t\t\t});\n\n\t\t\treadline().split('').forEach(function(ch)\t{\n\t\t\t\ts2Map[ch] += 1;\n\t\t\t});\n\n\t\t\tif(s1Map['+'] - s2Map['+'] === 0 && s1Map['-'] - s2Map['-'] === 0)\t{\n\t\t\t\tresult = 1;\n\t\t\t} else\t{\n\t\t\t\ttotalCase = Math.pow(2, s2Map['?']);\n\t\t\t\tsolveCase = s1Map['+'] > 0 ? combination(s2Map['?'], s1Map['+'] - s2Map['+'])\n\t\t\t\t: combination(s2Map['?'], s1Map['-'] - s2Map['-']);\n\n\t\t\t\tresult = solveCase / totalCase;\n\t\t\t}\n\n\t\t\tresult = Number(result).toFixed(12);\n\n\t\t\treturn result;\n\t\t})());", "src_uid": "f7f68a15cfd33f641132fac265bc5299"}
{"source_code": "\n\nvar r = readline();\n\nr = r.split(' ');\n\nn = parseInt(r[0]);\nh = parseInt(r[1]);\nm = parseInt(r[2]);\n\narr = [];\n\nfor(var i=0;i<m;i++)\n{\n r = readline();\n r = r.split(' ');\n //print(r);\n arr.push(r);\n}\nvar ans = 0;\n\nfor(var i=0;i<m;i++)\n{\n for(var j=0;j<3;j++)\n {\n arr[i][j] = parseInt(arr[i][j]);\n //print(arr[i][j]);\n }\n // print(\"**\");\n}\n\nfor(var i = 1;i<=n;i++)\n{\n for(var j=h;j>0;j--)\n {\n var pu = 0;\n for(var k=0;k<m;k++)\n {\n if( arr[k][0]<=i && arr[k][1] >= i )\n {\n if(arr[k][2]<j)\n {\n pu = 1;\n break;\n }\n }\n }\n if(pu==0)\n {\n ans+=j*j;\n //print(i,j);\n break;\n }\n \n }\n}\n\nprint(ans)", "src_uid": "f22b6dab443f63fb8d2d288b702f20ad"}
{"source_code": "var numbers = readline().split(\" \").map(function(x) { return parseInt(x); });\nvar n = numbers[0]\nvar k = numbers[1]\n\nvar rem = n % k;\nif(rem ===0){\nprint(n + k);\n}else{\n\nif(rem == n){\n print(k)\n}else{\n n-=rem\n print(n+k)\n}\n\n \n}", "src_uid": "75f3835c969c871a609b978e04476542"}
{"source_code": "var arr = readline().split(':');\nvar h = parseInt(arr[0]);\nvar m = parseInt(arr[1]);\n\nvar isP = function (s)\n{\n for (var i = 0; i < s.length / 2; i ++)\n {\n if (s.charAt(i) != s.charAt(s.length - i - 1))\n {\n return false;\n }\n }\n return true;\n}\nvar zeroPad = function (num, places)\n{\n var zero = places - num.toString().length + 1;\n return Array(+(zero > 0 && zero)).join(\"0\") + num;\n}\n\nvar i = 0;\nwhile(true)\n{\n var str = zeroPad(h, 2)+zeroPad(m, 2);\n // print(str);\n if (isP(str))\n {\n break;\n }\n m ++;\n if (m >= 60)\n {\n m %= 60;\n h ++;\n h %= 24;\n }\n i ++;\n}\nprint(i);\n", "src_uid": "3ad3b8b700f6f34b3a53fdb63af351a5"}
{"source_code": "let stop = '';\nprocess.stdin.on('data', c => stop += c);\nprocess.stdin.on('end', () => {\n const {EOL} = require('os');\n const lines = stop.split(EOL);\n var t = lines[0];\n for(i = 1; i <= t; i++){\n var n = lines[i];\n var a = new Map();\n for(j = 1; j * j <= n; j++){\n a.set(j * j, 1);\n }\n for(j = 1; j * j * j <= n; j++){\n a.set(j * j * j, 1);\n }\n console.log(a.size);\n }\n});\n", "src_uid": "015afbefe1514a0e18fcb9286c7b6624"}
{"source_code": "function main() {\n\n var nm = readline().split(' ').map(Number);\n var n = nm[0];\n var m = nm[1];\n var horizontal = readline();\n var vertical = readline();\n\n if (horizontal[0] === \"<\" && horizontal[n - 1] === \">\" && vertical[0] === \"v\" && vertical[m - 1] === \"^\") {\n print(\"YES\");\n } else if (horizontal[0] === \">\" && horizontal[n - 1] === \"<\" && vertical[m - 1] === \"v\" && vertical[0] === \"^\") {\n print(\"YES\");\n } else {\n print(\"NO\");\n }\n\n\n}\n\nmain();", "src_uid": "eab5c84c9658eb32f5614cd2497541cf"}
{"source_code": ";(function () {\n\n\tprint((function () {\n\t\tfor (var i = 1, str = readline(), l = str.length, ret = 0, p = 0; i < l; i++) {\n\t\t\tif (str[i] === str[i - 1]) {\n\t\t\t\tp++;\n\t\t\t} else {\n\t\t\t\tp = 0;\n\t\t\t\tret++;\n\t\t\t}\n\n\t\t\tif (p >= 5) {\n\t\t\t\tret++;\n\t\t\t\tp = 0;\n\t\t\t}\n\t\t}\n\n\t\treturn ret + 1;\n\t}).apply(0));\n\n}).call(this);\n", "src_uid": "5257f6b50f5a610a17c35a47b3a0da11"}
{"source_code": "const n = Number(readline());\nconst a = readline().split(\" \").slice(0, n).map(x => Number(x));\nprint(Math.max(...a) ^ a[n - 1]);\n", "src_uid": "f45c769556ac3f408f5542fa71a67d98"}
{"source_code": "var valid = function(x) {\n\tx = x + ''\n\treturn x.charAt(0) != x.charAt(1)\n\t\t&& x.charAt(0) != x.charAt(2)\n\t\t&& x.charAt(0) != x.charAt(3)\n\t\t&& x.charAt(1) != x.charAt(2)\n\t\t&& x.charAt(1) != x.charAt(3)\n\t\t&& x.charAt(2) != x.charAt(3)\n}\n\nvar n = parseInt(readline()) + 1\n\nwhile(!valid(n))\n\tn ++\n\nprint(n)\n", "src_uid": "d62dabfbec52675b7ed7b582ad133acd"}
{"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 (+d % 2 === 0) {\n console.log(0);\n }\n else {\n console.log(1);\n }\n\n c++;\n});\n", "src_uid": "78e64fdbf59c5ce89d0f0a1d0591f795"}
{"source_code": "var aux=readline().split(\" \").map(function(x){return parseInt(x);});\nvar n=aux[0],v=aux[1];\nvar rez=Math.min(v,n-1);\nfor(var i=2;i<=n-v;i++)\n rez+=i;\nprint(rez);", "src_uid": "f8eb96deeb82d9f011f13d7dac1e1ab7"}
{"source_code": "var n = parseInt(readline().split(' '));\nvar s = readline().split(' ');\nvar crash = [];\nfor (var i = 0; i < n; i ++) {\n crash[i] = parseInt(s[i]) - 1;\n}\nvar res = 1;\nvar vis = new Array(n);\nvar gcd = function (x, y) {\n if (x == 0) {\n return y;\n }\n return gcd(y%x, x);\n};\nvar lcm = function (x, y) {\n return parseInt(x/ gcd(x,y)) * y;\n};\nvar dfs = function (x, idx, rt) {\n vis[x] = true;\n var y = crash[x];\n if (vis[y] == null) {\n dfs(y, idx+1, rt);\n }\n else {\n if (y == rt) {\n if (idx % 2 == 1) {\n res = lcm(res, idx);\n }\n else {\n res = lcm(res, parseInt(idx/2));\n }\n }\n else {\n res = -1;\n }\n return;\n }\n}\n\nfor (var i = 0; i < n; i ++) {\n if (vis[i] == null) {\n dfs(i, 1, i);\n if (res == -1) \n break;\n }\n}\n\nprint(res);", "src_uid": "149221131a978298ac56b58438df46c9"}
{"source_code": "var num = readline().split(\" \").map(function(x) { return parseInt(x); });\nvar n=num[0];\n\nwrite(Math.floor(n/2)+1);", "src_uid": "5551742f6ab39fdac3930d866f439e3e"}
{"source_code": "ip = readline().split(' ').map(Number);\na = ip[0], b = ip[1], c = ip[2];\ni = 0;\nfound = false;\nwhile (!found && i * a <= c){\n k = c - (a*i);\n if (k % b === 0){\n found = true;\n break;\n }\n i++;\n}\nprint(found?'Yes':'No');\n", "src_uid": "e66ecb0021a34042885442b336f3d911"}
{"source_code": "//rextester.com:C24.2.0 (SpiderMonkey)--codeforces.com:V8 4.8.0\nvar z=readline().split(' ');var a=parseInt(z[0]);var b=parseInt(z[1])\nif(a<1&b>0)print('Impossible')\nelse print((a>b)?a:b,b!=0?a+b-1:a)", "src_uid": "1e865eda33afe09302bda9077d613763"}
{"source_code": "function main()\n{\n var data = readline().split(' ');\n var k = data[0];\n var n = 4;\n var x = 0;\n var a = new Array (0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0);\n for ( var i = 0; i < n; i++)\n {\n data = readline().split(' ');\n var line = data[0]\n for ( var j = 0; j < line.length; j++)\n { \n if (line[j] == '.')\n continue;\n x = +(line[j]);\n a[x]++;\n if (a[x] > 2*k)\n {\n print('NO');\n return;\n }\n } \n }\n print('YES');\n}\nmain()\n", "src_uid": "5fdaf8ee7763cb5815f49c0c38398f16"}
{"source_code": "let data = '';\nprocess.stdin.on('data',c => data += c);\nconst solution = () => {\n\tlet [n, k, m] = data.split(' ').map(v => parseInt(v, 10));\n\tlet r = Math.trunc(((m-1)%(2*k))/2) + 1;\n\tlet d = Math.trunc((m-1)/(2 * k)) + 1;\n\tlet v = (m%2 === 0)?\"R\":\"L\";\n\tconsole.log(`${d} ${r} ${v}`);\n};\n\nprocess.stdin.on('end', solution);", "src_uid": "d6929926b44c2d5b1a8e6b7f965ca1bb"}
{"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;\nlet n, a, b;\nlet arr1, arr2;\n\nrl.on('line', (d) => {\n if (c === 0) {\n c++;\n [n, a, b] = d.split(' ').map(Number);\n return;\n }\n\n if (c === 1) {\n arr1 = d.split(' ').map(Number);\n c++;\n return;\n }\n\n arr2 = d.split(' ').map(Number);\n\n c++;\n});\n\nrl.on('close', () => {\n let ans = '';\n arr1.sort((a, b) => a - b);\n arr2.sort((a, b) => a - b);\n\n for (let i = 1; i <= n; i++) {\n if (arr1.indexOf(i) > -1) {\n ans += '1 ';\n }\n else {\n ans += '2 ';\n }\n }\n\n console.log(ans);\n});\n", "src_uid": "a35a27754c9c095c6f1b2d4adccbfe93"}
{"source_code": "function main() {\n\n var arr = readline().split(' ').map(Number);\n var n=arr[0];\n var vol=arr[1];\n\n var friends = readline().split(' ').map(Number);\n\n var total=0;\n\n friends.sort(function (a, b) {\n return a-b;\n });\n \n\n for(var i=0;i<n-1;i++){\n total+=friends[i];\n }\n\n if(total<=vol){\n print(\"YES\");\n }else {\n print(\"NO\");\n }\n\n}\n\nmain();", "src_uid": "496baae594b32c5ffda35b896ebde629"}
{"source_code": "var lettersToCheck = parseInt(readline());\nvar word = readline();\nvar vowels = ['a', 'e', 'i', 'o', 'u', 'y'];\nfor (var index = 0; index < word.length;) {\n if (vowels.includes(word[index]) && vowels.includes(word[index + 1])) {\n word = word.slice(0, index + 1) + word.slice(index + 2, word.length);\n } else {\n index++;\n }\n}\nprint(word)\n", "src_uid": "63a4a5795d94f698b0912bb8d4cdf690"}
{"source_code": "var Point = function(coors) {\n this.x = +coors[0];\n this.y = +coors[1];\n};\n\nvar Vector = function(pointStart, pointEnd) {\n this.x = pointEnd.x - pointStart.x;\n this.y = pointEnd.y - pointStart.y;\n\n this.length = Math.sqrt(this.x*this.x + this.y*this.y);\n};\n\nvar product = function(vector1, vector2) {\n return vector1.x*vector2.x + vector1.y*vector2.y;\n};\n\nvar angle = function(vector1, vector2) {\n return Math.acos(product(vector1, vector2) / (vector1.length * vector2.length)) * 180.0 / Math.PI;\n};\n\nvar isN = function(number) {\n return Math.abs(Math.round(number) - number) < 0.0001;\n};\n\nvar pA = new Point(readline().split(' '));\nvar pB = new Point(readline().split(' '));\nvar pC = new Point(readline().split(' '));\n\nvar pO = new Point((function () {\n var A1 = 2.0*(pB.x - pA.x);\n var B1 = 2.0*(pB.y - pA.y);\n var C1 = (pA.x*pA.x + pA.y*pA.y) - (pB.x*pB.x + pB.y*pB.y);\n\n var A2 = 2.0*(pC.x - pB.x);\n var B2 = 2.0*(pC.y - pB.y);\n var C2 = (pB.x*pB.x + pB.y*pB.y) - (pC.x*pC.x + pC.y*pC.y);\n\n return [(B1*C2 - C1*B2)/(A1*B2 - B1*A2), (A1*C2 - C1*A2)/(B1*A2 - A1*B2)]\n})());\n\nvar vOA = new Vector(pO, pA);\nvar vOB = new Vector(pO, pB);\nvar vOC = new Vector(pO, pC);\n\nvar aAOB = angle(vOA, vOB);\nvar aBOC = angle(vOB, vOC);\n\nfor (var i = 3; i <= 100; ++i) {\n var a = 360.0/i;\n \n if (isN(aAOB/a) && isN(aBOC/a)) {\n var R = vOA.length;\n \n write(i/2.0 * R*R * Math.sin(2.0*Math.PI / i));\n break;\n }\n}\n\n", "src_uid": "980f4094b3cfc647d6f74e840b1bfb62"}
{"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 numberString = readLine();\n // if (numberString.indexOf('4') === -1 && numberString.indexOf('1') === -1) {\n // console.log('NO');\n // return;\n // }\n for (let i = 0; i < numberString.length; i++) {\n if (numberString[i] !== '1' && numberString[i] !== '4') {\n console.log('NO');\n return;\n }\n }\n if (numberString[0] !== '1') {\n console.log('NO');\n return;\n }\n if (numberString.includes('444')) {\n console.log('NO');\n return;\n }\n console.log('YES');\n}\n", "src_uid": "3153cfddae27fbd817caaf2cb7a6a4b5"}
{"source_code": "const readline = require('readline');\nconst rl = readline.createInterface({\n input: process.stdin,\n output: process.stdout\n});\n\nlet l = 0;\nlet n = 0\n\nrl.on('line', (input) => {\n if (l === 0) {\n n = parseInt(input)\n } else {\n if (l === n)\n rl.close();\n\n let nr = parseInt(input)\n let i = 7\n let c = 0\n while (nr != 0) {\n if (nr - i < 0)\n i--\n else {\n nr = nr - i\n c++\n }\n }\n console.log(c)\n\n }\n l++\n});\n", "src_uid": "a661b6ce166fe4b2bbfd0ace56a7dc2c"}
{"source_code": "var mat = readline().split(\" \");\nvar temp = 1;\nvar reg = /[CMY]/i\n\tfor (var i=0; i<+mat[0]; i++){\n\t\tvar str = readline().split(\" \")\n\t\tfor (var j=0; j<+mat[1]; j++){\n\t\t\tif (reg.test(str[j]))\n\t\t\t{\n\t\t\t\ttemp = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t}\ntemp==0? print(\"#Color\"):print(\"#Black&White\");", "src_uid": "19c311c02380f9a73cd477e4fde27454"}
{"source_code": "var checkName = (readline() + readline()).split('').sort().join('');\nvar winterName = readline().split('').sort().join('');\n\nif (checkName === winterName) {\n print('YES');\n}\nelse {\n print('NO');\n}", "src_uid": "b6456a39d38fabcd25267793ed94d90c"}
{"source_code": "var l = readline().split(' ')\nvar Y = l[0]\nvar W = l[1]\nvar m = Math.max(Y, W)\n\nswitch (m) {\n case 6: print('1/6'); break\n case 5: print('1/3'); break\n case 4: print('1/2'); break\n case 3: print('2/3'); break\n case 2: print('5/6'); break\n case 1: print('1/1'); break\n}", "src_uid": "f97eb4ecffb6cbc8679f0c621fd59414"}
{"source_code": "var arr = readline().split(' ');\nvar len = Number(arr[0]);\narr = readline().split(' ');\n\nvar str = arr[0];\nvar num_in_p = 0;\nvar max_len = 0;\nvar tmp_len = 0;\nvar p_flag = false;\nvar s_flag = false;\n\nfor (var i = 0;i < str.length;i ++) {\n\tif (!s_flag && !p_flag && helper(str[i]) == -1) {\n\t\ttmp_len ++;\n\t\ts_flag = true;\n\t} else if (s_flag && !p_flag && helper(str[i]) == -1) {\n\t\ttmp_len ++;\n\t} else if (helper(str[i]) != -1 && !p_flag && s_flag) {\n\t\ts_flag = false;\n\t\tmax_len < tmp_len ? max_len = tmp_len : null;\n\t\ttmp_len = 0;\n\t} \n\tif (!p_flag && helper(str[i]) == 1) {\n\t\tp_flag = true;\n\t} else if (p_flag && helper(str[i]) == 2) {\n\t\tp_flag = false;\n\t}\n\n\tif (p_flag && helper(str[i]) == -1 && !s_flag) {\n\t\ts_flag = true;\n\t\tnum_in_p ++;\n\t} else if (p_flag && s_flag && helper(str[i]) != -1) {\n\t\ts_flag = false;\n\t} \n}\nmax_len < tmp_len ? max_len = tmp_len : null;\n\nprint(max_len);\nprint(num_in_p);\n\nfunction helper(_c) {\n\tif (_c == '_') {\n\t\treturn 0;\n\t} else if (_c == '(') {\n\t\treturn 1;\n\t} else if (_c == ')') {\n\t\treturn 2;\n\t} else {\n\t\treturn -1;\n\t}\n}", "src_uid": "fc86df4931e787fa3a1a40e2aecf0b92"}
{"source_code": "const processData = (lines) => {\n const l = 'codeforces'.split('')\n const arr = Array(l.length).fill(1)\n const num = +lines[0]\n\n let cur = 1\n let iter = 0\n while(cur < num) {\n cur /= arr[iter]\n arr[iter] = arr[iter] + 1\n cur *= arr[iter]\n iter = (iter + 1) % l.length\n }\n let res = []\n for (let i=0;i<arr.length; i++) {\n res = res.concat(Array(arr[i]).fill(l[i]))\n }\n console.log(res.join(''))\n}\n\nlet i = ''\nprocess.stdin.on('data', c => i += c)\nprocess.stdin.on('end', () => {\n const {EOL} = require('os')\n const lines = i.split(EOL) /*your input text, split by lines*/\n processData(lines)\n})\n", "src_uid": "8001a7570766cadcc538217e941b3031"}
{"source_code": "var num = parseInt(readline());\nvar cnt = 0;\nvar primes = [3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,\n103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,\n199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,\n313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,\n433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,\n563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,\n673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,\n811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,\n941,947,953,967,971,977,983,991,997,1009,1013,1019,1021,1031,1033,1039,1049,\n1051,1061,1063,1069,1087,1091,1093,1097,1103,1109,1117,1123,1129,1151,1153,\n1163,1171,1181,1187,1193,1201,1213,1217,1223,1229,1231,1237,1249,1259,1277,\n1279,1283,1289,1291,1297,1301,1303,1307,1319,1321,1327,1361,1367,1373,1381,\n1399,1409,1423,1427,1429,1433,1439,1447,1451,1453,1459,1471,1481,1483,1487,\n1489,1493,1499,1511,1523,1531,1543,1549,1553,1559,1567,1571,1579,1583,1597,\n1601,1607,1609,1613,1619,1621,1627,1637,1657,1663,1667,1669,1693,1697,1699,\n1709,1721,1723,1733,1741,1747,1753,1759,1777,1783,1787,1789,1801,1811,1823,\n1831,1847,1861,1867,1871,1873,1877,1879,1889,1901,1907,1913,1931,1933,1949,\n1951,1973,1979,1987,1993,1997,1999,2003,2011,2017,2027,2029,2039,2053,2063,\n2069,2081,2083,2087,2089,2099,2111,2113,2129,2131,2137,2141,2143,2153,2161,\n2179,2203,2207,2213,2221,2237,2239,2243,2251,2267,2269,2273,2281,2287,2293,\n2297,2309,2311,2333,2339,2341,2347,2351,2357,2371,2377,2381,2383,2389,2393,\n2399,2411,2417,2423,2437,2441,2447,2459,2467,2473,2477,2503,2521,2531,2539,\n2543,2549,2551,2557,2579,2591,2593,2609,2617,2621,2633,2647,2657,2659,2663,\n2671,2677,2683,2687,2689,2693,2699,2707,2711,2713,2719,2729,2731,2741,2749,\n2753,2767,2777,2789,2791,2797,2801,2803,2819,2833,2837,2843,2851,2857,2861,\n2879,2887,2897,2903,2909,2917,2927,2939,2953,2957,2963,2969,2971,2999,3001,\n3011,3019,3023,3037,3041,3049,3061,3067,3079,3083,3089,3109,3119,3121,3137,\n3163,3167,3169,3181,3187,3191,3203,3209,3217,3221,3229,3251,3253,3257,3259,\n3271,3299,3301,3307,3313,3319,3323,3329,3331,3343,3347,3359,3361,3371,3373,\n3389,3391,3407,3413,3433,3449,3457,3461,3463,3467,3469,3491,3499,3511,3517,\n3527,3529,3533,3539,3541,3547,3557,3559,3571,3581,3583,3593,3607,3613,3617,\n3623,3631,3637,3643,3659,3671,3673,3677,3691,3697,3701,3709,3719,3727,3733,\n3739,3761,3767,3769,3779,3793,3797,3803,3821,3823,3833,3847,3851,3853,3863,\n3877,3881,3889,3907,3911,3917,3919,3923,3929,3931,3943,3947,3967,3989,4001,\n4003,4007,4013,4019,4021,4027,4049,4051,4057,4073,4079,4091,4093,4099,4111,\n4127,4129,4133,4139,4153,4157,4159,4177,4201,4211,4217,4219,4229,4231,4241,\n4243,4253,4259,4261,4271,4273,4283,4289,4297,4327,4337,4339,4349,4357,4363,\n4373,4391,4397,4409,4421,4423,4441,4447,4451,4457,4463,4481,4483,4493,4507,\n4513,4517,4519,4523,4547,4549,4561,4567,4583,4591,4597,4603,4621,4637,4639,\n4643,4649,4651,4657,4663,4673,4679,4691,4703,4721,4723,4729,4733,4751,4759,\n4783,4787,4789,4793,4799,4801,4813,4817,4831,4861,4871,4877,4889,4903,4909,\n4919,4931,4933,4937,4943,4951,4957,4967,4969,4973,4987,4993,4999,5003,5009,\n5011,5021,5023,5039,5051,5059,5077,5081,5087,5099,5101,5107,5113,5119,5147,\n5153,5167,5171,5179,5189,5197,5209,5227,5231,5233,5237,5261,5273,5279,5281,\n5297,5303,5309,5323,5333,5347,5351,5381,5387,5393,5399,5407,5413,5417,5419,\n5431,5437,5441,5443,5449,5471,5477,5479,5483,5501,5503,5507,5519,5521,5527,\n5531,5557,5563,5569,5573,5581,5591,5623,5639,5641,5647,5651,5653,5657,5659,\n5669,5683,5689,5693,5701,5711,5717,5737,5741,5743,5749,5779,5783,5791,5801,\n5807,5813,5821,5827,5839,5843,5849,5851,5857,5861,5867,5869,5879,5881,5897,\n5903,5923,5927,5939,5953,5981,5987,6007,6011,6029,6037,6043,6047,6053,6067,\n6073,6079,6089,6091,6101,6113,6121,6131,6133,6143,6151,6163,6173,6197,6199,\n6203,6211,6217,6221,6229,6247,6257,6263,6269,6271,6277,6287,6299,6301,6311,\n6317,6323,6329,6337,6343,6353,6359,6361,6367,6373,6379,6389,6397,6421,6427,\n6449,6451,6469,6473,6481,6491,6521,6529,6547,6551,6553,6563,6569,6571,6577,\n6581,6599,6607,6619,6637,6653,6659,6661,6673,6679,6689,6691,6701,6703,6709,\n6719,6733,6737,6761,6763,6779,6781,6791,6793,6803,6823,6827,6829,6833,6841,\n6857,6863,6869,6871,6883,6899,6907,6911,6917,6947,6949,6959,6961,6967,6971,\n6977,6983,6991,6997,7001,7013,7019,7027,7039,7043,7057,7069,7079,7103,7109,\n7121,7127,7129,7151,7159,7177,7187,7193,7207,7211,7213,7219,7229,7237,7243,\n7247,7253,7283,7297,7307,7309,7321,7331,7333,7349,7351,7369,7393,7411,7417,\n7433,7451,7457,7459,7477,7481,7487,7489,7499,7507,7517,7523,7529,7537,7541,\n7547,7549,7559,7561,7573,7577,7583,7589,7591,7603,7607,7621,7639,7643,7649,\n7669,7673,7681,7687,7691,7699,7703,7717,7723,7727,7741,7753,7757,7759,7789,\n7793,7817,7823,7829,7841,7853,7867,7873,7877,7879,7883,7901,7907,7919,7927,\n7933,7937,7949,7951,7963,7993,8009,8011,8017,8039,8053,8059,8069,8081,8087,\n8089,8093,8101,8111,8117,8123,8147,8161,8167,8171,8179,8191,8209,8219,8221,\n8231,8233,8237,8243,8263,8269,8273,8287,8291,8293,8297,8311,8317,8329,8353,\n8363,8369,8377,8387,8389,8419,8423,8429,8431,8443,8447,8461,8467,8501,8513,\n8521,8527,8537,8539,8543,8563,8573,8581,8597,8599,8609,8623,8627,8629,8641,\n8647,8663,8669,8677,8681,8689,8693,8699,8707,8713,8719,8731,8737,8741,8747,\n8753,8761,8779,8783,8803,8807,8819,8821,8831,8837,8839,8849,8861,8863,8867,\n8887,8893,8923,8929,8933,8941,8951,8963,8969,8971,8999,9001,9007,9011,9013,\n9029,9041,9043,9049,9059,9067,9091,9103,9109,9127,9133,9137,9151,9157,9161,\n9173,9181,9187,9199,9203,9209,9221,9227,9239,9241,9257,9277,9281,9283,9293,\n9311,9319,9323,9337,9341,9343,9349,9371,9377,9391,9397,9403,9413,9419,9421,\n9431,9433,9437,9439,9461,9463,9467,9473,9479,9491,9497,9511,9521,9533,9539,\n9547,9551,9587,9601,9613,9619,9623,9629,9631,9643,9649,9661,9677,9679,9689,\n9697,9719,9721,9733,9739,9743,9749,9767,9769,9781,9787,9791,9803,9811,9817,\n9829,9833,9839,9851,9857,9859,9871,9883,9887,9901,9907,9923,9929,9931,9941,\n9949,9967,9973,10007,10009,10037,10039,10061,10067,10069,10079,10091,10093,\n10099,10103,10111,10133,10139,10141,10151,10159,10163,10169,10177,10181,\n10193,10211,10223,10243,10247,10253,10259,10267,10271,10273,10289,10301,\n10303,10313,10321,10331,10333,10337,10343,10357,10369,10391,10399,10427,\n10429,10433,10453,10457,10459,10463,10477,10487,10499,10501,10513,10529,\n10531,10559,10567,10589,10597,10601,10607,10613,10627,10631,10639,10651,\n10657,10663,10667,10687,10691,10709,10711,10723,10729,10733,10739,10753,\n10771,10781,10789,10799,10831,10837,10847,10853,10859,10861,10867,10883,\n10889,10891,10903,10909,10937,10939,10949,10957,10973,10979,10987,10993,\n11003,11027,11047,11057,11059,11069,11071,11083,11087,11093,11113,11117,\n11119,11131,11149,11159,11161,11171,11173,11177,11197,11213,11239,11243,\n11251,11257,11261,11273,11279,11287,11299,11311,11317,11321,11329,11351,\n11353,11369,11383,11393,11399,11411,11423,11437,11443,11447,11467,11471,\n11483,11489,11491,11497,11503,11519,11527,11549,11551,11579,11587,11593,\n11597,11617,11621,11633,11657,11677,11681,11689,11699,11701,11717,11719,\n11731,11743,11777,11779,11783,11789,11801,11807,11813,11821,11827,11831,\n11833,11839,11863,11867,11887,11897,11903,11909,11923,11927,11933,11939,\n11941,11953,11959,11969,11971,11981,11987,12007,12011,12037,12041,12043,\n12049,12071,12073,12097,12101,12107,12109,12113,12119,12143,12149,12157,\n12161,12163,12197,12203,12211,12227,12239,12241,12251,12253,12263,12269,\n12277,12281,12289,12301,12323,12329,12343,12347,12373,12377,12379,12391,\n12401,12409,12413,12421,12433,12437,12451,12457,12473,12479,12487,12491,\n12497,12503,12511,12517,12527,12539,12541,12547,12553,12569,12577,12583,\n12589,12601,12611,12613,12619,12637,12641,12647,12653,12659,12671,12689,\n12697,12703,12713,12721,12739,12743,12757,12763,12781,12791,12799,12809,\n12821,12823,12829,12841,12853,12889,12893,12899,12907,12911,12917,12919,\n12923,12941,12953,12959,12967,12973,12979,12983,13001,13003,13007,13009,\n13033,13037,13043,13049,13063,13093,13099,13103,13109,13121,13127,13147,\n13151,13159,13163,13171,13177,13183,13187,13217,13219,13229,13241,13249,\n13259,13267,13291,13297,13309,13313,13327,13331,13337,13339,13367,13381,\n13397,13399,13411,13417,13421,13441,13451,13457,13463,13469,13477,13487,\n13499,13513,13523,13537,13553,13567,13577,13591,13597,13613,13619,13627,\n13633,13649,13669,13679,13681,13687,13691,13693,13697,13709,13711,13721,\n13723,13729,13751,13757,13759,13763,13781,13789,13799,13807,13829,13831,\n13841,13859,13873,13877,13879,13883,13901,13903,13907,13913,13921,13931,\n13933,13963,13967,13997,13999,14009,14011,14029,14033,14051,14057,14071,\n14081,14083,14087,14107,14143,14149,14153,14159,14173,14177,14197,14207,\n14221,14243,14249,14251,14281,14293,14303,14321,14323,14327,14341,14347,\n14369,14387,14389,14401,14407,14411,14419,14423,14431,14437,14447,14449,\n14461,14479,14489,14503,14519,14533,14537,14543,14549,14551,14557,14561,\n14563,14591,14593,14621,14627,14629,14633,14639,14653,14657,14669,14683,\n14699,14713,14717,14723,14731,14737,14741,14747,14753,14759,14767,14771,\n14779,14783,14797,14813,14821,14827,14831,14843,14851,14867,14869,14879,\n14887,14891,14897,14923,14929,14939,14947,14951,14957,14969,14983,15013,\n15017,15031,15053,15061,15073,15077,15083,15091,15101,15107,15121,15131,\n15137,15139,15149,15161,15173,15187,15193,15199,15217,15227,15233,15241,\n15259,15263,15269,15271,15277,15287,15289,15299,15307,15313,15319,15329,\n15331,15349,15359,15361,15373,15377,15383,15391,15401,15413,15427,15439,\n15443,15451,15461,15467,15473,15493,15497,15511,15527,15541,15551,15559,\n15569,15581,15583,15601,15607,15619,15629,15641,15643,15647,15649,15661,\n15667,15671,15679,15683,15727,15731,15733,15737,15739,15749,15761,15767,\n15773,15787,15791,15797,15803,15809,15817,15823,15859,15877,15881,15887,\n15889,15901,15907,15913,15919,15923,15937,15959,15971,15973,15991,16001,\n16007,16033,16057,16061,16063,16067,16069,16073,16087,16091,16097,16103,\n16111,16127,16139,16141,16183,16187,16189,16193,16217,16223,16229,16231,\n16249,16253,16267,16273,16301,16319,16333,16339,16349,16361,16363,16369,\n16381,16411,16417,16421,16427,16433,16447,16451,16453,16477,16481,16487,\n16493,16519,16529,16547,16553,16561,16567,16573,16603,16607,16619,16631,\n16633,16649,16651,16657,16661,16673,16691,16693,16699,16703,16729,16741,\n16747,16759,16763,16787,16811,16823,16829,16831,16843,16871,16879,16883,\n16889,16901,16903,16921,16927,16931,16937,16943,16963,16979,16981,16987,\n16993,17011,17021,17027,17029,17033,17041,17047,17053,17077,17093,17099,\n17107,17117,17123,17137,17159,17167,17183,17189,17191,17203,17207,17209,\n17231,17239,17257,17291,17293,17299,17317,17321,17327,17333,17341,17351,\n17359,17377,17383,17387,17389,17393,17401,17417,17419,17431,17443,17449,\n17467,17471,17477,17483,17489,17491,17497,17509,17519,17539,17551,17569,\n17573,17579,17581,17597,17599,17609,17623,17627,17657,17659,17669,17681,\n17683,17707,17713,17729,17737,17747,17749,17761,17783,17789,17791,17807,\n17827,17837,17839,17851,17863,17881,17891,17903,17909,17911,17921,17923,\n17929,17939,17957,17959,17971,17977,17981,17987,17989,18013,18041,18043,\n18047,18049,18059,18061,18077,18089,18097,18119,18121,18127,18131,18133,\n18143,18149,18169,18181,18191,18199,18211,18217,18223,18229,18233,18251,\n18253,18257,18269,18287,18289,18301,18307,18311,18313,18329,18341,18353,\n18367,18371,18379,18397,18401,18413,18427,18433,18439,18443,18451,18457,\n18461,18481,18493,18503,18517,18521,18523,18539,18541,18553,18583,18587,\n18593,18617,18637,18661,18671,18679,18691,18701,18713,18719,18731,18743,\n18749,18757,18773,18787,18793,18797,18803,18839,18859,18869,18899,18911,\n18913,18917,18919,18947,18959,18973,18979,19001,19009,19013,19031,19037,\n19051,19069,19073,19079,19081,19087,19121,19139,19141,19157,19163,19181,\n19183,19207,19211,19213,19219,19231,19237,19249,19259,19267,19273,19289,\n19301,19309,19319,19333,19373,19379,19381,19387,19391,19403,19417,19421,\n19423,19427,19429,19433,19441,19447,19457,19463,19469,19471,19477,19483,\n19489,19501,19507,19531,19541,19543,19553,19559,19571,19577,19583,19597,\n19603,19609,19661,19681,19687,19697,19699,19709,19717,19727,19739,19751,\n19753,19759,19763,19777,19793,19801,19813,19819,19841,19843,19853,19861,\n19867,19889,19891,19913,19919,19927,19937,19949,19961,19963,19973,19979,\n19991,19993,19997,20011,20021,20023,20029,20047,20051,20063,20071,20089,\n20101,20107,20113,20117,20123,20129,20143,20147,20149,20161,20173,20177,\n20183,20201,20219,20231,20233,20249,20261,20269,20287,20297,20323,20327,\n20333,20341,20347,20353,20357,20359,20369,20389,20393,20399,20407,20411,\n20431,20441,20443,20477,20479,20483,20507,20509,20521,20533,20543,20549,\n20551,20563,20593,20599,20611,20627,20639,20641,20663,20681,20693,20707,\n20717,20719,20731,20743,20747,20749,20753,20759,20771,20773,20789,20807,\n20809,20849,20857,20873,20879,20887,20897,20899,20903,20921,20929,20939,\n20947,20959,20963,20981,20983,21001,21011,21013,21017,21019,21023,21031,\n21059,21061,21067,21089,21101,21107,21121,21139,21143,21149,21157,21163,\n21169,21179,21187,21191,21193,21211,21221,21227,21247,21269,21277,21283,\n21313,21317,21319,21323,21341,21347,21377,21379,21383,21391,21397,21401,\n21407,21419,21433,21467,21481,21487,21491,21493,21499,21503,21517,21521,\n21523,21529,21557,21559,21563,21569,21577,21587,21589,21599,21601,21611,\n21613,21617,21647,21649,21661,21673,21683,21701,21713,21727,21737,21739,\n21751,21757,21767,21773,21787,21799,21803,21817,21821,21839,21841,21851,\n21859,21863,21871,21881,21893,21911,21929,21937,21943,21961,21977,21991,\n21997,22003,22013,22027,22031,22037,22039,22051,22063,22067,22073,22079,\n22091,22093,22109,22111,22123,22129,22133,22147,22153,22157,22159,22171,\n22189,22193,22229,22247,22259,22271,22273,22277,22279,22283,22291,22303,\n22307,22343,22349,22367,22369,22381,22391,22397,22409,22433,22441,22447,\n22453,22469,22481,22483,22501,22511,22531,22541,22543,22549,22567,22571,\n22573,22613,22619,22621,22637,22639,22643,22651,22669,22679,22691,22697,\n22699,22709,22717,22721,22727,22739,22741,22751,22769,22777,22783,22787,\n22807,22811,22817,22853,22859,22861,22871,22877,22901,22907,22921,22937,\n22943,22961,22963,22973,22993,23003,23011,23017,23021,23027,23029,23039,\n23041,23053,23057,23059,23063,23071,23081,23087,23099,23117,23131,23143,\n23159,23167,23173,23189,23197,23201,23203,23209,23227,23251,23269,23279,\n23291,23293,23297,23311,23321,23327,23333,23339,23357,23369,23371,23399,\n23417,23431,23447,23459,23473,23497,23509,23531,23537,23539,23549,23557,\n23561,23563,23567,23581,23593,23599,23603,23609,23623,23627,23629,23633,\n23663,23669,23671,23677,23687,23689,23719,23741,23743,23747,23753,23761,\n23767,23773,23789,23801,23813,23819,23827,23831,23833,23857,23869,23873,\n23879,23887,23893,23899,23909,23911,23917,23929,23957,23971,23977,23981,\n23993,24001,24007,24019,24023,24029,24043,24049,24061,24071,24077,24083,\n24091,24097,24103,24107,24109,24113,24121,24133,24137,24151,24169,24179,\n24181,24197,24203,24223,24229,24239,24247,24251,24281,24317,24329,24337,\n24359,24371,24373,24379,24391,24407,24413,24419,24421,24439,24443,24469,\n24473,24481,24499,24509,24517,24527,24533,24547,24551,24571,24593,24611,\n24623,24631,24659,24671,24677,24683,24691,24697,24709,24733,24749,24763,\n24767,24781,24793,24799,24809,24821,24841,24847,24851,24859,24877,24889,\n24907,24917,24919,24923,24943,24953,24967,24971,24977,24979,24989,25013,\n25031,25033,25037,25057,25073,25087,25097,25111,25117,25121,25127,25147,\n25153,25163,25169,25171,25183,25189,25219,25229,25237,25243,25247,25253,\n25261,25301,25303,25307,25309,25321,25339,25343,25349,25357,25367,25373,\n25391,25409,25411,25423,25439,25447,25453,25457,25463,25469,25471,25523,\n25537,25541,25561,25577,25579,25583,25589,25601,25603,25609,25621,25633,\n25639,25643,25657,25667,25673,25679,25693,25703,25717,25733,25741,25747,\n25759,25763,25771,25793,25799,25801,25819,25841,25847,25849,25867,25873,\n25889,25903,25913,25919,25931,25933,25939,25943,25951,25969,25981,25997,\n25999,26003,26017,26021,26029,26041,26053,26083,26099,26107,26111,26113,\n26119,26141,26153,26161,26171,26177,26183,26189,26203,26209,26227,26237,\n26249,26251,26261,26263,26267,26293,26297,26309,26317,26321,26339,26347,\n26357,26371,26387,26393,26399,26407,26417,26423,26431,26437,26449,26459,\n26479,26489,26497,26501,26513,26539,26557,26561,26573,26591,26597,26627,\n26633,26641,26647,26669,26681,26683,26687,26693,26699,26701,26711,26713,\n26717,26723,26729,26731,26737,26759,26777,26783,26801,26813,26821,26833,\n26839,26849,26861,26863,26879,26881,26891,26893,26903,26921,26927,26947,\n26951,26953,26959,26981,26987,26993,27011,27017,27031,27043,27059,27061,\n27067,27073,27077,27091,27103,27107,27109,27127,27143,27179,27191,27197,\n27211,27239,27241,27253,27259,27271,27277,27281,27283,27299,27329,27337,\n27361,27367,27397,27407,27409,27427,27431,27437,27449,27457,27479,27481,\n27487,27509,27527,27529,27539,27541,27551,27581,27583,27611,27617,27631,\n27647,27653,27673,27689,27691,27697,27701,27733,27737,27739,27743,27749,\n27751,27763,27767,27773,27779,27791,27793,27799,27803,27809,27817,27823,\n27827,27847,27851,27883,27893,27901,27917,27919,27941,27943,27947,27953,\n27961,27967,27983,27997,28001,28019,28027,28031,28051,28057,28069,28081,\n28087,28097,28099,28109,28111,28123,28151,28163,28181,28183,28201,28211,\n28219,28229,28277,28279,28283,28289,28297,28307,28309,28319,28349,28351,\n28387,28393,28403,28409,28411,28429,28433,28439,28447,28463,28477,28493,\n28499,28513,28517,28537,28541,28547,28549,28559,28571,28573,28579,28591,\n28597,28603,28607,28619,28621,28627,28631,28643,28649,28657,28661,28663,\n28669,28687,28697,28703,28711,28723,28729,28751,28753,28759,28771,28789,\n28793,28807,28813,28817,28837,28843,28859,28867,28871,28879,28901,28909,\n28921,28927,28933,28949,28961,28979,29009,29017,29021,29023,29027,29033,\n29059,29063,29077,29101,29123,29129,29131,29137,29147,29153,29167,29173,\n29179,29191,29201,29207,29209,29221,29231,29243,29251,29269,29287,29297,\n29303,29311,29327,29333,29339,29347,29363,29383,29387,29389,29399,29401,\n29411,29423,29429,29437,29443,29453,29473,29483,29501,29527,29531,29537,\n29567,29569,29573,29581,29587,29599,29611,29629,29633,29641,29663,29669,\n29671,29683,29717,29723,29741,29753,29759,29761,29789,29803,29819,29833,\n29837,29851,29863,29867,29873,29879,29881,29917,29921,29927,29947,29959,\n29983,29989,30011,30013,30029,30047,30059,30071,30089,30091,30097,30103,\n30109,30113,30119,30133,30137,30139,30161,30169,30181,30187,30197,30203,\n30211,30223,30241,30253,30259,30269,30271,30293,30307,30313,30319,30323,\n30341,30347,30367,30389,30391,30403,30427,30431,30449,30467,30469,30491,\n30493,30497,30509,30517,30529,30539,30553,30557,30559,30577,30593,30631,\n30637,30643,30649,30661,30671,30677,30689,30697,30703,30707,30713,30727,\n30757,30763,30773,30781,30803,30809,30817,30829,30839,30841,30851,30853,\n30859,30869,30871,30881,30893,30911,30931,30937,30941,30949,30971,30977,\n30983,31013,31019,31033,31039,31051,31063,31069,31079,31081,31091,31121,\n31123,31139,31147,31151,31153,31159,31177,31181,31183,31189,31193,31219,\n31223,31231,31237,31247,31249,31253,31259,31267,31271,31277,31307,31319,\n31321,31327,31333,31337,31357,31379,31387,31391,31393,31397,31469,31477,\n31481,31489,31511,31513,31517,31531,31541,31543,31547,31567,31573,31583,\n31601,31607,31627,31643,31649,31657,31663,31667,31687,31699,31721,31723,\n31727,31729,31741,31751,31769,31771,31793,31799,31817,31847,31849,31859,\n31873,31883,31891,31907,31957,31963,31973,31981,31991,32003,32009,32027,\n32029,32051,32057,32059,32063,32069,32077,32083,32089,32099,32117,32119,\n32141,32143,32159,32173,32183,32189,32191,32203,32213,32233,32237,32251,\n32257,32261,32297,32299,32303,32309,32321,32323,32327,32341,32353,32359,\n32363,32369,32371,32377,32381,32401,32411,32413,32423,32429,32441,32443,\n32467,32479,32491,32497,32503,32507,32531,32533,32537,32561,32563,32569,\n32573,32579,32587,32603,32609,32611,32621,32633,32647,32653,32687,32693,\n32707,32713,32717,32719,32749,32771,32779,32783,32789,32797,32801,32803,\n32831,32833,32839,32843,32869,32887,32909,32911,32917,32933,32939,32941,\n32957,32969,32971,32983,32987,32993,32999,33013,33023,33029,33037,33049,\n33053,33071,33073,33083,33091,33107,33113,33119,33149,33151,33161,33179,\n33181,33191,33199,33203,33211,33223,33247,33287,33289,33301,33311,33317,\n33329,33331,33343,33347,33349,33353,33359,33377,33391,33403,33409,33413,\n33427,33457,33461,33469,33479,33487,33493,33503,33521,33529,33533,33547,\n33563,33569,33577,33581,33587,33589,33599,33601,33613,33617,33619,33623,\n33629,33637,33641,33647,33679,33703,33713,33721,33739,33749,33751,33757,\n33767,33769,33773,33791,33797,33809,33811,33827,33829,33851,33857,33863,\n33871,33889,33893,33911,33923,33931,33937,33941,33961,33967,33997,34019,\n34031,34033,34039,34057,34061,34123,34127,34129,34141,34147,34157,34159,\n34171,34183,34211,34213,34217,34231,34253,34259,34261,34267,34273,34283,\n34297,34301,34303,34313,34319,34327,34337,34351,34361,34367,34369,34381,\n34403,34421,34429,34439,34457,34469,34471,34483,34487,34499,34501,34511,\n34513,34519,34537,34543,34549,34583,34589,34591,34603,34607,34613,34631,\n34649,34651,34667,34673,34679,34687,34693,34703,34721,34729,34739,34747,\n34757,34759,34763,34781,34807,34819,34841,34843,34847,34849,34871,34877,\n34883,34897,34913,34919,34939,34949,34961,34963,34981,35023,35027,35051,\n35053,35059,35069,35081,35083,35089,35099,35107,35111,35117,35129,35141,\n35149,35153,35159,35171,35201,35221,35227,35251,35257,35267,35279,35281,\n35291,35311,35317,35323,35327,35339,35353,35363,35381,35393,35401,35407,\n35419,35423,35437,35447,35449,35461,35491,35507,35509,35521,35527,35531,\n35533,35537,35543,35569,35573,35591,35593,35597,35603,35617,35671,35677,\n35729,35731,35747,35753,35759,35771,35797,35801,35803,35809,35831,35837,\n35839,35851,35863,35869,35879,35897,35899,35911,35923,35933,35951,35963,\n35969,35977,35983,35993,35999,36007,36011,36013,36017,36037,36061,36067,\n36073,36083,36097,36107,36109,36131,36137,36151,36161,36187,36191,36209,\n36217,36229,36241,36251,36263,36269,36277,36293,36299,36307,36313,36319,\n36341,36343,36353,36373,36383,36389,36433,36451,36457,36467,36469,36473,\n36479,36493,36497,36523,36527,36529,36541,36551,36559,36563,36571,36583,\n36587,36599,36607,36629,36637,36643,36653,36671,36677,36683,36691,36697,\n36709,36713,36721,36739,36749,36761,36767,36779,36781,36787,36791,36793,\n36809,36821,36833,36847,36857,36871,36877,36887,36899,36901,36913,36919,\n36923,36929,36931,36943,36947,36973,36979,36997,37003,37013,37019,37021,\n37039,37049,37057,37061,37087,37097,37117,37123,37139,37159,37171,37181,\n37189,37199,37201,37217,37223,37243,37253,37273,37277,37307,37309,37313,\n37321,37337,37339,37357,37361,37363,37369,37379,37397,37409,37423,37441,\n37447,37463,37483,37489,37493,37501,37507,37511,37517,37529,37537,37547,\n37549,37561,37567,37571,37573,37579,37589,37591,37607,37619,37633,37643,\n37649,37657,37663,37691,37693,37699,37717,37747,37781,37783,37799,37811,\n37813,37831,37847,37853,37861,37871,37879,37889,37897,37907,37951,37957,\n37963,37967,37987,37991,37993,37997,38011,38039,38047,38053,38069,38083,\n38113,38119,38149,38153,38167,38177,38183,38189,38197,38201,38219,38231,\n38237,38239,38261,38273,38281,38287,38299,38303,38317,38321,38327,38329,\n38333,38351,38371,38377,38393,38431,38447,38449,38453,38459,38461,38501,\n38543,38557,38561,38567,38569,38593,38603,38609,38611,38629,38639,38651,\n38653,38669,38671,38677,38693,38699,38707,38711,38713,38723,38729,38737,\n38747,38749,38767,38783,38791,38803,38821,38833,38839,38851,38861,38867,\n38873,38891,38903,38917,38921,38923,38933,38953,38959,38971,38977,38993,\n39019,39023,39041,39043,39047,39079,39089,39097,39103,39107,39113,39119,\n39133,39139,39157,39161,39163,39181,39191,39199,39209,39217,39227,39229,\n39233,39239,39241,39251,39293,39301,39313,39317,39323,39341,39343,39359,\n39367,39371,39373,39383,39397,39409,39419,39439,39443,39451,39461,39499,\n39503,39509,39511,39521,39541,39551,39563,39569,39581,39607,39619,39623,\n39631,39659,39667,39671,39679,39703,39709,39719,39727,39733,39749,39761,\n39769,39779,39791,39799,39821,39827,39829,39839,39841,39847,39857,39863,\n39869,39877,39883,39887,39901,39929,39937,39953,39971,39979,39983,39989,\n40009,40013,40031,40037,40039,40063,40087,40093,40099,40111,40123,40127,\n40129,40151,40153,40163,40169,40177,40189,40193,40213,40231,40237,40241,\n40253,40277,40283,40289,40343,40351,40357,40361,40387,40423,40427,40429,\n40433,40459,40471,40483,40487,40493,40499,40507,40519,40529,40531,40543,\n40559,40577,40583,40591,40597,40609,40627,40637,40639,40693,40697,40699,\n40709,40739,40751,40759,40763,40771,40787,40801,40813,40819,40823,40829,\n40841,40847,40849,40853,40867,40879,40883,40897,40903,40927,40933,40939,\n40949,40961,40973,40993,41011,41017,41023,41039,41047,41051,41057,41077,\n41081,41113,41117,41131,41141,41143,41149,41161,41177,41179,41183,41189,\n41201,41203,41213,41221,41227,41231,41233,41243,41257,41263,41269,41281,\n41299,41333,41341,41351,41357,41381,41387,41389,41399,41411,41413,41443,\n41453,41467,41479,41491,41507,41513,41519,41521,41539,41543,41549,41579,\n41593,41597,41603,41609,41611,41617,41621,41627,41641,41647,41651,41659,\n41669,41681,41687,41719,41729,41737,41759,41761,41771,41777,41801,41809,\n41813,41843,41849,41851,41863,41879,41887,41893,41897,41903,41911,41927,\n41941,41947,41953,41957,41959,41969,41981,41983,41999,42013,42017,42019,\n42023,42043,42061,42071,42073,42083,42089,42101,42131,42139,42157,42169,\n42179,42181,42187,42193,42197,42209,42221,42223,42227,42239,42257,42281,\n42283,42293,42299,42307,42323,42331,42337,42349,42359,42373,42379,42391,\n42397,42403,42407,42409,42433,42437,42443,42451,42457,42461,42463,42467,\n42473,42487,42491,42499,42509,42533,42557,42569,42571,42577,42589,42611,\n42641,42643,42649,42667,42677,42683,42689,42697,42701,42703,42709,42719,\n42727,42737,42743,42751,42767,42773,42787,42793,42797,42821,42829,42839,\n42841,42853,42859,42863,42899,42901,42923,42929,42937,42943,42953,42961,\n42967,42979,42989,43003,43013,43019,43037,43049,43051,43063,43067,43093,\n43103,43117,43133,43151,43159,43177,43189,43201,43207,43223,43237,43261,\n43271,43283,43291,43313,43319,43321,43331,43391,43397,43399,43403,43411,\n43427,43441,43451,43457,43481,43487,43499,43517,43541,43543,43573,43577,\n43579,43591,43597,43607,43609,43613,43627,43633,43649,43651,43661,43669,\n43691,43711,43717,43721,43753,43759,43777,43781,43783,43787,43789,43793,\n43801,43853,43867,43889,43891,43913,43933,43943,43951,43961,43963,43969,\n43973,43987,43991,43997,44017,44021,44027,44029,44041,44053,44059,44071,\n44087,44089,44101,44111,44119,44123,44129,44131,44159,44171,44179,44189,\n44201,44203,44207,44221,44249,44257,44263,44267,44269,44273,44279,44281,\n44293,44351,44357,44371,44381,44383,44389,44417,44449,44453,44483,44491,\n44497,44501,44507,44519,44531,44533,44537,44543,44549,44563,44579,44587,\n44617,44621,44623,44633,44641,44647,44651,44657,44683,44687,44699,44701,\n44711,44729,44741,44753,44771,44773,44777,44789,44797,44809,44819,44839,\n44843,44851,44867,44879,44887,44893,44909,44917,44927,44939,44953,44959,\n44963,44971,44983,44987,45007,45013,45053,45061,45077,45083,45119,45121,\n45127,45131,45137,45139,45161,45179,45181,45191,45197,45233,45247,45259,\n45263,45281,45289,45293,45307,45317,45319,45329,45337,45341,45343,45361,\n45377,45389,45403,45413,45427,45433,45439,45481,45491,45497,45503,45523,\n45533,45541,45553,45557,45569,45587,45589,45599,45613,45631,45641,45659,\n45667,45673,45677,45691,45697,45707,45737,45751,45757,45763,45767,45779,\n45817,45821,45823,45827,45833,45841,45853,45863,45869,45887,45893,45943,\n45949,45953,45959,45971,45979,45989,46021,46027,46049,46051,46061,46073,\n46091,46093,46099,46103,46133,46141,46147,46153,46171,46181,46183,46187,\n46199,46219,46229,46237,46261,46271,46273,46279,46301,46307,46309,46327,\n46337,46349,46351,46381,46399,46411,46439,46441,46447,46451,46457,46471,\n46477,46489,46499,46507,46511,46523,46549,46559,46567,46573,46589,46591,\n46601,46619,46633,46639,46643,46649,46663,46679,46681,46687,46691,46703,\n46723,46727,46747,46751,46757,46769,46771,46807,46811,46817,46819,46829,\n46831,46853,46861,46867,46877,46889,46901,46919,46933,46957,46993,46997,\n47017,47041,47051,47057,47059,47087,47093,47111,47119,47123,47129,47137,\n47143,47147,47149,47161,47189,47207,47221,47237,47251,47269,47279,47287,\n47293,47297,47303,47309,47317,47339,47351,47353,47363,47381,47387,47389,\n47407,47417,47419,47431,47441,47459,47491,47497,47501,47507,47513,47521,\n47527,47533,47543,47563,47569,47581,47591,47599,47609,47623,47629,47639,\n47653,47657,47659,47681,47699,47701,47711,47713,47717,47737,47741,47743,\n47777,47779,47791,47797,47807,47809,47819,47837,47843,47857,47869,47881,\n47903,47911,47917,47933,47939,47947,47951,47963,47969,47977,47981,48017,\n48023,48029,48049,48073,48079,48091,48109,48119,48121,48131,48157,48163,\n48179,48187,48193,48197,48221,48239,48247,48259,48271,48281,48299,48311,\n48313,48337,48341,48353,48371,48383,48397,48407,48409,48413,48437,48449,\n48463,48473,48479,48481,48487,48491,48497,48523,48527,48533,48539,48541,\n48563,48571,48589,48593,48611,48619,48623,48647,48649,48661,48673,48677,\n48679,48731,48733,48751,48757,48761,48767,48779,48781,48787,48799,48809,\n48817,48821,48823,48847,48857,48859,48869,48871,48883,48889,48907,48947,\n48953,48973,48989,48991,49003,49009,49019,49031,49033,49037,49043,49057,\n49069,49081,49103,49109,49117,49121,49123,49139,49157,49169,49171,49177,\n49193,49199,49201,49207,49211,49223,49253,49261,49277,49279,49297,49307,\n49331,49333,49339,49363,49367,49369,49391,49393,49409,49411,49417,49429,\n49433,49451,49459,49463,49477,49481,49499,49523,49529,49531,49537,49547,\n49549,49559,49597,49603,49613,49627,49633,49639,49663,49667,49669,49681,\n49697,49711,49727,49739,49741,49747,49757,49783,49787,49789,49801,49807,\n49811,49823,49831,49843,49853,49871,49877,49891,49919,49921,49927,49937,\n49939,49943,49957,49991,49993,49999,50021,50023,50033,50047,50051,50053,\n50069,50077,50087,50093,50101,50111,50119,50123,50129,50131,50147,50153,\n50159,50177,50207,50221,50227,50231,50261,50263,50273,50287,50291,50311,\n50321,50329,50333,50341,50359,50363,50377,50383,50387,50411,50417,50423,\n50441,50459,50461,50497,50503,50513,50527,50539,50543,50549,50551,50581,\n50587,50591,50593,50599,50627,50647,50651,50671,50683,50707,50723,50741,\n50753,50767,50773,50777,50789,50821,50833,50839,50849,50857,50867,50873,\n50891,50893,50909,50923,50929,50951,50957,50969,50971,50989,50993,51001,\n51031,51043,51047,51059,51061,51071,51109,51131,51133,51137,51151,51157,\n51169,51193,51197,51199,51203,51217,51229,51239,51241,51257,51263,51283,\n51287,51307,51329,51341,51343,51347,51349,51361,51383,51407,51413,51419,\n51421,51427,51431,51437,51439,51449,51461,51473,51479,51481,51487,51503,\n51511,51517,51521,51539,51551,51563,51577,51581,51593,51599,51607,51613,\n51631,51637,51647,51659,51673,51679,51683,51691,51713,51719,51721,51749,\n51767,51769,51787,51797,51803,51817,51827,51829,51839,51853,51859,51869,\n51871,51893,51899,51907,51913,51929,51941,51949,51971,51973,51977,51991,\n52009,52021,52027,52051,52057,52067,52069,52081,52103,52121,52127,52147,\n52153,52163,52177,52181,52183,52189,52201,52223,52237,52249,52253,52259,\n52267,52289,52291,52301,52313,52321,52361,52363,52369,52379,52387,52391,\n52433,52453,52457,52489,52501,52511,52517,52529,52541,52543,52553,52561,\n52567,52571,52579,52583,52609,52627,52631,52639,52667,52673,52691,52697,\n52709,52711,52721,52727,52733,52747,52757,52769,52783,52807,52813,52817,\n52837,52859,52861,52879,52883,52889,52901,52903,52919,52937,52951,52957,\n52963,52967,52973,52981,52999,53003,53017,53047,53051,53069,53077,53087,\n53089,53093,53101,53113,53117,53129,53147,53149,53161,53171,53173,53189,\n53197,53201,53231,53233,53239,53267,53269,53279,53281,53299,53309,53323,\n53327,53353,53359,53377,53381,53401,53407,53411,53419,53437,53441,53453,\n53479,53503,53507,53527,53549,53551,53569,53591,53593,53597,53609,53611,\n53617,53623,53629,53633,53639,53653,53657,53681,53693,53699,53717,53719,\n53731,53759,53773,53777,53783,53791,53813,53819,53831,53849,53857,53861,\n53881,53887,53891,53897,53899,53917,53923,53927,53939,53951,53959,53987,\n53993,54001,54011,54013,54037,54049,54059,54083,54091,54101,54121,54133,\n54139,54151,54163,54167,54181,54193,54217,54251,54269,54277,54287,54293,\n54311,54319,54323,54331,54347,54361,54367,54371,54377,54401,54403,54409,\n54413,54419,54421,54437,54443,54449,54469,54493,54497,54499,54503,54517,\n54521,54539,54541,54547,54559,54563,54577,54581,54583,54601,54617,54623,\n54629,54631,54647,54667,54673,54679,54709,54713,54721,54727,54751,54767,\n54773,54779,54787,54799,54829,54833,54851,54869,54877,54881,54907,54917,\n54919,54941,54949,54959,54973,54979,54983,55001,55009,55021,55049,55051,\n55057,55061,55073,55079,55103,55109,55117,55127,55147,55163,55171,55201,\n55207,55213,55217,55219,55229,55243,55249,55259,55291,55313,55331,55333,\n55337,55339,55343,55351,55373,55381,55399,55411,55439,55441,55457,55469,\n55487,55501,55511,55529,55541,55547,55579,55589,55603,55609,55619,55621,\n55631,55633,55639,55661,55663,55667,55673,55681,55691,55697,55711,55717,\n55721,55733,55763,55787,55793,55799,55807,55813,55817,55819,55823,55829,\n55837,55843,55849,55871,55889,55897,55901,55903,55921,55927,55931,55933,\n55949,55967,55987,55997,56003,56009,56039,56041,56053,56081,56087,56093,\n56099,56101,56113,56123,56131,56149,56167,56171,56179,56197,56207,56209,\n56237,56239,56249,56263,56267,56269,56299,56311,56333,56359,56369,56377,\n56383,56393,56401,56417,56431,56437,56443,56453,56467,56473,56477,56479,\n56489,56501,56503,56509,56519,56527,56531,56533,56543,56569,56591,56597,\n56599,56611,56629,56633,56659,56663,56671,56681,56687,56701,56711,56713,\n56731,56737,56747,56767,56773,56779,56783,56807,56809,56813,56821,56827,\n56843,56857,56873,56891,56893,56897,56909,56911,56921,56923,56929,56941,\n56951,56957,56963,56983,56989,56993,56999,57037,57041,57047,57059,57073,\n57077,57089,57097,57107,57119,57131,57139,57143,57149,57163,57173,57179,\n57191,57193,57203,57221,57223,57241,57251,57259,57269,57271,57283,57287,\n57301,57329,57331,57347,57349,57367,57373,57383,57389,57397,57413,57427,\n57457,57467,57487,57493,57503,57527,57529,57557,57559,57571,57587,57593,\n57601,57637,57641,57649,57653,57667,57679,57689,57697,57709,57713,57719,\n57727,57731,57737,57751,57773,57781,57787,57791,57793,57803,57809,57829,\n57839,57847,57853,57859,57881,57899,57901,57917,57923,57943,57947,57973,\n57977,57991,58013,58027,58031,58043,58049,58057,58061,58067,58073,58099,\n58109,58111,58129,58147,58151,58153,58169,58171,58189,58193,58199,58207,\n58211,58217,58229,58231,58237,58243,58271,58309,58313,58321,58337,58363,\n58367,58369,58379,58391,58393,58403,58411,58417,58427,58439,58441,58451,\n58453,58477,58481,58511,58537,58543,58549,58567,58573,58579,58601,58603,\n58613,58631,58657,58661,58679,58687,58693,58699,58711,58727,58733,58741,\n58757,58763,58771,58787,58789,58831,58889,58897,58901,58907,58909,58913,\n58921,58937,58943,58963,58967,58979,58991,58997,59009,59011,59021,59023,\n59029,59051,59053,59063,59069,59077,59083,59093,59107,59113,59119,59123,\n59141,59149,59159,59167,59183,59197,59207,59209,59219,59221,59233,59239,\n59243,59263,59273,59281,59333,59341,59351,59357,59359,59369,59377,59387,\n59393,59399,59407,59417,59419,59441,59443,59447,59453,59467,59471,59473,\n59497,59509,59513,59539,59557,59561,59567,59581,59611,59617,59621,59627,\n59629,59651,59659,59663,59669,59671,59693,59699,59707,59723,59729,59743,\n59747,59753,59771,59779,59791,59797,59809,59833,59863,59879,59887,59921,\n59929,59951,59957,59971,59981,59999,60013,60017,60029,60037,60041,60077,\n60083,60089,60091,60101,60103,60107,60127,60133,60139,60149,60161,60167,\n60169,60209,60217,60223,60251,60257,60259,60271,60289,60293,60317,60331,\n60337,60343,60353,60373,60383,60397,60413,60427,60443,60449,60457,60493,\n60497,60509,60521,60527,60539,60589,60601,60607,60611,60617,60623,60631,\n60637,60647,60649,60659,60661,60679,60689,60703,60719,60727,60733,60737,\n60757,60761,60763,60773,60779,60793,60811,60821,60859,60869,60887,60889,\n60899,60901,60913,60917,60919,60923,60937,60943,60953,60961,61001,61007,\n61027,61031,61043,61051,61057,61091,61099,61121,61129,61141,61151,61153,\n61169,61211,61223,61231,61253,61261,61283,61291,61297,61331,61333,61339,\n61343,61357,61363,61379,61381,61403,61409,61417,61441,61463,61469,61471,\n61483,61487,61493,61507,61511,61519,61543,61547,61553,61559,61561,61583,\n61603,61609,61613,61627,61631,61637,61643,61651,61657,61667,61673,61681,\n61687,61703,61717,61723,61729,61751,61757,61781,61813,61819,61837,61843,\n61861,61871,61879,61909,61927,61933,61949,61961,61967,61979,61981,61987,\n61991,62003,62011,62017,62039,62047,62053,62057,62071,62081,62099,62119,\n62129,62131,62137,62141,62143,62171,62189,62191,62201,62207,62213,62219,\n62233,62273,62297,62299,62303,62311,62323,62327,62347,62351,62383,62401,\n62417,62423,62459,62467,62473,62477,62483,62497,62501,62507,62533,62539,\n62549,62563,62581,62591,62597,62603,62617,62627,62633,62639,62653,62659,\n62683,62687,62701,62723,62731,62743,62753,62761,62773,62791,62801,62819,\n62827,62851,62861,62869,62873,62897,62903,62921,62927,62929,62939,62969,\n62971,62981,62983,62987,62989,63029,63031,63059,63067,63073,63079,63097,\n63103,63113,63127,63131,63149,63179,63197,63199,63211,63241,63247,63277,\n63281,63299,63311,63313,63317,63331,63337,63347,63353,63361,63367,63377,\n63389,63391,63397,63409,63419,63421,63439,63443,63463,63467,63473,63487,\n63493,63499,63521,63527,63533,63541,63559,63577,63587,63589,63599,63601,\n63607,63611,63617,63629,63647,63649,63659,63667,63671,63689,63691,63697,\n63703,63709,63719,63727,63737,63743,63761,63773,63781,63793,63799,63803,\n63809,63823,63839,63841,63853,63857,63863,63901,63907,63913,63929,63949,\n63977,63997,64007,64013,64019,64033,64037,64063,64067,64081,64091,64109,\n64123,64151,64153,64157,64171,64187,64189,64217,64223,64231,64237,64271,\n64279,64283,64301,64303,64319,64327,64333,64373,64381,64399,64403,64433,\n64439,64451,64453,64483,64489,64499,64513,64553,64567,64577,64579,64591,\n64601,64609,64613,64621,64627,64633,64661,64663,64667,64679,64693,64709,\n64717,64747,64763,64781,64783,64793,64811,64817,64849,64853,64871,64877,\n64879,64891,64901,64919,64921,64927,64937,64951,64969,64997,65003,65011,\n65027,65029,65033,65053,65063,65071,65089,65099,65101,65111,65119,65123,\n65129,65141,65147,65167,65171,65173,65179,65183,65203,65213,65239,65257,\n65267,65269,65287,65293,65309,65323,65327,65353,65357,65371,65381,65393,\n65407,65413,65419,65423,65437,65447,65449,65479,65497,65519,65521,65537,\n65539,65543,65551,65557,65563,65579,65581,65587,65599,65609,65617,65629,\n65633,65647,65651,65657,65677,65687,65699,65701,65707,65713,65717,65719,\n65729,65731,65761,65777,65789,65809,65827,65831,65837,65839,65843,65851,\n65867,65881,65899,65921,65927,65929,65951,65957,65963,65981,65983,65993,\n66029,66037,66041,66047,66067,66071,66083,66089,66103,66107,66109,66137,\n66161,66169,66173,66179,66191,66221,66239,66271,66293,66301,66337,66343,\n66347,66359,66361,66373,66377,66383,66403,66413,66431,66449,66457,66463,\n66467,66491,66499,66509,66523,66529,66533,66541,66553,66569,66571,66587,\n66593,66601,66617,66629,66643,66653,66683,66697,66701,66713,66721,66733,\n66739,66749,66751,66763,66791,66797,66809,66821,66841,66851,66853,66863,\n66877,66883,66889,66919,66923,66931,66943,66947,66949,66959,66973,66977,\n67003,67021,67033,67043,67049,67057,67061,67073,67079,67103,67121,67129,\n67139,67141,67153,67157,67169,67181,67187,67189,67211,67213,67217,67219,\n67231,67247,67261,67271,67273,67289,67307,67339,67343,67349,67369,67391,\n67399,67409,67411,67421,67427,67429,67433,67447,67453,67477,67481,67489,\n67493,67499,67511,67523,67531,67537,67547,67559,67567,67577,67579,67589,\n67601,67607,67619,67631,67651,67679,67699,67709,67723,67733,67741,67751,\n67757,67759,67763,67777,67783,67789,67801,67807,67819,67829,67843,67853,\n67867,67883,67891,67901,67927,67931,67933,67939,67943,67957,67961,67967,\n67979,67987,67993,68023,68041,68053,68059,68071,68087,68099,68111,68113,\n68141,68147,68161,68171,68207,68209,68213,68219,68227,68239,68261,68279,\n68281,68311,68329,68351,68371,68389,68399,68437,68443,68447,68449,68473,\n68477,68483,68489,68491,68501,68507,68521,68531,68539,68543,68567,68581,\n68597,68611,68633,68639,68659,68669,68683,68687,68699,68711,68713,68729,\n68737,68743,68749,68767,68771,68777,68791,68813,68819,68821,68863,68879,\n68881,68891,68897,68899,68903,68909,68917,68927,68947,68963,68993,69001,\n69011,69019,69029,69031,69061,69067,69073,69109,69119,69127,69143,69149,\n69151,69163,69191,69193,69197,69203,69221,69233,69239,69247,69257,69259,\n69263,69313,69317,69337,69341,69371,69379,69383,69389,69401,69403,69427,\n69431,69439,69457,69463,69467,69473,69481,69491,69493,69497,69499,69539,\n69557,69593,69623,69653,69661,69677,69691,69697,69709,69737,69739,69761,\n69763,69767,69779,69809,69821,69827,69829,69833,69847,69857,69859,69877,\n69899,69911,69929,69931,69941,69959,69991,69997,70001,70003,70009,70019,\n70039,70051,70061,70067,70079,70099,70111,70117,70121,70123,70139,70141,\n70157,70163,70177,70181,70183,70199,70201,70207,70223,70229,70237,70241,\n70249,70271,70289,70297,70309,70313,70321,70327,70351,70373,70379,70381,\n70393,70423,70429,70439,70451,70457,70459,70481,70487,70489,70501,70507,\n70529,70537,70549,70571,70573,70583,70589,70607,70619,70621,70627,70639,\n70657,70663,70667,70687,70709,70717,70729,70753,70769,70783,70793,70823,\n70841,70843,70849,70853,70867,70877,70879,70891,70901,70913,70919,70921,\n70937,70949,70951,70957,70969,70979,70981,70991,70997,70999,71011,71023,\n71039,71059,71069,71081,71089,71119,71129,71143,71147,71153,71161,71167,\n71171,71191,71209,71233,71237,71249,71257,71261,71263,71287,71293,71317,\n71327,71329,71333,71339,71341,71347,71353,71359,71363,71387,71389,71399,\n71411,71413,71419,71429,71437,71443,71453,71471,71473,71479,71483,71503,\n71527,71537,71549,71551,71563,71569,71593,71597,71633,71647,71663,71671,\n71693,71699,71707,71711,71713,71719,71741,71761,71777,71789,71807,71809,\n71821,71837,71843,71849,71861,71867,71879,71881,71887,71899,71909,71917,\n71933,71941,71947,71963,71971,71983,71987,71993,71999,72019,72031,72043,\n72047,72053,72073,72077,72089,72091,72101,72103,72109,72139,72161,72167,\n72169,72173,72211,72221,72223,72227,72229,72251,72253,72269,72271,72277,\n72287,72307,72313,72337,72341,72353,72367,72379,72383,72421,72431,72461,\n72467,72469,72481,72493,72497,72503,72533,72547,72551,72559,72577,72613,\n72617,72623,72643,72647,72649,72661,72671,72673,72679,72689,72701,72707,\n72719,72727,72733,72739,72763,72767,72797,72817,72823,72859,72869,72871,\n72883,72889,72893,72901,72907,72911,72923,72931,72937,72949,72953,72959,\n72973,72977,72997,73009,73013,73019,73037,73039,73043,73061,73063,73079,\n73091,73121,73127,73133,73141,73181,73189,73237,73243,73259,73277,73291,\n73303,73309,73327,73331,73351,73361,73363,73369,73379,73387,73417,73421,\n73433,73453,73459,73471,73477,73483,73517,73523,73529,73547,73553,73561,\n73571,73583,73589,73597,73607,73609,73613,73637,73643,73651,73673,73679,\n73681,73693,73699,73709,73721,73727,73751,73757,73771,73783,73819,73823,\n73847,73849,73859,73867,73877,73883,73897,73907,73939,73943,73951,73961,\n73973,73999,74017,74021,74027,74047,74051,74071,74077,74093,74099,74101,\n74131,74143,74149,74159,74161,74167,74177,74189,74197,74201,74203,74209,\n74219,74231,74257,74279,74287,74293,74297,74311,74317,74323,74353,74357,\n74363,74377,74381,74383,74411,74413,74419,74441,74449,74453,74471,74489,\n74507,74509,74521,74527,74531,74551,74561,74567,74573,74587,74597,74609,\n74611,74623,74653,74687,74699,74707,74713,74717,74719,74729,74731,74747,\n74759,74761,74771,74779,74797,74821,74827,74831,74843,74857,74861,74869,\n74873,74887,74891,74897,74903,74923,74929,74933,74941,74959,75011,75013,\n75017,75029,75037,75041,75079,75083,75109,75133,75149,75161,75167,75169,\n75181,75193,75209,75211,75217,75223,75227,75239,75253,75269,75277,75289,\n75307,75323,75329,75337,75347,75353,75367,75377,75389,75391,75401,75403,\n75407,75431,75437,75479,75503,75511,75521,75527,75533,75539,75541,75553,\n75557,75571,75577,75583,75611,75617,75619,75629,75641,75653,75659,75679,\n75683,75689,75703,75707,75709,75721,75731,75743,75767,75773,75781,75787,\n75793,75797,75821,75833,75853,75869,75883,75913,75931,75937,75941,75967,\n75979,75983,75989,75991,75997,76001,76003,76031,76039,76079,76081,76091,\n76099,76103,76123,76129,76147,76157,76159,76163,76207,76213,76231,76243,\n76249,76253,76259,76261,76283,76289,76303,76333,76343,76367,76369,76379,\n76387,76403,76421,76423,76441,76463,76471,76481,76487,76493,76507,76511,\n76519,76537,76541,76543,76561,76579,76597,76603,76607,76631,76649,76651,\n76667,76673,76679,76697,76717,76733,76753,76757,76771,76777,76781,76801,\n76819,76829,76831,76837,76847,76871,76873,76883,76907,76913,76919,76943,\n76949,76961,76963,76991,77003,77017,77023,77029,77041,77047,77069,77081,\n77093,77101,77137,77141,77153,77167,77171,77191,77201,77213,77237,77239,\n77243,77249,77261,77263,77267,77269,77279,77291,77317,77323,77339,77347,\n77351,77359,77369,77377,77383,77417,77419,77431,77447,77471,77477,77479,\n77489,77491,77509,77513,77521,77527,77543,77549,77551,77557,77563,77569,\n77573,77587,77591,77611,77617,77621,77641,77647,77659,77681,77687,77689,\n77699,77711,77713,77719,77723,77731,77743,77747,77761,77773,77783,77797,\n77801,77813,77839,77849,77863,77867,77893,77899,77929,77933,77951,77969,\n77977,77983,77999,78007,78017,78031,78041,78049,78059,78079,78101,78121,\n78137,78139,78157,78163,78167,78173,78179,78191,78193,78203,78229,78233,\n78241,78259,78277,78283,78301,78307,78311,78317,78341,78347,78367,78401,\n78427,78437,78439,78467,78479,78487,78497,78509,78511,78517,78539,78541,\n78553,78569,78571,78577,78583,78593,78607,78623,78643,78649,78653,78691,\n78697,78707,78713,78721,78737,78779,78781,78787,78791,78797,78803,78809,\n78823,78839,78853,78857,78877,78887,78889,78893,78901,78919,78929,78941,\n78977,78979,78989,79031,79039,79043,79063,79087,79103,79111,79133,79139,\n79147,79151,79153,79159,79181,79187,79193,79201,79229,79231,79241,79259,\n79273,79279,79283,79301,79309,79319,79333,79337,79349,79357,79367,79379,\n79393,79397,79399,79411,79423,79427,79433,79451,79481,79493,79531,79537,\n79549,79559,79561,79579,79589,79601,79609,79613,79621,79627,79631,79633,\n79657,79669,79687,79691,79693,79697,79699,79757,79769,79777,79801,79811,\n79813,79817,79823,79829,79841,79843,79847,79861,79867,79873,79889,79901,\n79903,79907,79939,79943,79967,79973,79979,79987,79997,79999,80021,80039,\n80051,80071,80077,80107,80111,80141,80147,80149,80153,80167,80173,80177,\n80191,80207,80209,80221,80231,80233,80239,80251,80263,80273,80279,80287,\n80309,80317,80329,80341,80347,80363,80369,80387,80407,80429,80447,80449,\n80471,80473,80489,80491,80513,80527,80537,80557,80567,80599,80603,80611,\n80621,80627,80629,80651,80657,80669,80671,80677,80681,80683,80687,80701,\n80713,80737,80747,80749,80761,80777,80779,80783,80789,80803,80809,80819,\n80831,80833,80849,80863,80897,80909,80911,80917,80923,80929,80933,80953,\n80963,80989,81001,81013,81017,81019,81023,81031,81041,81043,81047,81049,\n81071,81077,81083,81097,81101,81119,81131,81157,81163,81173,81181,81197,\n81199,81203,81223,81233,81239,81281,81283,81293,81299,81307,81331,81343,\n81349,81353,81359,81371,81373,81401,81409,81421,81439,81457,81463,81509,\n81517,81527,81533,81547,81551,81553,81559,81563,81569,81611,81619,81629,\n81637,81647,81649,81667,81671,81677,81689,81701,81703,81707,81727,81737,\n81749,81761,81769,81773,81799,81817,81839,81847,81853,81869,81883,81899,\n81901,81919,81929,81931,81937,81943,81953,81967,81971,81973,82003,82007,\n82009,82013,82021,82031,82037,82039,82051,82067,82073,82129,82139,82141,\n82153,82163,82171,82183,82189,82193,82207,82217,82219,82223,82231,82237,\n82241,82261,82267,82279,82301,82307,82339,82349,82351,82361,82373,82387,\n82393,82421,82457,82463,82469,82471,82483,82487,82493,82499,82507,82529,\n82531,82549,82559,82561,82567,82571,82591,82601,82609,82613,82619,82633,\n82651,82657,82699,82721,82723,82727,82729,82757,82759,82763,82781,82787,\n82793,82799,82811,82813,82837,82847,82883,82889,82891,82903,82913,82939,\n82963,82981,82997,83003,83009,83023,83047,83059,83063,83071,83077,83089,\n83093,83101,83117,83137,83177,83203,83207,83219,83221,83227,83231,83233,\n83243,83257,83267,83269,83273,83299,83311,83339,83341,83357,83383,83389,\n83399,83401,83407,83417,83423,83431,83437,83443,83449,83459,83471,83477,\n83497,83537,83557,83561,83563,83579,83591,83597,83609,83617,83621,83639,\n83641,83653,83663,83689,83701,83717,83719,83737,83761,83773,83777,83791,\n83813,83833,83843,83857,83869,83873,83891,83903,83911,83921,83933,83939,\n83969,83983,83987,84011,84017,84047,84053,84059,84061,84067,84089,84121,\n84127,84131,84137,84143,84163,84179,84181,84191,84199,84211,84221,84223,\n84229,84239,84247,84263,84299,84307,84313,84317,84319,84347,84349,84377,\n84389,84391,84401,84407,84421,84431,84437,84443,84449,84457,84463,84467,\n84481,84499,84503,84509,84521,84523,84533,84551,84559,84589,84629,84631,\n84649,84653,84659,84673,84691,84697,84701,84713,84719,84731,84737,84751,\n84761,84787,84793,84809,84811,84827,84857,84859,84869,84871,84913,84919,\n84947,84961,84967,84977,84979,84991,85009,85021,85027,85037,85049,85061,\n85081,85087,85091,85093,85103,85109,85121,85133,85147,85159,85193,85199,\n85201,85213,85223,85229,85237,85243,85247,85259,85297,85303,85313,85331,\n85333,85361,85363,85369,85381,85411,85427,85429,85439,85447,85451,85453,\n85469,85487,85513,85517,85523,85531,85549,85571,85577,85597,85601,85607,\n85619,85621,85627,85639,85643,85661,85667,85669,85691,85703,85711,85717,\n85733,85751,85781,85793,85817,85819,85829,85831,85837,85843,85847,85853,\n85889,85903,85909,85931,85933,85991,85999,86011,86017,86027,86029,86069,\n86077,86083,86111,86113,86117,86131,86137,86143,86161,86171,86179,86183,\n86197,86201,86209,86239,86243,86249,86257,86263,86269,86287,86291,86293,\n86297,86311,86323,86341,86351,86353,86357,86369,86371,86381,86389,86399,\n86413,86423,86441,86453,86461,86467,86477,86491,86501,86509,86531,86533,\n86539,86561,86573,86579,86587,86599,86627,86629,86677,86689,86693,86711,\n86719,86729,86743,86753,86767,86771,86783,86813,86837,86843,86851,86857,\n86861,86869,86923,86927,86929,86939,86951,86959,86969,86981,86993,87011,\n87013,87037,87041,87049,87071,87083,87103,87107,87119,87121,87133,87149,\n87151,87179,87181,87187,87211,87221,87223,87251,87253,87257,87277,87281,\n87293,87299,87313,87317,87323,87337,87359,87383,87403,87407,87421,87427,\n87433,87443,87473,87481,87491,87509,87511,87517,87523,87539,87541,87547,\n87553,87557,87559,87583,87587,87589,87613,87623,87629,87631,87641,87643,\n87649,87671,87679,87683,87691,87697,87701,87719,87721,87739,87743,87751,\n87767,87793,87797,87803,87811,87833,87853,87869,87877,87881,87887,87911,\n87917,87931,87943,87959,87961,87973,87977,87991,88001,88003,88007,88019,\n88037,88069,88079,88093,88117,88129,88169,88177,88211,88223,88237,88241,\n88259,88261,88289,88301,88321,88327,88337,88339,88379,88397,88411,88423,\n88427,88463,88469,88471,88493,88499,88513,88523,88547,88589,88591,88607,\n88609,88643,88651,88657,88661,88663,88667,88681,88721,88729,88741,88747,\n88771,88789,88793,88799,88801,88807,88811,88813,88817,88819,88843,88853,\n88861,88867,88873,88883,88897,88903,88919,88937,88951,88969,88993,88997,\n89003,89009,89017,89021,89041,89051,89057,89069,89071,89083,89087,89101,\n89107,89113,89119,89123,89137,89153,89189,89203,89209,89213,89227,89231,\n89237,89261,89269,89273,89293,89303,89317,89329,89363,89371,89381,89387,\n89393,89399,89413,89417,89431,89443,89449,89459,89477,89491,89501,89513,\n89519,89521,89527,89533,89561,89563,89567,89591,89597,89599,89603,89611,\n89627,89633,89653,89657,89659,89669,89671,89681,89689,89753,89759,89767,\n89779,89783,89797,89809,89819,89821,89833,89839,89849,89867,89891,89897,\n89899,89909,89917,89923,89939,89959,89963,89977,89983,89989,90001,90007,\n90011,90017,90019,90023,90031,90053,90059,90067,90071,90073,90089,90107,\n90121,90127,90149,90163,90173,90187,90191,90197,90199,90203,90217,90227,\n90239,90247,90263,90271,90281,90289,90313,90353,90359,90371,90373,90379,\n90397,90401,90403,90407,90437,90439,90469,90473,90481,90499,90511,90523,\n90527,90529,90533,90547,90583,90599,90617,90619,90631,90641,90647,90659,\n90677,90679,90697,90703,90709,90731,90749,90787,90793,90803,90821,90823,\n90833,90841,90847,90863,90887,90901,90907,90911,90917,90931,90947,90971,\n90977,90989,90997,91009,91019,91033,91079,91081,91097,91099,91121,91127,\n91129,91139,91141,91151,91153,91159,91163,91183,91193,91199,91229,91237,\n91243,91249,91253,91283,91291,91297,91303,91309,91331,91367,91369,91373,\n91381,91387,91393,91397,91411,91423,91433,91453,91457,91459,91463,91493,\n91499,91513,91529,91541,91571,91573,91577,91583,91591,91621,91631,91639,\n91673,91691,91703,91711,91733,91753,91757,91771,91781,91801,91807,91811,\n91813,91823,91837,91841,91867,91873,91909,91921,91939,91943,91951,91957,\n91961,91967,91969,91997,92003,92009,92033,92041,92051,92077,92083,92107,\n92111,92119,92143,92153,92173,92177,92179,92189,92203,92219,92221,92227,\n92233,92237,92243,92251,92269,92297,92311,92317,92333,92347,92353,92357,\n92363,92369,92377,92381,92383,92387,92399,92401,92413,92419,92431,92459,\n92461,92467,92479,92489,92503,92507,92551,92557,92567,92569,92581,92593,\n92623,92627,92639,92641,92647,92657,92669,92671,92681,92683,92693,92699,\n92707,92717,92723,92737,92753,92761,92767,92779,92789,92791,92801,92809,\n92821,92831,92849,92857,92861,92863,92867,92893,92899,92921,92927,92941,\n92951,92957,92959,92987,92993,93001,93047,93053,93059,93077,93083,93089,\n93097,93103,93113,93131,93133,93139,93151,93169,93179,93187,93199,93229,\n93239,93241,93251,93253,93257,93263,93281,93283,93287,93307,93319,93323,\n93329,93337,93371,93377,93383,93407,93419,93427,93463,93479,93481,93487,\n93491,93493,93497,93503,93523,93529,93553,93557,93559,93563,93581,93601,\n93607,93629,93637,93683,93701,93703,93719,93739,93761,93763,93787,93809,\n93811,93827,93851,93871,93887,93889,93893,93901,93911,93913,93923,93937,\n93941,93949,93967,93971,93979,93983,93997,94007,94009,94033,94049,94057,\n94063,94079,94099,94109,94111,94117,94121,94151,94153,94169,94201,94207,\n94219,94229,94253,94261,94273,94291,94307,94309,94321,94327,94331,94343,\n94349,94351,94379,94397,94399,94421,94427,94433,94439,94441,94447,94463,\n94477,94483,94513,94529,94531,94541,94543,94547,94559,94561,94573,94583,\n94597,94603,94613,94621,94649,94651,94687,94693,94709,94723,94727,94747,\n94771,94777,94781,94789,94793,94811,94819,94823,94837,94841,94847,94849,\n94873,94889,94903,94907,94933,94949,94951,94961,94993,94999,95003,95009,\n95021,95027,95063,95071,95083,95087,95089,95093,95101,95107,95111,95131,\n95143,95153,95177,95189,95191,95203,95213,95219,95231,95233,95239,95257,\n95261,95267,95273,95279,95287,95311,95317,95327,95339,95369,95383,95393,\n95401,95413,95419,95429,95441,95443,95461,95467,95471,95479,95483,95507,\n95527,95531,95539,95549,95561,95569,95581,95597,95603,95617,95621,95629,\n95633,95651,95701,95707,95713,95717,95723,95731,95737,95747,95773,95783,\n95789,95791,95801,95803,95813,95819,95857,95869,95873,95881,95891,95911,\n95917,95923,95929,95947,95957,95959,95971,95987,95989,96001,96013,96017,\n96043,96053,96059,96079,96097,96137,96149,96157,96167,96179,96181,96199,\n96211,96221,96223,96233,96259,96263,96269,96281,96289,96293,96323,96329,\n96331,96337,96353,96377,96401,96419,96431,96443,96451,96457,96461,96469,\n96479,96487,96493,96497,96517,96527,96553,96557,96581,96587,96589,96601,\n96643,96661,96667,96671,96697,96703,96731,96737,96739,96749,96757,96763,\n96769,96779,96787,96797,96799,96821,96823,96827,96847,96851,96857,96893,\n96907,96911,96931,96953,96959,96973,96979,96989,96997,97001,97003,97007,\n97021,97039,97073,97081,97103,97117,97127,97151,97157,97159,97169,97171,\n97177,97187,97213,97231,97241,97259,97283,97301,97303,97327,97367,97369,\n97373,97379,97381,97387,97397,97423,97429,97441,97453,97459,97463,97499,\n97501,97511,97523,97547,97549,97553,97561,97571,97577,97579,97583,97607,\n97609,97613,97649,97651,97673,97687,97711,97729,97771,97777,97787,97789,\n97813,97829,97841,97843,97847,97849,97859,97861,97871,97879,97883,97919,\n97927,97931,97943,97961,97967,97973,97987,98009,98011,98017,98041,98047,\n98057,98081,98101,98123,98129,98143,98179,98207,98213,98221,98227,98251,\n98257,98269,98297,98299,98317,98321,98323,98327,98347,98369,98377,98387,\n98389,98407,98411,98419,98429,98443,98453,98459,98467,98473,98479,98491,\n98507,98519,98533,98543,98561,98563,98573,98597,98621,98627,98639,98641,\n98663,98669,98689,98711,98713,98717,98729,98731,98737,98773,98779,98801,\n98807,98809,98837,98849,98867,98869,98873,98887,98893,98897,98899,98909,\n98911,98927,98929,98939,98947,98953,98963,98981,98993,98999,99013,99017,\n99023,99041,99053,99079,99083,99089,99103,99109,99119,99131,99133,99137,\n99139,99149,99173,99181,99191,99223,99233,99241,99251,99257,99259,99277,\n99289,99317,99347,99349,99367,99371,99377,99391,99397,99401,99409,99431,\n99439,99469,99487,99497,99523,99527,99529,99551,99559,99563,99571,99577,\n99581,99607,99611,99623,99643,99661,99667,99679,99689,99707,99709,99713,\n99719,99721,99733,99761,99767,99787,99793,99809,99817,99823,99829,99833,\n99839,99859,99871,99877,99881,99901,99907,99923,99929,99961,99971,99989,99991];\nif ( num ) {\n\tif ( num % 2 === 0 ) {\n\t\tcnt = num / 2;\n } else {\n\t\tfor (var i = 0, l = primes.length; i < l; i++) {\n\t\t\tif ( num % primes[i] === 0 ) {\n\t\t\t\tnum -= primes[i];\n\t\t\t\tcnt = num / 2 + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif ( !cnt ) \n\t\t\tcnt = 1;\n\t}\n}\nprint(cnt);", "src_uid": "a1e80ddd97026835a84f91bac8eb21e6"}
{"source_code": "'use strict';\n// 9- 8- 8- 7- 7- 7- 7- 7- 7- 6- 5- 3- 2- 2- 2 2- 2- 2 1- 1- 1 0- 0-\n\n// 7 4 2 - - - - - \n// value = 3\n// arr[minIndx] = 4\n// min = 1\n// 4 - - -\n\n// 9 8 8 7 6 5 4 2 1 0\n// 7 7 7 2 1 0\n// 7 7 2 2 1 \n// 1 1\nprocess.stdin.resume();\nprocess.stdin.setEncoding('utf-8');\nlet arr = []\nlet input = []\nlet n;\nvar readline = require('readline')\n\nprocess.stdin.on('data', inputStdin => {\n input += inputStdin;\n});\n\nprocess.stdin.on('end', _ => {\n input = input.trim().split('\\n').map(string => {\n return string.trim();\n });\n n = input[0]\n arr = input[1].split(\" \")\n arr = arr.map(s=>parseInt(s))\n main(); \n});\nfunction main() {\n // console.log(\"len\",arr.length)\n let visted = {};\n arr.sort(function(a, b){return b-a});\n// arr.reverse();\n // arr.map(s=>console.log(typeof s))\n\n function findMinDifference(value) {\n let min = 100000000;\n let minIndex;\n for (let i = 0; i < arr.length; i++) {\n if (visted[i]) continue;\n if (Math.abs(arr[i] - value) < min ) {\n min = Math.abs(arr[i] - value);\n minIndex = i;\n }\n }\n visted[minIndex] = true;\n return arr[minIndex];\n }\n let pils = 1;\n let boxesCanHold = arr[0]; // 9\n visted[0] = true;\n\n for (let i = 0; i < arr.length; i++) {\n if (visted[i]) continue;\n if(boxesCanHold ==0){\n boxesCanHold = arr[i];\n visted[i] = true;\n ++pils;\n }\n if(boxesCanHold!=0){\n let nextStrength = findMinDifference(boxesCanHold-1);\n boxesCanHold = nextStrength >= boxesCanHold ? --boxesCanHold : nextStrength; \n }\n if (boxesCanHold == 0 && Object.keys(visted).length != arr.length) {\n // console.log(\"here\")\n i = 0;\n }\n else if(i < arr.length-1 && Object.keys(visted).length != arr.length){\n i = 0;\n }\n\n }\n console.log(pils );\n\n}\n", "src_uid": "7c710ae68f27f140e7e03564492f7214"}
{"source_code": "const input = Number(readline());\nprint([4, 22, 27, 58, 85, 94, 121, 166, 202, 265, 274, 319, 346, 355, 378, 382, 391, 438, 454, 483, 517, 526, 535, 562, 576, 588, 627, 634, 636, 645][input - 1]);\n", "src_uid": "bf65a25185e9ea5b71e853723b838b04"}
{"source_code": " var datos = readline().split(\" \");\n \n var x1 = parseInt(datos[0]);\n var x2 = parseInt(datos[1]);\n var x3 = parseInt(datos[2]);\n var x4= parseInt(datos[3]);\n \n var a=x1+x2;\n var b=x3+x4;\n var c=x1+x3;\n var d= x2+x4;\n var i= x1+x4;\n var j = x2+x3;\n var e=x1+x3+x4;\n var f=x2+x3+ x4;\n var g=x1+x2+x4;\n var h=x1+x2+x3;\n if (a == b || c==d || i==j || x1==f || x2==e || x3==g || x4==h )\n {\n print (\"YES\");\n }\n else{\n print(\"NO\");\n }", "src_uid": "5a623c49cf7effacfb58bc82f8eaff37"}
{"source_code": "T=readline().split(' ')\nvar n=Number(T[0]),pos=Number(T[1]),l=Number(T[2]),r=Number(T[3]);\n\nfunction q1(l,r,pos) {\n var A=0;\n if (l>1) {\n A += Math.abs(l-pos) + 1\n pos = l\n }\n if (r<n) {\n A += Math.abs(pos-r) + 1\n }\n return A;\n}\n\nfunction q2(l,r,pos) {\n var A=0;\n if (r<n) {\n A += Math.abs(pos-r) + 1\n pos = r;\n }\n if (l>1) {\n A += Math.abs(l-pos) + 1\n }\n return A;\n}\n\nif (l==1 && r==n) {\n print(0)\n} else {\n print(Math.min(q1(l,r,pos),q2(l,r,pos)))\n}\n", "src_uid": "5deaac7bd3afedee9b10e61997940f78"}
{"source_code": "var letters = \"A\" + readline() + \"A\";\n\nvar vowelLetters \t\t\t= ['A', 'E', 'I', 'O', 'U', 'Y'],\n\tlastVowelLetterPosition = 0,\n\tmaxJumpLength \t\t\t= 1;\n\nfor (var i = 1, len = letters.length; i < len; ++i) {\n\tif (~vowelLetters.indexOf(letters[i])) {\n\t\tif (i - lastVowelLetterPosition > maxJumpLength) {\n\t\t\tmaxJumpLength = i - lastVowelLetterPosition;\n\t\t}\n\t\tlastVowelLetterPosition = i;\n\t}\n}\n\nprint(maxJumpLength);", "src_uid": "1fc7e939cdeb015fe31f3cf1c0982fee"}
{"source_code": "/* TEST CASE\nInput\n3\n1 1000000000 2\nAnswer\n1000000003\n\n */\nfunction main() {\n\tvar n = parseInt(readline());\n\tvar splitted = readline().split(' ');\n\tvar a = new Array(n);\n\tvar i;\n\tfor (i = 0; i < n; i++) {\n\t\ta[i] = parseInt(splitted[i]);\n\t}\n\ta.sort(function(a, b) {return a - b;});\n\tvar answer = 0;\n\tvar lastPick = Infinity;\n\tvar pick = 0;\n\tfor (i = n - 1; lastPick > 1 && i >= 0; i--) {\n\t\tpick = a[i];\n\t\tif (pick >= lastPick) {\n\t\t\tpick = lastPick - 1;\n\t\t}\n\t\tanswer += pick;\n\t\tlastPick = pick;\n\t}\n\t\n\tprint(answer);\n}\n\nmain();", "src_uid": "3c4b2d1c9440515bc3002eddd2b89f6f"}
{"source_code": "var app = {\n supposeValue : '',\n result : 0,\n DIGIT_MAP : {},\n main : function() {\n this.initialize();\n this.readValues();\n this.sovleResult();\n this.printResult();\n },\n initialize : function() {\n this.DIGIT_MAP = {\n 0 : [ 0, 8 ],\n 1 : [ 0, 1, 3, 4, 7, 8, 9 ],\n 2 : [ 2, 8 ],\n 3 : [ 3, 8, 9 ],\n 4 : [ 4, 8, 7 ],\n 5 : [ 5, 6, 8, 9 ],\n 6 : [ 6, 8 ],\n 7 : [ 0, 3, 7, 8, 9 ],\n 8 : [ 8 ],\n 9 : [ 8, 9 ],\n };\n },\n readValues : function() {\n this.supposeValue = readline();\n },\n sovleResult : function() {\n var unitDigit = this.supposeValue[1],\n tensDigit = this.supposeValue[0];\n \n this.result = this.DIGIT_MAP[unitDigit].length * this.DIGIT_MAP[tensDigit].length;\n },\n printResult : function() {\n print(this.result);\n }\n};\n\napp.main();", "src_uid": "76c8bfa6789db8364a8ece0574cd31f5"}
{"source_code": "var text = readline().split(':-'), i;\nvar left = text[0].split(/[^_]/).filter(function(x){return x.length != 0;});\nvar right = text[1].split(/[^_<>]/).filter(function(x){return x.length != 0;});\nvar top = 0, nxt = new Array(), to = new Array(), head = new Array(), dgree = new Array(), as = new Array();\nfor(i = 0; i < 1024; ++i) nxt[i] = to[i] = head[i] = dgree[i] = as[i] = 0;\nfunction addedge(te, sym)\n{\n\tvar val = te.split(sym);\n\tif(sym === '>') val = [val[1].length, val[0].length];\n\telse val = [val[0].length, val[1].length];\n\ttop++;\n\tnxt[top] = head[val[0]];\n\tto[top] = val[1];\n\thead[val[0]] = top;\n\t++dgree[val[1]];\n}\nfunction solve(okback, nsback)\n{\n\tvar que = new Array(), lead = 1, tail = 0, now;\n\tfor(i = 1; i < 1024; ++i) if(!dgree[i]) que[++tail] = i;\n\tfor(; lead <= tail; ++lead)\n\t{\n\t\tnow = que[lead];\n\t\tfor(i = head[now]; i; i = nxt[i])\n\t\t{\n\t\t\tas[to[i]] = Math.max(as[to[i]], as[now] + 1);\n\t\t\tif(!--dgree[to[i]]) que[++tail] = to[i];\n\t\t}\n\t}\n\tif(dgree.reduce(function(l, r){return l || (r != 0);}) || as.reduce(function(l, r){return l || (r > 9);}))\tnsback();\n\telse okback();\n}\nfor(i = 0; i < right.length; ++i)\n\tif(right[i].indexOf('>') != -1) addedge(right[i], '>');\n\telse addedge(right[i], '<');\nvar ans = \"\";\nsolve(function(){for(i = 0; i < left.length; ++i) ans = ans + as[left[i].length];},function(){ans = 'false'});\nwrite(ans, '\\n');\n", "src_uid": "390a0b72c77ebe5881b656830fbfae02"}
{"source_code": "var a = readline().split(' ').map(Number);\nif (a % 2 === 0)\n\tprint(\"Mahmoud\");\nelse\n\tprint(\"Ehab\");", "src_uid": "5e74750f44142624e6da41d4b35beb9a"}
{"source_code": "\n// importPackage(java.io);importPackage(java.lang);var stdin = new BufferedReader( new InputStreamReader(System['in']) );\n\nvar n = parseInt( readline() );\n\nvar ans = 1;\nfor ( var i=2 ; i<=n ; i++ )\n{\n\tif ( n%i == 0 )\n\t{\n\t\tvar j = n / i;\n\t\tif ( i > j ) break;\n\t\tans = i;\n\t}\n}\n\nprint( ans + \" \" + (n/ans) );", "src_uid": "f52af273954798a4ae38a1378bfbf77a"}
{"source_code": "var string = readline();\nvar happyDigitCounter = 0;\n\nfor (var i = 0; i < string.length; i++) {\n if (string[i] == '4' || string[i] == '7') {\n happyDigitCounter++;\n }\n}\n\nif (happyDigitCounter == 4 || happyDigitCounter == 7) {\n print(\"YES\");\n} else {\n print(\"NO\");\n}", "src_uid": "33b73fd9e7f19894ea08e98b790d07f1"}
{"source_code": "process.stdin.resume()\r\nprocess.stdin.setEncoding('utf-8')\r\n\r\nlet inputString = ''\r\nlet inputArray = null\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 inputArray = inputString\r\n .trim()\r\n .split('\\n')\r\n .map((s) => s.trim())\r\n\r\n main()\r\n})\r\n\r\nfunction readline() {\r\n return inputArray[currentLine++]\r\n}\r\n\r\nfunction main() {\r\n const s = readline()\r\n for (let i = 2; i < s.length; i++) {\r\n if (\r\n (s.charCodeAt(i - 2) -\r\n 'A'.charCodeAt() +\r\n s.charCodeAt(i - 1) -\r\n 'A'.charCodeAt()) %\r\n 26 !==\r\n s.charCodeAt(i) - 'A'.charCodeAt()\r\n ) {\r\n console.log('NO')\r\n return\r\n }\r\n }\r\n console.log('YES')\r\n}\r\n", "src_uid": "27e977b41f5b6970a032d13e53db2a6a"}
{"source_code": "function _defineProperties(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,\"value\"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}function _createClass(t,e,r){return e&&_defineProperties(t.prototype,e),r&&_defineProperties(t,r),Object.defineProperty(t,\"prototype\",{writable:!1}),t}function _inheritsLoose(t,e){t.prototype=Object.create(e.prototype),t.prototype.constructor=t,_setPrototypeOf(t,e)}function _setPrototypeOf(t,e){return _setPrototypeOf=Object.setPrototypeOf||function(t,e){return t.__proto__=e,t},_setPrototypeOf(t,e)}function _unsupportedIterableToArray(t,e){if(t){if(\"string\"==typeof t)return _arrayLikeToArray(t,e);var r=Object.prototype.toString.call(t).slice(8,-1);return\"Object\"===r&&t.constructor&&(r=t.constructor.name),\"Map\"===r||\"Set\"===r?Array.from(t):\"Arguments\"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?_arrayLikeToArray(t,e):void 0}}function _arrayLikeToArray(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=new Array(e);r<e;r++)n[r]=t[r];return n}function _createForOfIteratorHelperLoose(t,e){var r=\"undefined\"!=typeof Symbol&&t[Symbol.iterator]||t[\"@@iterator\"];if(r)return(r=r.call(t)).next.bind(r);if(Array.isArray(t)||(r=_unsupportedIterableToArray(t))||e&&t&&\"number\"==typeof t.length){r&&(t=r);var n=0;return function(){return n>=t.length?{done:!0}:{done:!1,value:t[n++]}}}throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\")}var fs=require(\"fs\"),configPath=\"./compe.config.json\";function proc(t,e){if(global.MOD_=998244353,global.MOD_CUT=444595123,fs.existsSync(configPath)){if(!fs.existsSync(e))return void console.log(\"Input directory does not exist\");var r=fs.readFileSync(e,{encoding:\"utf-8\"}),n=0;r=r.split(/ |\\n|\\r/g);for(var i,o=[],s=_createForOfIteratorHelperLoose(r);!(i=s()).done;){var a=i.value;a.length>0&&o.push(a)}global.rnum=function(t){return t?o.slice(n,n+=t).map((function(t){return+t})):+o[n++]},global.rstr=function(t){return t?o.slice(n,n+=t):o[n++]},global.rbig=function(t){return t?o.slice(n,n+=t).map((function(t){return BigInt(t)})):BigInt(o[n++])},global.print=function(){for(var t=arguments.length,e=new Array(t),r=0;r<t;r++)e[r]=arguments[r];for(var n=0,i=e;n<i.length;n++){var o=i[n];process.stdout.write(String(o))}},t()}else{var u=\"\";process.stdin.on(\"data\",(function(t){u+=t})),process.stdin.on(\"end\",(function(){var e=0;u=u.split(/ |\\n|\\r/g);for(var r,n=[],i=_createForOfIteratorHelperLoose(u);!(r=i()).done;){var o=r.value;o.length>0&&n.push(o)}global.rnum=function(t){return t?n.slice(e,e+=t).map((function(t){return+t})):+n[e++]},global.rstr=function(t){return t?n.slice(e,e+=t):n[e++]},global.rbig=function(t){return t?n.slice(e,e+=t).map((function(t){return BigInt(t)})):BigInt(n[e++])};var s=\"\";global.print=function(){for(var t=arguments.length,e=new Array(t),r=0;r<t;r++)e[r]=arguments[r];for(var n=0,i=e;n<i.length;n++){var o=i[n];s+=String(o)}},t(),console.log(s)}))}}function _defineProperties$1(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,\"value\"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}function _createClass$1(t,e,r){return e&&_defineProperties$1(t.prototype,e),r&&_defineProperties$1(t,r),Object.defineProperty(t,\"prototype\",{writable:!1}),t}function _inheritsLoose$1(t,e){t.prototype=Object.create(e.prototype),t.prototype.constructor=t,_setPrototypeOf$1(t,e)}function _getPrototypeOf(t){return _getPrototypeOf=Object.setPrototypeOf?Object.getPrototypeOf:function(t){return t.__proto__||Object.getPrototypeOf(t)},_getPrototypeOf(t)}function _setPrototypeOf$1(t,e){return _setPrototypeOf$1=Object.setPrototypeOf||function(t,e){return t.__proto__=e,t},_setPrototypeOf$1(t,e)}function _isNativeReflectConstruct(){if(\"undefined\"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if(\"function\"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(t){return!1}}function _construct(t,e,r){return _construct=_isNativeReflectConstruct()?Reflect.construct:function(t,e,r){var n=[null];n.push.apply(n,e);var i=new(Function.bind.apply(t,n));return r&&_setPrototypeOf$1(i,r.prototype),i},_construct.apply(null,arguments)}function _isNativeFunction(t){return-1!==Function.toString.call(t).indexOf(\"[native code]\")}function _wrapNativeSuper(t){var e=\"function\"==typeof Map?new Map:void 0;return _wrapNativeSuper=function(t){if(null===t||!_isNativeFunction(t))return t;if(\"function\"!=typeof t)throw new TypeError(\"Super expression must either be null or a function\");if(void 0!==e){if(e.has(t))return e.get(t);e.set(t,r)}function r(){return _construct(t,arguments,_getPrototypeOf(this).constructor)}return r.prototype=Object.create(t.prototype,{constructor:{value:r,enumerable:!1,writable:!0,configurable:!0}}),_setPrototypeOf$1(r,t)},_wrapNativeSuper(t)}function _assertThisInitialized(t){if(void 0===t)throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");return t}function _unsupportedIterableToArray$1(t,e){if(t){if(\"string\"==typeof t)return _arrayLikeToArray$1(t,e);var r=Object.prototype.toString.call(t).slice(8,-1);return\"Object\"===r&&t.constructor&&(r=t.constructor.name),\"Map\"===r||\"Set\"===r?Array.from(t):\"Arguments\"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?_arrayLikeToArray$1(t,e):void 0}}function _arrayLikeToArray$1(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=new Array(e);r<e;r++)n[r]=t[r];return n}function _createForOfIteratorHelperLoose$1(t,e){var r=\"undefined\"!=typeof Symbol&&t[Symbol.iterator]||t[\"@@iterator\"];if(r)return(r=r.call(t)).next.bind(r);if(Array.isArray(t)||(r=_unsupportedIterableToArray$1(t))||e&&t&&\"number\"==typeof t.length){r&&(t=r);var n=0;return function(){return n>=t.length?{done:!0}:{done:!1,value:t[n++]}}}throw new TypeError(\"Invalid attempt to iterate non-iterable instance.\\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.\")}Object.defineProperty(exports,\"__esModule\",{value:!0});var ErrorGenerator,ForOfAdaptor=function(t){function e(t,e){this.it_=t,this.last_=e}var r=e.prototype;return r.next=function(){if(this.it_.equals(this.last_))return{done:!0,value:void 0};var t=this.it_;return this.it_=this.it_.next(),{done:!1,value:t.value}},r[t]=function(){return this},e}(Symbol.iterator),Container=function(t){function e(){}var r=e.prototype;return r.empty=function(){return 0===this.size()},r.rbegin=function(){return this.end().reverse()},r.rend=function(){return this.begin().reverse()},r[t]=function(){return new ForOfAdaptor(this.begin(),this.end())},r.toJSON=function(){for(var t,e=[],r=_createForOfIteratorHelperLoose$1(this);!(t=r()).done;){var n=t.value;e.push(n)}return e},e}(Symbol.iterator),NativeArrayIterator=function(){function t(t,e){this.data_=t,this.index_=e}var e=t.prototype;return e.index=function(){return this.index_},e.prev=function(){return--this.index_,this},e.next=function(){return++this.index_,this},e.advance=function(t){return this.index_+=t,this},e.equals=function(t){return this.data_===t.data_&&this.index_===t.index_},e.swap=function(t){var e=[t.data_,this.data_];this.data_=e[0],t.data_=e[1];var r=[t.index_,this.index_];this.index_=r[0],t.index_=r[1]},_createClass$1(t,[{key:\"value\",get:function(){return this.data_[this.index_]}}]),t}(),SetContainer=function(t){function e(e){var r;return(r=t.call(this)||this).data_=e(_assertThisInitialized(r)),r}_inheritsLoose$1(e,t);var r=e.prototype;return r.assign=function(t,e){this.clear(),this.insert(t,e)},r.clear=function(){this.data_.clear()},r.begin=function(){return this.data_.begin()},r.end=function(){return this.data_.end()},r.has=function(t){return!this.find(t).equals(this.end())},r.size=function(){return this.data_.size()},r.push=function(){for(var t=arguments.length,e=new Array(t),r=0;r<t;r++)e[r]=arguments[r];if(0===e.length)return this.size();var n=new NativeArrayIterator(e,0),i=new NativeArrayIterator(e,e.length);return this._Insert_by_range(n,i),this.size()},r.insert=function(){for(var t=arguments.length,e=new Array(t),r=0;r<t;r++)e[r]=arguments[r];return 1===e.length?this._Insert_by_key(e[0]):e[0].next instanceof Function&&e[1].next instanceof Function?this._Insert_by_range(e[0],e[1]):this._Insert_by_hint(e[0],e[1])},r.erase=function(){for(var t=arguments.length,e=new Array(t),r=0;r<t;r++)e[r]=arguments[r];return 1!==e.length||e[0]instanceof this.end().constructor&&e[0].source()===this?1===e.length?this._Erase_by_range(e[0]):this._Erase_by_range(e[0],e[1]):this._Erase_by_val(e[0])},r._Erase_by_range=function(t,e){void 0===e&&(e=t.next());var r=this.data_.erase(t,e);return this._Handle_erase(t,e),r},e}(Container),Exception=function(t){function e(r){var n;n=t.call(this,r)||this;var i=(this instanceof e?this.constructor:void 0).prototype;return Object.setPrototypeOf?Object.setPrototypeOf(_assertThisInitialized(n),i):n.__proto__=i,n}_inheritsLoose$1(e,t);var r=e.prototype;return r.what=function(){return this.message},r.toJSON=function(){return{name:this.name,message:this.message,stack:this.stack}},_createClass$1(e,[{key:\"name\",get:function(){return this.constructor.name}}]),e}(_wrapNativeSuper(Error)),LogicError=function(t){function e(e){return t.call(this,e)||this}return _inheritsLoose$1(e,t),e}(Exception),InvalidArgument=function(t){function e(e){return t.call(this,e)||this}return _inheritsLoose$1(e,t),e}(LogicError),OutOfRange=function(t){function e(e){return t.call(this,e)||this}return _inheritsLoose$1(e,t),e}(LogicError);!function(t){function e(t){if(\"string\"==typeof t)return t;var e=t.constructor.name;return t.constructor.__MODULE&&(e=t.constructor.__MODULE+\".\"+e),\"std.\"+e}t.get_class_name=e,t.empty=function(t,r){return new OutOfRange(\"Error on \"+e(t)+\".\"+r+\"(): it's empty container.\")},t.negative_index=function(t,r,n){return new OutOfRange(\"Error on \"+e(t)+\".\"+r+\"(): parametric index is negative -> (index = \"+n+\").\")},t.excessive_index=function(t,r,n,i){return new OutOfRange(\"Error on \"+e(t)+\".\"+r+\"(): parametric index is equal or greater than size -> (index = \"+n+\", size: \"+i+\").\")},t.not_my_iterator=function(t,r){return new InvalidArgument(\"Error on \"+e(t)+\".\"+r+\"(): parametric iterator is not this container's own.\")},t.erased_iterator=function(t,r){return new InvalidArgument(\"Error on \"+e(t)+\".\"+r+\"(): parametric iterator, it already has been erased.\")},t.negative_iterator=function(t,r,n){return new OutOfRange(\"Error on \"+e(t)+\".\"+r+\"(): parametric iterator is directing negative position -> (index = \"+n+\").\")},t.iterator_end_value=function(t,r){void 0===r&&(r=\"end\");var n=e(t);return new OutOfRange(\"Error on \"+n+\".Iterator.value: cannot access to the \"+n+\".\"+r+\"().value.\")},t.key_nout_found=function(t,r,n){throw new OutOfRange(\"Error on \"+e(t)+\".\"+r+\"(): unable to find the matched key -> \"+n)}}(ErrorGenerator||(ErrorGenerator={}));var IAssociativeContainer,UniqueSet=function(t){function e(){return t.apply(this,arguments)||this}_inheritsLoose$1(e,t);var r=e.prototype;return r.count=function(t){return this.find(t).equals(this.end())?0:1},r.insert=function(){for(var e,r=arguments.length,n=new Array(r),i=0;i<r;i++)n[i]=arguments[i];return(e=t.prototype.insert).call.apply(e,[this].concat(n))},r._Insert_by_range=function(t,e){for(;!t.equals(e);t=t.next())this._Insert_by_key(t.value)},r.extract=function(t){return t instanceof this.end().constructor?this._Extract_by_iterator(t):this._Extract_by_val(t)},r._Extract_by_val=function(t){var e=this.find(t);if(!0===e.equals(this.end()))throw ErrorGenerator.key_nout_found(this,\"extract\",t);return this._Erase_by_range(e),t},r._Extract_by_iterator=function(t){return!0===t.equals(this.end())||!1===this.has(t.value)?this.end():(this._Erase_by_range(t),t)},r._Erase_by_val=function(t){var e=this.find(t);return!0===e.equals(this.end())?0:(this._Erase_by_range(e),1)},r.merge=function(t){for(var e=t.begin();!e.equals(t.end());)!1===this.has(e.value)?(this.insert(e.value),e=t.erase(e)):e=e.next()},e}(SetContainer);!function(t){t.construct=function(t){for(var e=arguments.length,r=new Array(e>1?e-1:0),n=1;n<e;n++)r[n-1]=arguments[n];var i,o;return r.length>=1&&r[0]instanceof Array?(i=function(){var e=r[0];t.push.apply(t,e)},o=r.slice(1)):r.length>=2&&r[0].next instanceof Function&&r[1].next instanceof Function?(i=function(){var e=r[0],n=r[1];t.assign(e,n)},o=r.slice(2)):(i=null,o=r),{ramda:i,tail:o}}}(IAssociativeContainer||(IAssociativeContainer={}));var is_node_=null;function is_node(){return null===is_node_&&(is_node_=\"object\"==typeof global&&\"object\"==typeof global.process&&\"object\"==typeof global.process.versions&&void 0!==global.process.versions.node),is_node_}function _Get_root(){return null===__s_pRoot&&void 0===(__s_pRoot=is_node()?global:self).__s_iUID&&(__s_pRoot.__s_iUID=0),__s_pRoot}var ITreeContainer,__s_pRoot=null;function get_uid(t){if(t instanceof Object){if(!1===t.hasOwnProperty(\"__get_m_iUID\")){var e=++_Get_root().__s_iUID;Object.defineProperty(t,\"__get_m_iUID\",{value:function(){return e}})}return t.__get_m_iUID()}return void 0===t?-1:0}function equal_to(t,e){return t=t?t.valueOf():t,e=e?e.valueOf():e,t instanceof Object&&t.equals instanceof Function?t.equals(e):t===e}function less(t,e){return t=t.valueOf(),e=e.valueOf(),t instanceof Object?t.less instanceof Function?t.less(e):get_uid(t)<get_uid(e):t<e}function hash(){for(var t=INIT_VALUE,e=arguments.length,r=new Array(e),n=0;n<e;n++)r[n]=arguments[n];for(var i=0,o=r;i<o.length;i++){var s=o[i],a=typeof(s=s?s.valueOf():s);if(\"boolean\"===a)t=_Hash_boolean(s,t);else if(\"number\"===a||\"bigint\"===a)t=_Hash_number(s,t);else if(\"string\"===a)t=_Hash_string(s,t);else if(s instanceof Object&&s.hashCode instanceof Function){var u=s.hashCode();if(1===r.length)return u;t^=u,t*=MULTIPLIER}else t=_Hash_number(get_uid(s),t)}return Math.abs(t)}function _Hash_boolean(t,e){return e^=t?1:0,e*=MULTIPLIER}function _Hash_number(t,e){return _Hash_string(t.toString(),e)}function _Hash_string(t,e){for(var r=0;r<t.length;++r)e^=t.charCodeAt(r),e*=MULTIPLIER;return Math.abs(e)}!function(t){t.construct=function(t,e,r){for(var n=null,i=less,o=arguments.length,s=new Array(o>3?o-3:0),a=3;a<o;a++)s[a-3]=arguments[a];if(1===s.length&&s[0]instanceof e){var u=s[0];i=u.key_comp(),n=function(){var e=u.begin(),r=u.end();t.assign(e,r)}}else{var h=IAssociativeContainer.construct.apply(IAssociativeContainer,[t].concat(s));n=h.ramda,h.tail.length>=1&&(i=h.tail[0])}r(i),null!==n&&n()},t.emplacable=function(t,e,r){var n=e.prev(),i=n.equals(t.end())||t.value_comp()(n.value,r);return i=i&&(e.equals(t.end())||t.value_comp()(r,e.value))}}(ITreeContainer||(ITreeContainer={}));var INIT_VALUE=2166136261,MULTIPLIER=16777619,Pair=function(){function t(t,e){this.first=t,this.second=e}var e=t.prototype;return e.equals=function(t){return equal_to(this.first,t.first)&&equal_to(this.second,t.second)},e.less=function(t){return!1===equal_to(this.first,t.first)?less(this.first,t.first):less(this.second,t.second)},e.hashCode=function(){return hash(this.first,this.second)},t}(),UniqueTreeSet=function(t){function e(){return t.apply(this,arguments)||this}_inheritsLoose$1(e,t);var r=e.prototype;return r.find=function(t){var e=this.lower_bound(t);return!e.equals(this.end())&&this._Key_eq(t,e.value)?e:this.end()},r.equal_range=function(t){var e=this.lower_bound(t);return new Pair(e,!e.equals(this.end())&&this._Key_eq(t,e.value)?e.next():e)},r.value_comp=function(){return this.key_comp()},r._Key_eq=function(t,e){return!this.key_comp()(t,e)&&!this.key_comp()(e,t)},r._Insert_by_key=function(t){var e=this.lower_bound(t);return!e.equals(this.end())&&this._Key_eq(e.value,t)?new Pair(e,!1):(e=this.data_.insert(e,t),this._Handle_insert(e,e.next()),new Pair(e,!0))},r._Insert_by_hint=function(t,e){if(ITreeContainer.emplacable(this,t,e)){var r=this.data_.insert(t,e);return this._Handle_insert(r,r.next()),r}return this._Insert_by_key(e).first},e}(UniqueSet),ListIterator=function(){function t(t,e,r){this.prev_=t,this.next_=e,this.value_=r}t._Set_prev=function(t,e){t.prev_=e},t._Set_next=function(t,e){t.next_=e};var e=t.prototype;return e.prev=function(){return this.prev_},e.next=function(){return this.next_},e._Try_value=function(){if(void 0===this.value_&&!0===this.equals(this.source().end()))throw ErrorGenerator.iterator_end_value(this.source())},e.equals=function(t){return this===t},_createClass$1(t,[{key:\"value\",get:function(){return this._Try_value(),this.value_}}]),t}(),Repeater=function(){function t(t,e){this.index_=t,this.value_=e}var e=t.prototype;return e.index=function(){return this.index_},e.next=function(){return++this.index_,this},e.equals=function(t){return this.index_===t.index_},_createClass$1(t,[{key:\"value\",get:function(){return this.value_}}]),t}();function advance(t,e){if(0===e)return t;if(t.advance instanceof Function)return t.advance(e);var r;if(e<0){if(!(t.prev instanceof Function))throw new InvalidArgument(\"Error on std.advance(): parametric iterator is not a bi-directional iterator, thus advancing to negative direction is not possible.\");r=function(t){return t.prev()},e=-e}else r=function(t){return t.next()};for(;e-- >0;)t=r(t);return t}var ListContainer=function(t){function e(){var e;return(e=t.call(this)||this).end_=e._Create_iterator(null,null),e.clear(),e}_inheritsLoose$1(e,t);var r=e.prototype;return r.assign=function(t,e){this.clear(),this.insert(this.end(),t,e)},r.clear=function(){ListIterator._Set_prev(this.end_,this.end_),ListIterator._Set_next(this.end_,this.end_),this.begin_=this.end_,this.size_=0},r.resize=function(t){var e=t-this.size();e>0?this.insert(this.end(),e,void 0):e<0&&this.erase(advance(this.end(),-e),this.end())},r.begin=function(){return this.begin_},r.end=function(){return this.end_},r.size=function(){return this.size_},r.push_front=function(t){this.insert(this.begin_,t)},r.push_back=function(t){this.insert(this.end_,t)},r.pop_front=function(){if(!0===this.empty())throw ErrorGenerator.empty(this.end_.source().constructor.name,\"pop_front\");this.erase(this.begin_)},r.pop_back=function(){if(!0===this.empty())throw ErrorGenerator.empty(this.end_.source().constructor.name,\"pop_back\");this.erase(this.end_.prev())},r.push=function(){for(var t=arguments.length,e=new Array(t),r=0;r<t;r++)e[r]=arguments[r];if(0===e.length)return this.size();var n=new NativeArrayIterator(e,0),i=new NativeArrayIterator(e,e.length);return this._Insert_by_range(this.end(),n,i),this.size()},r.insert=function(t){if(t.source()!==this.end_.source())throw ErrorGenerator.not_my_iterator(this.end_.source(),\"insert\");if(!0===t.erased_)throw ErrorGenerator.erased_iterator(this.end_.source(),\"insert\");return 1==(arguments.length<=1?0:arguments.length-1)?this._Insert_by_repeating_val(t,1,arguments.length<=1?void 0:arguments[1]):2==(arguments.length<=1?0:arguments.length-1)&&\"number\"==typeof(arguments.length<=1?void 0:arguments[1])?this._Insert_by_repeating_val(t,arguments.length<=1?void 0:arguments[1],arguments.length<=2?void 0:arguments[2]):this._Insert_by_range(t,arguments.length<=1?void 0:arguments[1],arguments.length<=2?void 0:arguments[2])},r._Insert_by_repeating_val=function(t,e,r){var n=new Repeater(0,r),i=new Repeater(e);return this._Insert_by_range(t,n,i)},r._Insert_by_range=function(t,e,r){for(var n=t.prev(),i=null,o=0,s=e;!1===s.equals(r);s=s.next()){var a=this._Create_iterator(n,null,s.value);0===o&&(i=a),ListIterator._Set_next(n,a),n=a,++o}return!0===t.equals(this.begin())&&(this.begin_=i),ListIterator._Set_next(n,t),ListIterator._Set_prev(t,n),this.size_+=o,i},r.erase=function(t,e){return void 0===e&&(e=t.next()),this._Erase_by_range(t,e)},r._Erase_by_range=function(t,e){if(t.source()!==this.end_.source())throw ErrorGenerator.not_my_iterator(this.end_.source(),\"insert\");if(!0===t.erased_)throw ErrorGenerator.erased_iterator(this.end_.source(),\"insert\");if(t.equals(this.end_))return this.end_;var r=t.prev();ListIterator._Set_next(r,e),ListIterator._Set_prev(e,r);for(var n=t;!n.equals(e);n=n.next())n.erased_=!0,--this.size_;return t.equals(this.begin_)&&(this.begin_=e),e},r.swap=function(t){var e=[t.begin_,this.begin_];this.begin_=e[0],t.begin_=e[1];var r=[t.end_,this.end_];this.end_=r[0],t.end_=r[1];var n=[t.size_,this.size_];this.size_=n[0],t.size_=n[1]},e}(Container),ReverseIterator=function(){function t(t){this.base_=t.prev()}var e=t.prototype;return e.source=function(){return this.base_.source()},e.base=function(){return this.base_.next()},e.prev=function(){return this._Create_neighbor(this.base().next())},e.next=function(){return this._Create_neighbor(this.base_)},e.equals=function(t){return this.base_.equals(t.base_)},_createClass$1(t,[{key:\"value\",get:function(){return this.base_.value}}]),t}(),SetElementList=function(t){function e(e){var r;return(r=t.call(this)||this).associative_=e,r}_inheritsLoose$1(e,t);var r=e.prototype;return r._Create_iterator=function(t,r,n){return e.Iterator.create(this,t,r,n)},e._Swap_associative=function(t,e){var r=[e.associative_,t.associative_];t.associative_=r[0],e.associative_=r[1]},r.associative=function(){return this.associative_},e}(ListContainer);!function(t){var e=function(t){function e(e,r,n,i){var o;return(o=t.call(this,r,n,i)||this).source_=e,o}_inheritsLoose$1(e,t),e.create=function(t,r,n,i){return new e(t,r,n,i)};var n=e.prototype;return n.reverse=function(){return new r(this)},n.source=function(){return this.source_.associative()},e}(ListIterator);t.Iterator=e;var r=function(t){function e(){return t.apply(this,arguments)||this}return _inheritsLoose$1(e,t),e.prototype._Create_neighbor=function(t){return new e(t)},e}(ReverseIterator);t.ReverseIterator=r}(SetElementList||(SetElementList={}));var XTreeNode=function(){function t(t,e){this.value=t,this.color=e,this.parent=null,this.left=null,this.right=null}return _createClass$1(t,[{key:\"grand\",get:function(){return this.parent.parent}},{key:\"sibling\",get:function(){return this===this.parent.left?this.parent.right:this.parent.left}},{key:\"uncle\",get:function(){return this.parent.sibling}}]),t}(),XTree=function(){function t(t){this.root_=null,this.comp_=t,this.equal_=function(e,r){return!t(e,r)&&!t(r,e)}}var e=t.prototype;return e.clear=function(){this.root_=null},e.root=function(){return this.root_},e.get=function(t){var e=this.nearest(t);return null!==e&&this.equal_(t,e.value)?e:null},e.nearest=function(t){if(null===this.root_)return null;for(var e=this.root_;;){var r=null;if(this.comp_(t,e.value))r=e.left;else{if(!this.comp_(e.value,t))return e;r=e.right}if(null===r)break;e=r}return e},e._Fetch_maximum=function(t){for(;null!==t.right;)t=t.right;return t},e.insert=function(t){var e=this.nearest(t),r=new XTreeNode(t,1);null===e?this.root_=r:(r.parent=e,this.comp_(r.value,e.value)?e.left=r:e.right=r),this._Insert_case1(r)},e._Insert_case1=function(t){null===t.parent?t.color=0:this._Insert_case2(t)},e._Insert_case2=function(t){0!==this._Fetch_color(t.parent)&&this._Insert_case3(t)},e._Insert_case3=function(t){1===this._Fetch_color(t.uncle)?(t.parent.color=0,t.uncle.color=0,t.grand.color=1,this._Insert_case1(t.grand)):this._Insert_case4(t)},e._Insert_case4=function(t){t===t.parent.right&&t.parent===t.grand.left?(this._Rotate_left(t.parent),t=t.left):t===t.parent.left&&t.parent===t.grand.right&&(this._Rotate_right(t.parent),t=t.right),this._Insert_case5(t)},e._Insert_case5=function(t){t.parent.color=0,t.grand.color=1,t===t.parent.left&&t.parent===t.grand.left?this._Rotate_right(t.grand):this._Rotate_left(t.grand)},e.erase=function(t){var e=this.get(t);if(null!==e){if(null!==e.left&&null!==e.right){var r=this._Fetch_maximum(e.left);e.value=r.value,e=r}var n=null===e.right?e.left:e.right;0===this._Fetch_color(e)&&(e.color=this._Fetch_color(n),this._Erase_case1(e)),this._Replace_node(e,n),1===this._Fetch_color(this.root_)&&(this.root_.color=0)}},e._Erase_case1=function(t){null!==t.parent&&this._Erase_case2(t)},e._Erase_case2=function(t){1===this._Fetch_color(t.sibling)&&(t.parent.color=1,t.sibling.color=0,t===t.parent.left?this._Rotate_left(t.parent):this._Rotate_right(t.parent)),this._Erase_case3(t)},e._Erase_case3=function(t){0===this._Fetch_color(t.parent)&&0===this._Fetch_color(t.sibling)&&0===this._Fetch_color(t.sibling.left)&&0===this._Fetch_color(t.sibling.right)?(t.sibling.color=1,this._Erase_case1(t.parent)):this._Erase_case4(t)},e._Erase_case4=function(t){1===this._Fetch_color(t.parent)&&null!==t.sibling&&0===this._Fetch_color(t.sibling)&&0===this._Fetch_color(t.sibling.left)&&0===this._Fetch_color(t.sibling.right)?(t.sibling.color=1,t.parent.color=0):this._Erase_case5(t)},e._Erase_case5=function(t){t===t.parent.left&&null!==t.sibling&&0===this._Fetch_color(t.sibling)&&1===this._Fetch_color(t.sibling.left)&&0===this._Fetch_color(t.sibling.right)?(t.sibling.color=1,t.sibling.left.color=0,this._Rotate_right(t.sibling)):t===t.parent.right&&null!==t.sibling&&0===this._Fetch_color(t.sibling)&&0===this._Fetch_color(t.sibling.left)&&1===this._Fetch_color(t.sibling.right)&&(t.sibling.color=1,t.sibling.right.color=0,this._Rotate_left(t.sibling)),this._Erase_case6(t)},e._Erase_case6=function(t){t.sibling.color=this._Fetch_color(t.parent),t.parent.color=0,t===t.parent.left?(t.sibling.right.color=0,this._Rotate_left(t.parent)):(t.sibling.left.color=0,this._Rotate_right(t.parent))},e._Rotate_left=function(t){var e=t.right;this._Replace_node(t,e),t.right=e.left,null!==e.left&&(e.left.parent=t),e.left=t,t.parent=e},e._Rotate_right=function(t){var e=t.left;this._Replace_node(t,e),t.left=e.right,null!==e.right&&(e.right.parent=t),e.right=t,t.parent=e},e._Replace_node=function(t,e){null===t.parent?this.root_=e:t===t.parent.left?t.parent.left=e:t.parent.right=e,null!==e&&(e.parent=t.parent)},e._Fetch_color=function(t){return null===t?0:t.color},t}(),SetTree=function(t){function e(e,r,n){var i;return(i=t.call(this,n)||this).source_=e,i.key_comp_=r,i.key_eq_=function(t,e){return!r(t,e)&&!r(e,t)},i}_inheritsLoose$1(e,t),e._Swap_source=function(t,e){var r=[e.source_,t.source_];t.source_=r[0],e.source_=r[1]};var r=e.prototype;return r.get_by_key=function(t){var e=this.nearest_by_key(t);return null!==e&&this.key_eq_(t,e.value.value)?e:null},r.lower_bound=function(t){var e=this.nearest_by_key(t);return null===e?this.source_.end():this.key_comp_(e.value.value,t)?e.value.next():e.value},r.equal_range=function(t){return new Pair(this.lower_bound(t),this.upper_bound(t))},r.source=function(){return this.source_},r.key_comp=function(){return this.key_comp_},r.key_eq=function(){return this.key_eq_},r.value_comp=function(){return this.key_comp_},e}(XTree),UniqueSetTree=function(t){function e(e,r){return t.call(this,e,r,(function(t,e){return r(t.value,e.value)}))||this}_inheritsLoose$1(e,t);var r=e.prototype;return r.nearest_by_key=function(t){if(null===this.root_)return null;for(var e=this.root_;;){var r=e.value,n=null;if(this.key_comp()(t,r.value))n=e.left;else{if(!this.key_comp()(r.value,t))return e;n=e.right}if(null===n)break;e=n}return e},r.upper_bound=function(t){var e=this.nearest_by_key(t);if(null===e)return this.source().end();var r=e.value;return this.key_comp()(t,r.value)?r:r.next()},e}(SetTree);const TreeSet=function(t){function e(){var r;r=t.call(this,(function(t){return new SetElementList(t)}))||this;for(var n=arguments.length,i=new Array(n),o=0;o<n;o++)i[o]=arguments[o];return ITreeContainer.construct.apply(ITreeContainer,[_assertThisInitialized(r),e,function(t){r.tree_=new UniqueSetTree(_assertThisInitialized(r),t)}].concat(i)),r}_inheritsLoose$1(e,t);var r=e.prototype;return r.clear=function(){t.prototype.clear.call(this),this.tree_.clear()},r.swap=function(t){var e=[t.data_,this.data_];this.data_=e[0],t.data_=e[1],SetElementList._Swap_associative(this.data_,t.data_),UniqueSetTree._Swap_source(this.tree_,t.tree_);var r=[t.tree_,this.tree_];this.tree_=r[0],t.tree_=r[1]},r.key_comp=function(){return this.tree_.key_comp()},r.lower_bound=function(t){return this.tree_.lower_bound(t)},r.upper_bound=function(t){return this.tree_.upper_bound(t)},r._Handle_insert=function(t,e){for(;!t.equals(e);t=t.next())this.tree_.insert(t)},r._Handle_erase=function(t,e){for(;!t.equals(e);t=t.next())this.tree_.erase(t)},e}(UniqueTreeSet);function createCommonjsModule(t,e){return t(e={exports:{}},e.exports),e.exports}!function(t){t.Iterator=SetElementList.Iterator,t.ReverseIterator=SetElementList.ReverseIterator}(TreeSet||(TreeSet={}));var runtime_1=createCommonjsModule((function(t){var e=function(t){var e,r=Object.prototype,n=r.hasOwnProperty,i=\"function\"==typeof Symbol?Symbol:{},o=i.iterator||\"@@iterator\",s=i.asyncIterator||\"@@asyncIterator\",a=i.toStringTag||\"@@toStringTag\";function u(t,e,r){return Object.defineProperty(t,e,{value:r,enumerable:!0,configurable:!0,writable:!0}),t[e]}try{u({},\"\")}catch(t){u=function(t,e,r){return t[e]=r}}function h(t,e,r,n){var i=e&&e.prototype instanceof d?e:d,o=Object.create(i.prototype),s=new A(n||[]);return o._invoke=function(t,e,r){var n=c;return function(i,o){if(n===_)throw new Error(\"Generator is already running\");if(n===p){if(\"throw\"===i)throw o;return F()}for(r.method=i,r.arg=o;;){var s=r.delegate;if(s){var a=E(s,r);if(a){if(a===v)continue;return a}}if(\"next\"===r.method)r.sent=r._sent=r.arg;else if(\"throw\"===r.method){if(n===c)throw n=p,r.arg;r.dispatchException(r.arg)}else\"return\"===r.method&&r.abrupt(\"return\",r.arg);n=_;var u=l(t,e,r);if(\"normal\"===u.type){if(n=r.done?p:f,u.arg===v)continue;return{value:u.arg,done:r.done}}\"throw\"===u.type&&(n=p,r.method=\"throw\",r.arg=u.arg)}}}(t,r,s),o}function l(t,e,r){try{return{type:\"normal\",arg:t.call(e,r)}}catch(t){return{type:\"throw\",arg:t}}}t.wrap=h;var c=\"suspendedStart\",f=\"suspendedYield\",_=\"executing\",p=\"completed\",v={};function d(){}function g(){}function y(){}var m={};u(m,o,(function(){return this}));var b=Object.getPrototypeOf,w=b&&b(b(z([])));w&&w!==r&&n.call(w,o)&&(m=w);var x=y.prototype=d.prototype=Object.create(m);function I(t){[\"next\",\"throw\",\"return\"].forEach((function(e){u(t,e,(function(t){return this._invoke(e,t)}))}))}function L(t,e){function r(i,o,s,a){var u=l(t[i],t,o);if(\"throw\"!==u.type){var h=u.arg,c=h.value;return c&&\"object\"==typeof c&&n.call(c,\"__await\")?e.resolve(c.__await).then((function(t){r(\"next\",t,s,a)}),(function(t){r(\"throw\",t,s,a)})):e.resolve(c).then((function(t){h.value=t,s(h)}),(function(t){return r(\"throw\",t,s,a)}))}a(u.arg)}var i;this._invoke=function(t,n){function o(){return new e((function(e,i){r(t,n,e,i)}))}return i=i?i.then(o,o):o()}}function E(t,r){var n=t.iterator[r.method];if(n===e){if(r.delegate=null,\"throw\"===r.method){if(t.iterator.return&&(r.method=\"return\",r.arg=e,E(t,r),\"throw\"===r.method))return v;r.method=\"throw\",r.arg=new TypeError(\"The iterator does not provide a 'throw' method\")}return v}var i=l(n,t.iterator,r.arg);if(\"throw\"===i.type)return r.method=\"throw\",r.arg=i.arg,r.delegate=null,v;var o=i.arg;return o?o.done?(r[t.resultName]=o.value,r.next=t.nextLoc,\"return\"!==r.method&&(r.method=\"next\",r.arg=e),r.delegate=null,v):o:(r.method=\"throw\",r.arg=new TypeError(\"iterator result is not an object\"),r.delegate=null,v)}function O(t){var e={tryLoc:t[0]};1 in t&&(e.catchLoc=t[1]),2 in t&&(e.finallyLoc=t[2],e.afterLoc=t[3]),this.tryEntries.push(e)}function k(t){var e=t.completion||{};e.type=\"normal\",delete e.arg,t.completion=e}function A(t){this.tryEntries=[{tryLoc:\"root\"}],t.forEach(O,this),this.reset(!0)}function z(t){if(t){var r=t[o];if(r)return r.call(t);if(\"function\"==typeof t.next)return t;if(!isNaN(t.length)){var i=-1,s=function r(){for(;++i<t.length;)if(n.call(t,i))return r.value=t[i],r.done=!1,r;return r.value=e,r.done=!0,r};return s.next=s}}return{next:F}}function F(){return{value:e,done:!0}}return g.prototype=y,u(x,\"constructor\",y),u(y,\"constructor\",g),g.displayName=u(y,a,\"GeneratorFunction\"),t.isGeneratorFunction=function(t){var e=\"function\"==typeof t&&t.constructor;return!!e&&(e===g||\"GeneratorFunction\"===(e.displayName||e.name))},t.mark=function(t){return Object.setPrototypeOf?Object.setPrototypeOf(t,y):(t.__proto__=y,u(t,a,\"GeneratorFunction\")),t.prototype=Object.create(x),t},t.awrap=function(t){return{__await:t}},I(L.prototype),u(L.prototype,s,(function(){return this})),t.AsyncIterator=L,t.async=function(e,r,n,i,o){void 0===o&&(o=Promise);var s=new L(h(e,r,n,i),o);return t.isGeneratorFunction(r)?s:s.next().then((function(t){return t.done?t.value:s.next()}))},I(x),u(x,a,\"Generator\"),u(x,o,(function(){return this})),u(x,\"toString\",(function(){return\"[object Generator]\"})),t.keys=function(t){var e=[];for(var r in t)e.push(r);return e.reverse(),function r(){for(;e.length;){var n=e.pop();if(n in t)return r.value=n,r.done=!1,r}return r.done=!0,r}},t.values=z,A.prototype={constructor:A,reset:function(t){if(this.prev=0,this.next=0,this.sent=this._sent=e,this.done=!1,this.delegate=null,this.method=\"next\",this.arg=e,this.tryEntries.forEach(k),!t)for(var r in this)\"t\"===r.charAt(0)&&n.call(this,r)&&!isNaN(+r.slice(1))&&(this[r]=e)},stop:function(){this.done=!0;var t=this.tryEntries[0].completion;if(\"throw\"===t.type)throw t.arg;return this.rval},dispatchException:function(t){if(this.done)throw t;var r=this;function i(n,i){return a.type=\"throw\",a.arg=t,r.next=n,i&&(r.method=\"next\",r.arg=e),!!i}for(var o=this.tryEntries.length-1;o>=0;--o){var s=this.tryEntries[o],a=s.completion;if(\"root\"===s.tryLoc)return i(\"end\");if(s.tryLoc<=this.prev){var u=n.call(s,\"catchLoc\"),h=n.call(s,\"finallyLoc\");if(u&&h){if(this.prev<s.catchLoc)return i(s.catchLoc,!0);if(this.prev<s.finallyLoc)return i(s.finallyLoc)}else if(u){if(this.prev<s.catchLoc)return i(s.catchLoc,!0)}else{if(!h)throw new Error(\"try statement without catch or finally\");if(this.prev<s.finallyLoc)return i(s.finallyLoc)}}}},abrupt:function(t,e){for(var r=this.tryEntries.length-1;r>=0;--r){var i=this.tryEntries[r];if(i.tryLoc<=this.prev&&n.call(i,\"finallyLoc\")&&this.prev<i.finallyLoc){var o=i;break}}o&&(\"break\"===t||\"continue\"===t)&&o.tryLoc<=e&&e<=o.finallyLoc&&(o=null);var s=o?o.completion:{};return s.type=t,s.arg=e,o?(this.method=\"next\",this.next=o.finallyLoc,v):this.complete(s)},complete:function(t,e){if(\"throw\"===t.type)throw t.arg;return\"break\"===t.type||\"continue\"===t.type?this.next=t.arg:\"return\"===t.type?(this.rval=this.arg=t.arg,this.method=\"return\",this.next=\"end\"):\"normal\"===t.type&&e&&(this.next=e),v},finish:function(t){for(var e=this.tryEntries.length-1;e>=0;--e){var r=this.tryEntries[e];if(r.finallyLoc===t)return this.complete(r.completion,r.afterLoc),k(r),v}},catch:function(t){for(var e=this.tryEntries.length-1;e>=0;--e){var r=this.tryEntries[e];if(r.tryLoc===t){var n=r.completion;if(\"throw\"===n.type){var i=n.arg;k(r)}return i}}throw new Error(\"illegal catch attempt\")},delegateYield:function(t,r,n){return this.delegate={iterator:z(t),resultName:r,nextLoc:n},\"next\"===this.method&&(this.arg=e),v}},t}(t.exports);try{regeneratorRuntime=e}catch(t){\"object\"==typeof globalThis?globalThis.regeneratorRuntime=e:Function(\"r\",\"regeneratorRuntime = r\")(e)}})),Deque=function(t){function e(t){this.head=0,this.tail=0,this.mask=1,this.list=new Array(2),t&&this.extend(t)}var r=e.prototype;return r.extend=function(t){for(var e,r=_createForOfIteratorHelperLoose(t);!(e=r()).done;){var n=e.value;this.push(n)}return this},r.extendFront=function(t){for(var e,r=_createForOfIteratorHelperLoose(t);!(e=r()).done;){var n=e.value;this.pushFront(n)}return this},r._resize=function(t,e){var r=this.head,n=this.mask;if(this.head=0,this.tail=t,this.mask=e-1,0!==r){for(var i=new Array(e),o=0;o<t;o++)i[o]=this.list[r+o&n];this.list=i}else this.list.length=e},r.push=function(t){return this.list[this.tail]=t,this.tail=this.tail+1&this.mask,this.head===this.tail&&this._resize(this.list.length,this.list.length<<1),this},r.pushFront=function(t){return this.head=this.head-1&this.mask,this.list[this.head]=t,this.head===this.tail&&this._resize(this.list.length,this.list.length<<1),this},r.clear=function(){this.head=0,this.tail=0},r.at=function(t){var e=this.head,r=this.size,n=this.tail,i=this.list;if((0|t)!==t||t>=r||t<-r)throw new RangeError(\"deque index out of range\");return i[(t>=0?e:n)+t&this.mask]},r.indexOf=function(t,e){void 0===e&&(e=0);for(var r=this.head,n=this.list,i=this.size,o=this.mask,s=e>=0?e:e<-i?0:i+e;s<i;s++)if(n[r+s&o]===t)return s;return-1},r.has=function(t){for(var e=this.head,r=this.list,n=this.size,i=this.mask,o=0;o<n;o++)if(r[e+o&i]===t)return!0;return!1},r.insert=function(t,e){var r=this.head+t&this.mask,n=this.tail;for(this.tail=this.tail+1&this.mask;n!==r;){var i=n-1&this.mask;this.list[n]=this.list[i],n=i}return this.list[r]=e,this.head===this.tail&&this._resize(this.list.length,this.list.length<<1),this},r.pop=function(){if(this.head===this.tail)throw new RangeError(\"pop from an empty deque\");this.tail=this.tail-1&this.mask;var t=this.list[this.tail];return this.list[this.tail]=void 0,this.size<this.mask>>>1&&this._resize(this.size,this.list.length>>>1),t},r.popFront=function(){if(this.head===this.tail)throw new RangeError(\"pop from an empty deque\");var t=this.list[this.head];return this.list[this.head]=void 0,this.head=this.head+1&this.mask,this.size<this.mask>>>1&&this._resize(this.size,this.list.length>>>1),t},r.delete=function(t){if(t>=this.size||t<0)throw new RangeError(\"deque index out of range\");for(var e=this.head+t&this.mask;e!==this.tail;){var r=e+1&this.mask;this.list[e]=this.list[r],e=r}return this.tail=this.tail-1&this.mask,this.size<this.mask>>>1&&this._resize(this.size,this.list.length>>>1),this},r.reverse=function(){for(var t=this.head,e=this.tail,r=this.size,n=this.mask,i=0;i<~~(r/2);i++){var o=e-i-1&n,s=t+i&n,a=this.list[o];this.list[o]=this.list[s],this.list[s]=a}return this},r.rotate=function(t){void 0===t&&(t=1);var e=this.head,r=this.tail;if(0===t||e===r)return this;if(this.head=e-t&this.mask,this.tail=r-t&this.mask,t>0)for(var n=1;n<=t;n++){var i=e-n&this.mask,o=r-n&this.mask;this.list[i]=this.list[o],this.list[o]=void 0}else for(var s=0;s>t;s--){var a=r-s&this.mask,u=e-s&this.mask;this.list[a]=this.list[u],this.list[u]=void 0}return this},r.entries=runtime_1.mark((function t(){var e,r,n,i,o;return runtime_1.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:e=this.head,r=this.size,n=this.list,i=this.mask,o=0;case 2:if(!(o<r)){t.next=8;break}return t.next=5,n[e+o&i];case 5:o++,t.next=2;break;case 8:case\"end\":return t.stop()}}),t,this)})),r.keys=function(){return this.entries()},r.values=function(){return this.entries()},r[t]=function(){return this.entries()},_createClass(e,[{key:\"front\",get:function(){if(this.size)return this.list[this.head];throw new RangeError(\"deque index out of range\")}},{key:\"back\",get:function(){if(this.size)return this.list[this.tail-1&this.mask];throw new RangeError(\"deque index out of range\")}},{key:\"size\",get:function(){return this.tail-this.head&this.mask}}]),e}(Symbol.iterator),multiArray=function(t){if(0==(arguments.length<=1?0:arguments.length-1))throw new Error(\"Please insert dimension values\");if((arguments.length<=1?0:arguments.length-1)>=1){var e;if(\"object\"==typeof t)throw new Error(\"The value can not be object\");var r=[t,[]],n=0,i=1;r[0]=new Array((e=(arguments.length<=1?0:arguments.length-1)-1+1)<1||arguments.length<=e?void 0:arguments[e]);for(var o=0;o<r[0].length;o++)r[0][o]=t;for(var s=(arguments.length<=1?0:arguments.length-1)-2;s>=0;s--){if(!Number.isInteger(s+1<1||arguments.length<=s+1?void 0:arguments[s+1]))throw new Error(\"Please pass integer arguments for array size\");r[i]=new Array(s+1<1||arguments.length<=s+1?void 0:arguments[s+1]);for(var a=0;a<(s+1<1||arguments.length<=s+1?void 0:arguments[s+1]);a++)r[i][a]=r[n].slice();var u=[i,n];n=u[0],i=u[1]}return r[n]}},vectorArray=function(t){for(var e=new Array(t),r=0;r<t;r++)e[r]=[];return e},DSU=function(){function t(t){this.p=multiArray(-1,t+1)}var e=t.prototype;return e.group=function(t){return this.p[t]<0?t:(this.p[t]=this.group(this.p[t]),this.p[t])},e.join=function(t,e){if((t=this.group(t))==(e=this.group(e)))return!1;if(this.p[t]>this.p[e]){var r=[e,t];t=r[0],e=r[1]}return this.p[t]+=this.p[e],this.p[e]=t,!0},e.size=function(t){return t=this.group(t),-this.p[t]},t}(),PriorityQueue=function(){function t(t){this.comparator=t||function(t,e){return t<e},this.elem=[]}var e=t.prototype;return e.swap=function(t,e){var r=[this.elem[e],this.elem[t]];this.elem[t]=r[0],this.elem[e]=r[1]},e.push=function(t){for(var e=this.elem.push(t)-1,r=0;e>0&&(r=e>>1,!this.comparator(this.elem[e],this.elem[r]));)this.swap(e,r),e=r},e.pop=function(){var t=this.top,e=this.elem.pop(),r=this.size;if(0==r)return t;this.elem[0]=e;for(var n=0,i=0,o=0,s=0;n<r&&(i=n,s=2+(n<<1),(o=1+(n<<1))<r&&!this.comparator(this.elem[o],this.elem[i])&&(i=o),s<r&&!this.comparator(this.elem[s],this.elem[i])&&(i=s),i!=n);)this.swap(i,n),n=i;return t},_createClass(t,[{key:\"size\",get:function(){return this.elem.length}},{key:\"top\",get:function(){if(0==this.elem.length)throw new Error(\"PriorityQueue is empty\");return this.elem[0]}}]),t}(),SparseTable=function(){function t(t,e){var r=this;void 0===e&&(e=function(t,e){return t<e?t:e}),this.maxGap=0;var n=t.length;this.logFactor=this.floorLog2(n),this.merger=e,this.cont=Array(n).fill(0).map((function(){return Array(r.logFactor+1)}));for(var i=0;i<n;i++)this.cont[i][0]=t[i];for(var o=1;o<=this.logFactor;o++)for(var s=0;s+(1<<o)-1<n;s++)this.cont[s][o]=e(this.cont[s][o-1],this.cont[s+(1<<o-1)][o-1])}var e=t.prototype;return e.floorLog2=function(t){return 31-Math.clz32(t)},e.query=function(t,e){return this.maxGap=this.floorLog2(e-t+1),this.merger(this.cont[t][this.maxGap],this.cont[e-(1<<this.maxGap)+1][this.maxGap])},t}(),FenwickTree=function(){function t(t,e,r){void 0===e&&(e=0),void 0===r&&(r=function(t,e){return t+e}),this.identityValue=e,this.updateMethod=r,this.elemCount=t,this.cont=Array(t+1).fill(e)}var e=t.prototype;return e.query=function(t){for(var e=this.identityValue;t>=0;t=(t&t+1)-1)e=this.updateMethod(e,this.cont[t]);return e},e.update=function(t,e){for(;t<=this.elemCount;t|=t+1)this.cont[t]=this.updateMethod(this.cont[t],e)},t}(),SegmentTree=function(){function t(t,e,r,n){if(void 0===n&&(n=null),this.identityValue=e,this.merger=r,this.elemCount=t,this.log=Math.ceil(Math.log2(t)),this.size=1<<this.log,this.cont=Array(t<<1).fill(this.identityValue),n){for(var i=0;i<t;i++)this.cont[this.size+i]=n[i];for(var o=this.size-1;o>=1;o--)this.internalUpdate(o)}}var e=t.prototype;return e.internalUpdate=function(t){this.cont[t]=this.merger(this.cont[t<<1],this.cont[t<<1|1])},e.set=function(t,e){t+=this.size,this.cont[t]=e;for(var r=1;r<=this.log;r++)this.internalUpdate(t>>r)},e.get=function(t){return t?this.cont[t+this.size]:this.cont.slice(this.size,this.size+this.elemCount)},e.query=function(t,e){void 0===t&&(t=0),void 0===e&&(e=this.elemCount-1),e++;var r=this.identityValue,n=this.identityValue;for(t+=this.size,e+=this.size;t<e;)1&t&&(r=this.merger(r,this.cont[t++])),1&e&&(n=this.merger(this.cont[--e],n)),t>>=1,e>>=1;return this.merger(r,n)},e.all=function(){return this.cont[1]},t}(),LazySegmentTree=function(){function t(t,e,r,n,i,o,s){if(void 0===s&&(s=null),this.identityValue=e,this.merger=r,this.identityLazy=n,this.pusher=i,this.modifier=o,this.log=Math.ceil(Math.log2(t)),this.size=1<<this.log,this.cont=Array(this.size<<1).fill(this.identityValue),this.lazyCont=Array(this.size).fill(n),s){for(var a=0;a<t;a++)this.cont[this.size+a]=s[a];for(var u=this.size-1;u>=1;u--)this.internalUpdate(u)}}var e=t.prototype;return e.internalUpdate=function(t){this.cont[t]=this.merger(this.cont[t<<1],this.cont[t<<1|1])},e.internalModify=function(t,e){e!==this.identityLazy&&(this.cont[t]=this.modifier(this.cont[t],e),t<this.size&&(this.lazyCont[t]=this.pusher(this.lazyCont[t],e)))},e.internalPush=function(t){this.lazyCont[t]!==this.identityLazy&&(this.internalModify(t<<1,this.lazyCont[t]),this.internalModify(t<<1|1,this.lazyCont[t]),this.lazyCont[t]=this.identityLazy)},e.set=function(t,e){t+=this.size;for(var r=this.log;r>=1;r--)this.internalPush(t>>r);this.cont[t]=e;for(var n=1;n<=this.log;n++)this.internalUpdate(t>>n)},e.get=function(t){t+=this.size;for(var e=this.log;e>=1;e--)this.internalPush(t>>e);return this.cont[t]},e.query=function(t,e){e++,t+=this.size,e+=this.size;for(var r=this.log;r>=1;r--)t>>r<<r!=t&&this.internalPush(t>>r),e>>r<<r!=e&&this.internalPush(e-1>>r);for(var n=this.identityValue,i=this.identityValue;t<e;)1&t&&(n=this.merger(n,this.cont[t++])),1&e&&(i=this.merger(this.cont[--e],i)),t>>=1,e>>=1;return this.merger(n,i)},e.all=function(){return this.cont[1]},e.update=function(t,e,r){e++,t+=this.size,e+=this.size;for(var n=this.log;n>=1;n--)t>>n<<n!=t&&this.internalPush(t>>n),e>>n<<n!=e&&this.internalPush(e-1>>n);for(var i=t,o=e;t<e;)1&t&&this.internalModify(t++,r),1&e&&this.internalModify(--e,r),t>>=1,e>>=1;t=i,e=o;for(var s=1;s<=this.log;s++)t>>s<<s!=t&&this.internalUpdate(t>>s),e>>s<<s!=e&&this.internalUpdate(e-1>>s)},t}(),defaultComparator=function(t,e){return t<e},lowerBound=function(t,e,r,n,i){var o;for(void 0===r&&(r=0),void 0===n&&(n=0),void 0===i&&(i=defaultComparator),n||(n=t.length);r<n;)i(t[o=r+(n-r>>>1)],e)?r=o+1:n=o;return r},upperBound=function(t,e,r,n,i){var o;for(void 0===r&&(r=0),void 0===n&&(n=0),void 0===i&&(i=defaultComparator),n||(n=t.length);r<n;)i(e,t[o=r+(n-r>>>1)])?n=o:r=o+1;return r},binarySearch=function(t,e,r){for(var n,i=null;t<=e;)r(n=t+e>>1)?(i=n,e=n-1):t=n+1;return i},ternarySearch=function(t,e,r,n,i){var o,s;if(void 0===n&&(n=!1),void 0===i&&(i=200),n)for(;i--;)s=e-(e-t)/3,r(o=t+(e-t)/3)<r(s)?t=o:e=s;else for(;i--;)o=t+(e-t)/3,r(s=e-(e-t)/3)<r(o)?t=o:e=s;return r(o)},integralExtremumSearch=function(t,e,r,n){if(void 0===n&&(n=!1),n){var i,o,s=r(t);for(t++;t<=e;)o=r(i=t+e>>1),r(i-1)<o?(s=o,t=i+1):e=i-1;return s}var a,u,h=r(t);for(t++;t<=e;)u=r(a=t+e>>1),r(a-1)>u?(h=u,t=a+1):e=a-1;return h},Graph=function(){function t(t){this.g=vectorArray(t+1),this.vis=multiArray(!1,t+1),this.par=multiArray(-1,t+1)}var e=t.prototype;return e.addEdge=function(t,e,r){this.g[t].push({to:e,prop:r})},e.addBiEdge=function(t,e,r){this.addEdge(t,e,r),this.addEdge(e,t,r)},e.reset=function(){this.vis=multiArray(!1,this.g.length),this.par=multiArray(-1,this.g.length)},t}(),dfs=function(t,e,r,n){var i=new Deque;for(i.push(e);i.size;){var o=i.back;if(t.vis[o])n(o,t),i.pop();else{t.vis[o]=!0,r(o,t);for(var s,a=_createForOfIteratorHelperLoose(t.g[o]);!(s=a()).done;){var u=s.value;t.vis[u.to]||(t.par[u.to]=o,i.push(u.to))}}}},bfs=function(t,e,r){var n=new Deque;if(n.push(e),Array.isArray(e))for(var i,o=_createForOfIteratorHelperLoose(e);!(i=o()).done;){var s=i.value;t.vis[s]=!0,n.push(s)}else t.vis[e]=!0,n.push(e);for(;n.size;){var a=n.pop();r(a,t);for(var u,h=_createForOfIteratorHelperLoose(t.g[a]);!(u=h()).done;){var l=u.value;t.vis[l.to]||(t.par[l.to]=a,n.push(l.to),t.vis[l.to]=!0)}}},mst=function(t){for(var e=0,r=[],n=[],i=0;i<t.g.length;i++)for(var o,s=_createForOfIteratorHelperLoose(t.g[i]);!(o=s()).done;){var a=o.value;i<a.to&&r.push({from:i,to:a.to,weight:a.prop.weight})}var u=new DSU(t.g.length);r.sort((function(t,e){return t.weight-e.weight}));for(var h=0,l=r;h<l.length;h++){var c=l[h];u.join(c.from,c.to)&&(e+=c.weight,n.push(c))}return{mst:e,mstEdges:n}},spfa=function(t,e){t.reset();var r,n=Number.MAX_SAFE_INTEGER,i=multiArray(n,t.g.length),o=multiArray(!1,t.g.length),s=new Deque;if(Array.isArray(e))for(var a,u=_createForOfIteratorHelperLoose(e);!(a=u()).done;){var h=a.value;s.push(h),o[h]=!0,i[h]=0}else s.push(e),o[e]=!0,i[e]=0;for(;s.size;){o[r=s.pop()]=!1;for(var l,c=_createForOfIteratorHelperLoose(t.g[r]);!(l=c()).done;){var f=l.value;i[f.to]>i[r]+f.prop.weight&&(i[f.to]=i[r]+f.prop.weight,t.par[f.to]=r,o[f.to]||(o[f.to]=!0,s.push(f.to)))}}return{parArray:t.par,distArray:i}},dijkstra=function(t,e){t.reset();var r=new PriorityQueue((function(t,e){return t.dist>e.dist})),n=Number.MAX_SAFE_INTEGER,i=multiArray(n,t.g.length);if(Array.isArray(e))for(var o,s=_createForOfIteratorHelperLoose(e);!(o=s()).done;){var a=o.value;r.push({node:a,dist:0}),i[a]=0}else r.push({node:e,dist:0}),i[e]=0;for(;r.size;){var u=r.pop();if(i[u.node]===u.dist)for(var h,l=_createForOfIteratorHelperLoose(t.g[u.node]);!(h=l()).done;){var c=h.value;i[c.to]>i[u.node]+c.prop.weight&&(i[c.to]=i[u.node]+c.prop.weight,t.par[c.to]=u.node,r.push({node:c.to,dist:i[c.to]}))}}return{parArray:t.par,distArray:i}},setMod=function(t){global.MOD_=t,global.MOD_CUT=1099511627776%t},add=function(){for(var t=arguments.length,e=new Array(t),r=0;r<t;r++)e[r]=arguments[r];for(var n=e.length-1;n>=1;n--)e[0]+=e[n],e[0]=e[0]>=global.MOD_?e[0]-global.MOD_:e[0];return e[0]},sub=function(t,e){return(t+=global.MOD_-e)>=global.MOD_?t-global.MOD_:t},mul=function(){for(var t=arguments.length<=0?void 0:arguments[0],e=1;e<arguments.length;e++)t=((t>>20)*((e<0||arguments.length<=e?void 0:arguments[e])>>20)*global.MOD_CUT+(4293918720&t)*(1048575&(e<0||arguments.length<=e?void 0:arguments[e]))+(1048575&t)*(e<0||arguments.length<=e?void 0:arguments[e]))%global.MOD_;return t},pow=function(t,e){for(var r=1;e;)1&e&&(r=mul(r,t)),t=mul(t,t),e>>>=1;return r},inv=function(t){for(var e,r=1,n=0,i=global.MOD_;i;n=(o=[r,n-e*r])[0],r=o[1],o){var o,s;i=(s=[t,i-(e=i/t|0)*t])[0],t=s[1]}return r<0?r+global.MOD_:r},factSetup=function(t){void 0===t&&(t=2e5),global.factorial=Array(t+1).fill(1),global.invFactorial=Array(t+1).fill(1);for(var e=1;e<=t;e++)global.factorial[e]=mul(global.factorial[e-1],e);global.invFactorial[t]=inv(global.factorial[t]);for(var r=t-1;r>=1;r--)global.invFactorial[r]=mul(global.invFactorial[r+1],r+1)},binom=function(t,e){return e>t?0:mul(global.factorial[t],global.invFactorial[e],global.invFactorial[t-e])},fact=function(t){return global.factorial[t]},Tree=function(t){function e(e,r){var n;return(n=t.call(this,e)||this).root=1,n.root=r,n.childCount=Array(e+1).fill(1),n.distRoot=Array(e+1).fill(0),n.distance=Array(e+1).fill(0),n}_inheritsLoose(e,t);var r=e.prototype;return r.setupDist=function(){var t=this;dfs(this,this.root,(function(e,r){for(var n,i=_createForOfIteratorHelperLoose(r.g[e]);!(n=i()).done;){var o=n.value;o.to!=r.par[e]&&(o.prop&&(t.distance[o.to]=t.distance[e]+o.prop.weight),t.distRoot[o.to]=t.distRoot[e]+1)}}),(function(e,r){for(var n,i=_createForOfIteratorHelperLoose(r.g[e]);!(n=i()).done;){var o=n.value;o.to!=r.par[e]&&(t.childCount[e]+=t.childCount[o.to])}}))},r.setupLCA=function(){this.setupDist();var t=31-Math.clz32(this.g.length);this.log=t,this.parentLift=Array(t+1),this.parentLift[0]=this.par;for(var e=1;e<=t;e++){this.parentLift[e]=Array(this.g.length).fill(-1);for(var r=0;r<this.g.length;r++)-1!=this.parentLift[e-1][r]&&(this.parentLift[e][r]=this.parentLift[e-1][this.parentLift[e-1][r]])}this.distRoot=this.distRoot},r.getLCA=function(t,e){if(this.distRoot[t]<this.distRoot[e]){var r=[e,t];t=r[0],e=r[1]}for(var n=this.log;n>=0;n--)this.distRoot[t]-(1<<n)>=this.distRoot[e]&&(t=this.parentLift[n][t]);if(t===e)return t;for(var i=this.log;i>=0;i--)this.parentLift[i][t]!=this.parentLift[i][e]&&(t=this.parentLift[i][t],e=this.parentLift[i][e]);return this.parentLift[0][t]},e}(Graph);\r\n\r\nfunction main() {\r\n // write your code from here\r\n let [n, x] = rnum(2);\r\n let dp = multiArray(0, n + 1, x + 1);\r\n let p = multiArray(0, n + 1, x + 1);\r\n dp[0][0] = 1;\r\n for (let i = 0; i <= n; i ++) {\r\n for (let j = 1; j <= x; j ++) {\r\n p[i][j] = pow(j, i);\r\n }\r\n }\r\n factSetup();\r\n for (let i = 2; i <= n; i ++) {\r\n for (let j = 1; j < i; j ++) {\r\n dp[i][j] = mul(binom(n, i), sub(p[i][j], p[i][j - 1]));\r\n }\r\n }\r\n for (let i = 2; i <= n; i ++) {\r\n for (let j = 1; j <= x; j ++) {\r\n for (let k = 0; i + k <= n && i + j + k - 1 <= x; k ++) {\r\n dp[i + k][i + j + k - 1] = add(dp[i + k][i + j + k - 1], mul(dp[i][j], binom(n - i, k), p[k][i + k - 1]));\r\n }\r\n }\r\n }\r\n let ans = 0;\r\n for (let i = 1; i <= x; i ++)\r\n ans = add(ans, dp[n][i]);\r\n print(ans);\r\n}\r\nproc(main, 'input.txt');\r\n\r\n\r\n// Generated with compe.js - https://github.com/polarity-cf/compe.js", "src_uid": "1908d1c8c6b122a4c6633a7af094f17f"}
{"source_code": "x = +readline(), y = 0, t = readline().split(' ');\nfor (h = +t[0], m = +t[1]; !`${h}${m}`.match(/7/); y++)\n if (m < x) m += 60 - x, h = h ? h - 1 : 23; else m -= x;\nprint(y);\n\n", "src_uid": "5ecd569e02e0164a5da9ff549fca3ceb"}
{"source_code": "var coinsNumber = +readline();\nvar coinsValues = readline().split(' ').map(Number);\n\nif (coinsNumber === 1) {\n print(1);\n} else {\n var valuesAmount = new Array(100).fill(0);\n for (var i = 0; i < coinsNumber; i++) {\n valuesAmount[coinsValues[i]-1]++;\n }\n print(valuesAmount.reduce((a, b) => a > b ? a : b));\n}", "src_uid": "f30329023e84b4c50b1b118dc98ae73c"}
{"source_code": "var isTandem = function(s, lf, rg) {\n var mid = Math.floor((lf + rg) / 2);\n for (var j = lf, k = mid + 1; j <= mid; j++, k++) {\n if (k < s.length && s[j] !== s[k]) {\n return false;\n }\n }\n\n return true;\n}\n\nvar main = function() {\n var s = readline();\n var k = parseInt(readline(), 10);\n var ans = k - (k % 2);\n\n for (var lf = 0; lf < s.length; lf++) {\n for (var ln = 1; lf + 2*ln <= s.length + k; ln++) {\n if (isTandem(s, lf, lf + 2*ln - 1)) {\n ans = Math.max(ans, 2 * ln);\n }\n }\n }\n\n print(ans);\n}\n\nmain();", "src_uid": "bb65667b65ff069a9c0c9e8fe31da8ab"}
{"source_code": "const line1 = readline();\nconst yearsNum = +line1;\n\nconst line2 = readline();\nconst years = line2.split(' ').map(year => parseInt(year));\n\nconst arrLen = Math.floor((yearsNum-1)/2);\n\nfunction compareNumeric(a, b) {\n if (a > b) return 1;\n if (a < b) return -1;\n}\n\nyears.sort(compareNumeric);\n\nprint(years[arrLen]);\n", "src_uid": "f03773118cca29ff8d5b4281d39e7c63"}
{"source_code": "var line1 = readline().split(' ');\nvar n = parseInt(line1[0]);\nvar rent = parseInt(line1[1]);\nvar rates = readline().split(' ');\nvar profit = 0;\nfor(var i = 0; i<n-1;i++){\n if(parseInt(rates[i])-parseInt(rates[i+1]) > rent && parseInt(rates[i])-parseInt(rates[i+1]) - rent > profit){\n profit = parseInt(rates[i])-parseInt(rates[i+1]) - rent;\n }\n}\n\nprint(profit);", "src_uid": "411539a86f2e94eb6386bb65c9eb9557"}
{"source_code": "function main() {\n var line = readline().split('');\n if(line.length < 26){\n return print(-1);\n }\n var start = 0;\n var end = 26;\n var found = false;\n while(end <= line.length && !found){\n var pos = [];\n for(var i=65;i<=90;i++){\n pos[i-65] = false;\n }\n var unknown = 0;\n for(var i=start;i<end;i++){\n var it = line[i];\n if(it == \"?\"){\n unknown++;\n continue;\n }\n pos[it.charCodeAt() - 65] = true;\n }\n if(pos.filter(it => it).length + unknown != 26){\n start++;\n end++;\n } else {\n found = true;\n for(var i=start;i<end;i++){\n var it = line[i];\n if(it == \"?\"){\n var j = 0;\n while(pos[j]){\n j++;\n }\n line[i] = String.fromCharCode(j + 65);\n pos[j] = true;\n }\n }\n }\n }\n if(!found){\n return print(-1)\n }\n \n print(line.join('').replace(/\\?/g, \"A\"))\n}\n\n\nmain()", "src_uid": "a249431a4b0b1ade652997fe0b82edf3"}
{"source_code": "(function(){\n \"use strict\";\n \n var more_than1 = function(s/*string*/, c/*char*/, l/*length*/){\n var count = 0;\n for(var i = 0; i < l; i++){\n if(s[i] === c) count += 1;\n if(count >= 2) break;\n }\n var result = false;\n if(count >= 2) result = true;\n return result;\n };\n\n var l = readline();\n var st = readline();\n\n var yes = false;\n if(l === \"1\") yes = true;\n else {\n for(var i = 0; i < l; i++){\n if(more_than1(st, st[i], l)){\n yes = true;\n break; \n }\n }\n }\n\n print(yes ? \"Yes\" : \"No\");\n\n})();", "src_uid": "6b22e93f7e429693dcfe3c099346dcda"}
{"source_code": "var bigInt = (function(undefined) {\n 'use strict';\n var BASE = 1e7,\n LOG_BASE = 7,\n MAX_INT = 9007199254740992,\n MAX_INT_ARR = smallToArray(MAX_INT),\n LOG_MAX_INT = Math.log(MAX_INT);\n function Integer(v, radix) {\n if (typeof v === 'undefined') return Integer[0];\n if (typeof radix !== 'undefined')\n return +radix === 10 ? parseValue(v) : parseBase(v, radix);\n return parseValue(v);\n }\n function BigInteger(value, sign) {\n this.value = value;\n this.sign = sign;\n this.isSmall = false;\n }\n BigInteger.prototype = Object.create(Integer.prototype);\n function SmallInteger(value) {\n this.value = value;\n this.sign = value < 0;\n this.isSmall = true;\n }\n SmallInteger.prototype = Object.create(Integer.prototype);\n function isPrecise(n) {\n return -MAX_INT < n && n < MAX_INT;\n }\n function smallToArray(n) {\n if (n < 1e7) return [n];\n if (n < 1e14) return [n % 1e7, Math.floor(n / 1e7)];\n return [n % 1e7, Math.floor(n / 1e7) % 1e7, Math.floor(n / 1e14)];\n }\n function arrayToSmall(arr) {\n trim(arr);\n var length = arr.length;\n if (length < 4 && compareAbs(arr, MAX_INT_ARR) < 0) {\n switch (length) {\n case 0:\n return 0;\n case 1:\n return arr[0];\n case 2:\n return arr[0] + arr[1] * BASE;\n default:\n return arr[0] + (arr[1] + arr[2] * BASE) * BASE;\n }\n }\n return arr;\n }\n function trim(v) {\n var i = v.length;\n while (v[--i] === 0);\n v.length = i + 1;\n }\n function createArray(length) {\n var x = new Array(length);\n var i = -1;\n while (++i < length) {\n x[i] = 0;\n }\n return x;\n }\n function truncate(n) {\n if (n > 0) return Math.floor(n);\n return Math.ceil(n);\n }\n function add(a, b) {\n var l_a = a.length,\n l_b = b.length,\n r = new Array(l_a),\n carry = 0,\n base = BASE,\n sum,\n i;\n for (i = 0; i < l_b; i++) {\n sum = a[i] + b[i] + carry;\n carry = sum >= base ? 1 : 0;\n r[i] = sum - carry * base;\n }\n while (i < l_a) {\n sum = a[i] + carry;\n carry = sum === base ? 1 : 0;\n r[i++] = sum - carry * base;\n }\n if (carry > 0) r.push(carry);\n return r;\n }\n function addAny(a, b) {\n if (a.length >= b.length) return add(a, b);\n return add(b, a);\n }\n function addSmall(a, carry) {\n var l = a.length,\n r = new Array(l),\n base = BASE,\n sum,\n i;\n for (i = 0; i < l; i++) {\n sum = a[i] - base + carry;\n carry = Math.floor(sum / base);\n r[i] = sum - carry * base;\n carry += 1;\n }\n while (carry > 0) {\n r[i++] = carry % base;\n carry = Math.floor(carry / base);\n }\n return r;\n }\n BigInteger.prototype.add = function(v) {\n var n = parseValue(v);\n if (this.sign !== n.sign) {\n return this.subtract(n.negate());\n }\n var a = this.value,\n b = n.value;\n if (n.isSmall) {\n return new BigInteger(addSmall(a, Math.abs(b)), this.sign);\n }\n return new BigInteger(addAny(a, b), this.sign);\n };\n BigInteger.prototype.plus = BigInteger.prototype.add;\n SmallInteger.prototype.add = function(v) {\n var n = parseValue(v);\n var a = this.value;\n if (a < 0 !== n.sign) {\n return this.subtract(n.negate());\n }\n var b = n.value;\n if (n.isSmall) {\n if (isPrecise(a + b)) return new SmallInteger(a + b);\n b = smallToArray(Math.abs(b));\n }\n return new BigInteger(addSmall(b, Math.abs(a)), a < 0);\n };\n SmallInteger.prototype.plus = SmallInteger.prototype.add;\n function subtract(a, b) {\n var a_l = a.length,\n b_l = b.length,\n r = new Array(a_l),\n borrow = 0,\n base = BASE,\n i,\n difference;\n for (i = 0; i < b_l; i++) {\n difference = a[i] - borrow - b[i];\n if (difference < 0) {\n difference += base;\n borrow = 1;\n } else borrow = 0;\n r[i] = difference;\n }\n for (i = b_l; i < a_l; i++) {\n difference = a[i] - borrow;\n if (difference < 0) difference += base;\n else {\n r[i++] = difference;\n break;\n }\n r[i] = difference;\n }\n for (; i < a_l; i++) {\n r[i] = a[i];\n }\n trim(r);\n return r;\n }\n function subtractAny(a, b, sign) {\n var value;\n if (compareAbs(a, b) >= 0) {\n value = subtract(a, b);\n } else {\n value = subtract(b, a);\n sign = !sign;\n }\n value = arrayToSmall(value);\n if (typeof value === 'number') {\n if (sign) value = -value;\n return new SmallInteger(value);\n }\n return new BigInteger(value, sign);\n }\n function subtractSmall(a, b, sign) {\n var l = a.length,\n r = new Array(l),\n carry = -b,\n base = BASE,\n i,\n difference;\n for (i = 0; i < l; i++) {\n difference = a[i] + carry;\n carry = Math.floor(difference / base);\n difference %= base;\n r[i] = difference < 0 ? difference + base : difference;\n }\n r = arrayToSmall(r);\n if (typeof r === 'number') {\n if (sign) r = -r;\n return new SmallInteger(r);\n }\n return new BigInteger(r, sign);\n }\n BigInteger.prototype.subtract = function(v) {\n var n = parseValue(v);\n if (this.sign !== n.sign) {\n return this.add(n.negate());\n }\n var a = this.value,\n b = n.value;\n if (n.isSmall) return subtractSmall(a, Math.abs(b), this.sign);\n return subtractAny(a, b, this.sign);\n };\n BigInteger.prototype.minus = BigInteger.prototype.subtract;\n SmallInteger.prototype.subtract = function(v) {\n var n = parseValue(v);\n var a = this.value;\n if (a < 0 !== n.sign) {\n return this.add(n.negate());\n }\n var b = n.value;\n if (n.isSmall) {\n return new SmallInteger(a - b);\n }\n return subtractSmall(b, Math.abs(a), a >= 0);\n };\n SmallInteger.prototype.minus = SmallInteger.prototype.subtract;\n BigInteger.prototype.negate = function() {\n return new BigInteger(this.value, !this.sign);\n };\n SmallInteger.prototype.negate = function() {\n var sign = this.sign;\n var small = new SmallInteger(-this.value);\n small.sign = !sign;\n return small;\n };\n BigInteger.prototype.abs = function() {\n return new BigInteger(this.value, false);\n };\n SmallInteger.prototype.abs = function() {\n return new SmallInteger(Math.abs(this.value));\n };\n function multiplyLong(a, b) {\n var a_l = a.length,\n b_l = b.length,\n l = a_l + b_l,\n r = createArray(l),\n base = BASE,\n product,\n carry,\n i,\n a_i,\n b_j;\n for (i = 0; i < a_l; ++i) {\n a_i = a[i];\n for (var j = 0; j < b_l; ++j) {\n b_j = b[j];\n product = a_i * b_j + r[i + j];\n carry = Math.floor(product / base);\n r[i + j] = product - carry * base;\n r[i + j + 1] += carry;\n }\n }\n trim(r);\n return r;\n }\n function multiplySmall(a, b) {\n var l = a.length,\n r = new Array(l),\n base = BASE,\n carry = 0,\n product,\n i;\n for (i = 0; i < l; i++) {\n product = a[i] * b + carry;\n carry = Math.floor(product / base);\n r[i] = product - carry * base;\n }\n while (carry > 0) {\n r[i++] = carry % base;\n carry = Math.floor(carry / base);\n }\n return r;\n }\n function shiftLeft(x, n) {\n var r = [];\n while (n-- > 0) r.push(0);\n return r.concat(x);\n }\n function multiplyKaratsuba(x, y) {\n var n = Math.max(x.length, y.length);\n if (n <= 30) return multiplyLong(x, y);\n n = Math.ceil(n / 2);\n var b = x.slice(n),\n a = x.slice(0, n),\n d = y.slice(n),\n c = y.slice(0, n);\n var ac = multiplyKaratsuba(a, c),\n bd = multiplyKaratsuba(b, d),\n abcd = multiplyKaratsuba(addAny(a, b), addAny(c, d));\n var product = addAny(\n addAny(ac, shiftLeft(subtract(subtract(abcd, ac), bd), n)),\n shiftLeft(bd, 2 * n)\n );\n trim(product);\n return product;\n }\n function useKaratsuba(l1, l2) {\n return -0.012 * l1 - 0.012 * l2 + 15e-6 * l1 * l2 > 0;\n }\n BigInteger.prototype.multiply = function(v) {\n var n = parseValue(v),\n a = this.value,\n b = n.value,\n sign = this.sign !== n.sign,\n abs;\n if (n.isSmall) {\n if (b === 0) return Integer[0];\n if (b === 1) return this;\n if (b === -1) return this.negate();\n abs = Math.abs(b);\n if (abs < BASE) {\n return new BigInteger(multiplySmall(a, abs), sign);\n }\n b = smallToArray(abs);\n }\n if (useKaratsuba(a.length, b.length))\n return new BigInteger(multiplyKaratsuba(a, b), sign);\n return new BigInteger(multiplyLong(a, b), sign);\n };\n BigInteger.prototype.times = BigInteger.prototype.multiply;\n function multiplySmallAndArray(a, b, sign) {\n if (a < BASE) {\n return new BigInteger(multiplySmall(b, a), sign);\n }\n return new BigInteger(multiplyLong(b, smallToArray(a)), sign);\n }\n SmallInteger.prototype._multiplyBySmall = function(a) {\n if (isPrecise(a.value * this.value)) {\n return new SmallInteger(a.value * this.value);\n }\n return multiplySmallAndArray(\n Math.abs(a.value),\n smallToArray(Math.abs(this.value)),\n this.sign !== a.sign\n );\n };\n BigInteger.prototype._multiplyBySmall = function(a) {\n if (a.value === 0) return Integer[0];\n if (a.value === 1) return this;\n if (a.value === -1) return this.negate();\n return multiplySmallAndArray(\n Math.abs(a.value),\n this.value,\n this.sign !== a.sign\n );\n };\n SmallInteger.prototype.multiply = function(v) {\n return parseValue(v)._multiplyBySmall(this);\n };\n SmallInteger.prototype.times = SmallInteger.prototype.multiply;\n function square(a) {\n var l = a.length,\n r = createArray(l + l),\n base = BASE,\n product,\n carry,\n i,\n a_i,\n a_j;\n for (i = 0; i < l; i++) {\n a_i = a[i];\n carry = 0 - a_i * a_i;\n for (var j = i; j < l; j++) {\n a_j = a[j];\n product = 2 * (a_i * a_j) + r[i + j] + carry;\n carry = Math.floor(product / base);\n r[i + j] = product - carry * base;\n }\n r[i + l] = carry;\n }\n trim(r);\n return r;\n }\n BigInteger.prototype.square = function() {\n return new BigInteger(square(this.value), false);\n };\n SmallInteger.prototype.square = function() {\n var value = this.value * this.value;\n if (isPrecise(value)) return new SmallInteger(value);\n return new BigInteger(square(smallToArray(Math.abs(this.value))), false);\n };\n function divMod1(a, b) {\n var a_l = a.length,\n b_l = b.length,\n base = BASE,\n result = createArray(b.length),\n divisorMostSignificantDigit = b[b_l - 1],\n lambda = Math.ceil(base / (2 * divisorMostSignificantDigit)),\n remainder = multiplySmall(a, lambda),\n divisor = multiplySmall(b, lambda),\n quotientDigit,\n shift,\n carry,\n borrow,\n i,\n l,\n q;\n if (remainder.length <= a_l) remainder.push(0);\n divisor.push(0);\n divisorMostSignificantDigit = divisor[b_l - 1];\n for (shift = a_l - b_l; shift >= 0; shift--) {\n quotientDigit = base - 1;\n if (remainder[shift + b_l] !== divisorMostSignificantDigit) {\n quotientDigit = Math.floor(\n (remainder[shift + b_l] * base + remainder[shift + b_l - 1]) /\n divisorMostSignificantDigit\n );\n }\n carry = 0;\n borrow = 0;\n l = divisor.length;\n for (i = 0; i < l; i++) {\n carry += quotientDigit * divisor[i];\n q = Math.floor(carry / base);\n borrow += remainder[shift + i] - (carry - q * base);\n carry = q;\n if (borrow < 0) {\n remainder[shift + i] = borrow + base;\n borrow = -1;\n } else {\n remainder[shift + i] = borrow;\n borrow = 0;\n }\n }\n while (borrow !== 0) {\n quotientDigit -= 1;\n carry = 0;\n for (i = 0; i < l; i++) {\n carry += remainder[shift + i] - base + divisor[i];\n if (carry < 0) {\n remainder[shift + i] = carry + base;\n carry = 0;\n } else {\n remainder[shift + i] = carry;\n carry = 1;\n }\n }\n borrow += carry;\n }\n result[shift] = quotientDigit;\n }\n remainder = divModSmall(remainder, lambda)[0];\n return [arrayToSmall(result), arrayToSmall(remainder)];\n }\n function divMod2(a, b) {\n var a_l = a.length,\n b_l = b.length,\n result = [],\n part = [],\n base = BASE,\n guess,\n xlen,\n highx,\n highy,\n check;\n while (a_l) {\n part.unshift(a[--a_l]);\n trim(part);\n if (compareAbs(part, b) < 0) {\n result.push(0);\n continue;\n }\n xlen = part.length;\n highx = part[xlen - 1] * base + part[xlen - 2];\n highy = b[b_l - 1] * base + b[b_l - 2];\n if (xlen > b_l) {\n highx = (highx + 1) * base;\n }\n guess = Math.ceil(highx / highy);\n do {\n check = multiplySmall(b, guess);\n if (compareAbs(check, part) <= 0) break;\n guess--;\n } while (guess);\n result.push(guess);\n part = subtract(part, check);\n }\n result.reverse();\n return [arrayToSmall(result), arrayToSmall(part)];\n }\n function divModSmall(value, lambda) {\n var length = value.length,\n quotient = createArray(length),\n base = BASE,\n i,\n q,\n remainder,\n divisor;\n remainder = 0;\n for (i = length - 1; i >= 0; --i) {\n divisor = remainder * base + value[i];\n q = truncate(divisor / lambda);\n remainder = divisor - q * lambda;\n quotient[i] = q | 0;\n }\n return [quotient, remainder | 0];\n }\n function divModAny(self, v) {\n var value,\n n = parseValue(v);\n var a = self.value,\n b = n.value;\n var quotient;\n if (b === 0) throw new Error('Cannot divide by zero');\n if (self.isSmall) {\n if (n.isSmall) {\n return [new SmallInteger(truncate(a / b)), new SmallInteger(a % b)];\n }\n return [Integer[0], self];\n }\n if (n.isSmall) {\n if (b === 1) return [self, Integer[0]];\n if (b == -1) return [self.negate(), Integer[0]];\n var abs = Math.abs(b);\n if (abs < BASE) {\n value = divModSmall(a, abs);\n quotient = arrayToSmall(value[0]);\n var remainder = value[1];\n if (self.sign) remainder = -remainder;\n if (typeof quotient === 'number') {\n if (self.sign !== n.sign) quotient = -quotient;\n return [new SmallInteger(quotient), new SmallInteger(remainder)];\n }\n return [\n new BigInteger(quotient, self.sign !== n.sign),\n new SmallInteger(remainder)\n ];\n }\n b = smallToArray(abs);\n }\n var comparison = compareAbs(a, b);\n if (comparison === -1) return [Integer[0], self];\n if (comparison === 0)\n return [Integer[self.sign === n.sign ? 1 : -1], Integer[0]];\n if (a.length + b.length <= 200) value = divMod1(a, b);\n else value = divMod2(a, b);\n quotient = value[0];\n var qSign = self.sign !== n.sign,\n mod = value[1],\n mSign = self.sign;\n if (typeof quotient === 'number') {\n if (qSign) quotient = -quotient;\n quotient = new SmallInteger(quotient);\n } else quotient = new BigInteger(quotient, qSign);\n if (typeof mod === 'number') {\n if (mSign) mod = -mod;\n mod = new SmallInteger(mod);\n } else mod = new BigInteger(mod, mSign);\n return [quotient, mod];\n }\n BigInteger.prototype.divmod = function(v) {\n var result = divModAny(this, v);\n return { quotient: result[0], remainder: result[1] };\n };\n SmallInteger.prototype.divmod = BigInteger.prototype.divmod;\n BigInteger.prototype.divide = function(v) {\n return divModAny(this, v)[0];\n };\n SmallInteger.prototype.over = SmallInteger.prototype.divide = BigInteger.prototype.over =\n BigInteger.prototype.divide;\n BigInteger.prototype.mod = function(v) {\n return divModAny(this, v)[1];\n };\n SmallInteger.prototype.remainder = SmallInteger.prototype.mod = BigInteger.prototype.remainder =\n BigInteger.prototype.mod;\n BigInteger.prototype.pow = function(v) {\n var n = parseValue(v),\n a = this.value,\n b = n.value,\n value,\n x,\n y;\n if (b === 0) return Integer[1];\n if (a === 0) return Integer[0];\n if (a === 1) return Integer[1];\n if (a === -1) return n.isEven() ? Integer[1] : Integer[-1];\n if (n.sign) {\n return Integer[0];\n }\n if (!n.isSmall)\n throw new Error('The exponent ' + n.toString() + ' is too large.');\n if (this.isSmall) {\n if (isPrecise((value = Math.pow(a, b))))\n return new SmallInteger(truncate(value));\n }\n x = this;\n y = Integer[1];\n while (true) {\n if (b & (1 === 1)) {\n y = y.times(x);\n --b;\n }\n if (b === 0) break;\n b /= 2;\n x = x.square();\n }\n return y;\n };\n SmallInteger.prototype.pow = BigInteger.prototype.pow;\n BigInteger.prototype.modPow = function(exp, mod) {\n exp = parseValue(exp);\n mod = parseValue(mod);\n if (mod.isZero()) throw new Error('Cannot take modPow with modulus 0');\n var r = Integer[1],\n base = this.mod(mod);\n while (exp.isPositive()) {\n if (base.isZero()) return Integer[0];\n if (exp.isOdd()) r = r.multiply(base).mod(mod);\n exp = exp.divide(2);\n base = base.square().mod(mod);\n }\n return r;\n };\n SmallInteger.prototype.modPow = BigInteger.prototype.modPow;\n function compareAbs(a, b) {\n if (a.length !== b.length) {\n return a.length > b.length ? 1 : -1;\n }\n for (var i = a.length - 1; i >= 0; i--) {\n if (a[i] !== b[i]) return a[i] > b[i] ? 1 : -1;\n }\n return 0;\n }\n BigInteger.prototype.compareAbs = function(v) {\n var n = parseValue(v),\n a = this.value,\n b = n.value;\n if (n.isSmall) return 1;\n return compareAbs(a, b);\n };\n SmallInteger.prototype.compareAbs = function(v) {\n var n = parseValue(v),\n a = Math.abs(this.value),\n b = n.value;\n if (n.isSmall) {\n b = Math.abs(b);\n return a === b ? 0 : a > b ? 1 : -1;\n }\n return -1;\n };\n BigInteger.prototype.compare = function(v) {\n if (v === Infinity) {\n return -1;\n }\n if (v === -Infinity) {\n return 1;\n }\n var n = parseValue(v),\n a = this.value,\n b = n.value;\n if (this.sign !== n.sign) {\n return n.sign ? 1 : -1;\n }\n if (n.isSmall) {\n return this.sign ? -1 : 1;\n }\n return compareAbs(a, b) * (this.sign ? -1 : 1);\n };\n BigInteger.prototype.compareTo = BigInteger.prototype.compare;\n SmallInteger.prototype.compare = function(v) {\n if (v === Infinity) {\n return -1;\n }\n if (v === -Infinity) {\n return 1;\n }\n var n = parseValue(v),\n a = this.value,\n b = n.value;\n if (n.isSmall) {\n return a == b ? 0 : a > b ? 1 : -1;\n }\n if (a < 0 !== n.sign) {\n return a < 0 ? -1 : 1;\n }\n return a < 0 ? 1 : -1;\n };\n SmallInteger.prototype.compareTo = SmallInteger.prototype.compare;\n BigInteger.prototype.equals = function(v) {\n return this.compare(v) === 0;\n };\n SmallInteger.prototype.eq = SmallInteger.prototype.equals = BigInteger.prototype.eq =\n BigInteger.prototype.equals;\n BigInteger.prototype.notEquals = function(v) {\n return this.compare(v) !== 0;\n };\n SmallInteger.prototype.neq = SmallInteger.prototype.notEquals = BigInteger.prototype.neq =\n BigInteger.prototype.notEquals;\n BigInteger.prototype.greater = function(v) {\n return this.compare(v) > 0;\n };\n SmallInteger.prototype.gt = SmallInteger.prototype.greater = BigInteger.prototype.gt =\n BigInteger.prototype.greater;\n BigInteger.prototype.lesser = function(v) {\n return this.compare(v) < 0;\n };\n SmallInteger.prototype.lt = SmallInteger.prototype.lesser = BigInteger.prototype.lt =\n BigInteger.prototype.lesser;\n BigInteger.prototype.greaterOrEquals = function(v) {\n return this.compare(v) >= 0;\n };\n SmallInteger.prototype.geq = SmallInteger.prototype.greaterOrEquals = BigInteger.prototype.geq =\n BigInteger.prototype.greaterOrEquals;\n BigInteger.prototype.lesserOrEquals = function(v) {\n return this.compare(v) <= 0;\n };\n SmallInteger.prototype.leq = SmallInteger.prototype.lesserOrEquals = BigInteger.prototype.leq =\n BigInteger.prototype.lesserOrEquals;\n BigInteger.prototype.isEven = function() {\n return (this.value[0] & 1) === 0;\n };\n SmallInteger.prototype.isEven = function() {\n return (this.value & 1) === 0;\n };\n BigInteger.prototype.isOdd = function() {\n return (this.value[0] & 1) === 1;\n };\n SmallInteger.prototype.isOdd = function() {\n return (this.value & 1) === 1;\n };\n BigInteger.prototype.isPositive = function() {\n return !this.sign;\n };\n SmallInteger.prototype.isPositive = function() {\n return this.value > 0;\n };\n BigInteger.prototype.isNegative = function() {\n return this.sign;\n };\n SmallInteger.prototype.isNegative = function() {\n return this.value < 0;\n };\n BigInteger.prototype.isUnit = function() {\n return false;\n };\n SmallInteger.prototype.isUnit = function() {\n return Math.abs(this.value) === 1;\n };\n BigInteger.prototype.isZero = function() {\n return false;\n };\n SmallInteger.prototype.isZero = function() {\n return this.value === 0;\n };\n BigInteger.prototype.isDivisibleBy = function(v) {\n var n = parseValue(v);\n var value = n.value;\n if (value === 0) return false;\n if (value === 1) return true;\n if (value === 2) return this.isEven();\n return this.mod(n).equals(Integer[0]);\n };\n SmallInteger.prototype.isDivisibleBy = BigInteger.prototype.isDivisibleBy;\n function isBasicPrime(v) {\n var n = v.abs();\n if (n.isUnit()) return false;\n if (n.equals(2) || n.equals(3) || n.equals(5)) return true;\n if (n.isEven() || n.isDivisibleBy(3) || n.isDivisibleBy(5)) return false;\n if (n.lesser(49)) return true;\n }\n function millerRabinTest(n, a) {\n var nPrev = n.prev(),\n b = nPrev,\n r = 0,\n d,\n t,\n i,\n x;\n while (b.isEven()) (b = b.divide(2)), r++;\n next: for (i = 0; i < a.length; i++) {\n if (n.lesser(a[i])) continue;\n x = bigInt(a[i]).modPow(b, n);\n if (x.equals(Integer[1]) || x.equals(nPrev)) continue;\n for (d = r - 1; d != 0; d--) {\n x = x.square().mod(n);\n if (x.isUnit()) return false;\n if (x.equals(nPrev)) continue next;\n }\n return false;\n }\n return true;\n }\n BigInteger.prototype.isPrime = function(strict) {\n var isPrime = isBasicPrime(this);\n if (isPrime !== undefined) return isPrime;\n var n = this.abs();\n var bits = n.bitLength();\n if (bits <= 64)\n return millerRabinTest(n, [\n 2,\n 325,\n 9375,\n 28178,\n 450775,\n 9780504,\n 1795265022\n ]);\n var logN = Math.log(2) * bits;\n var t = Math.ceil(strict === true ? 2 * Math.pow(logN, 2) : logN);\n for (var a = [], i = 0; i < t; i++) {\n a.push(bigInt(i + 2));\n }\n return millerRabinTest(n, a);\n };\n SmallInteger.prototype.isPrime = BigInteger.prototype.isPrime;\n BigInteger.prototype.isProbablePrime = function(iterations) {\n var isPrime = isBasicPrime(this);\n if (isPrime !== undefined) return isPrime;\n var n = this.abs();\n var t = iterations === undefined ? 5 : iterations;\n for (var a = [], i = 0; i < t; i++) {\n a.push(bigInt.randBetween(2, n.minus(2)));\n }\n return millerRabinTest(n, a);\n };\n SmallInteger.prototype.isProbablePrime = BigInteger.prototype.isProbablePrime;\n BigInteger.prototype.modInv = function(n) {\n var t = bigInt.zero,\n newT = bigInt.one,\n r = parseValue(n),\n newR = this.abs(),\n q,\n lastT,\n lastR;\n while (!newR.equals(bigInt.zero)) {\n q = r.divide(newR);\n lastT = t;\n lastR = r;\n t = newT;\n r = newR;\n newT = lastT.subtract(q.multiply(newT));\n newR = lastR.subtract(q.multiply(newR));\n }\n if (!r.equals(1))\n throw new Error(\n this.toString() + ' and ' + n.toString() + ' are not co-prime'\n );\n if (t.compare(0) === -1) {\n t = t.add(n);\n }\n if (this.isNegative()) {\n return t.negate();\n }\n return t;\n };\n SmallInteger.prototype.modInv = BigInteger.prototype.modInv;\n BigInteger.prototype.next = function() {\n var value = this.value;\n if (this.sign) {\n return subtractSmall(value, 1, this.sign);\n }\n return new BigInteger(addSmall(value, 1), this.sign);\n };\n SmallInteger.prototype.next = function() {\n var value = this.value;\n if (value + 1 < MAX_INT) return new SmallInteger(value + 1);\n return new BigInteger(MAX_INT_ARR, false);\n };\n BigInteger.prototype.prev = function() {\n var value = this.value;\n if (this.sign) {\n return new BigInteger(addSmall(value, 1), true);\n }\n return subtractSmall(value, 1, this.sign);\n };\n SmallInteger.prototype.prev = function() {\n var value = this.value;\n if (value - 1 > -MAX_INT) return new SmallInteger(value - 1);\n return new BigInteger(MAX_INT_ARR, true);\n };\n var powersOfTwo = [1];\n while (2 * powersOfTwo[powersOfTwo.length - 1] <= BASE)\n powersOfTwo.push(2 * powersOfTwo[powersOfTwo.length - 1]);\n var powers2Length = powersOfTwo.length,\n highestPower2 = powersOfTwo[powers2Length - 1];\n function shift_isSmall(n) {\n return (\n ((typeof n === 'number' || typeof n === 'string') &&\n +Math.abs(n) <= BASE) ||\n (n instanceof BigInteger && n.value.length <= 1)\n );\n }\n BigInteger.prototype.shiftLeft = function(n) {\n if (!shift_isSmall(n)) {\n throw new Error(String(n) + ' is too large for shifting.');\n }\n n = +n;\n if (n < 0) return this.shiftRight(-n);\n var result = this;\n if (result.isZero()) return result;\n while (n >= powers2Length) {\n result = result.multiply(highestPower2);\n n -= powers2Length - 1;\n }\n return result.multiply(powersOfTwo[n]);\n };\n SmallInteger.prototype.shiftLeft = BigInteger.prototype.shiftLeft;\n BigInteger.prototype.shiftRight = function(n) {\n var remQuo;\n if (!shift_isSmall(n)) {\n throw new Error(String(n) + ' is too large for shifting.');\n }\n n = +n;\n if (n < 0) return this.shiftLeft(-n);\n var result = this;\n while (n >= powers2Length) {\n if (result.isZero() || (result.isNegative() && result.isUnit()))\n return result;\n remQuo = divModAny(result, highestPower2);\n result = remQuo[1].isNegative() ? remQuo[0].prev() : remQuo[0];\n n -= powers2Length - 1;\n }\n remQuo = divModAny(result, powersOfTwo[n]);\n return remQuo[1].isNegative() ? remQuo[0].prev() : remQuo[0];\n };\n SmallInteger.prototype.shiftRight = BigInteger.prototype.shiftRight;\n function bitwise(x, y, fn) {\n y = parseValue(y);\n var xSign = x.isNegative(),\n ySign = y.isNegative();\n var xRem = xSign ? x.not() : x,\n yRem = ySign ? y.not() : y;\n var xDigit = 0,\n yDigit = 0;\n var xDivMod = null,\n yDivMod = null;\n var result = [];\n while (!xRem.isZero() || !yRem.isZero()) {\n xDivMod = divModAny(xRem, highestPower2);\n xDigit = xDivMod[1].toJSNumber();\n if (xSign) {\n xDigit = highestPower2 - 1 - xDigit;\n }\n yDivMod = divModAny(yRem, highestPower2);\n yDigit = yDivMod[1].toJSNumber();\n if (ySign) {\n yDigit = highestPower2 - 1 - yDigit;\n }\n xRem = xDivMod[0];\n yRem = yDivMod[0];\n result.push(fn(xDigit, yDigit));\n }\n var sum = fn(xSign ? 1 : 0, ySign ? 1 : 0) !== 0 ? bigInt(-1) : bigInt(0);\n for (var i = result.length - 1; i >= 0; i -= 1) {\n sum = sum.multiply(highestPower2).add(bigInt(result[i]));\n }\n return sum;\n }\n BigInteger.prototype.not = function() {\n return this.negate().prev();\n };\n SmallInteger.prototype.not = BigInteger.prototype.not;\n BigInteger.prototype.and = function(n) {\n return bitwise(this, n, function(a, b) {\n return a & b;\n });\n };\n SmallInteger.prototype.and = BigInteger.prototype.and;\n BigInteger.prototype.or = function(n) {\n return bitwise(this, n, function(a, b) {\n return a | b;\n });\n };\n SmallInteger.prototype.or = BigInteger.prototype.or;\n BigInteger.prototype.xor = function(n) {\n return bitwise(this, n, function(a, b) {\n return a ^ b;\n });\n };\n SmallInteger.prototype.xor = BigInteger.prototype.xor;\n var LOBMASK_I = 1 << 30,\n LOBMASK_BI = ((BASE & -BASE) * (BASE & -BASE)) | LOBMASK_I;\n function roughLOB(n) {\n var v = n.value,\n x =\n typeof v === 'number'\n ? v | LOBMASK_I\n : (v[0] + v[1] * BASE) | LOBMASK_BI;\n return x & -x;\n }\n function integerLogarithm(value, base) {\n if (base.compareTo(value) <= 0) {\n var tmp = integerLogarithm(value, base.square(base));\n var p = tmp.p;\n var e = tmp.e;\n var t = p.multiply(base);\n return t.compareTo(value) <= 0\n ? { p: t, e: e * 2 + 1 }\n : { p: p, e: e * 2 };\n }\n return { p: bigInt(1), e: 0 };\n }\n BigInteger.prototype.bitLength = function() {\n var n = this;\n if (n.compareTo(bigInt(0)) < 0) {\n n = n.negate().subtract(bigInt(1));\n }\n if (n.compareTo(bigInt(0)) === 0) {\n return bigInt(0);\n }\n return bigInt(integerLogarithm(n, bigInt(2)).e).add(bigInt(1));\n };\n SmallInteger.prototype.bitLength = BigInteger.prototype.bitLength;\n function max(a, b) {\n a = parseValue(a);\n b = parseValue(b);\n return a.greater(b) ? a : b;\n }\n function min(a, b) {\n a = parseValue(a);\n b = parseValue(b);\n return a.lesser(b) ? a : b;\n }\n function gcd(a, b) {\n a = parseValue(a).abs();\n b = parseValue(b).abs();\n if (a.equals(b)) return a;\n if (a.isZero()) return b;\n if (b.isZero()) return a;\n var c = Integer[1],\n d,\n t;\n while (a.isEven() && b.isEven()) {\n d = Math.min(roughLOB(a), roughLOB(b));\n a = a.divide(d);\n b = b.divide(d);\n c = c.multiply(d);\n }\n while (a.isEven()) {\n a = a.divide(roughLOB(a));\n }\n do {\n while (b.isEven()) {\n b = b.divide(roughLOB(b));\n }\n if (a.greater(b)) {\n t = b;\n b = a;\n a = t;\n }\n b = b.subtract(a);\n } while (!b.isZero());\n return c.isUnit() ? a : a.multiply(c);\n }\n function lcm(a, b) {\n a = parseValue(a).abs();\n b = parseValue(b).abs();\n return a.divide(gcd(a, b)).multiply(b);\n }\n function randBetween(a, b) {\n a = parseValue(a);\n b = parseValue(b);\n var low = min(a, b),\n high = max(a, b);\n var range = high.subtract(low).add(1);\n if (range.isSmall) return low.add(Math.floor(Math.random() * range));\n var length = range.value.length - 1;\n var result = [],\n restricted = true;\n for (var i = length; i >= 0; i--) {\n var top = restricted ? range.value[i] : BASE;\n var digit = truncate(Math.random() * top);\n result.unshift(digit);\n if (digit < top) restricted = false;\n }\n result = arrayToSmall(result);\n return low.add(\n typeof result === 'number'\n ? new SmallInteger(result)\n : new BigInteger(result, false)\n );\n }\n var parseBase = function(text, base) {\n var length = text.length;\n var i;\n var absBase = Math.abs(base);\n for (var i = 0; i < length; i++) {\n var c = text[i].toLowerCase();\n if (c === '-') continue;\n if (/[a-z0-9]/.test(c)) {\n if (/[0-9]/.test(c) && +c >= absBase) {\n if (c === '1' && absBase === 1) continue;\n throw new Error(c + ' is not a valid digit in base ' + base + '.');\n } else if (c.charCodeAt(0) - 87 >= absBase) {\n throw new Error(c + ' is not a valid digit in base ' + base + '.');\n }\n }\n }\n if (2 <= base && base <= 36) {\n if (length <= LOG_MAX_INT / Math.log(base)) {\n var result = parseInt(text, base);\n if (isNaN(result)) {\n throw new Error(c + ' is not a valid digit in base ' + base + '.');\n }\n return new SmallInteger(parseInt(text, base));\n }\n }\n base = parseValue(base);\n var digits = [];\n var isNegative = text[0] === '-';\n for (i = isNegative ? 1 : 0; i < text.length; i++) {\n var c = text[i].toLowerCase(),\n charCode = c.charCodeAt(0);\n if (48 <= charCode && charCode <= 57) digits.push(parseValue(c));\n else if (97 <= charCode && charCode <= 122)\n digits.push(parseValue(c.charCodeAt(0) - 87));\n else if (c === '<') {\n var start = i;\n do {\n i++;\n } while (text[i] !== '>');\n digits.push(parseValue(text.slice(start + 1, i)));\n } else throw new Error(c + ' is not a valid character');\n }\n return parseBaseFromArray(digits, base, isNegative);\n };\n function parseBaseFromArray(digits, base, isNegative) {\n var val = Integer[0],\n pow = Integer[1],\n i;\n for (i = digits.length - 1; i >= 0; i--) {\n val = val.add(digits[i].times(pow));\n pow = pow.times(base);\n }\n return isNegative ? val.negate() : val;\n }\n function stringify(digit) {\n if (digit <= 35) {\n return '0123456789abcdefghijklmnopqrstuvwxyz'.charAt(digit);\n }\n return '<' + digit + '>';\n }\n function toBase(n, base) {\n base = bigInt(base);\n if (base.isZero()) {\n if (n.isZero()) return { value: [0], isNegative: false };\n throw new Error('Cannot convert nonzero numbers to base 0.');\n }\n if (base.equals(-1)) {\n if (n.isZero()) return { value: [0], isNegative: false };\n if (n.isNegative())\n return {\n value: [].concat.apply(\n [],\n Array.apply(null, Array(-n)).map(Array.prototype.valueOf, [1, 0])\n ),\n isNegative: false\n };\n var arr = Array.apply(null, Array(+n - 1)).map(Array.prototype.valueOf, [\n 0,\n 1\n ]);\n arr.unshift([1]);\n return { value: [].concat.apply([], arr), isNegative: false };\n }\n var neg = false;\n if (n.isNegative() && base.isPositive()) {\n neg = true;\n n = n.abs();\n }\n if (base.equals(1)) {\n if (n.isZero()) return { value: [0], isNegative: false };\n return {\n value: Array.apply(null, Array(+n)).map(Number.prototype.valueOf, 1),\n isNegative: neg\n };\n }\n var out = [];\n var left = n,\n divmod;\n while (left.isNegative() || left.compareAbs(base) >= 0) {\n divmod = left.divmod(base);\n left = divmod.quotient;\n var digit = divmod.remainder;\n if (digit.isNegative()) {\n digit = base.minus(digit).abs();\n left = left.next();\n }\n out.push(digit.toJSNumber());\n }\n out.push(left.toJSNumber());\n return { value: out.reverse(), isNegative: neg };\n }\n function toBaseString(n, base) {\n var arr = toBase(n, base);\n return (arr.isNegative ? '-' : '') + arr.value.map(stringify).join('');\n }\n BigInteger.prototype.toArray = function(radix) {\n return toBase(this, radix);\n };\n SmallInteger.prototype.toArray = function(radix) {\n return toBase(this, radix);\n };\n BigInteger.prototype.toString = function(radix) {\n if (radix === undefined) radix = 10;\n if (radix !== 10) return toBaseString(this, radix);\n var v = this.value,\n l = v.length,\n str = String(v[--l]),\n zeros = '0000000',\n digit;\n while (--l >= 0) {\n digit = String(v[l]);\n str += zeros.slice(digit.length) + digit;\n }\n var sign = this.sign ? '-' : '';\n return sign + str;\n };\n SmallInteger.prototype.toString = function(radix) {\n if (radix === undefined) radix = 10;\n if (radix != 10) return toBaseString(this, radix);\n return String(this.value);\n };\n BigInteger.prototype.toJSON = SmallInteger.prototype.toJSON = function() {\n return this.toString();\n };\n BigInteger.prototype.valueOf = function() {\n return parseInt(this.toString(), 10);\n };\n BigInteger.prototype.toJSNumber = BigInteger.prototype.valueOf;\n SmallInteger.prototype.valueOf = function() {\n return this.value;\n };\n SmallInteger.prototype.toJSNumber = SmallInteger.prototype.valueOf;\n function parseStringValue(v) {\n if (isPrecise(+v)) {\n var x = +v;\n if (x === truncate(x)) return new SmallInteger(x);\n throw new Error('Invalid integer: ' + v);\n }\n var sign = v[0] === '-';\n if (sign) v = v.slice(1);\n var split = v.split(/e/i);\n if (split.length > 2)\n throw new Error('Invalid integer: ' + split.join('e'));\n if (split.length === 2) {\n var exp = split[1];\n if (exp[0] === '+') exp = exp.slice(1);\n exp = +exp;\n if (exp !== truncate(exp) || !isPrecise(exp))\n throw new Error(\n 'Invalid integer: ' + exp + ' is not a valid exponent.'\n );\n var text = split[0];\n var decimalPlace = text.indexOf('.');\n if (decimalPlace >= 0) {\n exp -= text.length - decimalPlace - 1;\n text = text.slice(0, decimalPlace) + text.slice(decimalPlace + 1);\n }\n if (exp < 0)\n throw new Error('Cannot include negative exponent part for integers');\n text += new Array(exp + 1).join('0');\n v = text;\n }\n var isValid = /^([0-9][0-9]*)$/.test(v);\n if (!isValid) throw new Error('Invalid integer: ' + v);\n var r = [],\n max = v.length,\n l = LOG_BASE,\n min = max - l;\n while (max > 0) {\n r.push(+v.slice(min, max));\n min -= l;\n if (min < 0) min = 0;\n max -= l;\n }\n trim(r);\n return new BigInteger(r, sign);\n }\n function parseNumberValue(v) {\n if (isPrecise(v)) {\n if (v !== truncate(v)) throw new Error(v + ' is not an integer.');\n return new SmallInteger(v);\n }\n return parseStringValue(v.toString());\n }\n function parseValue(v) {\n if (typeof v === 'number') {\n return parseNumberValue(v);\n }\n if (typeof v === 'string') {\n return parseStringValue(v);\n }\n return v;\n }\n for (var i = 0; i < 1e3; i++) {\n Integer[i] = new SmallInteger(i);\n if (i > 0) Integer[-i] = new SmallInteger(-i);\n }\n Integer.one = Integer[1];\n Integer.zero = Integer[0];\n Integer.minusOne = Integer[-1];\n Integer.max = max;\n Integer.min = min;\n Integer.gcd = gcd;\n Integer.lcm = lcm;\n Integer.isInstance = function(x) {\n return x instanceof BigInteger || x instanceof SmallInteger;\n };\n Integer.randBetween = randBetween;\n Integer.fromArray = function(digits, base, isNegative) {\n return parseBaseFromArray(\n digits.map(parseValue),\n parseValue(base || 10),\n isNegative\n );\n };\n return Integer;\n})();\nif (typeof module !== 'undefined' && module.hasOwnProperty('exports')) {\n module.exports = bigInt;\n}\nif (typeof define === 'function' && define.amd) {\n define('big-integer', [], function() {\n return bigInt;\n });\n}\n\nfunction substract(a, b) {\n if (a.eq(0) || b.eq(0)) {\n return { a, b };\n } else if (a.greaterOrEquals(b.multiply(2))) {\n a = a.mod(b.multiply(2));\n return substract(a, b);\n } else if (b.greaterOrEquals(a.multiply(2))) {\n b = b.mod(a.multiply(2));\n return substract(a, b);\n } else {\n return { a, b };\n }\n}\n\nconst nd = readline().split(' ');\n\nconst result = substract(bigInt(nd[0]), bigInt(nd[1]));\n\nprint(result.a.toString() + ' ' + result.b.toString() + '\\n');", "src_uid": "1f505e430eb930ea2b495ab531274114"}
{"source_code": "var l = [];\nvar s = [];\nvar r = [];\nvar p = [];\n\nfor(var i = 0; i < 4; i++) {\n\tvar numbers = readline().split(\" \").map(function(x) { return parseInt(x); });\n\tl.push(numbers[0]);\n\ts.push(numbers[1]);\n\tr.push(numbers[2]);\n\tp.push(numbers[3]);\t\n}\n\nvar result = false;\n\nfor(var i = 0; i < 4; i++) {\n\tif(p[i] == 1) {\n\t\tif(l[i] == 1 || s[i] == 1 || r[i] == 1)\t{\n\t\t\tresult = true;\n\t\t}\n\t}\n}\n\nif(!result) {\n\tif(p[0] == 1) {\n\t\tif(l[1] == 1 || s[2] == 1 || r[3] == 1)\n\t\t\tresult = true\n\t}\n\n\tif(p[1] == 1) {\n\t\tif(l[2] == 1 || s[3] == 1 || r[0] == 1)\n\t\t\tresult = true\n\t}\n\n\tif(p[2] == 1) {\n\t\tif(l[3] == 1 || s[0] == 1 || r[1] == 1)\n\t\t\tresult = true\n\t}\n\n\tif(p[3] == 1) {\n\t\tif(l[0] == 1 || s[1] == 1 || r[2] == 1)\n\t\t\tresult = true\n\t}\n}\n\nif(result)\n\tprint(\"YES\");\nelse\n\tprint(\"NO\");", "src_uid": "44fdf71d56bef949ec83f00d17c29127"}
{"source_code": "var n = Number(readline());\nvar s = readline().split(\"\");\n\nvar x = 0, y = 0;\nvar max = 0;\n\nfor (var i = 0; i < s.length; ++i) {\n var opp;\n if (s[i] === 'L')\n opp = 'R';\n else if (s[i] === 'R')\n opp = 'L';\n else if (s[i] === 'D')\n opp = 'U';\n else if (s[i] === 'U')\n opp = 'D';\n else\n continue;\n\n for(var j = i + 1; j < s.length; j++) {\n if (s[j] === opp) {\n max++;\n s[j] = '';\n break;\n }\n }\n}\n\nprint(max * 2);\n", "src_uid": "b9fa2bb8001bd064ede531a5281cfd8a"}
{"source_code": "lines = \"\"\nwhile (line = readline()) {\n lines += line\n}\ninputs = lines.split(\"\")\n\nans = (inputs[0] == inputs[8] &&\n inputs[1] == inputs[7] &&\n inputs[2] == inputs[6] &&\n inputs[3] == inputs[5]) ? \"YES\" : \"NO\"\n\nprint(ans)", "src_uid": "6a5fe5fac8a4e3993dc3423180cdd6a9"}
{"source_code": ";(function () {\n\n\tvar mat = [];\n\tfor (var i = 0; i < 3; i++) mat.push(readline().split(' ').map(Number));\n\n\tprint((function () {\n\t\tfor (var i = 0; i <= 3*1e5; i++) {\n\t\t\tvar k1 = i - mat[0][1] - mat[0][2];\n\t\t\tif (k1 > 0 && i === k1 + mat[1][0] + mat[2][0]) {\n\t\t\t\tvar k2 = i - mat[1][0] - mat[1][2];\n\t\t\t\tif (k2 > 0 && i === k2 + mat[0][1] + mat[2][1]) {\n\t\t\t\t\tvar k3 = i - mat[2][0] - mat[2][1];\n\t\t\t\t\tif (k3 > 0 && i === k3 + mat[0][2] + mat[1][2]){\n\t\t\t\t\t\tif (i === k1 + k2 + k3 && i === mat[0][2] + k2 + mat[2][0])\n\t\t\t\t\t\t\treturn k1 + ' ' + mat[0][1] + ' ' + mat[0][2] + '\\n'\n\t\t\t\t\t\t\t\t+ mat[1][0] + ' ' + k2 + ' ' + mat[1][2] + '\\n' +\n\t\t\t\t\t\t\t\t+ mat[2][0] + ' ' + mat[2][1] + ' ' + k3;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t})());\n\n}).call(this);", "src_uid": "0c42eafb73d1e30f168958a06a0f9bca"}
{"source_code": "print(function(n) {\n\tvar a = readline().split(' ').map(Number).sort(function(a, b) {\n\t\treturn a - b;\n\t});\n\n\tvar max = a[n - 1];\n\ta[n - 1] = a[0];\n\ta[0] = max;\n\n\treturn a.join(' ');\n\n}(+readline()));", "src_uid": "4408eba2c5c0693e6b70bdcbe2dda2f4"}
{"source_code": "n=parseInt(readline());\nc=true;\nfor(i=n; i>0; i--) {\n if(n%i===0) {\n two=(i).toString(2);\n if(two.length%2===1){\n c=true;\n for(j=0;j<Math.floor(two.length/2)+1;j++){\n if(two[j]==='0') {\n c=false;\n break;\n }\n }\n if(c===true){\n for(j=Math.floor(two.length/2)+1;j<two.length;j++){\n if(two[j]==='1') {\n c=false;\n break;\n }\n }\n if(c===true){\n print(i);\n break;\n }\n }\n }\n }\n}", "src_uid": "339246a1be81aefe19290de0d1aead84"}
{"source_code": "'use strict';\r\n\r\nfunction solve(n, m) {\r\n const target = 10n ** (n - 1n);\r\n const queue = [[BigInt(m), 0]],\r\n cache = new Set();\r\n for (let [num, step] of queue) {\r\n const st = [];\r\n let tmp = num;\r\n while (num) {\r\n let cur = num % 10n;\r\n num = num / 10n;\r\n if (cur < 2n || st[cur]) continue;\r\n st[cur] = 1;\r\n let next = tmp * cur;\r\n if (cache.has(next)) continue;\r\n if (next >= target) {\r\n return step + 1;\r\n }\r\n cache.add(next);\r\n queue.push([next, step + 1]);\r\n }\r\n }\r\n return -1;\r\n}\r\n\r\nasync function main(read) {\r\n try {\r\n let res = [];\r\n const [n, m] = (await read()).split(' ').map(BigInt);\r\n res.push(solve(n, m));\r\n console.log(res.join('\\n'));\r\n } catch (error) {\r\n console.log(error);\r\n }\r\n}\r\n\r\nlet inputs,\r\n str = '';\r\nfunction read() {\r\n return inputs.next().value.trim();\r\n}\r\nprocess.stdin.resume();\r\nprocess.stdin.setEncoding('utf8');\r\nprocess.stdin.on('data', input => str += input);\r\nprocess.stdin.on('end', () => {\r\n inputs = str.split('\\n').values();\r\n main(read);\r\n});\r\n", "src_uid": "cedcc3cee864bf8684148df93804d029"}
{"source_code": "var c = {};\n\nfunction T(i, n) {\n if (i > n / 2) i = n - i;\n if (i === 0) return 1;\n if (c[i + '+' + n]) return c[i + '+' + n];\n if (i == 1) {\n return n;\n }\n var ans = 0;\n for (var j = 1; j < n; j++) {\n ans += T(i - 1, j);\n }\n return c[i + '+' + n] = ans;\n}\n\n\nprint(function(n, m, t) {\n var a = [];\n for (var i = 1; i <= m; i++) {\n\n var j = t - i;\n\n if (j <= n && j >= 4) {\n a.push([T(i, m), T(j, n)]);\n }\n }\n\n var b = [];\n var x = 0;\n a.forEach(function(v){\n \tif(v[0]*v[1]>1e15){\n \t\tvar xx=v[1].toString();\n \t\tvar j=xx.length-1;\n \t\t// print(v)\n \t\tfor(var i=1; i<v[1]; i*=10){\n \t\t\tb.push( v[0]*xx[j--]*i )\n \t\t}\n \t}else{\n \t\tb.push(v[0]*v[1]);\n \t}\n });\n return b.reduce(function(a,b){\n \t// return a+b\n \t//print(a,b)\n \ta=a.toString();\n \tb=b.toString();\n \tvar sum=[];\n \tvar i=a.length-1;\n \tvar j=b.length-1;\n \tvar c=0;\n \twhile(i>=0||j>=0){\n \t\tvar k= +(a[i]||0) + +(b[j]||0) + c;\n \t\tc=~~(k/10);\n \t\tsum.push(k%10);\n \t\ti--;\n \t\tj--;\n \t}\n \tif(c>0){\n\t \tsum.push(c)\t\n \t}\n \treturn sum.reverse().join('');\n });\n}.apply(0, readline().split(' ').map(Number)));", "src_uid": "489e69c7a2fba5fac34e89d7388ed4b8"}
{"source_code": "var values = readline().split(\" \").map(Number);\n\nvar n = values[0];\nvar m = values[1];\nvar divisible = false;\n\nfunction isPrime(n) {\n for (var i = 2; i < n - 1; i++) {\n if (n % i === 0) {\n divisible = true;\n break;\n }\n }\n \n return divisible;\n}\n\nfor (var n = n + 1; n <= m ; n++) {\n if (isPrime(n)) {\n divisible = false;\n } else {\n break;\n }\n \n}\n\nprint(n === m ? \"YES\": \"NO\");", "src_uid": "9d52ff51d747bb59aa463b6358258865"}
{"source_code": "function main()\n{\n var line = readline();\n var arr = line.split(' ');\n\n //print(arr);\n\n var c = parseInt(arr[0]),\n v0 = parseInt(arr[1]),\n v1 = parseInt(arr[2]),\n a = parseInt(arr[3]),\n l = parseInt(arr[4]);\n\n var read = v0,\n days = 1;\n\n if (c === 0) {\n print(0);\n return 0;\n }\n while (read < c) {\n read += Math.min((v0 - l) + days * a, v1 - l);\n days++;\n }\n\n print(days);\n return 0;\n}\nmain();", "src_uid": "b743110117ce13e2090367fd038d3b50"}
{"source_code": "\n\n(function(){\n\nvar grid = [];\nfor (var i = 0; i < 3; i++) {\n\tgrid.push( readline().split('') );\n}\n\ncountX = 0;\ncount0 = 0;\n\nfor(var i=0; i<3; i++){\n\tfor (var j = 0; j<3; j++) {\n\t\tif(grid[i][j]=='X'){\n\t\t\tcountX++;\n\t\t}else if(grid[i][j]=='0'){\n\t\t\tcount0++;\n\t\t}\n\t}\n}\n\nvar l = [];\nfor(var i=0;i<3;i++){\n\tl.push( grid[i].join('') );\n}\nfor(var j=0;j<3;j++){\n\tl.push(grid[0][j]+grid[1][j]+grid[2][j]);\n}\nl.push(grid[0][0]+grid[1][1]+grid[2][2]);\nl.push(grid[0][2]+grid[1][1]+grid[2][0]);\n\nif( countX-count0!=1 && countX-count0!=0 ){\n\tprint('illegal');\n\treturn;\n}\n\ncX = 0;\nc0 = 0;\nfor(var i=0;i<l.length;i++){\n\tif(l[i]=='XXX'){\n\t\tcX++;\n\t}else if(l[i]=='000'){\n\t\tc0++;\n\t}\n}\nif(cX&&c0){\n\tprint('illegal');\n\treturn;\n}\n\nif(cX){\n\tif(countX==count0){\n\t\tprint('illegal');\n\t\treturn;\n\t}\n\tprint('the first player won');\n\treturn;\n}\nif(c0){\n\tif(countX>count0){\n\t\tprint('illegal');\n\t\treturn;\n\t}\n\tprint('the second player won');\n\treturn;\n}\nif(countX+count0==9){\n\tprint('draw');\n\treturn;\n}\nif(countX>count0){\n\tprint('second');\n\treturn;\n}\nif(countX==count0){\n\tprint('first');\n\treturn;\n}\n\n\n}());", "src_uid": "892680e26369325fb00d15543a96192c"}
{"source_code": "function main() {\n let line = stdin[0].split(' ');\n let n = parseInt(line[0]);\n let k = parseInt(line[1]);\n\n\n let nDivisors = [];\n\n for(let i=1; i*i<=n; i++) {\n if(n%i==0) {\n nDivisors.push(i);\n if( i*i != n ) {\n nDivisors.push(n/i);\n }\n }\n }\n\n var x = undefined;\n\n for(let xModK=1; xModK<k; xModK++) {\n if( nDivisors.includes(xModK) ) {\n let xDivK = n/xModK;\n let xCandidate = xDivK * k + xModK;\n\n if( x===undefined || x>xCandidate) {\n x = xCandidate;\n }\n\n }\n }\n console.log(x);\n};\n\n\nconst readline = require('readline');\nconst rl = readline.createInterface(process.stdin, process.stdout, null);\n\nvar stdin = [];\nrl.on('line', function (line) {stdin.push(line);});\nrl.on('close', main);\n\n", "src_uid": "ed0ebc1e484fcaea875355b5b7944c57"}
{"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 b = parseInt(lines[0], 10);\n const g = parseInt(lines[1], 10);\n const n = parseInt(lines[2], 10);\n console.log(badges(b, g, n));\n});\n\n\nfunction badges(b, g, n) {\n if (n === b + g) return 1;\n const min = Math.min(b, g);\n const sub = Math.max(b, g) < n ? n - Math.max(b, g) : 0;\n return min >= n ? 1 + n - sub : 1 + min - sub;\n}", "src_uid": "9266a69e767df299569986151852e7b1"}
{"source_code": "'use strict';\n\nprocess.stdin.resume();\nprocess.stdin.setEncoding('utf-8');\n\nlet inputString = '';\nlet currentLine = 0;\n\nprocess.stdin.on('data', inputStdin => {\n inputString += inputStdin;\n});\n\nprocess.stdin.on('end', _ => {\n inputString = inputString.trim().split('\\n').map(string => {\n return string.trim();\n });\n\n main();\n});\n\nfunction readline() {\n return inputString[currentLine++];\n}\n\nfunction print(s) {\n process.stdout.write(`${s}`);\n}\n// Make a Snippet for the code above this and then write your logic in main();\n\nfunction main() {\n // input\n const [k, r] = readline().split(' ').map(x => parseInt(x));\n let x = 1;\n while (k * x % 10 !== 0 && k * x % 10 !== r) {\n x++;\n }\n // output\n print(x);\n}\n\n", "src_uid": "18cd1cd809df4744bb7bcd7cad94e2d3"}
{"source_code": "var n = readline().split(' ')\nvar x = n[0];\nvar y = n[1];\nvar z = n[2];\nvar t1 = n[3];\nvar t2 = n[4];\nvar t3 = n[5];\nvar elevatorDistance = getElevatorDistance(x,y,z);\nvar ladderDistance = getLadderDistance(x,y);\nfunction getElevatorDistance(x,y,z) {\n var dis1 = Math.abs(x-z);\n var dis2 = Math.abs(x-y);\n var distance = dis1 + dis2;\n return distance;\n}\nfunction getLadderDistance(x,y) {\n return Math.abs(x-y);\n}\nfunction getElevatorTime(t2,t3) {\n return t3*3+elevatorDistance*t2;\n}\nfunction getLadderTime(t1) {\n return t1*ladderDistance;\n}\nif (getElevatorTime(t2,t3) <= getLadderTime(t1)) {\n print(\"YES\");\n} else {\n print(\"NO\");\n}\n", "src_uid": "05cffd59b28b9e026ca3203718b2e6ca"}
{"source_code": "function solve(input) {\n var o = 0, _ = 0;\n o = input.match(/o/g) ? input.match(/o/g).length : 0;\n _ = input.length - o;\n\n return (o === 0) || (_ % o === 0);\n}\n\nvar x = readline();\nprint(solve(x) ? 'YES' : 'NO')\n", "src_uid": "6e006ae3df3bcd24755358a5f584ec03"}