Rows:
| CHALLENGE | AUTHORS | SOLVES (CURRENT) | SOLVE RATE (AT CONTEST TIME) |
|---|---|---|---|
WelcomeMisc | 1229 solves | - | |
AlpacaHack 2100Misc | 633 solves | - | |
Simple LoginWeb | 509 solves | Top 28% = 84/300 users | |
a fact of CTFCrypto | 428 solves | - | |
echoPwn | 309 solves | Top 32% = 56/174 users | |
EmojifyWeb | 306 solves | - | |
283 solves | - | ||
255 solves | - | ||
244 solves | Top 15% = 71/458 users | ||
qrimeCrypto | 226 solves | Top 38% = 91/239 users | |
Country DBWeb | 205 solves | Top 33% = 246/729 teams | |
hit-and-missMisc | 199 solves | - | |
inboundPwn | 187 solves | Top 28% = 57/197 users | |
183 solves | - | ||
size limitCrypto | 181 solves | - | |
179 solves | - | ||
Alpaca BankWeb | 169 solves | - | |
masking tapeRev | 159 solves | Top 19% = 61/316 users | |
Fully Padded RSACrypto | 152 solves | - | |
before-writePwn | 146 solves | - |
Rows:
a < b && parseInt(a) > parseInt(b) となるような a, b を見つけてください🐟
const rl = require("node:readline").createInterface({
input: process.stdin,
output: process.stdout,
});
rl.question("Input a,b: ", input => {
const [a, b] = input.toString().trim().split(",").map(Number);
if (a < b && parseInt(a) > parseInt(b))
console.log(process.env.FLAG);
else
console.log(":(");
rl.close();
});
*完全なソースコードは以下からダウンロード可能です。