Rows:
| CHALLENGE | AUTHORS | SOLVES (CURRENT) | SOLVE RATE (AT CONTEST TIME) |
|---|---|---|---|
1744 solves | - | ||
1567 solves | - | ||
926 solves | - | ||
623 solves | Top 28% = 84/300 users | ||
617 solves | - | ||
600 solves | - | ||
539 solves | Top 73% = 683/928 teams | ||
409 solves | - | ||
403 solves | - | ||
371 solves | - | ||
367 solves | - | ||
363 solves | Top 32% = 56/174 users | ||
349 solves | - | ||
342 solves | - | ||
336 solves | - | ||
330 solves | - | ||
329 solves | - | ||
323 solves | - | ||
318 solves | - | ||
305 solves | - |
Rows:
Daily AlpacaHackTopic: OptimizationReleased: Mar 26, 2026
一見複雑に見える式でも、実は単純な計算の最適化結果かもしれません。
chal と、元ソースコードの chal.c が与えられています。chal.c ソースコードの処理内容を解析して、 chal バイナリの出力が Correct! となるような入力（= フラグ）を探すことです。