Rows:
| CHALLENGE | AUTHORS | SOLVES (CURRENT) | SOLVE RATE (AT CONTEST TIME) |
|---|---|---|---|
1734 solves | - | ||
1561 solves | - | ||
920 solves | - | ||
622 solves | Top 28% = 84/300 users | ||
616 solves | - | ||
599 solves | - | ||
537 solves | Top 73% = 683/928 teams | ||
407 solves | - | ||
401 solves | - | ||
369 solves | - | ||
365 solves | - | ||
362 solves | Top 32% = 56/174 users | ||
348 solves | - | ||
339 solves | - | ||
335 solves | - | ||
328 solves | - | ||
327 solves | - | ||
321 solves | - | ||
317 solves | - | ||
303 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();
});
*完全なソースコードは以下からダウンロード可能です。