首页
沸点
课程
数据标注
HOT
AI Coding
更多
直播
活动
APP
插件
直播
活动
APP
插件
搜索历史
清空
创作者中心
写文章
发沸点
写笔记
写代码
草稿箱
创作灵感
查看更多
登录
注册
滁生
掘友等级
获得徽章 0
动态
文章
专栏
沸点
收藏集
关注
作品
赞
109
文章 107
沸点 2
赞
109
返回
|
搜索文章
最新
热门
F. All Possible Digits
F. All Possible Digits time limit per test 3 seconds memory limit per test 256 megabytes input stand
F. Random Walk
You are given a tree consisting of $$$n$$$ vertices and $$$n - 1$$$ edges, and each vertex $$$v$$$ h
C. Unlucky Numbers(数位dp)
题目 In this problem, unlike problem A, you need to look for unluckiest number, not the luckiest one.
D. Longest Subsequence(数论 + 暴力)
题目 A subsequence of a is an array we can get by erasing some elements of a. It is allowed to erase z
D. Magic Numbers(数位dp)
题目 Consider the decimal presentation of an integer. Let's call a number d-magic if digit d appears i
C. Not Equal on a Segment
You are given array a with n integers and m queries. The i-th query is given with three integers li,
F. Xors on Segments
题目 Problem - F - Codeforces F. Xors on Segments You are given an array with n integers a_i and m que
E. New Year Tree(树剖+bitset)
题目 The New Year holidays are over, but Resha doesn't want to throw away the New Year tree. He invite
D. Professor GukiZ and Two Arrays(双指针)
题目 Professor GukiZ has two arrays of integers, a and b. Professor wants to make the sum of the eleme
E. Sum of Remainders(数论分块)
题目 Calculate the value of the sum: n mod 1 + n mod 2 + n mod 3 + ... + n mod m. As the result can be
下一页
个人成就
文章被点赞
94
文章被阅读
15,656
掘力值
1,010
关注了
4
关注者
6
收藏集
0
关注标签
2
加入于
2022-10-01