結果

問題 No.1529 Constant Lcm
コンテスト
ユーザー watarimaycry2
提出日時 2021-09-29 16:20:15
言語 JavaScript
(node v23.5.0)
結果
TLE  
実行時間 -
コード長 4,708 bytes
コンパイル時間 60 ms
コンパイル使用メモリ 6,944 KB
実行使用メモリ 123,300 KB
最終ジャッジ日時 2024-07-16 11:57:36
合計ジャッジ時間 6,249 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 8 TLE * 1 -- * 15
権限があれば一括ダウンロードができます

ソースコード

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 N = nextInt();
	var list = [];
	for(var i = 0; i < Math.floor(N / 2); i++){
		list.push((N - (i + 1)));
		list.push((i + 1))
	}
	
	var map = {};
	var mod = 998244353n;
	for(var i = 0; i < list.length; i += 2){
		var p = getPrimeFactorization(list[i]);
		var p2 = getPrimeFactorization(list[i + 1]);
		var key = Object.keys(p);
		var key2 = Object.keys(p2);
		var set = {};
		for(var j = 0; j < key.length; j++){
			if(set[key[j]] == null){
				set[key[j]] = 0;
			}
			set[key[j]] += p[key[j]];
		}
		for(var j = 0; j < key2.length; j++){
			if(set[key2[j]] == null){
				set[key2[j]] = 0;
			}
			set[key2[j]] += p2[key2[j]];
		}
		var key3 = Object.keys(set);
		for(var j = 0; j < key3.length; j++){
			if(map[key3[j]] == null){
				map[key3[j]] = 0;
			}
			map[key3[j]] = Math.max(map[key3[j]], set[key3[j]]);
		}
	}
	
	var output = 1n;
	var k = Object.keys(map);
	for(var i = 0; i < k.length; i++){
		output *= mypow(k[i], map[k[i]], mod);
		output %= mod;
	}
	myout(output);
}
function mypow(x, n, m) {
	x = BigInt(x);
	n = BigInt(n);
	m = BigInt(m);
	var ans = 1n;
	while (n > 0n) {
		if ((n & 1n) == 1n){
			ans = ans * x;
			if(m != -1n){
				ans %= m;
			}
		}
		x = x * x;
		if(m != -1n){
			x %= m;
		}
		n >>= 1n;
	}
	return ans;
}
function getPrimeFactorization(val){
	var primeMap = {};
	var div = 2;
	if(isPrime(val)){
		primeMap[val] = 1;
		return primeMap;
	}
	while(val != 1){
		if(val % div == 0){
			var count = 2;
			while(val % Math.pow(div, count) == 0){
				count++;
			}
			(primeMap[div] == null)  ? primeMap[div] = (count - 1) : primeMap[div] += (count - 1);
			val /= Math.pow(div, count - 1);
			if(isPrime(val)){
				(primeMap[val] == null)  ? primeMap[val] = 1 : primeMap[val]++;
				break;
			}
		}
		div = (div == 2) ? div + 1 : div + 2;
	}
	return primeMap;
}
function isPrime(val){
	if(val == null || val <= 1 || (val != 2 && val % 2 == 0)){
		return false;
	}else if(val == 2){
		return true;
	}
	var root = Math.floor(Math.sqrt(val));
	for(var i = 3; i <= root; i += 2){
		if(val % i == 0){
			return false;
		}
	}
	return true;
}
0