hira

<h1 id="a---twiblr">
<a class="header-anchor-link" href="#a---twiblr" aria-hidden="true"></a> A - twiblr</h1>
<p>フォロー可能な最大数を求めて引く。<br style="display:none">
<span class="embed-block zenn-embedded zenn-embedded-card"><iframe id="zenn-embedded__d1a65cd0b4b59" src="https://embed.zenn.studio/card#zenn-embedded__d1a65cd0b4b59" data-content="https%3A%2F%2Fatcoder.jp%2Fcontests%2Fabc182%2Fsubmissions%2F34098896" frameborder="0" scrolling="no" loading="lazy"></iframe></span><a href="https://atcoder.jp/contests/abc182/submissions/34098896" style="display:none" target="_blank" rel="nofollow noopener noreferrer">https://atcoder.jp/contests/abc182/submissions/34098896</a></p>


<h1 id="b---almost-gcd">
<a class="header-anchor-link" href="#b---almost-gcd" aria-hidden="true"></a> B - Almost GCD</h1>
<p>適当に上限を決めて、その範囲内で全部調べる。とりあえず<embed-katex><eq class="zenn-katex">A</eq></embed-katex>の最大値を上限とすればいい。<embed-katex><eq class="zenn-katex">A</eq></embed-katex>の最大値を超える数は確実にGCD度は0で、かつそれより小さい数の中でGCD度が1以上の数は確実に存在するので。<br style="display:none">
<span class="embed-block zenn-embedded zenn-embedded-card"><iframe id="zenn-embedded__0bfea5c9b2541" src="https://embed.zenn.studio/card#zenn-embedded__0bfea5c9b2541" data-content="https%3A%2F%2Fatcoder.jp%2Fcontests%2Fabc182%2Fsubmissions%2F38735601" frameborder="0" scrolling="no" loading="lazy"></iframe></span><a href="https://atcoder.jp/contests/abc182/submissions/38735601" style="display:none" target="_blank" rel="nofollow noopener noreferrer">https://atcoder.jp/contests/abc182/submissions/38735601</a></p>


<h1 id="c---to-3">
<a class="header-anchor-link" href="#c---to-3" aria-hidden="true"></a> C - To 3</h1>
<p>消すパターンとしてあり得るケースは<embed-katex><eq class="zenn-katex">2^{18}-1</eq></embed-katex>通り（262143通り）しかないので全部調べる。bit全探索が使える。<br style="display:none">
<span class="embed-block zenn-embedded zenn-embedded-card"><iframe id="zenn-embedded__1d2dd8105890b" src="https://embed.zenn.studio/card#zenn-embedded__1d2dd8105890b" data-content="https%3A%2F%2Fatcoder.jp%2Fcontests%2Fabc182%2Fsubmissions%2F50556105" frameborder="0" scrolling="no" loading="lazy"></iframe></span><a href="https://atcoder.jp/contests/abc182/submissions/50556105" style="display:none" target="_blank" rel="nofollow noopener noreferrer">https://atcoder.jp/contests/abc182/submissions/50556105</a></p>
