<a href="https://atcoder.jp/contests/past201912-open">First Algorithm Practical Skill Test Past Questions - AtCoder</a> <a href="/en/PAST1">PAST1</a> <a href="/en/Algorithm%20Practical%20Skill%20Test">Algorithm Practical Skill Test</a> <a href="/en/past201912">past201912</a>
D
<ul>
<li>Count first, then find out what is over- or under-counted.
E
</li>
<li>Have graphs with adjacency matrices. Query 3 is of the order of 10^4 at worst, but even if all of that is done 500 times, there is still plenty of room
F
</li>
<li>The first letter is chopped after the first even numbered capital letter, sorted and merged.
G
</li>
<li>How hard can it be? I was worried about it, but n=10.
<ul>
<li>If you do a full search of 3^10, it&#39;s about 10^5.</li>
<li>10^2 to calculate the score</li>
<li>I&#39;ll make it in plenty of time.</li>
</ul>
</li>
<li><a href="/en/PAST1H">PAST1H</a> noSub
</li>
<li><a href="/en/PAST1I">PAST1I</a> AC
</li>
<li><a href="/en/PAST1J">PAST1J</a> AC
</li>
<li><a href="/en/PAST1K">PAST1K</a> AC
</li>
<li><a href="/en/PAST1L">PAST1L</a> WA1
</li>
<li><a href="/en/PAST1M">PAST1M</a>
</li>
<li><a href="/en/PAST1N">PAST1N</a>
</li>
<li><a href="/en/PAST1O">PAST1O</a>
</li>
</ul>
<hr>
This page is auto-translated from [/nishio/第一回 アルゴリズム実技検定](<a href="https://scrapbox.io/nishio/%E7%AC%AC%E4%B8%80%E5%9B%9E">https://scrapbox.io/nishio/第一回</a> アルゴリズム実技検定) using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at <a href="https://twitter.com/nishio_en">@nishio_en</a>. I&#39;m very happy to spread my thought to non-Japanese readers.

First Algorithm Practical Skills Test