# SkyWT

#### 我们的征途是星辰大海

⚙️ 本网站主题尚未开发完善，可能偶现奇怪的 bug。
✨ 生活向的内容都放到了 whisper.skywt.cn。

More...

Educational Codeforces Round 71 (Rated for Div. 2)

# F - Remainder Problem

## Description

*2100

• 1 x y：将 $a_x$ 增加 $y$；
• 2 x y：计算 $\sum\limits_{i \in R(x, y)} a_i$，其中 $R(x,y)$ 表示 1 到 500000 中模 $x$ 余 $y$ 的数字集合。

More...

2019.11.07 Upd：其实不是真的完结了，有些题目实在搞不动 QwQ

More...

# D - Power Products

## Description

More...

Codeforces Round #578 (Div. 2)

# D - White Lines

## Description

*1900

More...

Codeforces Round #581 (Div. 2) 比赛链接：LInk

# C - Anna, Svyatoslav and Maps

More...

Link

More...

More...

## Description

Link

Ivan wants to make a necklace as a present to his beloved girl. A necklace is a cyclic sequence of beads of different colors. Ivan says that necklace is beautiful relative to the cut point between two adjacent beads, if the chain of beads remaining after this cut is a palindrome (reads the same forward and backward).

More...

## Description

Yaroslav has n points that lie on the $Ox$ axis. The coordinate of the first point is $x_1$, the coordinate of the second point is $x_2$, ..., the coordinate of the n-th point is — $x_n$. Now Yaroslav wants to execute $m$ queries, each of them is of one of the two following types:

More...