Konjac konjac cultivation of CF Orange name Program 2

1

Because the first article did not write test instructions led to most of the problems of God has been completely unaware of what is said ... So we have to re-open an article to protect the peace ...

"303A" test instructions: for the arrangement of three lengths of $n (n<=10^5) $ $a,b,c$ make $a_i+b_i \equiv c_i \pmod{n}$; problem: God ... (hand chinaround into the ... ）。 First of all, $n$ is an odd number without solution (proving not qaq); $n $ is even, you can set $n=2k+1$, and we assume $a_i=b_i$, then $2a_i \equiv c_i \pmod{2k+1}$, when $ <= a_i <= k$, apparently $ C_i$ are even different, when $k<a_i<2k$, $c _i$ is obviously odd, so there are $k+1+k=2k+1$ number. Then it's built ... (though I didn't construct it qaq)

Konjac konjac cultivation of CF Orange name Program 2