結果

問題 No.2027 (1, 2, 3, …, N) 's Subset Sum
ユーザー watarimaycry2watarimaycry2
提出日時 2022-08-05 21:25:59
言語 JavaScript
(node v21.7.1)
結果
AC  
実行時間 267 ms / 2,000 ms
コード長 3,033 bytes
コンパイル時間 202 ms
コンパイル使用メモリ 5,336 KB
実行使用メモリ 72,432 KB
最終ジャッジ日時 2023-10-13 21:49:16
合計ジャッジ時間 7,104 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 82 ms
42,512 KB
testcase_01 AC 82 ms
42,620 KB
testcase_02 AC 267 ms
72,256 KB
testcase_03 AC 80 ms
42,768 KB
testcase_04 AC 201 ms
72,432 KB
testcase_05 AC 197 ms
72,336 KB
testcase_06 AC 202 ms
72,336 KB
testcase_07 AC 101 ms
49,848 KB
testcase_08 AC 176 ms
64,380 KB
testcase_09 AC 95 ms
48,280 KB
testcase_10 AC 123 ms
52,972 KB
testcase_11 AC 100 ms
49,112 KB
testcase_12 AC 113 ms
51,732 KB
testcase_13 AC 100 ms
49,816 KB
testcase_14 AC 94 ms
48,180 KB
testcase_15 AC 104 ms
49,964 KB
testcase_16 AC 118 ms
52,408 KB
testcase_17 AC 82 ms
45,144 KB
testcase_18 AC 84 ms
43,080 KB
testcase_19 AC 82 ms
43,168 KB
testcase_20 AC 82 ms
42,996 KB
testcase_21 AC 81 ms
42,980 KB
testcase_22 AC 149 ms
58,788 KB
testcase_23 AC 130 ms
53,476 KB
testcase_24 AC 104 ms
48,920 KB
testcase_25 AC 169 ms
61,220 KB
testcase_26 AC 102 ms
49,716 KB
権限があれば一括ダウンロードができます

ソースコード

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] = nextLong();
		}else if(code == 'double'){
			ret[i] = nextDouble();
		}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 nextDoubleArray(size){return nextArray(size, 'double');}
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 nextDouble(){return parseFloat(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 N = nextInt();
	var K = nextInt();
	var list = [];
	for(var i = N; i >= 1; i--){
		if(K >= i){
			K -= i;
			list.push(i);
		}
	}
	list.sort(function(a,b){
		return a - b;
	});
	myout(list.length);
	myout(myconv(list, 8));
}
0