2023 年 11月随笔档案 - EdGrass

摘要：比赛录屏 https://www.bilibili.com/video/BV1H34y1F7B1/

A . C o v e r i n W a t e r

https://codeforces.com/contest/1900/submission/234430348 \(B. Laura and Operat

21

0

1

Starters 109 Division 2 (Rated)

摘要：比赛录屏 https://www.bilibili.com/video/BV1Aw411n7DP/?vd_source=9a4bbd69c77feaab80f2e4e19721de57vd_source=9a4bbd69c77feaab80f2e4e19721de57 \(Best of N Set

20

0

Codeforces Round 905 (Div. 2)

摘要：

A . C h e m i s t r y

https://codeforces.com/contest/1888/submission/233505834

B . R a s p b e r r i e s

https://codeforces.com/contest/1888/submission/233506474

57

0

Codeforces Round 904 (Div. 2)

摘要：

A . S i m p l e D e s i g n

https://codeforces.com/contest/1884/submission/233628914

B . H a u n t e d H o u s e

https://codeforces.com/contest/1884/submission/2336

32

0

Codeforces Round 910 (Div. 2)

摘要：比赛录屏 https://www.bilibili.com/video/BV1kN411T71H/?spm_id_from=top_right_bar_window_dynamic.content.click

A . M i l i c a a n d S t r i n g

https://codeforces.c

52

0

Starters 108 (Rated till 6 Stars)

摘要：

C h e s s P a i r i n g

https://www.codechef.com/viewsolution/1030072835

P a l i n d r o m i c P r i m e N u m b e r s

https://www.codechef.com/viewsolution/1030133052 \(Cl

6

0

Codeforces Round 907 (Div. 2)

摘要：

A . S o r t i n g w i t h T w o s

https://codeforces.com/contest/1891/submission/232689614

B . D e j a V u

https://codeforces.com/contest/1891/submission/232690

23

0

Codeforces Round 908 (Div. 2)

摘要：比赛视频 https://www.bilibili.com/video/BV1nw411x7xH/?vd_source=9a4bbd69c77feaab80f2e4e19721de57

A . S e c r e t S p o r t

https://codeforces.com/contest/1894/s

141

0

Educational Codeforces Round 157 (Rated for Div. 2)

摘要：

D . X O R C o n s t r u c t i o n

首先观察

b_{1} \oplus b_{2} = a_{1}, b_{2} \oplus b_{3} = a_{2} \dots

，发现

b_{1} \oplus b_{j + 1} = ⨁_{i = 1}^{j} a_{i}

，那么自然的想到如果第一个数字确定，后面的

17

0

Starters 106 (Rated till 5 Stars) div2

摘要：

G u e s s t h e w i n n e r!

场上没想到怎么做，看到题解就会了。因为只能删掉奇数，所以如果原来的数字是个偶数，后手可以跟着先手删掉相同的数字。因为没写出这道题，下次只能去写

d i v 3

了。 void solve(){ int n=read(),ans=1; if(n==1||

12

0

EdGrass

向地学青苔

11 2023 档案

公告

常用链接

随笔档案

阅读排行榜

评论排行榜

推荐排行榜

最新评论