小、pi孩

Codeforce

python学习(29) 动态规划(1) 快速幂逆元(2) 数据结构(19) 最短路(1) 算法(26) 蓝桥杯(1) 计算机网络(2) 题解(2)

/ 注册

全部文章 / Codeforce （共14篇）

Codeforces Round #613 (Div. 2)

A. Mezo Playing Zoma 题目大意：给你两个操作L和R，分别表示当前坐标-1和+1，当然，这些操作可以视为无效，即不移动它的坐标点。现在给你一个操作的字符串，然后进行一系列操作，让你算出有多少种可能的坐标。思路：计算出它的左右边界，这个区间内的所有点即他可能到达的点。 #incl...

2020-10-07

0 468

Codeforces 1285C( Fadi and LCM)

题目： Today, Osama gave Fadi an integer X, and Fadi was wondering about the minimum possible value of max(a,b) such that LCM(a,b) equals X. Both a and b...

2020-10-07

0 580

CodeForces - 978D（Almost Arithmetic Progression）

题目： Polycarp likes arithmetic progressions. A sequence [a1,a2,…,an] is called an arithmetic progression if for each i (1≤i<n) the value ai+1−ai is ...

2020-10-07

0 586

CodeForces - 1144E（Median String ）

题目： You are given two strings s and t, both consisting of exactly k lowercase Latin letters, s is lexicographically less than t. Let’s consider list ...

2020-10-07

0 482

Codeforces Round #619 (Three Strings)

题目： You are given three strings a, b and c of the same length n. The strings consist of lowercase English letters only. The i-th letter of a is ai, th...

2020-10-07

0 423

Codeforces Round #619 (Motarack's Birthday)

题目： Dark is going to attend Motarack’s birthday. Dark decided that the gift he is going to give to Motarack is an array a of n non-negative integers. ...

2020-10-07

0 348

Codeforces Round #619 (Ayoub's function)

题目： Ayoub thinks that he is a very smart person, so he created a function f(s), where s is a binary string (a string which contains only symbols “0” a...

2020-10-07

0 526

Codeforces Round #626（Count Subrectangles）

题目： You are given an array a of length n and array b of length m both consisting of only integers 0 and 1. Consider a matrix c of size n×m formed by f...

2020-10-07

0 609

Codeforces Round #628 (Div. 2)------EhAb AnD gCd

题目： You are given a positive integer x. Find any such 2 positive integers a and b such that GCD(a,b)+LCM(a,b)=x. As a reminder, GCD(a,b) is the greate...

2020-10-07

0 607

Codeforces Round #633 (Div. 2) ------ Sorted Adjacent Differences

题目： You have array of n numbers a1,a2,…,an. Rearrange these numbers to satisfy |a1−a2|≤|a2−a3|≤…≤|an−1−an|, where |x| denotes absolute value of x. It...

2020-10-07

0 506