DeaL57 - 博客园

2020年5月25日

摘要： 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 the 阅读全文

posted @ 2020-05-25 12:17 DeaL57 阅读(237) 评论(0) 推荐(0) 编辑

C. Skier

摘要： Skier rides on a snowy field. Its movements can be described by a string of characters 'S', 'N', 'W', 'E' (which correspond to 11 meter movement in th 阅读全文

posted @ 2020-05-25 10:05 DeaL57 阅读(216) 评论(0) 推荐(0) 编辑

D. Game With Array

摘要： Petya and Vasya are competing with each other in a new interesting game as they always do. At the beginning of the game Petya has to come up with an a 阅读全文

posted @ 2020-05-25 09:23 DeaL57 阅读(131) 评论(0) 推荐(0) 编辑

2020年5月24日

B. Count Subrectangles

摘要： You are given an array aa of length nn and array bb of length mm both consisting of only integers 00 and 11. Consider a matrix cc of size n×mn×m forme 阅读全文

posted @ 2020-05-24 11:02 DeaL57 阅读(219) 评论(0) 推荐(0) 编辑

2020年5月22日

C. Perfect Keyboard

摘要： Polycarp wants to assemble his own keyboard. Layouts with multiple rows are too complicated for him — his keyboard will consist of only one row, where 阅读全文

posted @ 2020-05-22 20:14 DeaL57 阅读(207) 评论(0) 推荐(0) 编辑

2020年5月20日

C. Ehab and Path-etic MEXs

摘要： output standard output You are given a tree consisting of nn nodes. You want to write some labels on the tree's edges such that the following conditio 阅读全文

posted @ 2020-05-20 11:54 DeaL57 阅读(133) 评论(0) 推荐(0) 编辑

2020年5月19日

D1. Prefix-Suffix Palindrome (Easy version)

摘要： This is the easy version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make 阅读全文

posted @ 2020-05-19 23:19 DeaL57 阅读(269) 评论(0) 推荐(0) 编辑

A. Powered Addition

摘要： You have an array aa of length nn. For every positive integer xx you are going to perform the following operation during the xx-th second: Select some 阅读全文

posted @ 2020-05-19 09:43 DeaL57 阅读(164) 评论(0) 推荐(0) 编辑

2020年5月18日

A. Orac and LCM

摘要： For the multiset of positive integers s={s1,s2,…,sk}s={s1,s2,…,sk}, define the Greatest Common Divisor (GCD) and Least Common Multiple (LCM) of ss as 阅读全文

posted @ 2020-05-18 21:04 DeaL57 阅读(277) 评论(0) 推荐(0) 编辑

Nastya and Strange Generator

摘要： Denis was very sad after Nastya rejected him. So he decided to walk through the gateways to have some fun. And luck smiled at him! When he entered the 阅读全文

posted @ 2020-05-18 09:13 DeaL57 阅读(187) 评论(0) 推荐(0) 编辑

DeaL0124

公告