One of my friends(Definitely not TahaNami87), used my account on the school computers to post that blog, I deny every single word said in that blog
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 163 |
3 | -is-this-fft- | 162 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | nor | 155 |
7 | adamant | 155 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
One of my friends(Definitely not TahaNami87), used my account on the school computers to post that blog, I deny every single word said in that blog
Hello, following my previous blog, I'm adding the new problems I found interesting/teaching, so let's get into the problems
Note: these problems are mostly for the range of [pupil, expert] level, an average specialist with a bit of sweat will be able to solve them all
1549C - Паутина лжи
553A - Кёя и цветные мячи
333D - Характеристики прямоугольников
1873E - Построение аквариума
1873H - Безумный город
363D - Прокат велосипедов
358D - Дима и зайцы
1624D - Раскраска палиндромов
1928C - Урок физкультуры
1918E - ace5 и порядок задач
1834D - Опрос на уроке
1931F - Скриншоты чата
1931D - Делимые пары
1931G - Одномерный пазл
343C - Время чтения
551C - GukiZ ненавидит коробки
1904D1 - Присвоить максимум (простая версия)
1904D2 - Присвоить максимум (сложная версия)
1705D - Марк и лампочки
1930C - Лексикографически наибольший
1930D1 - Сумма по всем подстрокам (простая версия)
1930D2 - Сумма по всем подстрокам (сложная версия)
1932C - LR-остатки
1926G - Влад и проблемы в МИТ
20A - Файловая система BerOS
782B - Место встречи изменить нельзя
573B - Мишка и кубики
965D - Одноразовые камни
1629D - Особые предпочтения в фильмах
1923C - Найти B
1251D - Изменение зарплат
1923D - Слизни
378C - Лабиринт
1933E - Оптимальные тренировки
1930E - 2...3...4.... Замечательно! Замечательно!
1272D - Удалите один элемент
1909B - Сделать почти равными по модулю
1909C - Тяжелые интервалы
1909D - Разделить и плюс K
1909F1 - Небольшая задачка про перестановки (простая версия)
480C - Катаемся на лифте
380C - Сережа и скобочки
1365D - Решить лабиринт
607B - Zuma
1941G - Рудольф и метро
1077D - Вырезание массива
1610C - Кеши устраивает вечеринку
1856C - Стать максимумом
1862F - Волшебство спасёт мир
1948D - Тандемные повторы?
1462E1 - Близкие наборы (простая версия)
1462E2 - Близкие наборы (сложная версия)
237C - Простые на отрезке
231C - Прибавляй не прибавляй
1061C - Делимость
1486C1 - Найти наибольшее (простая версия)
1486C2 - Найти наибольшее (сложная версия)
1569D - Неудачные пары
The problems aren't in any specific order but higher problems may be a bit easier
These problems' requirements are intermediate dp, binary search, pure logic, algorithmic thinking, and math.
and I've solved all of them so feel free to check my submissions if u wanted
Hello cf community, in this blog I tried to gather binary search problems that are worth solving and maybe makes you learn it better, if there exist any blog tell me I'll remove this
1486D - Max Median
1486C1 - Guessing the Greatest (easy version)
1486C2 - Guessing the Greatest (hard version)
883I - Photo Processing
1707A - Doremy's IQ
1945E - Binary Search
1623C - Balanced Stone Heaps
1117C - Magic Ship
1862F - Magic Will Save the World
1856C - To Become Max
1610C - Keshi Is Throwing a Party
1077D - Cutting Out
1730B - Meeting on the Line
1622C - Set or Decrease(doesn't need binary search)
1073C - Vasya and Robot
1923D - Slimes
782B - The Meeting Place Cannot Be Changed(recommended to solve)
343C - Read Time
551C - GukiZ hates Boxes
1698D - Fixed Point Guessing
333D - Characteristics of Rectangles
1902D - Robot Queries(not binary search focused, just a tool)
1853C - Ntarsis' Set
1843E - Tracking Segments
251A - Points on Line
371C - Hamburgers
372A - Counting Kangaroos is Fun
460C - Present
448D - Multiplication Table
670D2 - Magic Powder - 2(thanks to Arpa)
codechecf QHOUSE (also thanks to arpa)
1520F1 - Guess the K-th Zero (Easy version)
1520F2 - Guess the K-th Zero (Hard version)
These problems are mostly specialist/expert level based but everyone can solve them, have fun and Hope you enjoy them
Peace
In a weird high school, there are $$$n$$$ students, and the school principal Mr. X wants to make students happy so he decides to throw a couples' party.
In this high school, between every 2 person, there can be 4 types of relationships:
1: they love each other
2: The first loves the second but the second doesn't
3: The second loves the first but the first doesn't
4: they don't like each other
At this party, people will be grouped into Pairs of couples.
The relationship between them determines the happiness of a pair:
type 1: happiness 2, type 2,3: happiness 1, type 4: happiness -1
if a person gets left out(I.E n is odd) there will be a -2 happiness for him
Since Mr. X is a happy person he wants to maximize the sum happiness of the party. Since he is a busy person He asks you to do that
Input Format
In The First Line, there will be one integer $$$n$$$: $$$n$$$, ($$$1 \leq n \leq 10^5$$$) the number of people at the party. In the Second line will be $$$m$$$, the number of people who love a person ($$$1 \leq r \leq 10^5$$$)
In the following $$$m$$$ lines there will be a format: two indexes $$$i$$$, $$$j$$$ meaning the person $$$i$$$ loves the person $$$j$$$. (Two-sided love will be given in 2 separate lines, if there isn't a directed edge between 2 people their relationship is type 4)
Output Format In the only line of the output, print the maximum happiness of the party
So today I came up with this problem and actually got stuck in solving it. Appreciate any helps
Hello, CF community, I found this 1700*-ish problem, can somebody help?
Given $$$n$$$, $$$d$$$ positive integers, and the array $$$a$$$ with length $$$n$$$
for each $$$i$$$ s. t $$$1 \leq i \leq n$$$
Find the maximum j s. t $$$\vert{a_i - a_j}\vert \leq d$$$
Input format:
Integers n,d: $$$1 \leq n \leq 1e5, 1 \leq d \leq 1e9$$$
In the next line given $$$n$$$ integers representing $$$a_1$$$, $$$a_2$$$, ..., $$$a_{n-1}$$$, $$$a_n$$$
Output format:
In single line for each $$$1 \leq i \leq n$$$ output the corresponding $$$j$$$
if there is no corresponding $$$j$$$ output -1
I'd appreciate a solution without any kind of advanced data structure(___Trees, ___Arrays, etc)
Thanks for any help
Hello CF community, in this blog post I tried to gather the Questions I've solved and enjoyed them most of them are really teaching and worth spending hours of time on them Hope you enjoy
EDIT: Part 2 added, link
1418C - Mortal Kombat Tower
1311D - Three Integers
474D - Flowers
343C - Read Time
1918D - Blocking Elements
515C - Drazil and Factorial
1156C - Match Points
1853C - Ntarsis' Set
1843E - Tracking Segments
1843F1 - Omsk Metro (simple version)
1884D - Counting Rhyme
1884C - Medium Design
372A - Counting Kangaroos is Fun
455A - Boredom
1886D - Monocarp and the Set
1624D - Palindromes Coloring
448D - Multiplication Table
1092D1 - Great Vova Wall (Version 1)
479E - Riding in a Lift
1907E - Good Triples
1520F1 - Guess the K-th Zero (Easy version)
1520F2 - Guess the K-th Zero (Hard version)
1201C - Maximum Median
1374D - Zero Remainder Array
1922D - Berserk Monsters
1705C - Mark and His Unfinished Essay
380A - Sereja and Prefixes
747F - Igor and Interesting Numbers
1920D - Array Repetition
1920C - Partitioning the Array
831C - Jury Marks
1398C - Good Subarrays
1000C - Covered Points Count
1526C2 - Potions (Hard Version)
368B - Sereja and Suffixes
1324D - Pair of Topics
520B - Two Buttons
1901D - Yet Another Monster Fight
1919C - Grouping Increases
1574C - Slay the Dragon
1076C - Meme Problem
1349A - Orac and LCM
1358C - Celex Update
1458A - Row GCD
1539D - PriceFixed
1537E1 - Erase and Extend (Easy Version)
1497C2 - k-LCM (hard version)
1285C - Fadi and LCM
Note that to solve these problems you need no knowledge except:
9th grade math, a little bit number theory, sorting, elementary dp, elementary bs, set, stack, queue, map
Good luck and hope you enjoy them
EDIT: I added maybe a few problems, I ran out of beautiful problems, unfortunately, maybe suggest in the comments and I'll add them
Guys a question: do u want me to include recent contests as well?
Name |
---|