I think this team (AllTimeLegend from Sogang univ) has not updated yet, maybe because I posted with a reply so can be missed easily

https://mirror.codeforces.com/blog/entry/138428?#comment-1237786

AllTimeLegend: hulahula3247 Seungni W_NotFoundGD

Misuki orz

oh.. I was so stupid :(

The problems were so interesting and fun. Unlike other contests, AB was really good. I like them

Thx, that's what i needed

After k processes, the element x_i will be: gcd(x_i ~ x_{i+k}). To calculate this, You can use sparse table.

There is a solution with Sparse Table.

pypy3 is suck at big integers https://mirror.codeforces.com/blog/entry/91905?#comment-806750

Thanks!

I think TL on problem C is too tight for Pypy3. Or I was wrong?

(Edit: I got TLE while system testing.)

n, k, x = mip()
a = lmip()
a.sort()
p = []
g = 1
for i in range(1, n):
    di = a[i] - a[i - 1]
    if di > x:
        p.append((di - 1) // x)
        g += 1
 
p.sort()
for i in p:
    if i > k:
        break
    k -= i
    g -= 1
print(g)

D is from COCI 2009/2010 contest #3 https://hsin.hr/coci/archive/2009_2010/contest3_tasks.pdf