結果
問題 | No.1229 ラグビーの得点パターン |
ユーザー | watarimaycry2 |
提出日時 | 2020-10-07 09:47:42 |
言語 | JavaScript (node v21.7.1) |
結果 |
AC
|
実行時間 | 93 ms / 2,000 ms |
コード長 | 2,029 bytes |
コンパイル時間 | 65 ms |
コンパイル使用メモリ | 6,812 KB |
実行使用メモリ | 43,776 KB |
最終ジャッジ日時 | 2024-07-20 03:16:22 |
合計ジャッジ時間 | 5,099 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 88 ms
43,520 KB |
testcase_01 | AC | 87 ms
43,776 KB |
testcase_02 | AC | 85 ms
43,648 KB |
testcase_03 | AC | 87 ms
43,392 KB |
testcase_04 | AC | 88 ms
43,648 KB |
testcase_05 | AC | 88 ms
43,136 KB |
testcase_06 | AC | 93 ms
43,136 KB |
testcase_07 | AC | 86 ms
43,520 KB |
testcase_08 | AC | 86 ms
43,264 KB |
testcase_09 | AC | 85 ms
43,776 KB |
testcase_10 | AC | 87 ms
43,392 KB |
testcase_11 | AC | 85 ms
43,392 KB |
testcase_12 | AC | 86 ms
43,776 KB |
testcase_13 | AC | 85 ms
43,648 KB |
testcase_14 | AC | 85 ms
43,776 KB |
testcase_15 | AC | 86 ms
43,648 KB |
testcase_16 | AC | 87 ms
43,520 KB |
testcase_17 | AC | 84 ms
43,776 KB |
testcase_18 | AC | 84 ms
43,520 KB |
testcase_19 | AC | 85 ms
43,648 KB |
testcase_20 | AC | 85 ms
43,648 KB |
testcase_21 | AC | 86 ms
43,520 KB |
testcase_22 | AC | 85 ms
43,648 KB |
testcase_23 | AC | 85 ms
43,648 KB |
testcase_24 | AC | 88 ms
43,264 KB |
testcase_25 | AC | 86 ms
43,648 KB |
testcase_26 | AC | 88 ms
43,776 KB |
testcase_27 | AC | 87 ms
43,648 KB |
testcase_28 | AC | 86 ms
43,648 KB |
ソースコード
//Don't have to see. start------------------------------------------ var read = require('readline').createInterface({ input: process.stdin, output: process.stdout }); var obj; var inLine = []; read.on('line', function(input){inLine.push(input);}); read.on('close', function(){ obj = init(inLine); console.error('\n↑入力 ↓出力'); Main(); }); function makeClone(obj){return (obj instanceof Set) ? new Set(Array.from(obj)) : JSON.parse(JSON.stringify(obj));} function nextInt(){return myconv(next(),1);} function nextStrArray(){return myconv(next(),2);} function nextIntArray(){return myconv(next(),4);} function nextCharArray(){return myconv(next(),6);} function next(){return obj.next();} function hasNext(){return obj.hasNext();} 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';}} }; } function myout(s){console.log(s);} function myerr(s){console.error('debug:' + require('util').inspect(s,false,null));} //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 N = nextInt(); var output = 0; for(var i = 0; i < 100; i++){ for(var j = 0; j <= i; j++){ for(var k = 0; k < 100; k++){ if(i * 5 + j * 2 + k * 3 == N){ output++; } } } } myout(output); }