結果

問題 No.98 円を描こう
ユーザー watarimaycry2watarimaycry2
提出日時 2021-12-04 14:29:16
言語 JavaScript
(node v23.5.0)
結果
AC  
実行時間 77 ms / 5,000 ms
コード長 2,764 bytes
コンパイル時間 116 ms
コンパイル使用メモリ 6,816 KB
実行使用メモリ 40,448 KB
最終ジャッジ日時 2024-07-06 20:28:25
合計ジャッジ時間 1,800 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 6
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

//Don't have to see. start------------------------------------------
var read = require('readline').createInterface({
input: process.stdin, output: process.stdout
});
var obj; var inLine = []; var outputList = [];var retcode = new Set();
read.on('line', function(input){
var tmp = input.split(' ');
for(var i = 0; i < tmp.length; i++){
inLine.push(tmp[i]);
if(i == tmp.length - 1){
retcode.add(inLine.length);
}
}
});
read.on('close', function(){
obj = init(inLine);
console.error('\n');
Main();
console.log(myconv(outputList, 9));
});
function makeClone(obj){return (obj instanceof Set) ? new Set(Array.from(obj)) : JSON.parse(JSON.stringify(obj));}
function nextArray(size, code){
var ret = new Array(size);
for(var i = 0; i < size; i++){
if(code == 'int'){
ret[i] = nextInt();
}else if(code == 'long'){
ret[i] = BigInt(next());
}else{
ret[i] = next();
}
}
return ret;
}
function nextIntArray(size){return nextArray(size, 'int');} function nextStrArray(size){return nextArray(size, 'str');} function nextLongArray(size
    ){return nextArray(size, 'long');}
function nextCharArray(){return myconv(next(),6);}
function next(){return obj.next();} function hasNext(){return obj.hasNext();} function nextInt(){return myconv(next(),1);} function nextLong(){return
    BigInt(next());}
function getCountMap(list){
var map = {};
for(var i = 0; i < list.length; i++){
if(map[list[i]] == null){
map[list[i]] = 0;
}
map[list[i]]++;
}
return map;
}
function init(input){
return {
list : input, index : 0, max : input.length,
hasNext : function(){return (this.index < this.max);},
next : function(){if(this.hasNext()){return this.list[this.index++];}else{throw 'ArrayIndexOutOfBoundsException ‚There is no more input';}},
isReturn : function(){return retcode.has(this.index);}
};
}
function myout(s){outputList.push(s);}
function myerr(s){console.error('debug:' + require('util').inspect(s,false,null));}
function isReturn(){return obj.isReturn();}
//param "no" is
//unknown or outlier : return i. 1: parseInt.
//2: split space. 4: split space and parseInt.
//6: split 1 character. 7: split 1 character and parseInt.
//8: join space. 9: join nextline. 0: join no character.
function 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;}}
//Don't have to see. end------------------------------------------
function Main(){
var x = Math.abs(nextInt());
var y = Math.abs(nextInt());
var v = Math.floor(Math.sqrt(x * x + y * y) * 2) + 1;
myout(v);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0