結果
問題 | No.843 Triple Primes |
ユーザー | watarimaycry2 |
提出日時 | 2020-10-24 17:47:47 |
言語 | JavaScript (node v21.7.1) |
結果 |
AC
|
実行時間 | 224 ms / 2,000 ms |
コード長 | 3,042 bytes |
コンパイル時間 | 84 ms |
コンパイル使用メモリ | 5,328 KB |
実行使用メモリ | 54,592 KB |
最終ジャッジ日時 | 2023-09-28 20:32:45 |
合計ジャッジ時間 | 8,756 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 92 ms
42,956 KB |
testcase_01 | AC | 224 ms
51,940 KB |
testcase_02 | AC | 92 ms
42,444 KB |
testcase_03 | AC | 91 ms
42,444 KB |
testcase_04 | AC | 94 ms
42,440 KB |
testcase_05 | AC | 93 ms
42,372 KB |
testcase_06 | AC | 95 ms
42,708 KB |
testcase_07 | AC | 199 ms
52,196 KB |
testcase_08 | AC | 203 ms
51,624 KB |
testcase_09 | AC | 224 ms
52,128 KB |
testcase_10 | AC | 198 ms
51,660 KB |
testcase_11 | AC | 210 ms
52,296 KB |
testcase_12 | AC | 213 ms
52,040 KB |
testcase_13 | AC | 217 ms
54,592 KB |
testcase_14 | AC | 210 ms
53,660 KB |
testcase_15 | AC | 198 ms
53,680 KB |
testcase_16 | AC | 198 ms
51,872 KB |
testcase_17 | AC | 89 ms
42,620 KB |
testcase_18 | AC | 90 ms
42,436 KB |
testcase_19 | AC | 91 ms
42,436 KB |
testcase_20 | AC | 133 ms
47,824 KB |
testcase_21 | AC | 118 ms
46,956 KB |
testcase_22 | AC | 165 ms
49,420 KB |
testcase_23 | AC | 168 ms
49,312 KB |
testcase_24 | AC | 136 ms
47,472 KB |
testcase_25 | AC | 131 ms
47,396 KB |
testcase_26 | AC | 219 ms
52,392 KB |
testcase_27 | AC | 108 ms
46,428 KB |
testcase_28 | AC | 219 ms
51,820 KB |
testcase_29 | AC | 141 ms
47,548 KB |
testcase_30 | AC | 217 ms
51,860 KB |
testcase_31 | AC | 113 ms
48,976 KB |
testcase_32 | AC | 103 ms
46,620 KB |
testcase_33 | AC | 145 ms
49,684 KB |
testcase_34 | AC | 162 ms
49,008 KB |
testcase_35 | AC | 218 ms
52,396 KB |
testcase_36 | AC | 123 ms
47,488 KB |
testcase_37 | AC | 192 ms
52,940 KB |
testcase_38 | AC | 181 ms
53,388 KB |
testcase_39 | AC | 219 ms
51,672 KB |
testcase_40 | AC | 91 ms
42,672 KB |
testcase_41 | AC | 90 ms
42,596 KB |
testcase_42 | AC | 204 ms
52,192 KB |
testcase_43 | AC | 212 ms
52,196 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 map = sieveOfEratos(N); myerr(map.size); var output = 0; var list = Array.from(map); for(var i = 0; i < list.length; i++){ if(map.has(Math.sqrt(list[i] + 2))){ output++; } } myout(Math.max(output * 2 - 1, 0)); } function sieveOfEratos(val){ var primes = new Set(); var nums = new Set(); var used = [2,3,5,7,11];//これらは既に素数であるとする var underPrime = 13;//この値から+2ごとに追加。↑の値で割り切れたものは何もしない if(val <= 1){ return nums; } for(var i = 0; i < used.length; i++){if(used[i] <= val){nums.add(used[i]);}} for(var i = underPrime; i <= val; i = i + 2){ var continued = false; for(var j = 0; j < used.length; j++){ if(i % used[j] == 0){continued = true; break;} } if(continued){continue;} nums.add(i); } for(var i = 2; i <= Math.sqrt(val); (i == 2) ? i++ : i = i + 2){ if(!nums.has(i)){continue;} var count = 1; while(i * count <= val){ if(i <= 11 && used.indexOf(i) != -1){break;} if(count == 1){primes.add(i);} nums.delete(i * count); count++; } } var primeItr = Array.from(primes); for(var i = 0; i < primeItr.length; i++){ nums.add(primeItr[i]); } return nums; }