codeforces decreasing 1839e game

Educational Codeforces Round 35 (Rated for Div. 2)

# Educational Codeforces Round 35 (Rated for Div. 2) https://codeforces.com/contest/911 ## A. Nearest Minimums ```CC #include using namespace std; con ......
Educational Codeforces Round Rated Div

CodeForces 725F Family Photos

[洛谷传送门](https://www.luogu.com.cn/problem/CF725F "洛谷传送门") [CF 传送门](https://codeforces.com/problemset/problem/725/F "CF 传送门") 不错的贪心题。 我们考虑一对照片只有一张的情况。那么 ......
CodeForces Family Photos 725F 725

Educational Codeforces Round 71 (Rated for Div. 2)

Educational Codeforces Round 71 (Rated for Div. 2) A - There Are Two Types Of Burgers 思路:价格高的优先取 #include<bits/stdc++.h> using namespace std; #define ......
Educational Codeforces Round Rated Div

Codeforces Round 887 (Div. 2) A-D

# Codeforces Round 887 (Div. 2) ## A. Desorting 题意:给出一个数组,可以进行任意次以下操作: 选择一个i 对于数组中的a[1],a[2],...,a[i]全部+1 a[i+1]...a[n]全部-1, 问最小使得数组变得无序的操作是多少次 ### So ......
Codeforces Round 887 A-D Div

题解 Codeforces Round 887 (Div 1+Div 2) / CF1853AB,CF1852ABCD

下大分!悲!Div 1 只过了 1A!!! 但还是补完整场 Div 2 吧。 # A. Desorting ## problem 用操作:$[1,i]++,[i+1,n]--$,使得数组不单调不降,求最小操作次数。$n\leq 10^5$。 ## solution 操作等同于在差分数组上选出 $i$ ......
题解 Codeforces Div Round 1853

Codeforces Round #885 数学专场

妙,我只能说妙。今天补DEF发现除了F诡秘的杨辉三角,我都能独立做出来。 但为什么我感觉DE难度不如C!!!! ## [A](https://codeforces.com/problemset/problem/1848/A) 题意:一个人站在 $(x,y)$ 处,而其他人分别在 $(x_1,y_1) ......
专场 Codeforces 数学 Round 885

Codeforces Round #887 Div.2 A-E

# Codeforces Round #887 Div.2 一定要手玩哦 前言: **一定要手玩,一定要手玩!** 我今早一手玩发现C很TM简单,如果赛时我能切C说不定直接上1800.。。。 时隔多年,我的**Codeforces Rating(1718) 再次超越了 @cqbzlhy**(1674 ......
Codeforces Round 887 A-E Div

【题解】Imbalanced Arrays - Codeforces 1852B

**出处:** Codeforces Round 887 **链接:** https://codeforces.com/problemset/problem/1852/B **题目大意:** 给定一个包含 $n$ 个非负整数的频次序列 $f$ 。 构造任意一个等长的整数序列 $b$ ,要求 ① $b ......
题解 Imbalanced Codeforces Arrays 1852B

Codeforces Round 887 (Div. 2)记录

A. Desorting 如果有 $a_1 \leq a_2 \leq \ldots \leq a_{n-1} \leq a_n$,则称长度为 $n$ 的数组 $a$ 已排序。 Ntarsis 有一个长度为 $n$的数组 $a$。 他可以对数组进行一种操作(0 次或多次): - 选择一个索引 $i$ ......
Codeforces Round 887 Div

Codeforces Round 887(Div 2)(A-C)

# A. Desorting 题目里说的无序是指后面的一个数大于前面一个数,所以只要有一个 a[i+1]-a[i] using namespace std; #define int long long signed main() { ios::sync_with_stdio(false); cin. ......
Codeforces Round 887 A-C Div

Codeforces Round 886 (Div. 4)

# [Dashboard - Codeforces Round 886 (Div. 4) - Codeforces](https://codeforces.com/contest/1850) ## [A. To My Critics](https://codeforces.com/contest/1 ......
Codeforces Round 886 Div

Educational Codeforces Round 71

# A. There Are Two Types Of Burgers ```cpp #include using namespace std; #define int long long void solve() { int b, p, f, h, c; cin >> b >> p >> f>> ......
Educational Codeforces Round 71

Codeforces Round 887 (Div. 1) 题解

https://codeforces.com/contest/1852/problems # A. Ntarsis' Set https://codeforces.com/contest/1852/problem/A 感觉不是很一眼。 $n$ 和 $k$ 都是 $2 \times 10^5$,~~不 ......
题解 Codeforces Round 887 Div

【题解】Ntarsis' Set - Codeforces 1852A

**出处:** Codeforces Round 887 **链接:** https://codeforces.com/problemset/problem/1852/A **题目大意:** 给定一个包含 $n$ 个正整数的表示删除位置的严格升序序列 $p$ ,以及另外一个连续正整数的被删除的无穷序 ......
题解 Codeforces Ntarsis 1852A 1852

CodeForces 1810G The Maximum Prefix

[洛谷传送门](https://www.luogu.com.cn/problem/CF1810G "洛谷传送门") [CF 传送门](https://codeforces.com/problemset/problem/1810/G "CF 传送门") 感觉是比较 educational 的题。 拿到 ......
CodeForces Maximum Prefix 1810G 1810

games101 HomeWork2

# Games101 HomeWork2 ## 导航 [导航](https://www.cnblogs.com/zhywyt/p/17576370.html) ## 作业要求 - **rasterize_triangle(): 执行三角形栅格化算法** - **static bool insideT ......
HomeWork2 HomeWork games 101

「题解」Codeforces Round 887 (Div. 2)

## A. Desorting ### Problem [题目](https://codeforces.com/problemset/problem/1853/A) ### Sol & Code 若序列一开始无序答案为 $0$ 若有序即 $a_1\leq a_2 \leq \dots \leq a_ ......
题解 Codeforces Round 887 Div

Codeforces Round 887 (Div. 2)

## C. Ntarsis' Set >​ ![image-20230724121346402](https://zeoy-typora.oss-cn-hangzhou.aliyuncs.com/image-20230724121346402.png) > >($1 \leq n,k \leq 2 ......
Codeforces Round 887 Div

Codeforces Round 887 (Div 2) C. Ntarsis' Set

Ntarsis' Set 题意是给你n个数,每次按照顺序删除位于a[i]位置的这n个数,问k次后最小的是多少 参考这位大佬的题解Codeforces Round 887 (Div 2)A~C - 知乎 (zhihu.com) 结合一个官方题解,进行一次操作后,由于前面删掉i个数,a[i]到a[i+1 ......
Codeforces Ntarsis Round 887 Div

【题解】Educational Codeforces Round 151(CF1845)

VP战报:1h 过了 A,B,C,D 然后被 E 罚坐 1h rank:210th 题解只有 A-E ## A.Forbidden Integer ### 题目描述: 你需要构造一个正整数序列,满足: 1. 对于 $i$,$a_i\le k$ 且 $a_i\not=x$。 2. $\sum a_i= ......
题解 Educational Codeforces Round 1845

Codeforces Round 886 (Div. 4) 题解 A - H

## [A](https://codeforces.com/contest/1850/problem/A). To My Critics ### 题目大意 给定三个数,你可以挑俩数加起来,问这仨数有没有可能加起来大于等于 $10$ . ### 解题思路 我们找其中最大的两个数相加与 $10$ 比较即 ......
题解 Codeforces Round 886 Div

Codeforces Round 886 (Div. 4) 全题题解

我关注的人中正式参与**比赛排名公示**: | # | Who | = | Penalty | * | [A](https://codeforces.com/contest/1850/problem/A) | [B](https://codeforces.com/contest/1850/probl ......
题解 Codeforces Round 886 Div

games101作业1

# games101 HomeWork 1 **说起来我自己写games101的作业也是曲曲折折,虚拟机很卡就拿VS配环境,Windows不会配环境,就装Linux,现在装上了Linux,却因为没有经验把Windows格式化了(我是真的沙比),好在还是开始做了,也挺顺利的,所以再来记录一下作业。** ......
games 101

CodeForces 1776C Library game

[洛谷传送门](https://www.luogu.com.cn/problem/CF1776C "洛谷传送门") [CF 传送门](https://codeforces.com/problemset/problem/1776/C "CF 传送门") orz p_b_p_b。 下文令 $a_i$ 为 ......
CodeForces Library 1776C 1776 game

Codeforces Round 886 (Div. 4)记录

A - To My Critics 代码: #include<cstdio> #include<algorithm> #include<cmath> #include<vector> #include<string.h> #include<set> #include<string> #include ......
Codeforces Round 886 Div

Codeforces Round 885 (Div. 2) A - C

# A. Vika and Her Friends [Problem - A - Codeforces](https://codeforces.com/contest/1848/problem/A) **题意:** ​ 在$n*m$的范围内,$a$和她的朋友在追逐游戏,每秒$a$和朋友必须从当前位置 ......
Codeforces Round 885 Div

chinese game

# 0.0.0版本震撼来袭 代码: ```cpp #include #include #include using namespace std; int px=10,py=5,ma=0; string jie[100005]={"这是墙壁,你不能通过","这是地面,上面似乎布满了灰尘"}; stri ......
chinese game

Codeforces Round 886 (Div. 4)(A-H)

# A-To My Critics 读入 a,b,c 如果三个里较大的两个的和大于等于 10 输出 YES,不然输出 NO ``` #include using namespace std; void solve() { int a, b, c; cin >> a >> b >> c; cout = ......
Codeforces Round 886 A-H Div

Codeforces Round 886 (Div. 4)补题

# [Codeforces Round 886 (Div. 4)](https://codeforces.com/contest/1850) ## A~D: ```c++ //A: bool solve(){ cin>>a[1]>>a[2]>>a[3]; sort(a+1,a+4); return ......
Codeforces Round 886 Div

[ABC310G] Takahashi And Pass-The-Ball Game

Problem StatementThere are $N$ Takahashi. The $i$-th Takahashi has an integer $A_i$ and $B_i$ balls. An integer $x$ between $1$ and $K$, inclusive, wi ......
Pass-The-Ball Takahashi 310G Pass Ball