- Codeforces Round #615 (Div. 3)
A. Collecting Coins 题目链接:https://codeforces.com/contest […]...
- Educational Codeforces Round 83 (Rated for Div. 2)A–C
题意:给出一个边数为n的等边多边形,问是否可以变成m的等边多边形。条件是同一个中心,共用原顶点。 […]...
- Codeforces 1365D Solve The Maze
题目大意: 在一个 \(n * m\) 的矩阵中,有空地、坏人、好人和墙。你可以将空地变成墙来堵住坏人。\(( […]...
- Codeforces Round #612 (Div. 2)C. Garland
第四次写题解,请多指教! http://codeforces.com/contest/1287/problem […]...
- Codeforces Round #618 (Div. 2)
Codeforces Round #618 (Div. 2) 题库链接 https://codeforces. […]...
- Codeforces Round #467 (Div. 1). C – Lock Puzzle
#include <algorithm> #include <cstdio> #inc […]...
- Educational Codeforces Round 72 (Rated for Div. 2)
https://www.cnblogs.com/31415926535x/p/11601964.html这场只 […]...
- Codeforces 1304E 1-Trees and Queries (树上距离+思维)(翻译向)
题意 给你一棵树,q个询问(x,y,a,b,k),每次问你如果在(x,y)加一条边,那么a到b能不能走k步,同 […]...