脂环 - 博客园

2020年5月16日

Codeforces Round #643 (Div. 2) B. Young Explorers（贪心）

摘要： Young wilderness explorers set off to their first expedition led by senior explorer Russell. Explorers went into a forest, set up a camp and decided t 阅读全文

posted @ 2020-05-16 23:15 脂环阅读(742) 评论(0) 推荐(1)

Codeforces Round #643 (Div. 2) A. Sequence with Digits（暴力）

摘要： Let's define the following recurrence: an+1=an+minDigit(an)⋅maxDigit(an).an+1=an+minDigit(an)⋅maxDigit(an). Here minDigit(x)minDigit(x) and maxDigit(x 阅读全文

posted @ 2020-05-16 23:10 脂环阅读(536) 评论(0) 推荐(0)

2020年5月15日

Codeforces Round #642 (Div. 3) D. Constructing the Array（优先队列）

摘要： You are given an array aa of length nn consisting of zeros. You perform nn actions with this array: during the ii -th action, the following sequence o 阅读全文

posted @ 2020-05-15 14:35 脂环阅读(239) 评论(0) 推荐(0)

Codeforces Round #642 (Div. 3) C. Board Moves

摘要： You are given a board of size n×nn×n , where nn is odd (not divisible by 22 ). Initially, each cell of the board contains one figure. In one move, you 阅读全文

posted @ 2020-05-15 14:25 脂环阅读(280) 评论(0) 推荐(0)

Codeforces Round #642 (Div. 3) B. Two Arrays And Swaps

摘要： You are given two arrays aa and bb both consisting of nn positive (greater than zero) integers. You are also given an integer kk . In one move, you ca 阅读全文

posted @ 2020-05-15 14:20 脂环阅读(490) 评论(0) 推荐(0)

Codeforces Round #642 (Div. 3) A. Most Unstable Array

摘要： You are given two integers nn and mm . You have to construct the array aa of length nn consisting of non-negative integers (i.e. integers greater than 阅读全文

posted @ 2020-05-15 14:18 脂环阅读(367) 评论(0) 推荐(0)

2020年5月14日

实验七

摘要：实验目的：（1）掌握运算符函数重载为成员函数的方法（2）掌握运算符函数重载为友元函数的方法（3）掌握不同类型数据间的转换方法实验内容：假设square_matrix是n阶整型方阵，请实现下列运算：（1）cin>> square_matrix （2）cout<< square_matrix 阅读全文

posted @ 2020-05-14 10:24 脂环阅读(473) 评论(0) 推荐(0)

2020年5月13日

Codeforces Round #641 (Div. 2) B. Orac and Models（线性DP）

摘要： There are nn models in the shop numbered from 11 to nn , with sizes s1,s2,…,sns1,s2,…,sn . Orac will buy some of the models and will arrange them in t 阅读全文

posted @ 2020-05-13 10:09 脂环阅读(407) 评论(0) 推荐(0)

Codeforces Round #641 (Div. 2) A. Orac and Factors（数学）

摘要： Orac is studying number theory, and he is interested in the properties of divisors. For two positive integers aa and bb , aa is a divisor of bb if and 阅读全文

posted @ 2020-05-13 09:58 脂环阅读(327) 评论(0) 推荐(0)

2020年5月12日

Codeforces Round #639 (Div. 2) C. Hilbert's Hotel（数学）

摘要： Hilbert's Hotel is a very unusual hotel since the number of rooms is infinite! In fact, there is exactly one room for every integer, including zero an 阅读全文

posted @ 2020-05-12 00:11 脂环阅读(258) 评论(0) 推荐(1)

Loading

脂环

公告