Rows:
| CHALLENGE | AUTHORS | SOLVES (CURRENT) | SOLVE RATE (AT CONTEST TIME) |
|---|---|---|---|
1736 solves | - | ||
1563 solves | - | ||
922 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:
出力からフラグを復元してください🐍
import os
from Crypto.Util.number import getPrime, bytes_to_long
m = bytes_to_long(os.getenv("FLAG").encode())
p = getPrime(96)
n = p * p * p
e = 65537
c = pow(m, e, n)
print(f"{n,c=}")
出力:
n,c=(272361880253535445317143279209232620259509770172080133049487958853930525983846305005657, 69147423377323669983172806367084358432369489877851180970277804462365354019444586165184)