a1046765624的博客

Petya and Vasya decided to play a game. They have n cards (n is an even number). A single integer is written on each card.Before the game Petya will choose an integer and after that Vasya will c

C. A Mist of Florescencetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAs the boat drifts down the river, a wood full of blossoms shows up on the ...

A friend of yours has written a program that compares every pair of a list of items. With n items,it works as follows. First, it prints a 1, and it compares item 1 to items 2, 3, 4, . . . , n. It then...

C. Liebig's Barrelstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have m = n·k wooden staves. The i-th stave has length ai. You have to assem...

D. Bookshelvestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMr Keks is a typical white-collar in Byteland.He has a bookshelf in his office with s...

C. Three displaystime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIt is the middle of 2018 and Maria Stepanovna, who lives outside Krasnokamensk (a ...

D. Fairtime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputSome company is going to hold a fair in Byteland. There are nn towns in Byteland and mm two...

1模拟2暴力3倒着模拟4交互题。D. RocketThis is an interactive problem.Natasha is going to fly to Mars. Finally, Natasha sat in the rocket. She flies, flies... but gets bored. She wishes to arriv...

Childan is making up a legendary story and trying to sell his forgery — a necklace with a strong sense of "Wu" to the Kasouras. But Mr. Kasoura is challenging the truth of Childan's story. So he is go...

Initially there was an array aa consisting of nn integers. Positions in it are numbered from 11 to nn.Exactly qq queries were performed on the array. During the ii-th query some segment (li,ri)(li,r...

During the research on properties of the greatest common divisor (GCD) of a set of numbers, Ildar, a famous mathematician, introduced a brand new concept of the weakened common divisor (WCD) of a list...

Dima the hamster enjoys nibbling different things: cages, sticks, bad problemsetters and even trees!Recently he found a binary search tree and instinctively nibbled all of its edges, hence messing u...

E. Pencils and Boxestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMishka received a gift of multicolored pencils for his birthday! Unfortunately...

D. XOR-pyramidtime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputFor an array bb of length mm we define the function ff asf(b)={b[1]if m=1f(b[1]⊕b[2]...

Polycarp loves lowercase letters and dislikes uppercase ones. Once he got a string s consisting only of lowercase and uppercase Latin letters.Let A be a set of positions in the string. Let's cal

Dr. Evil kidnapped Mahmoud and Ehab in the evil land because of their performance in the Evil Olympiad in Informatics (EOI). He decided to give them some problems to let them go.Dr. Evil is intere

Mahmoud and Ehab continue their adventures! As everybody in the evil land knows, Dr. Evil likes bipartite graphs, especially trees.A tree is a connected acyclic graph. A bipartite graph is a graph

A. Nearest Minimumstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array of n integer numbersa0, 

A. Tricky Alchemytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDuring the winter holidays, the demand for Christmas

A - Trains Vasya the programmer lives in the middle of the Programming subway branch. He has two girlfriends: Dasha and Masha, who live at the different ends of the branch, each one is unaware o

It is nighttime and Joe the Elusive got into the country's main bank's safe. The safe has n cells positioned in a row, each of them contains some amount of diamonds. Let's make the problem more comfor...

A题目大概：给出n个数，求所有的连续区间（包含区间长度为1的区间）的数字相与之和。如7  11   9(7) + (7 & 11) + (7 & 11 & 9) + (11) + (11 & 9) + (9) = 40思路:这种区间的题正常来说都需要推规律，还是与数学有关。这道题的区间长度为1e5，暴力是不行的。如果做过类似的题目。就会把这些数转换成二进制的形式，题...

G题目大概：给出长度为n的字符串，q此操作，然后id，字符q，把id位置的字符替换为q，看是否是回文串。最后问q此操作有几次操作之后是回文串。思路：根据数据，暴力显然是不行的，长度和操作数都是1e5.可以先把给出的字符串按照对称位置，计算有多少个对称位置不同记为sum。然后，每次修改的时候，比较和对称位置的变化情况，然后维护sum值，当sum为0的时候就是回文串。代码：#include <i...

A. Pizza, Pizza, Pizza!!!time limit per test1 secondmemory limit per test128 megabytesinputstandard inputoutputstandard outputKatie, Kuro and Shiro are best friends. They have known each other since k...

C. Finite or not?time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given several queries. Each query consists of three integers pp, qq and bb...

As you know, majority of students and teachers of Summer Informatics School live in Berland for the most part of the year. Since corruption there is quite widespread, the following story is not uncomm...