QieQiemin

codeforces

ACM刷题之旅(9) ACM常用知识(7) Atcoder/洛谷(83) a牛客网/comet OJ(200) HDU/POJ/BZOJ/计蒜客(108) STL(2) 二分(1) 二分/三分(2) 几何（计算几何，解析几何）(7) 分治/偏序(2) 动态规划DP(18) 图的全家桶/ 最短路/Tarjan强连通/MST/拓扑(7) 字符串处理/ hash(5) 字符串的高级算法/ACM(1) 思维(5) 搜索系列/BFS/DFS(2) 数学/MATH/ 组合数学/(5) 数据结构/线段树/树状数组(12) 数论(7) 暴力/状态压缩/二进制枚举(2) 未归档(4) 构造/技巧(7) 树的全家桶/ 树形DP/ LCA/MST/树链剖分(6) 模拟/实现(2) 模板(19) 组队赛训练记录(2) 规律/打表/结论题(2) 贪心(1) 题解(1) 高精/大数(6)

/ 注册

全部文章 / codeforces （共323篇）

[Educational Codeforces Round 72] A. Creating a Character （简单数学）

[Educational Codeforces Round 72] A. Creating a Character （简单数学） A. Creating a Character time limit per test 1 second memory limit per test 256 m...

2020-03-18

0 543

[Codeforces Round #626 (Div. 2, based on Moscow Open Olympiad in Informatics)] -D. Present（异或性质，按位拆分，树桩数组）

[Codeforces Round #626 (Div. 2, based on Moscow Open Olympiad in Informatics)] -D. Present（异或性质，按位拆分，树桩数组） D. Present time limit per test 3 seconds...

2020-03-11

0 447

[Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated]-E. Kuroni and the Score Distribution(构造)

[Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated]-E. Kuroni and the Score Distribution(构造) Kuroni is the coordinator of the next Mathforces round writ...

2020-03-04

0 419

[Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated]-D. Kuroni and the Celebration（交互题+树的性质）

[Ozon Tech Challenge 2020 (Div.1 + Div.2, Rated]-D. Kuroni and the Celebration（交互题+树的性质） This is an interactive problem. After getting AC after 13 T...

2020-03-04

0 551

[Codeforces Round #622 (Div. 2)] - C2. Skyscrapers (hard version) （单调栈）

[Codeforces Round #622 (Div. 2)] - C2. Skyscrapers (hard version) （单调栈） C2. Skyscrapers (hard version) time limit per test 3 seconds memory limit ...

2020-02-24

0 457

[Codeforces Round #620 (Div. 2)] E. 1-Trees and Queries（树，LCA，奇偶性）

[Codeforces Round #620 (Div. 2)] E. 1-Trees and Queries time limit per test 4 seconds memory limit per test 512 megabytes input standard input ...

2020-02-17

0 421

[Educational Codeforces Round 82 (Rated for Div. 2)] D. Fill The Bag （二进制拆分，贪心）

[Educational Codeforces Round 82 (Rated for Div. 2)] D. Fill The Bag （二进制拆分，贪心） D. Fill The Bag time limit per test 2 seconds memory limit per tes...

2020-02-14

0 388

[Codeforces Round #617 (Div. 3)] 题解 A,B,C,D，E1，E2，F

[Codeforces Round #617 (Div. 3)] 题解 A,B,C,D，E1，E2，F 1296A - Array with Odd Sum 思路：如果一开始数组的sum和是奇数，那么直接YES，否则：如果存在一个奇数和一个偶数，答案为YES，否则为NO 代码： in...

2020-02-05

0 575

[Codeforces Round #611 (Div. 3)] C. Friends and Gifts (随机大法好)

[Codeforces Round #611 (Div. 3)] C. Friends and Gifts (随机大法好) C. Friends and Gifts time limit per test 2 seconds memory limit per test 256 megaby...

2020-02-02

0 454

[Codeforces Round #611 (Div. 3)] C. Friends and Gifts (随机大法好) 来自专栏

[Codeforces Round #611 (Div. 3)] C. Friends and Gifts (随机大法好) C. Friends and Gifts time limit per test 2 seconds memory limit per test 256 megaby...

2020-02-02

0 694