首页
沸点
课程
数据标注
HOT
AI Coding
更多
直播
活动
APP
插件
直播
活动
APP
插件
搜索历史
清空
创作者中心
写文章
发沸点
写笔记
写代码
草稿箱
创作灵感
查看更多
登录
注册
柳下桃蹊
掘友等级
学生
柳下桃蹊,乱分春色到人家。
获得徽章 0
动态
文章
专栏
沸点
收藏集
关注
作品
赞
1
文章 1
沸点 0
赞
1
返回
|
搜索文章
最新
热门
Codeforces Round 803 (Div. 2)D
This is an interactive problem. Initially, there is an array a=[1,2,…,n], where n is an odd positive
2020牛客暑期多校第二场C
Given an unrooted tree, you should choose the minimum number of chains that all edges in the tree ar
Codeforces Round 831 (Div. 1 + Div. 2) E
Pak Chanek has n blank heart-shaped cards. Card 11 is attached directly to the wall while each of th
Codeforces Round 834 (Div. 3) F
A positive number x of length n in base p (2≤p≤109) is written on the blackboard. The number x is gi
Codeforces Round 629 (Div. 3) E
You are given a rooted tree consisting of n vertices numbered from 1 to n. The root of the tree is a
Codeforces Round 857 (Div. 1) B
Little Sasha has two friends, whom he wants to please with gifts on the Eighth of March. To do this,
Educational Codeforces Round 126 (Rated for Div. 2)
You are given two arrays: an array a consisting of n zeros and an array b consisting of n integers.
Codeforces Round 862 (Div. 2) D
You are given a tree (a connected graph without cycles) with n vertices. Consider a fixed integer k.
Tokio Marine & Nichido Fire Insurance Programming Contest 2023
打一半说不计分了,刚好天梯赛打完就不想写了,后面不先把写过的写个题解把 Problem Statement A You are given a string S of length N consist
Codeforces Round 823 (Div. 2)
B. Meeting on the Line n people live on the coordinate line, the i-th one lives at the point xi (1≤i
下一页
个人成就
文章被点赞
1
文章被阅读
6,686
掘力值
471
关注了
0
关注者
0
收藏集
0
关注标签
0
加入于
2022-10-08