首页 > TAG信息列表 > getPrime
Number质数
const number = 180; let arr = []; let flag = true; getPrime(number); print(arr.join(' ')); function getPrime(num) { if (num === 1) { return null; } for (let i = 2; i <= num/i; i++) { if (Math.ceil(num/i) === num/crypto-RSA攻击
题目来源2022HGAME import re from math import ceil from Crypto.Util.number import getPrime from libnum import s2n from secret import flag flag_parts = list(map(s2n, re.findall(rf".{{,{ceil(len(flag) / 3)}}}", flag))) print("# task1") m =