Junior Training Sheet V7.0 - READ Row 10 To Make Your Own EDITABLE

This google sheet is created by Dr Mostafa Saad Ibrahim.
Overall ~950 problems for

mostafa.saad.fci@gmail.com Ask.fm
Problem Solving Sheet
Video Introducing roadmap (Arabic) - to min 18 ONLY
Currenet Version V7.0
What is this Sheet? - See Topics2 page (for extra topics/problems in specific cases)
- Allows you to write down your statiscs to learn from them (e.g. you consume much t
Advantages of this Sheet? - Continuous refining based on feedback
Your Sheet COPY NOTE: If u did so and still read-only format, then you are again opening my sheet (e.g
For Whom? A junior
Basic is anyone who
Programming does't
skills suchmaster
in solving codeforces Div2-D.
series
If you find my sheet is hard, Finish Assiut C++ Programming
University provides an easier starting roadm
first
Prerequisites?
Know about
Code with ourlanguage
any communitybutand what isC++
preferred programming competitions =>
or Java. For
Java:
Training Style? You can train alone, but highly advised to find partner(s) to work with to encourage ea
Skills Goals Moving from Junior Level to Semi-Senior Level: A one who do pretty well in CF-Div2 A
Knowledge Goals Understand and build fair knowledge in some algorithms in Number Theory, Dynamic
Sheet pages are mainly for Codeforces Div2 A, B, C, D + Problems on knolwdge topic
Each sheet has some sets, each set is ~10-15 problems....The top sets are mandator
If you did well in the mandatory sets, move to next sheet...otherwise you still need tra
Please watch the videos in order, solve UVA/SPOJ problems in order. Don't skip them
In some columns, some time recordings. This helps you to know how much time you
Sheets In the level column give an estimate to the problem level from 1-2 (easy), 3-4 (medium
In the comments column..write comments for hard problems.
Put problem Status AC (for Accepted) CS (can't solve)
If you solved a problem before, put ACX instead of AC. Don't resolve
Don't let a problem consumes more than 2-3 hours. If can't solve it, see editorials/solu
Don't compare yourself with others. People vary in their progress
In other words, most of the time, one shouldn't assign Div2-A problem level such as 5
Problem Level Column
CF136-D2-A CF (codeforces), D2 (Division 2), (136, A) is the problem URL. No

Notations
SRM150-D2-1000
Topcoder nowadaysSRM 150slow.
maybe (Topcoder),
So wait D2
for 5(Division
min for 2), 1000 (3rd
a problem problem)
to open. If did not w
https://codeforces.com/blog/entry/61252
CF483-D2-A White for a problem from codeforces

UVA 10242 Basic (if possible) Knowledge problem on the just watched videos
Problems Colors
Problems Colors
SPOJ CDOWN A knowledge problem on topic you watched before, will be harder
CF518-D2-B Problem of easier level than current sheet page level to enhance
Moving faster Do I have to solve every problem? For Div2 (A, B, C1) => No. If you can move faster,
Others Solutions If you solved a problem, please see some other accepted solutions in codeforces. Yo
Awesome Competitive Programming Many awesome links - very helpful for English
Ahmed Elsaghir Trainnig Ahmed is senior from GUC
A2oj Ladders Don't like my sheet? Go with Ahmed Aly Ladd
External Resources
Prgramming Ahmed M sayd Arabic Programming Playlist
Programming Mohamed desouky Arabic Programming Playlist
More Resources Each video is part of a playlist
V1: initial release

V2: Vidoes updates. Sheet P2A: Little problems replaced + reordering. P2B, P2C, P2
V3: Added
4- More problem
smooth names.from
transitions P3A,aP3B
sheetsplit
to over 3 sheets, reordered to be more increm
another
History 5- Utilizing the new many problems added by CF since initial sheet creation
V5
- Then Remove Misc sheet
-next
Click on Say
one. the arrow forinDiv2-D
you are middlesheets, and itmake
C1. Finish first. copy
Thenfor your sheet
remove C2, D1, D2, D3. In the
copy to your sheet. In other words, migration should be 5-min process. If need more
Thanks for all guys who sent sheet feedback: Mariam Alshereef, Magdy Hassan, Ahmed Yasser, Ahmed Elsayed A
Ayyad shenouda, Others.
Special Thanks for Coach Alhussain Aly for his continuous help
Special Thanks for All volunteers in videos recording / Editorials writing
d Ibrahim. Overall ~950 problems for newcomers to problem solving.
Site / More
Contacts
Video explaining the sheet
Latest Version
n specific cases)
from them (e.g. you consume much time in debugging)
n you are again opening my sheet (e.g. with old name), NOT your copy
deforces Div2-D. C++ is highly
+ an
rsity provides STLeasier
+ Debugging Skills
starting roadmap. Finish it recommended
Novice RoadMap Online Judge
mming competitions => Watch these videos for more details
Solver to be Channel Code El Masry Channel
artner(s) to work with to encourage each other.
A one who do pretty well in CF-Div2 A, B, C, D and similar levels (e.g. TC-Div2-1000)
gorithms in Number Theory, Dynamic Programming, Greedy, Graph Theory and Search
B, C, D + Problems on knolwdge topics (Mainly from UVA, SPOJ)

problems....The top sets are mandatory....The below sets (after line mark) are optional
ext sheet...otherwise you still need training on similar level...then solve the optional problems
POJ problems in order. Don't skip them.
elps you to know how much time you take per a problem...use that to recognize your problems
em level from 1-2 (easy), 3-4 (medium), 5-6(hard), 7-8 (had to read editorials), 9-10 (can't solve)
ard problems.
Other values: WA (wrong answer), TLE (time limit exceeded), RTE, MLE
d of AC. Don't resolve
urs. If can't solve it, see editorials/solutions. If still can't solve it, just leave it for now.
in their progress
assign Div2-A problem level such as 5. But it can be: 1, 1.5, 2. Very few might be 2.5
on 2), (136, A) is the problem URL. Note this is not Round 136 ... it is Round 97
Division
min for 2), 1000 (3rd
a problem problem)
to open. If did not work, try in another day
deforces
e problem on the just watched videos
pic you watched before, will be harder than basic problems
current sheet page level to enhance multiple training levels in same time instead of 1 level training
B, C1) => No. If you can move faster, do it. For Non CF problems (E.g. UVA), please solve all
accepted solutions in codeforces. You don't need to watch my linked videos unless can't solve
wesome links - very helpful for English guys

s senior from GUC
e my sheet? Go with Ahmed Aly Ladders
Programming Playlist
Programming Playlist
deo is part of a playlist
replaced + reordering. P2B, P2C, P2D merged in P2B. P3A and P3B: new knowledge sheets
3 sheets, reordered to be more incremental rather than random
her
F since initial sheet creation
et. copy
Thenfor your sheet
remove C2, D1, D2, D3. In the new version, click a sheet page and select Copy To, then
hould be 5-min process. If need more, you are doing it wrongly.
san, Ahmed Yasser, Ahmed Elsayed Awad, Mohamed Nasser, Mostafa Ali Mansour, Aya elymany,
Q) What
- NO is the sheetthe
for algorithms, requirements? Should
sheet will teach I study
you that in aalgorithms
smooth wayand Data structures?
- For C++ guys (and others as guide) - first 18 videos here: https://www.youtube.com/playlist?list=PLPt2dINI2MIZPFq6
Q) How much time do I need to finish the sheet?

- https://ask.fm/mostafasaad87/answers/144907000290 [adjust to whatever fits with you]
Q) When should I give up and check the editorials and solutions?

https://ask.fm/mostafasaad87/answers/144907000290
Q) Got WA,
- Don't keepshould
trying Ilonger,
check directly thethe
just check test cases?
test cases
- If you can write a brute force solution for your problem, write a stress test: Generate random cases and compare the op
Q) What could
- People is the debug
debugusing
time?'print statements'. A better way using a debugger
- Check out these 4 videos: https://www.youtube.com/watch?v=DlbQwQEiDW0&t=0s&index=35&list=PLPt2dINI2MIZP
Q) Should I solve
- Generally, everybut
preferred, problem?
If you think certain level is easy (e.g. solve it within 15 minutes), then jump a block and so on
- This jumping might be for codeforces problems only
Q) Just started
- However, in Div2-A,
following could is
the order I finish
a muchitsbetter
codeforces
idea problems first, then solve the UVA/Colored problems?
- Similarly, one could finish All Div2-A/Div2-B codeforces problems, then solve their colored problems. Again, this is not
Q) Is using C# ok? are official in UVA

- C++/Java/Python
- Codeforces allows more such as Javascript
Q) When
- No, I watch
sheet a video,
has subset shouldproblems
of these I solve the problems
already in its order
in specific info section?
- Sheet is self-contained
Q) I watched
- Still can't getthe butmore
video, for
it? Google it is hard, any from
materials tips? the web (ppt/pdf/videos) and try to learn
- In worst case, leave it for now and return to it later
Q) How
- This does
sheet your sheet
provides prepare
you with highfor ECPC/ACPC?
quality problems and good topics distribution + way to record your stats to know yo
- However, there are many concerns that YOU have to tackle by yourself and your team members
- Finish up to CF-C2 sheet, then study from the "Cracking the Coding Interview: 150 Programming Questions and Solutio
- Also watch: https://www.youtube.com/watch?v=39vqarATPyM
Q)
- It How different is for
is a sheet..ready your sheet
you versus
to record Ahmed
your times,Aly Ladders? help to improve yourself
notes...etc...this
- It is not blocking style. If you can't solve problem, just leave it and move to other one. In ladders, you see next problem
Q) How did
- Manual you select
selections and problems for the
investigations for sheet?
non-CF problems to be used in the sheet
- Lots of manual efforts and investigations and feedback processing
Q) what
- I will is theand
review nextdecide
step after finishing your sheet ?
- Side note: If you started in Div2-C1 and solved first 15 problems, you can share the sheet with me to follow your updat
Q) can't access the sheet in edit mode?

NOTE: If u did so and still read-only format, then you are again opening my sheet (e.g. with old name), NOT your copy
Q) What to
- Ad-hoc: write
Just in the category
per-problem column?
thinking in a special way/analysis on how to solve the problem
- Please watch from this minute: https://youtu.be/DZ6YTtILCE8?t=839
Q) Are problems really sorted based on easiness? I don't feel so.

So, questions ordered by people average. The promise is, the problems will be within your range to solve.
Q) What are these problems colors?

See "Problems Colors" notes in info page
Q) Are the problems sorted?

So if you felt they are not sorted, just keep going
Q) Why problem-solving is that important?

See the first 2 videos here: https://www.youtube.com/playlist?list=PLPt2dINI2MIaNcU070HIAO8JWYBcafuyG
Q) I feel bored when solving problems compare to doing projects?

Q) I would
I never likedlike to Graduate
that. freeze myonstudy
time.for 1-2 years
In your to beand
free times good in problem-solving?
vacations do more problem solving
Relevant: https://ask.fm/mostafasaad87/answers/145151822818
Q) Topics based-training
- Although vs guys
topics training let Blindbe
Order
so good early, they level stuck early and they don't improve. Seems to me, topics tr
good in Div2D level in shorter time and no interest in further competitions achievments, you may go topics based.
Q) Who FInished my sheet? Their levels?

Q) How to share my sheet progress with you?

Q) What is speaking,
- Generally after the sheet?
the region stars will solve a lot of problems, e.g. 2000-3000 problems with many of them of hard le
- Whoever finish the sheet, I join him in my supervision for the next levels
Problem Submit Reading Thinking Coding Debug Total
Problem Code Status
Name Count Time(m) Time(m) Time(m) Time(m) Time(m)
AC Averages => 3 2.3 5 13 15 18 50
Sample Name1Sample Link1 AC 5 4 8 6 32 50
Sample Name4Sample Link4 WA 5 4 25 20 2 51
Sample Name5Sample Link5 CS 6 5 30 25 31 91
0
0
0
Vanya and FencCF677-D2-A 0
Anton and Dani CF734-D2-A 0
0
0
0
Bear and Big Br CF791-D2-A 0
Team CF231-D2-A 0
Beautiful MatrixCF263-D2-A 0
Gravity Flip CF405-D2-A 0
Petya and StrinCF112-D2-A 0
Boy or Girl CF236-D2-A 0
Word CF59-D2-A 0
Magnets CF344-D2-A 0
Sereja and DimCF381-D2-A 0
Stones on the TaCF266-D2-A 0
Police Recruits CF427-D2-A 0
Black Square CF431-D2-A 0
Night at the Mu CF731-D2-A 0
Games CF268-D2-A 0
0
0
Buy a Shovel CF732-D2-A 0
Is your horseshCF228-D2-A 0
Colorful StonesCF265-D2-A 0
Die Roll CF9-D2-A 0
Shaass and Osk CF294-D2-A 0
Juicer CF709-D2-A 0
Carrot Cakes CF799-D2-A 0
Anton and LetteCF443-D2-A 0
Way Too Long CF71-D2-A 0
Free Ice CreamCF686-D2-A 0
Helpful Maths CF339-D2-A 0
Team OlympiadCF490-D2-A 0
New Password CF770-D2-A 0
0
0
Light, more lighUVA 10110 0
Product UVA 10106 0
Uniform GeneraUVA 408 0
Black and whiteUVA
SPOJ11231 0
EASYMATH 0
Electricity UVA 12148
0
Presents CF136-D2-A 0
Lineland Mail CF567-D2-A 0
Mahmoud and CF766-D2-A 0
Snacktower CF767-D2-A 0
Oath of the NigCF768-D2-A 0
Pangram CF520-D2-A 0
Twins CF160-D2-A 0
Keyboard CF474-D2-A 0
0
0
0
The Seasonal UVA 352 0
Marcus UVA 10452 0
Battleships UVA 11953 0
0
Forming TeamsCF216-D2-B
SPOJ 0
Hierarchy MAKETREE 0
Ordering TasksUVA 10305 0
0
Even Odds CF318-D2-A 0
I Wanna Be theCF469-D2-A 0
Is it rated? CF807-D2-A 0
Olesya and RodCF584-D2-A 0
Football CF43-D2-A 0
Brain's Photos CF707-D2-A 0
Dubstep CF208-D2-A 0
Valera and X CF404-D2-A 0
Arpa’s hard ex CF742-D2-A 0
Calculating FunCF486-D2-A 0
Theatre SquareCF1-D12-A 0
Anton and PolyCF785-D2-A 0
Panoramix's PreCF80-D2-A 0
CounterexamplCF483-D2-A 0
0
0
0
Wasted Time CF127-D2-A 0
Points in Figur UVA 476 0
Overlapping ReUVA 460 0
Fancy Fence CF270-D2-A 0
Pouring Rain CF667-D2-A 0
Fourth Point !! UVA 10242 0
0
Good Number CF365-D2-A 0
Dice Tower CF225-D2-A 0
Alyona and NumCF682-D2-A 0
Mountain SceneCF218-D2-A 0
Help Vasilisa th CF143-D2-A 0
Chewbaсca and CF514-D2-A 0
Ksenia and Pan CF382-D2-A 0
Launch of CollidCF699-D2-A 0
Polo the PenguCF289-D2-A 0
IQ Test CF287-D2-A 0
Yaroslav and PCF296-D2-A 0
Snow FootprintCF298-D2-A 0
Raising Bacteri CF579-D2-A 0
BowWow and thCF1204-D2-A 0
Balanced RatinCF1237-D12-A 0
0
0
The Playboy C UVA 10611 0
Pipeline CF287-D2-B 0
Burning MidnighCF165-D2-B 0
Aggressive cowSPOJ AGGRCOW 0
0
0
Optional Problems 0
0
Word CapitalizaCF281-D2-A 0
Next Round CF158-D12-A 0
Young PhysicisCF69-D2-A 0
Bit++ CF282-D2-A 0
Case of the Ze CF556-D2-A 0
Translation CF41-D2-A 0
String Task CF118-D2-A 0
Laptops CF456-D2-A 0
Left-handers, R CF950-D2-A 0
George and Acc CF467-D2-A 0
Vasya the Hipst CF581-D2-A 0
Fox And Snake CF510-D2-A 0
The New Year: MCF723-D2-A 0
Elephant CF617-D2-A 0
Greg's Workout CF255-D2-A 0
Ultra-Fast MathCF61-D2-A 0
Little Pony and CF454-D2-A 0
One-dimensionaCF721-D2-A 0
Soldier and BanCF546-D2-A 0
0
Bus to UdaylandCF711-D2-A 0
Cookies CF129-D2-A 0
Second Order Sta CF22-D2-A 0
Nearly Lucky N CF110-D2-A 0
Playing with DicCF378-D2-A 0
A Good Contest CF681-D2-A 0
Beautiful Year CF271-D2-A 0
Far Relative’s B CF629-D2-A 0
Mashmokh and L CF415-D2-A 0
Triangular numCF47-D2-A 0
0
Roma and Luck CF262-D2-A 0
Toy Army CF84-D2-A 0
Levko and TableCF361-D2-A 0
Cards CF701-D2-A 0
Wizards' Duel CF591-D2-A 0
Combination LoCF540-D2-A 0
Summer Camp CF672-D2-A 0
Soft Drinking CF151-D2-A 0
Coder CF384-D2-A 0
GukiZ and ConteCF551-D2-A 0
0
Circle Line CF278-D2-A 0
Patrick and Sho CF599-D2-A 0
Choosing TeamsCF432-D2-A 0
Vanya and CubeCF492-D2-A 0
Insomnia cure CF148-D2-A 0
Cakeminator CF330-D2-A 0
Flag CF16-D2-A 0
Cupboards CF248-D2-A 0
Soroban CF363-D2-A 0
0
Amusing Joke CF141-D2-A 0
Lights Out CF275-D2-A 0
Lunch Rush CF276-D2-A 0
Duff and Meat CF588-D2-A 0
Vanya and CardCF401-D2-A 0
Squats CF424-D2-A 0
Arrival of the G CF144-D2-A 0
Sinking Ship CF63-D2-A 0
LLPS CF202-D2-A 0
Candy Bags CF334-D2-A 0
0
Game With SticCF451-D2-A 0
Vasya and SocCF460-D2-A 0
Dima and Frien CF272-D2-A 0
Nicholas and PeCF676-D2-A 0
Toy Cars CF545-D2-A 0
DZY Loves HashCF447-D2-A 0
HQ9+ CF133-D2-A 0
Holidays CF670-D2-A 0
Dividing OrangeCF244-D2-A 0
Haiku CF78-D2-A 0
0
System of EquatCF214-D2-A 0
IQ test CF25-D2-A 0
Contest CF501-D2-A 0
Restoring PassCF94-D2-A 0
Valera and PlateCF369-D2-A 0
Minimum DifficuCF496-D2-A 0
Little Elephant CF221-D2-A 0
Collecting BeatsCF373-D2-A 0
Letter CF14-D2-A 0
Kefa and First S CF580-D2-A 0
0
Ilya and Bank A CF313-D2-A 0
Uncowed ForcesCF604-D2-A 0
ReconnaissanceCF34-D2-A 0
Lucky Ticket CF146-D2-A 0
Chat room CF58-D2-A 0
George and SleeCF387-D2-A 0
Ostap and Gras CF735-D2-A 0
The number of Cp F124-D2-A 0
Table CF359-D2-A 0
Tavas and NafasCF535-D2-A 0
0
Watermelon CF4-D2-A 0
Let's Watch FootCF195-D2-A 0
Initial Bet CF478-D2-A 0
Saitama DestroyCF608-D2-A 0
Queue on Bus StCF435-D2-A 0
Bicycle Chain CF215-D2-A 0
Little Elephant CF205-D2-A 0
Amr and Music CF507-D2-A 0
Marks CF152-D2-A 0
Postcards and pCF137-D2-A 0
0
Business trip CF149-D2-A 0
Drazil and DateCF515-D2-A 0
Multiplication T CF577-D2-A 0
Exam CF534-D2-A 0
Alena's Schedul CF586-D2-A 0
Interview CF631-D2-A 0
Lucky Division CF122-D2-A 0
Appleman and ECF462-D2-A 0
Vasya and DigitaCF355-D2-A 0
Parallelepiped CF224-D2-A 0
0
Group of StudenCF357-D2-A 0
Joysticks CF651-D2-A 0
Array CF300-D2-A 0
Round House CF659-D2-A 0
Lala Land and ACF558-D2-A 0
Autocomplete CF53-D2-A 0
Digital Counter CF495-D2-A 0
Vitaliy and Pie CF525-D2-A 0
Life Without Ze CF75-D2-A 0
Problem By
Category
Level /10 yourself?
2 2 2
2 Yes Math
2 No Impl
2 Yes Graph
7 Hint Math
9
You don't have to or encouraged to solve the next problem. If you felt you need so, try some of them. Or Proceed to
solve in parallel, up to you.
1-2 line Comments
About your approach
2
My Performance Notes: This is so bad performance. Needed many submissions per problem.
My Performance Notes: This is so bad performance. He thought for little time and continued
thinking while coding. As a result, much debug time too. RULE: Think More, Code Faster
My Performance
Other AC,This
Notes:
Status values: WA,isCS,
so TLE,
good MLE,
performance.
RTE, ... 1st submission. Thinking is the higher.
These values and comments are just examples. Just remove/ignore them.
Want c++ solution for UVA 408? Google with: UVA 408 filetype:cpp
Watch - Approaching Problem Statement

Watch - Thinking - On papers Not on PC
C++ Solution Example
This is from Round 379. Here is the editorial
You shouldn't watch a solution video unless you can't solve it by yourself and don't get it from
editorial/code. Videos are there just to for extra help.
In the first 20 problems, don't think more than 20 minutes. After that see the solutions.
Video Solution - Eng Youssef El Ghareeb

Video Solution - Eng Youssef Ali
Video Solution - Eng Samed Hajajla
Video Solution - Eng John Gamal
Video Solution - Solver to be (Java)
Video Solution - Eng Ahmead Raafat (Python)
Video Solution - Eng Yahia Ashraf
Watch - Measuring Algorithms Perfromance - 1

Watch - Elementary Math - Introduction
Video Solution - Eng Muntaser Abukadeja
Video Solution - Dr Mostafa Saad
Watch - Number Theory - Modular Arithmatic

Watch - Combinatorics - Counting Principles
Video Solution - Eng Amr Saud
Video Solution - Eng Youssef El Ghareeb. Don't solve using big integer
Video Solution - Eng Amr Saud
Sol
Learn Calender Leap Year
Video Solution - Eng Ahmed Rafaat (Python)


Watch - Graph Theory - Intro

Watch - Graph Theory - DFS
Video Solution - Eng Mohamed Nasser
Video Solution - Eng Ayman Salah
Video Solution - Eng Aya Elymany
Read definition of: Bipartite graph

Video Solution - Eng Belal Abdulnasser (Python)
Watch - Computational Geometry - Intro

Watch - Computational Geometry - Point and Vector

Video Solution - Eng Omar Ashraf
Video Solution - Eng Magdy Hasan

Watch - Search Techniques - Binary Search

Video Solution - Eng Youssef El Ghareeb

Before moving to another sheet, email me with feedback about these problems selection.
ncouraged to solve the next problem. If you felt you need so, try some of them. Or Proceed to next and
you.
Video Solution - Eng Hossam Yehia
Submit Reading Thinking Coding Debug
Problem Code Status
Count Time(m) Time(m) Time(m) Time(m)
AC Averages => 0 0 0 0 0 0
Petya and CountrysCF66-D2-B

Bear and Finding CCF680-D2-B
Burglar and Match CF16-D2-B
Caisa and Pylons CF463-D2-B
Sum of Digits CF102-D2-B
Coins CF47-D2-B
Effective ApproachCF227-D2-B
Easter Eggs CF78-D2-B
Decoding CF746-D2-B
Big Mod UVA 374

Combinations UVA 369
Pi UVA 412
Adding Reversed UVA 713
Taxi TIMUS 1607
The Drunk Jailer LIVEARCHIVE 2557
Vanya and Lanter CF492-D2-B
Kuriyama Mirai's CF433-D2-B

Fence CF363-D2-B
President's Office CF6-D2-B
Lovely PalindromeCF688-D2-B
Sort the Array CF451-D2-B
Summer sell-off CF810-D2-B
Colorful Field CF79-D12-B
Keyboard CF88-D2-B
Mahmoud and a TrCF766-D2-B
Tic-Tac-Toe ( I ) SPOJ TOE1

Tic-Tac-Toe ( II ) SPOJ TOE2
Knight Moves UVA 439
King's Path CF242-D2-C
Bookworm TIMUS 1638
UVA 10461
SPOJ POSTERIN
Students and ShoelCF129-D2-B

Dreamoon and WiFCF476-D2-B
Chat Online CF469-D2-B
Olympic Medal CF215-D2-B
Filya and Homewo CF714-D2-B
Inna and New MatriCF400-D2-B
Steps CF152-D2-B
Growing MushroomCF186-D2-B
Escape CF148-D2-B
Vacations CF699-D2-C
Woodcutters CF545-D2-C
Barcode CF225-D2-C
Continents UVA 11094
Brownie Points UVA 10865
Hanoi Tower TIMUS 1054
Roma and ChangingCF262-D2-B

Bear and Strings CF385-D2-B
I.O.U. CF376-D2-B
Jeff and Periods CF352-D2-B
Meeting CF144-D2-B
Chocolate CF617-D2-B
Easy Number ChallCF236-D2-B
Han Solo and Laz CF514-D2-B
Physics Practical CF253-D2-B
Two Buttons CF520-D2-B
Intersecting Lines UVA 378

The Stern-Brocot UVA 10077
Mr. Kitayuta's Col CF505-D2-B
DZY Loves ChemistCF445-D2-B
Kolya and Tanya CF584-D2-B
Suffix Structures CF448-D2-B
Complete the WordCF716-D2-B
Sea and Islands CF544-D2-B
Hopscotch CF141-D2-B
Valera and ContesCF369-D2-B
Bear and FriendshCF791-D2-B
Preparing OlympiaCF550-D2-B
Highways UVA 10147

ACM contest and B UVA 10600
Virtual Friends UVA 11503
Arctic Network UVA 10369
Trees on the level UVA 122
Final Standings TIMUS 1100
Farm TIMUS 1349
Mashmokh and TokCF415-D2-B

Approximating a C CF602-D2-B
Gena's Code CF614-D2-B
OR in Matrix CF486-D2-B
Fox And Two Dots CF510-D2-B
Routine Problem CF337-D2-B
Vasya and WrestlinCF493-D2-B
Hamming DistanceCF608-D2-B
Wet Shark and Bi CF621-D2-B
Kefa and Company CF580-D2-B
Tavas and SaDDaCF535-D2-B
Minimum Ternary S
CF1009-D12-B
CF1030-D12-B
CF1051-D2-B
CF1237-D12-B
Painting Eggs CF282-D2-B

Pasha Maximizes CF435-D2-B
Little Girl and Ga CF276-D2-B
Pasha and String CF525-D2-B
Booking System CF416-D2-C
Vanya and ExamsCF492-D2-C
The Skyline Probl UVA 105
Hanoi Tower TroubUVA 10276
Maze Exploration UVA 784
IP-TV UVA 1174
Optional Problems
Devu, the Dumb GCF439-D2-B

Find The Bone CF796-D2-B
Regular Bracket CF26-D12-B
Inbox (100500) CF465-D2-B
Different is Good CF672-D2-B
Permutation CF137-D2-B
Little Elephant an CF259-D2-B
Airport CF218-D2-B
Cormen --- The BesCF732-D2-B
Prison Transfer CF427-D2-B
A and B and CompilCF519-D2-B
Letter CF43-D2-B
Game of Robots CF670-D2-B
African CrosswordCF90-D2-B
Cows and Poker CF284-D2-B
Find Marble CF285-D2-B
Interesting drink CF706-D2-B
Megacity CF424-D2-B
Beautiful PaintingsCF651-D2-B
Ilya and Queries CF313-D2-B
Code Parsing CF255-D2-B
Hungry SequenceCF327-D2-B
Chloe and the seqCF743-D2-B
Luxurious HousesCF581-D2-B
Settlers' Training CF63-D2-B

Far Relative’s ProbCF629-D2-B
Wilbur and Array CF596-D2-B
Text Document AnaCF723-D2-B
Shower Line CF431-D2-B
Misha and ChanginCF501-D2-B
Coat of AnticubismCF667-D2-B
Ternary Logic CF136-D2-B
Counting Rhombi CF189-D2-B
Pashmak and FlowCF459-D2-B
The Monster and thCF592-D2-B

The Fibonacci Seg CF365-D2-B
Spider Man CF705-D2-B
Little Robber Girl'sCF686-D2-B
Unary CF133-D2-B
Canvas Frames CF127-D2-B
Ohana Cleans Up CF554-D2-B
Garland CF408-D2-B
Petya and StaircaseCF362-D2-B
Equidistant String CF545-D2-B
Vanya and Food PCF677-D2-B
Calendar CF304-D2-B
Amr and Pins CF507-D2-B
Polo the Penguin CF289-D2-B
George and Round CF387-D2-B

Alyona and flowersCF740-D2-B
Urbanization CF735-D2-B
Testing Pants for S CF104-D2-B
Cells Not Under AttCF701-D2-B
Vanya and Books CF552-D2-B
Worms CF474-D2-B
Fortune Telling CF59-D2-B
Walking in the Rai CF192-D2-B

Dima and To-do LisCF366-D2-B
Sail CF298-D2-B
Fox and Cross CF389-D2-B
Rebranding CF591-D2-B
Increase and DecreCF246-D2-B
Alyona and Mex CF682-D2-B
Coins CF58-D2-B
Berland National LCF567-D2-B
Art Union CF416-D2-B
BerSU Ball CF489-D2-B
Random Teams CF478-D2-B
Friends CF94-D2-B
War of the CorporaCF625-D2-B
Road Construction CF330-D2-B
Binary Number CF92-D2-B
Before an Exam CF4-D2-B
Running Student CF9-D2-B
Anton and currencyCF508-D2-B
Phone Numbers CF151-D2-B
Total Problem By
Category
Time(m) Level /10 yourself?
0 0 0 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
You don't have to or encouraged to solve the next problem. If you felt you need so, try some of them. Or P
0 and solve in parallel, up to you.
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1-2 line Comments
About your approach
0
Watch - Thinking - Problem Simplification
Watch - Thinking - Brainstorm - Rank - Approach
Study STL (You may study data structures if found hard)
Watch - Combinatorics - Permutations and Combinations - 1
Watch - Combinatorics - Permutations and Combinations - 2
Video Solution - Eng Abanob Ashraf
Watch - Training-Secrets of Success
Revise Stack/Queue datastructure concepts. Learn using STL
Watch - Number Theory - Fib, GCD, LCM, Pow
Video Solution - Eng Mohamed Adel

Don't use big integer class. Write simple array computations
Can you get AC first submission?
Find a formula
Watch - Prefix Sum

Watch - Graph Theory - BFS

Video Solution - Eng Essam AlNaggar
Can you get AC first submission
Sol

Video Solution - Eng Ahmed Salah
Video Solution - Eng Mohamed Salah
Video Solution - Eng Ahmed Salah
Review - Recursion
Watch - Intro to DP - 1
Watch - Intro to DP - 2

Sol


Watch - Computational Geometry - Complex Number and 2D Point

Watch - Computational Geometry - Lines and Distances

Video Solution - SolverToBe (Java)
Watch - Focused and Diffused Thinking

Watch - Graph Theory - MST - Kruskal
Video Solution - Eng Mahmoud Adel
Video Solution - Eng Moaz Rashad

Stable sort exercise
Learn Fermat’s Last Theorem
Video Solution - Eng Salma Yehia

Video Solution - Eng Salma Yehia

Video Solution - Eng Mahmoud Mabrok

Watch - Intro to Greedy


Before moving to another sheet, email me with feedback about these problems selection.
ncouraged to solve the next problem. If you felt you need so, try some of them. Or Proceed to next
p to you.

Problem Name Problem Code Status
AC Averages => 0 0 0 0 0 0
Drazil and FactorialCF515-D2-C

Lucky PermutationCF304-D2-C
Soldier and Cards CF546-D2-C
Watchmen CF651-D2-C
Google first
Fox Dividing CheeCF371-D2-B Goldbach's
Duff in Love CF588-D2-B conjecture
Twin Primes UVA 10394
Summation of FourUVA 10168
The Lottery UVA 10325
Hamburgers CF371-D2-C
Mint UVA 10717
BITMAP - Bitmap SPOJ BITMAP
CODECHEF GCDMOD
UVA 10843
The Child and Set CF437-D2-B
Tanya and PostcarCF518-D2-B
Greg and Array CF296-D2-C

The World is a TheCF131-D2-C
Trains CF88-D2-C
Semifinals CF378-D2-B
Towers CF479-D2-B
To Carry or not to UVA 10469

Beat the Spread! UVA 10812
Summation of PolyUVA 10302

Polly the PolynomiUVA 498
UVA 11053
LiveArchive 8078
R U Kidding Mr. F UVA 10509

Wandering Queen SPOJ QUEEN
Spreadsheet UVA 196
HACKR sherlock-and-probability
Searching for Grap CF402-D2-C

Flying Saucer SegCF227-D2-C
Vasya and Petya' CF577-D2-C
Round Table KnightCF71-D2-C
Kefa and Park CF580-D2-C
Knight TournamentCF357-D2-C
Special Offer! Sup CF219-D2-B
Graph Coloring UVA 193

23 out of 5 UVA 10344
8 Queens Chess PUVA 750
Assemble UVA 12124
SPOJ FUNPROB
Magic Formulas CF424-D2-C

Pythagorean TripleCF707-D2-C
Gerald's Hexagon CF560-D2-C
Points on Line CF252-D2-C
Find Maximum CF353-D2-C
Jzzhu and SequenCF450-D2-B
Simple Game CF570-D2-B
Prime Matrix CF271-D2-B
Vacation UVA 10192

Dividing coins UVA 562
SRM149-D1-500
SRM536-D2-1000
The Blocks Proble UVA 101
Divisibility UVA 10036
UVA 11628
Rational ResistancCF344-D2-C
k-Multiple Free Set CF275-D2-C
Polycarpus' Dice CF534-D2-C
Print Check CF631-D2-B
Playing Cubes CF257-D2-B
T-primes CF230-D2-B
Creating Palindro UVA 11753

Again Palindrome UVA 10617
Exploring Pyramid UVA 1362
Cutting Sticks UVA 10003
Optimal Array MultUVA 348
Accordian Patienc UVA 127
Software CRC UVA 128
ZOJ 1200
Maze CF378-D2-C
Thor CF705-D2-C
Hard problem CF706-D2-C
Unusual Product CF405-D2-C
Palindrome Transf CF486-D2-C
Removing ColumnCF496-D2-C
Crazy Town CF499-D2-C
Queue CF490-D2-B
Vika and Squares CF610-D2-B
Cosmic Tables CF222-D2-B
Prime Factors UVA 583

Mr. Azad and his UVA 10490
Perfect P-th PowerUVA 10622
Prime Land UVA 516
UVA 10920
SRM274-D1-500
Text Editor CF253-D2-C

Alternative ThinkinCF604-D2-C
Tennis ChampionshCF735-D2-C
Guess Your Way OutCF507-D2-C
Biathlon CF84-D2-C
Marina and Vasya CF584-D2-C
Divide by Three CF792-D2-C
Covered Path CF534-D2-B
Facetook Priority WCF75-D2-B
Treasure Hunt CF979-D2-B
How Many Points oUVA 10790

Factovisors UVA 10139
Fractions Again?! UVA 10976
Cut Ribbon CF189-D2-A
Cows and Cars UVA 10491

What is the ProbabiUVA 10056
Let’s Dance UVA 10218
Probability|Given UVA 11181
Another lottery UVA 11628
Airplane UVA 12461
HACKR tower-3-coloring
CF445-D2-C
HACKR a-circle-and-a-square
UVA 11573
Rankings UVA 12263
Hacker, pack your bCF822-D2-C

The Meaningless G CF834-D2-C
Star sky CF835-D2-C
Optional Problems
Diverse PermutatioCF483-D2-C
Replacement CF136-D2-C
Homework CF102-D2-C
Little Elephant and CF221-D2-C
Developing Skills CF581-D2-C
Maxim and DiscounCF262-D2-C
Fox and Box Accumu CF389-D2-C
Ice Skating CF218-D2-C
Valera and Tubes CF441-D2-C
Secret CF271-D2-C
Key Task SPOJ CERC07K
Cleaning Robot SPOJ CLEANRBT
They Are EverywheCF701-D2-C

Monitor CF16-D2-C
System AdministratCF22-D2-C
Lucky Sum CF122-D2-C
NP-Hard Problem CF688-D2-C
Vladik and fraction CF743-D2-C
Case of MatryoshkaCF556-D2-C
Vanya and Label CF677-D2-C
Exams CF479-D2-C
Boredom CF456-D2-C
Learning Languag CF278-D2-C
Beautiful Sets of PCF268-D2-C
Strategic Defense IUVA 497

String to Palindro UVA 10739
Trouble of 13-DotsUVA 10819
Sagheer and NubiaCF812-D2-C
Purification CF330-D2-C
Division into Team CF149-D2-C
Disposition CF49-D2-C
Mashmokh and Num CF415-D2-C
Statues CF129-D2-C
Inna and Huge CandCF400-D2-C
Anagram Search CF144-D2-C
Ilya and Sticks CF525-D2-C
Day at the Beach CF599-D2-C
Appleman and ToaCF462-D2-C

Anya and SmartphCF518-D2-C
Little Girl and M CF276-D2-C
Sereja and Algorit CF368-D2-C
The Child and Toy CF437-D2-C
Perfect Pair CF318-D2-C
Another Problem onCF165-D2-C
Socks CF731-D2-C
Valera and ElectionCF369-D2-C
Total Problem By
Category
0 0 0 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1-2 line Comments
About your approach
0
DON'T Skip colored
the problem: Useless,problems.
repeatedDon't
idea, skip others
boring, unlessgood
normal, a block is really
problem, easy for you
interesting
problem or important problem.
Watch - Thinking - Concretely - Symbolically - Pictorially

Or shorter:
Watch - Thinking - Problem Constraints
Or shorter:
Watch - Number Theory - Primes http://naivered.gi
thub.io/2016/07/
https://github.co
Video Solution - Eng Abanob Ashraf 03/Problem_Solv
m/ilyesLtifi/Comp
ing/UVa/UVa-
etitive-
10168-
Programming/blo
Summation-of-
b/master/UVA/U
Video Solution - Eng Moaz Rashad Four-Primes/
VA
Video Solution - Eng Amr Bahaa %2010325.cpp
Sol
Sol uses __int128 to avoid overflow

Theory result to read
Video Solution - Eng Youssef Ali

Watch - Algebra - Number Bases and Polynomials

Sol
Find O(n) Solution

Sol
Watch - Algebra - Patterns in Sequences
Sol to read
Sol
Watch - Algebra - Summations
Watch - Algebra - Basic Matrix Operations
Watch - Thinking - Problem Abstraction

Watch - Thinking - Problem Reverse
Watch - Search Techniques - Backtracking
Sol
Sol
Review bitmasking
Watch - DP - Subset Style
Explained in the tutorial videos
Watch - DP - Consecutive Ranges Style
Sol
Sol
Watch - DP - Nested Ranges Style

Watch - DP - General Ranges Style
Video Solution - Eng Aya Elymany
Sol to read
Sol

Watch - Thinking - Incrementally

Watch - Thinking - Problem Domain re-interpretation
Watch - Number Theory - Factorization
Sol to read

Sol
Sol to read
Sol to read
Watch - Probability - First 9 videos

Revise Probability
Sol
Sol
Sol
Sol
Sol to read
Learn Fermat's little theorem
Learn 0/1 BFS

Sol

Video Solution
Before moving -toSolver to sheet,
another be (Java)
email me with feedback about these problems
selection.
p to you.
Sol
Or shorter:
Or shorter:
http://naivered.gi
thub.io/2016/07/
https://github.co
03/Problem_Solv
m/ilyesLtifi/Comp
ing/UVa/UVa-
etitive-
10168-
Programming/blo
Summation-of-
b/master/UVA/U
Four-Primes/
VA
%2010325.cpp
AC Averages => 0 0 0 0 0 0
Win or Freeze CF151-D2-C

Euclid's Game UVA 10368
Pyramids SPOJ PIR
Power of Cryptogra UVA 113
SRM458-D2-500
Is There A Second UVA 10462
SRM381-D2-1000
Modified GCD CF75-D2-C

Alyona and mex CF740-D2-C
Wet Shark and FloweCF621-D2-C
Predict Outcome of CF451-D2-C
Balls and Boxes CF260-D2-C
Alice and Bob CF347-D2-C
Mahmoud and Ehab C a F959-D2-C
Almost Equal CF1206-D2-C
CF1220-D12-C
CF1065-D2-C
CF1036-D2-C
CF1068-D2-C
CF313-D2-C
Balls Game CF430-D2-B
Magical Array CF84-D2-B
Jugs UVA 571

Sending email UVA 10986
Lift Hopping UVA 10801
Shopping SPOJ SHOP
Ordering UVA 872
CF1064-D2-C
CF1059-D2-C
CF101933-GYM-K
Karen and Coffee CF816-D2-B
Bulls and Cows CF63-D2-C
Xor-tree CF430-D2-C
Median Smoothing CF591-D2-C
Coloring Trees CF711-D2-C
Clear Symmetry CF202-D2-C
CF1237-D12-C2
Sereja and Mirrorin CF426-D2-B
Restoring Painting CF675-D2-B
Gleaming the Cube UVA 737

Intersecting Line S UVA 866
The Circumference U o VA 438

Points in Figures: RUVA 477
Square Pegs And RUVA 356
UVA 453
Divisibility of Factor UVA 10484
SRM436-D2-500
CF975-D2-C
CF1047-D2-C
CF1075-D2-C
CF758-D2-C
UVA 10525
Prime Permutation CF124-D2-C

Hometask CF155-D2-C
Terse princess CF148-D2-C
Hacking Cypher CF490-D2-C
Dreamoon and SumsCF476-D2-C
Try and Catch CF195-D2-C
Primes or Palindro CF569-D2-C
View Angle CF257-D2-C
Little Pony and SortCF454-D2-B
Unidirectional TSP UVA 116

Make Palindrome UVA 10453
Fast Food UVA 662
Palindromic Subse UVA 11404
Gone Fishing UVA 757
Special Olympics CF199-D2-B
Rings and Glue UVA 10301
k-Tree CF431-D2-C
Caesar's Legions CF118-D2-D
UnsealTheSafe SRM354-D2-1000
DiceGames SRM349-D1-500
SPOJ TWINSNOW
SPOJ FACENEMY
No to Palindromes! CF465-D2-C
Triangle CF408-D2-C
To Add or Not to AdCF231-D2-C
Number of Ways CF466-D2-C
Queue CF141-D2-C
Magical Boxes CF270-D2-C
Find Pair CF160-D2-C
Multitasking CF384-D2-B
Non-square EquatioCF233-D2-B
Frogger UVA 534

Identifying ConcurreUVA 334
Numbering Paths UVA 125
Jack Straws UVA 273
Longest Match UVA 10100
Isolated Segments UVA 11343
Counting UVA 10198
Mafia CF349-D2-C
Sereja and PrefixesCF381-D2-C
About Bacteria CF199-D2-C
DNA Alignment CF520-D2-C
Geometric ProgressCF567-D2-C
Watering Flowers CF617-D2-C
Quiz CF337-D2-C
Secret CombinationCF496-D2-B
MUH and ImportantCF471-D2-B
Lucky Mask CF146-D2-B
PT07Z SPOJ PT07Z
Roads in the North UVA 10308
Subway tree systemLIVEARCHIVE 2935
Shaass and Lights CF294-D2-C

Journey CF721-D2-C
Captain Marmot CF474-D2-C
The Big Race CF592-D2-C
Molly's Chemicals CF776-D2-C
Anatoly and CockroCF719-D2-B
Opposites Attract CF131-D2-B
Railway UVA 10263

Factorial Factors UVA 884
Wifi Access UVA 12748
Lining Up UVA 270
Pouring water SPOJ POUR1
CF23-D12-C
CF869-D2-C
SRM321-D1-500
God, Save me UVA 10777

CF839-D2-C
CF454-D2-C
SRM577-D1-250
HACKR lazy-sorting
SPOJ ALIENS
CF340-D2-B
Optional Problems
Checkposts CF427-D2-C
Literature Lesson CF139-D2-C
Arpa's loud Owf and CF742-D2-C
Parity Game CF298-D2-C
Beauty Pageant CF246-D2-C
Heroes CF80-D2-C
Dynasty Puzzles CF192-D2-C
Buns CF106-D2-C
Counting Kangaroos CF373-D2-C
Corporation Mail CF56-D2-C
Matrix CF365-D2-C
Pick up sticks UVA 11686
Little Elephant and ICF205-D2-C

Sereja and Contest CF315-D2-C
Vasya and Robot CF355-D2-C
Hockey CF96-D2-C
Petya and File Syste CF66-D2-C
Kyoya and Colored Ba CF554-D2-C
George and Job CF467-D2-C
Harmony Analysis CF610-D2-C
Anton and Making PoCF734-D2-C
Table Decorations CF478-D2-C
Recycling Bottles CF672-D2-C
Message CF157-D2-C
Wilbur and Points CF596-D2-C
Cows and Sequence CF284-D2-C
Ladder CF279-D2-C
Not Wool SequencesCF239-D2-C
Anagram CF254-D2-C
DZY Loves SequenceCF447-D2-C
DZY Loves Physics CF445-D2-C
Misha and Forest CF501-D2-C
Jzzhu and Chocolate CF450-D2-C
Cinema CF670-D2-C
Report CF631-D2-C
Bear and Prime NumCF385-D2-C
Robbery CF90-D2-C
Vasya and BasketbalCF493-D2-C
Vanya and Scales CF552-D2-C
Pashmak and Buses CF459-D2-C
Fancy Number CF118-D2-C
Total Problem By
Category
0 0 0 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1-2 line Comments
About your approach
0
Watch - Thinking - Search Space and Output Analysis
Watch - Thinking - Observations Discovery
Watch - Game Theory - Intro
Sol
Sol to read


Watch - Thinking - Misc - Solution Verification - Implementation

Watch - Graph Theory - Dijkstra
Sol
Sol
Video Solution - Solver to be
Watch - Computational Geometry - Lines Intersections

Sol
Sol
Watch - Computational Geometry - Circles
Sol
Sol
Sol to read
Learn Handling Precisions
Sol to read
Video Sol. Also solvable in 2 other ways.

Editorial - Eng Ahmed Osama
Editorial - Eng Ahmed Osama
Watch - Thinking - Error Inspection - History - Contest Strategy

Watch - DP - Building Output
Sol
Sol to read
Sol
Watch - DP - Counting
Sol - text clarification

Sol
Watch - Thinking - Let's Put All Together

Watch - DP - Table Method
Watch - Graph Theory - Floyd Warshal
Sol
Sol
Sol
Sol
Needs Big Integer: Have it in your cpp library or learn Java for these (rare) cases
Watch - Measuring Algorithms Perfromance - 2
Watch - Graph Theory - Tree Diameter and Isomorphism
Sol
Sol
Sol
Sol to read
Sol
Video Solution - Eng Mohamed Nasser. Don't Code O(N^3)
See Rushiose's code in arena summary
Watch Video - Expected Value

Sol
Editorial
Revise Expected Value
Sol - Practice on min enclosing circle
Before moving to another sheet, email me with feedback about these problems
selection.
p to you.
Sol
AC Averages => 0 0 0 0 0 0
Dividing Island CF63-D2-D
Flowers CF474-D2-D
Dima and Bacteria CF400-D2-D
CF1043-D12-C
CF1033-D12-C
CF1066-D3-E
CF534-D2-D
CF899-D2-E
CF729-D12-D
Tourist Problem CF340-D2-C
Lorenzo Von MatteCF697-D2-C
Restore Graph CF404-D2-C
CF309-D1-C
CF101-D1-B
SRM569-D2-1000
CF961-D12-D
CF955-D2-C
UVA 12869
CF372-D1-B
Interval Product UVA 12532

Potentiometers LIVEARCHIVE 2191
Halt The War SPOJ CDC12_H
Counting Primes SPOJ CNTPRIME
Horrible Queries SPOJ HORRIBLE
Light Switching SPOJ LITE
Circular RMQ CF52-D12-C
A Famous City SPOJ CITY2
RMQ with Shifts UVA 12299
R2D2 and Droid ArCF514-D2-D
Ahoy, Pirates! UVA 11402
Brackets SPOJ BRCKTS
Present CF460-D2-C
MessageMess SRM149-D1-500
Mirror, Mirror UVA 466
Maximum Sum SPOJ KGSS
SRM297-D1-500
SRM441-D1-250
CF201-D1-B
CF380-D1-C
CF161-D12-D
CF61-D2-E
SPOJ KOMPICI
Quantity of Strings CF151-D2-D

Eternal Victory CF61-D2-D
Array Division CF808-D2-D
CF45-D12-D
SRM428-D2-1000
SGU 321
CODECHEF OPPOSITE
SRM513-D2-1000
SRM292-D1-500
SRM405-D2-1000
Hiring Staff CF216-D2-C
Tavas and Karafs CF535-D2-C
Permutations CF189-D2-C
Spider's Web CF216-D2-D

Chips CF334-D2-D
Vasya and String CF676-D2-C
The SetStack CompLiveArchive 3634
Database UVA 1592
Can you answer theSPOJ GSS1
SPOJ BILLIARD
Can you answer thes
SPOJ GSS3
SPOJ ABA12E
UVA 11825
CF472-D12-D
UVA 12325
UVA 12047
UVA 10705
UVA 1555
CF80-D2-D
Mahmoud and a DicCF766-D2-D

An overnight danceCF814-D2-D
Polyline CF617-D2-D
Queue CF92-D2-D
CF1038-D2-D
CF552-D2-D
CF101917-D12-E
CF1058-D2-D
CF1042-D12-D
SPOJ BIA
Plant CF186-D2-C
Reberland LinguistiCF667-D2-C
Lucky Permutation CF287-D2-C
Dice Throwing UVA 10759

TestBettingStrategySRM339-D1-500
Collecting Bugs PKU 2096
France '98 UVA 542
Tribbles UVA 11021
Tennis contest UVA 12457
Water Falls UVA 833
Number Sequence UVA 10706
Is It A Tree? UVA 615
Help R2-D2! SPOJ HELPR2D2
CF1016-D2-E
UVA 11997
FbHkrCup 18-R1-A
SRM456-D2-1000
Andrey and ProblemCF443-D2-D

Three Logos CF581-D2-D
Good Sequences CF265-D2-D
Party CF116-D2-C
Cupboard and Ball CF342-D2-C
Cycles CF233-D2-C
Pebble Solitaire UVA 10651

Kefa and Dishes CF580-D2-D
Permutations SPOJ PERMUT1
Assignments SPOJ ASSIGN
CF16-D2-E
Count the Faces. UVA 10178
LCM Cardinality UVA 10892
Robot Rapping Resu
CF645-D12-D
Wavio Sequence UVA 10534
UVA 10342
Directed Roads CF711-D2-D

Block Tower CF327-D2-D
A and B and InteresCF519-D2-D
As Fast As Possibl CF701-D2-D
Chloe and pleasantCF743-D2-D
Roads in Berland CF25-D2-C
Photographer CF203-D2-C
LCM Challenge CF236-D2-C
Search in the dictioSPOJ DICT

Disk Tree UVA 1556
Phone List SPOJ PHONELST
Cellphone Typing UVA 12526
Vasiliy's Multiset CF706-D2-D
Exchange Rates UVA 10113
Equation UVA 727
Safe CF47-D2-D
Central Post Office UVA 12379
Permalex UVA 153
UVA 507
UVA 10667
Volleyball CF96-D2-D
Lazy Student CF606-D2-D
Multiplication TableCF448-D2-D
CF486-D2-D
CF1040-D2-D
CF264-D1-C
CF506-D1-A
CODECHEF KSUM
CF623-D1-B
Divisible by Seven CF376-D2-C
Devu and PartitioniCF439-D2-C
Arthur and Table CF557-D2-C
Total Problem By
Category
0 0 0 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1-2 line Comments
About your approach
0
Sol
Sol
Watch - Data Structures - Segment Tree (2 vid)
Sol
See sscanf and sprintf usage
Use rmq
Sol
Sol
Reading: DP on Trees
Sol
Sol
Watch - Two pointers technique
Sol
Sol
Sol
Sol
Sol
Prove your Solution

Sol
Sol
Sol

Sol
DP - Probability
Sol
Sol
Sol
Sol
Sol
Sol
Sol
DP - Masks (2 vid)
Video Solution - Solver to be
Read first Euler Formula
Sol
Sol - read the statement clarification
String Processing - Trie
Sol
Sol
DP - Sub-rectangle style
Video Solution - Solve to be (Java)

AC Averages => 0 0 0 0 0 0
Oulipo PKU 3461

A Needle in the H SPOJ NHAY
Finding the TesseSPOJ TESSER
Period SPOJ PERIOD
Prefixes and SuffixCF432-D2-D
Tavas and MalekasCF535-D2-D
Be Efficient UVA 11155
Vertex Cover SPOJ PT07X
First Digit Law CF54-D12-C
CF500-D12-D
HACKR vertical-sticks
UVA 10174
UVA 1333
CF842-D2-D
CF709-D2-D
SPOJ MSKYCODE
LiveArchive 8015
Robin Hood CF672-D2-D

End of Exams CF94-D2-D
Equivalent Strings CF560-D2-D
Count Good SubstrCF451-D2-D
Mushroom ScientisCF186-D2-D
Analyzing PolylineCF195-D2-D
CF1023-D12-E
CF1060-D12-C
Bear and Prime 1 CF680-D2-C
Team CF401-D2-C
Bachet's Game UVA 10404

EllysCheckers SRM534-D1-250
RowAndCoins SRM522-D1-250
BagsOfGold SRM228-D1-500
Bag of mice CF148-D2-D
CF1147-D1-B
MELE3 SPOJ MELE3
Roads SPOJ ROADS
The Tree Root UVA 10459
SKYLINE UVA 1232
Ordering the SoldiSPOJ ORDERS
Playlist CF268-D2-E
SRM481-D1-500
Little Girl and M CF276-D2-D

Two Strings CF224-D2-D
Big Maximum SumCF75-D2-D
SPOJ BRCKTS2
CF1057-D12-C
CF1066-D3-F
CF1064-D2-E
CF459-D2-E
UVA 10888
CF1043-D12-D
Football Champio CF200-D2-C
Given Length and CF489-D2-C
S
Trip Routing UVA 186

Scheduling LectureUVA 607
Weird Function SPOJ WEIRDFN
The ? 1 ? 2 ? ... ? n UVA 10025
Dictionary Subseq SPOJ DICTSUB
Jimmi's Riddles UVA 10058
Friends and Subs CF689-D2-D
Sum of Squares wi SPOJ SEGSQRSS
Travel in Desert UVA 10816
Almost Union-FindUVA 11987
SRM537-D2-1000
CF513-D12-C
SRM453.5-D2-1000
SPOJ PARSUMS
CF1138-D2-D
Cow Program CF284-D2-D

Random Task CF431-D2-D
Greg and Graph CF296-D2-D
Russian Roulette CF104-D2-D
Bicycle Race CF659-D2-D
Greenhouse EffecCF270-D2-D
CF645-D12-D
CF459-D2-C
CODECHEF
REDCGAME
CF1005-D3-F
Pocket Book CF152-D2-C
Levko and Array CF361-D2-C
Ice Cave CF540-D2-C
Robbery UVA 707

The Errant PhysiciUVA 126
Brackets sequenceUVA 1626
Unique World UVA 10448
Bad Luck Island CF540-D2-D
Shopping Trip UVA 11284
Hotel booking UVA 11635
CF337-D2-D
HACKR ajourney
CF665-D12-E
Hit Ball CF203-D2-D

Sereja ans Anagr CF368-D2-D
Choosing Capital CF219-D2-D
Coloring BracketsCF149-D2-D
Cycle in Graph CF263-D2-D
CF101187-GYM-F
SRM319-D1-500
Atcoder092-ARC-B
AtCoder002-AGC-C
Fixing Typos CF363-D2-C
Cutting Figure CF194-D2-C
Escape from StonCF265-D2-C
BestTriangulatio
n SRM278-D2-500
Trees on My IslanUVA 10088
Packing polygons UVA 10005
LIVEARCHIVE 2831
Video Surveillanc UVA 588
SRM514-D1-500
SRM473-D1-500
SRM555-D2-1000
UVA 557
SRM285-D1-500
Xrange's PancakeHACKR xrange-and-pizza
SRM525-D1-500
UVA 11648
CF101864-GYM-A
CF101864-GYM-L
CF28-D12-C
UVA 881
UVA 11665
TIMUS 1599
Polygons UVA 137
Potholers SPOJ POTHOLE

Power TransmissiUVA 10330
Gopher II UVA 10080
Software AllocatioUVA 259
UVA 10349
UVA 12168
A Plug for UNIX UVA 753
UVA 10349
Intergalactic Map SPOJ IM
UVA 11159
UVA 1194
Fence Obstacle CPKU 2374
River Crossing UVA 10514
SRM368-D1-500
SRM373-D2-1000
SRM558-D1-250
ZOJ 2587
SRM550-D2-1000
UVA 10180
TIMUS 1156
UVA 1184
UVA 670
Total Problem By
Category
0 0 0 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1-2 line Comments
About your approach
0
String Processing - KMP (2 vid)
Sol
Sol - Text/Background Clarification
Sol
Sol
Sol to learn
DP - Games (2 vid)
Sol
Sol
Sol
Sol
Sol
Sol
Sol
See editorials
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Geometry - Simple and Convex Polygons

Geometry - Polygon Area - Centroid - Cut
Sol
Use polygon cut
Use polygon cut
Sol
Sol
Sol
Sol
Sol
Geometry - Point in polygon

Sol
Sol
Sol
Sol
Graph Theory - Maximum Flow (2 vid)
Sol
Sol
Sol
Sol
Sol - 2 ways
Sol
Sol
Sol - 2 ways
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
AC Averages => 0 0 0 0 0 0
The Bottom of a SPOJ BOTTOM

Test UVA 10731
SRM312-D1-500
CF467-D2-D
Theseus and labyrCF676-D2-D
Cunning Gena CF418-D1-B
Sabotage UVA 10480
SRM352-D2-1000
Garland UVA 1555
CF101589-GYM-F
CF1016-D12-D
CF26-D12-D
CF1012-D1-B
CF1010-D1-C
CF633-D12-D
HACKR house-location
CF621-D2-D
CF101992-GYM-D
SRM608-D2-1000
Gifts by the List CF681-D2-D

DZY Loves ModificCF447-D2-D
Mike and Feet CF548-D2-D
Special Grid CF435-D2-D
Roman and NumbeCF401-D2-D
Persistent BookcasCF707-D2-D
Regular Bridge CF550-D2-D
CF1059-D2-D
Almost Arithmetic CF255-D2-C
Title CF59-D2-C
Treasure CF495-D2-C
Unique Attack ZOJ 2587

End of Fun SPOJ DCEPC12E
Grammar Evaluati UVA 622
Find the Winning UVA 10111
Check the difficult PKU 2151
Proving Equivalen UVA 12167
DDF UVA 547
Dominos UVA 11504
SRM419-D2-1000
Winning Streak UVA 11176
SRM391-D2-1000
SRM465-D1-500
UVA 10740
UVA 12261
LIVEARCHIVE 4008
UVA 1342
CF811-D2-D
AtCoder026-AGC-B
SPOJ FISHES
UVA 11475
Red-Green TowersCF478-D2-D
Renting Bikes CF363-D2-D
Lucky Number 2 CF146-D2-D
Tennis Game CF496-D2-D
Bubble Sort Grap CF340-D2-D
Upgrading Array CF402-D2-D
ZOJ 3305
CF1017-D12-D
Game CF69-D2-C
Ciel and Robot CF322-D2-C
Plus and Square CF716-D2-C
Boxes in a Line UVA 12657

SPOJ QUEST4
Multifactorials UVA 11347
Crimewave UVA 563
SRM545-D2-1000
SRM495-D1-500
Primitive Root SPOJ PROOT
Of Zorcs and Axe CF101149-GYM-G
Connected CompoCF292-D12-D
AND Rounds SPOJ ANDROUND
Campus Roads UVA 11473
The Child and ZooCF437-D2-D
CF403-D1-C
CF787-D2-C
CF309-D12-B
SRM392-D1-1000
UVA 12128
Timus 1362
CF1012-D1-C
SPOJ COCONUTS
FbHkrCup 18-RQ-C
LIVEARCHIVE 4682
Image Preview CF651-D2-D

Maximum Xor SecCF281-D2-D
Ilya and Roads CF313-D2-D
Mr. Bender and SCF255-D2-D
Fish Weight CF298-D2-D
T-decomposition CF237-D2-D
Wizards and Huge CF168-D2-D
CODECHEF
BJUDGE
Dima and Salad CF366-D2-C
Arbitrage UVA 104

Black Box UVA 501
Expressions UVA 11234
Showstopper SPOJ MSE07E
Tobo or not Tobo SPOJ ANARC08A
Sum-up the PrimeUVA 10419
Largest RectangleSPOJ HISTOGRA
UVA 663
KingdomReorganiz SRM531-D2-1000
The Problem with UVA 10092
Psycho SPOJ PSYCHON
Minimal Ratio Tre LIVEARCHIVE 4326
RACING UVA 1234
ActivateGame SRM470-D2-1000
Pair of Numbers CF359-D2-D
Nuts for nuts UVA 10944
Probability UVa 11346
SRM470-D1-500
SPOJ COCONUTS
CF592-D2-D
UVA 1218
SPOJ IOPC1207
CF867-D12-E
AlgoRace CF189-D2-D
Moodular ArithmetCF604-D2-D
Lucky TransformatCF122-D2-D
Boring Partition CF239-D2-D
Spongebob and SCF599-D2-D
How many trees? CF9-D2-D
CF1043-D12-E
UVA 10982
CF1060-D12-D
Cthulhu CF104-D2-C
Anya and Ghosts CF508-D2-C
Square Subsets CF448-D2-C
Angry ProgrammeUVA 11506

The New Rule in UVA 10742
Multiples of 3 SPOJ MULTQ3
TimeTravellingSa SRM492-D2-1000
March of the PengUVA 12125
PeopleYouMayKnSRM447-D1-500
The Game of 31 UVA 10578
Can you answer thSPOJ GSS4
Area TJU 1011
Volatile Kite CF801-D2-D
Antifloyd UVA 10987
Messenger CF631-D2-D
SRM144-D1-500
SRM509-D1-500
CF280-D1-C
CF110-D2-D
CF163-D12-C
CF455-D1-B
Infinite Maze CF197-D2-D

Jeff and Furik CF352-D2-D
Sagheer and KindeCF812-D2-D
Dispute CF242-D2-D
Remainders Gam CF688-D2-D
CF1075-D2-D
CF1033-D12-D
CF442-D1-B
CF1025-D2-D
CF1072-D2-D
Total Problem By
Category
0 0 0 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1-2 line Comments
About your approach
0
Graph Theory - SCC (2 vid)
Sol
Sol
Sol
Sol
Sol
Sol - must read
Sol
Sol
Sol
Sol
Prove
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol - Must Read

Sol
Read SPOJ users' comments about IO. See here sol
Sol
Sol
Sol. Don't implement as adhock/greedy/Pure STL. Use a data structure.
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol. Find proof (See editorial comments)
Sol
Sol
Sol
Sol
Sol
Don't use DP. Check it later in editorial. Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
ff Problem Code Status
AC Averages => 0 0 0 0 0 0
This page has the SAME problems in (CF-A to CF-D3). It has problem
Some trainees don't like to train using Blind Order style (CF-A to CF-D
This sheet page is another training style. Determine a category, go ah
Vanya and Fence CF677-D2-A

Anton and Danik CF734-D2-A
Petya and StringsCF112-D2-A
Is your horseshoeCF228-D2-A
Team CF231-D2-A
Boy or Girl CF236-D2-A
Beautiful Matrix CF263-D2-A
Colorful Stones (SiCF265-D2-A
Stones on the TabCF266-D2-A
Games CF268-D2-A
Word CapitalizatioCF281-D2-A
Magnets CF344-D2-A
Sereja and Dima CF381-D2-A
Gravity Flip CF405-D2-A
Police Recruits CF427-D2-A
Black Square CF431-D2-A
Word CF59-D2-A
Night at the Mus CF731-D2-A
Buy a Shovel CF732-D2-A
Bear and Big BrotCF791-D2-A
Good Number CF365-D2-A
Snow Footprints CF298-D2-A
String Task CF118-D2-A
Presents CF136-D2-A
Next Round CF158-D12-A
Twins CF160-D2-A
Dubstep CF208-D2-A
Mountain SceneryCF218-D2-A
Dice Tower CF225-D2-A
Fancy Fence CF270-D2-A
Bit++ CF282-D2-A
IQ Test CF287-D2-A
Polo the Penguin CF289-D2-A
Shaass and OskolCF294-D2-A
Yaroslav and Perm CF296-D2-A
Even Odds CF318-D2-A
Helpful Maths CF339-D2-A
Ksenia and Pan SCF382-D2-A
Translation CF41-D2-A
Football CF43-D2-A
Anton and LettersCF443-D2-A
Laptops CF456-D2-A
I Wanna Be the GCF469-D2-A
Keyboard CF474-D2-A
Counterexample CF483-D2-A
Calculating FunctiCF486-D2-A
Team Olympiad CF490-D2-A
Chewbaсca and NCF514-D2-A
Pangram CF520-D2-A
Case of the ZerosCF556-D2-A
Lineland Mail CF567-D2-A
Raising Bacteria CF579-D2-A
Olesya and RodioCF584-D2-A
Alyona and NumbCF682-D2-A
Free Ice Cream CF686-D2-A
Young Physicist CF69-D2-A
Launch of ColliderCF699-D2-A
Brain's Photos CF707-D2-A
Way Too Long WoCF71-D2-A
Arpa’s hard exam CF742-D2-A
Mahmoud and LonCF766-D2-A
Snacktower CF767-D2-A
Oath of the Night' CF768-D2-A
New Password CF770-D2-A
Carrot Cakes CF799-D2-A
Panoramix's PrediCF80-D2-A
Is it rated? CF807-D2-A
Die Roll CF9-D2-A
Electricity UVA 12148
Final Standings TIMUS 1100
President's Office CF6-D2-B
Sum of Digits CF102-D2-B
Meeting CF144-D2-B
Steps CF152-D2-B
Burglar and Matc CF16-D2-B
Growing MushrooCF186-D2-B
Olympic Medal CF215-D2-B
Effective Approac CF227-D2-B
Roma and ChangiCF262-D2-B
Routine Problem CF337-D2-B
Jeff and Periods CF352-D2-B
I.O.U. CF376-D2-B
Multitasking CF384-D2-B
Bear and Strings CF385-D2-B
Inna and New Matr CF400-D2-B
Mashmokh and ToCF415-D2-B
Pasha Maximizes CF435-D2-B
DZY Loves Chemis CF445-D2-B
Suffix Structures CF448-D2-B
Chat Online CF469-D2-B
Coins CF47-D2-B
OR in Matrix CF486-D2-B
Vasya and WrestliCF493-D2-B
Secret Combinati CF496-D2-B
Mr. Kitayuta's Col CF505-D2-B
Fox And Two DotsCF510-D2-B
Pasha and String CF525-D2-B
Sea and Islands CF544-D2-B
Kefa and CompanCF580-D2-B
Kolya and Tanya CF584-D2-B
Approximating a CF602-D2-B
Hamming DistancCF608-D2-B
Petya and CountryCF66-D2-B
Bear and Finding CF680-D2-B
Filya and HomewoCF714-D2-B
Complete the WorCF716-D2-B
Easter Eggs CF78-D2-B
Hopscotch CF141-D2-B
Physics Practical CF253-D2-B
Little Girl and Ga CF276-D2-B
Painting Eggs CF282-D2-B
Fence CF363-D2-B
Valera and ContesCF369-D2-B
Han Solo and LazCF514-D2-B
Two Buttons CF520-D2-B
Tavas and SaDDaCF535-D2-B
Preparing Olympi CF550-D2-B
Lovely PalindromeCF688-D2-B
Anatoly and Cock CF719-D2-B
Decoding CF746-D2-B
Bear and FriendshCF791-D2-B
Keyboard CF88-D2-B
Kuriyama Mirai's CF433-D2-B
Vika and SquaresCF610-D2-B
CF1237-D12-B
Alyona and mex CF740-D2-C
UVA 11053
Karen and Coffee CF816-D2-B
CF1043-D12-C
CF1075-D2-C
CF1237-D12-C2
Molly's ChemicalsCF776-D2-C
Number of Ways CF466-D2-C
SPOJ TWINSNOW
UVA 10920
SRM381-D2-1000
Cutting Figure CF194-D2-C
Hacker, pack yourCF822-D2-C
Greg and Array CF296-D2-C
CF1066-D3-E
Almost Equal CF1206-D2-C
Permutations CF189-D2-C
SRM274-D1-500
Array Division CF808-D2-D
Prime Permutatio CF124-D2-C
Try and Catch CF195-D2-C
Title CF59-D2-C
CF309-D1-C
SPOJ KOMPICI
Lucky TransformatCF122-D2-D
SPOJ PARSUMS
CODECHEF OPPOSITE
SRM321-D1-500
Fish Weight CF298-D2-D
Dividing Island CF63-D2-D
Median Smoothin CF591-D2-C
CF23-D12-C
CF101589-GYM-F
Atcoder092-ARC-B
23 out of 5 UVA 10344
8 Queens Chess UVA 750
Graph Coloring UVA 193
Safe CF47-D2-D
Jimmi's Riddles UVA 10058
Grammar EvaluatiUVA 622
Help Vasilisa the CF143-D2-A
Gerald is into Art CF560-D2-B
Simple Game CF570-D2-B
Students and ShoCF129-D2-B
Balls Game CF430-D2-B
Cut Ribbon CF189-D2-A
Searching for GraCF402-D2-C
Bulls and Cows CF63-D2-C
Almost Arithmetic CF255-D2-C
Fancy Number CF118-D2-C
Recycling Bottles CF672-D2-C
Devu and PartitionCF439-D2-C
Football Champio CF200-D2-C
Sereja and Algori CF368-D2-C
Arthur and Table CF557-D2-C
CF1036-D2-C
Matrix CF365-D2-C
Removing ColumnCF496-D2-C
UVA 12261
UVA 10705
Lucky Number 2 CF146-D2-D
Levko and Array CF361-D2-C
CF1017-D12-D
CF621-D2-D
SRM513-D2-1000
CF633-D12-D
SRM525-D1-500
Pipeline CF287-D2-B
Vanya and LanterCF492-D2-B
Aggressive cows SPOJ AGGRCOW
Hanoi Tower Troub UVA 10276
The Stern-Brocot UVA 10077
Magical Boxes CF270-D2-C
Image Preview CF651-D2-D
Sagheer and NubiCF812-D2-C
The Playboy ChimUVA 10611
Modified GCD CF75-D2-C
Dictionary Subse SPOJ DICTSUB
Mr. Bender and SCF255-D2-D
CF1060-D12-C
Multiplication TablCF448-D2-D
Garland UVA 1555
SPOJ ABA12E
Showstopper SPOJ MSE07E
SRM319-D1-500
SPOJ POSTERIN
Knight TournamenCF357-D2-C
LiveArchive 8078
Queue CF92-D2-D
Thor CF705-D2-C
Database UVA 1592
Little Girl and M CF276-D2-C
Anya and Smartp CF518-D2-C
Lorenzo Von MattCF697-D2-C
Weird Function SPOJ WEIRDFN
Black Box UVA 501
The SetStack ComLiveArchive 3634
CF899-D2-E
Mike and Feet CF548-D2-D
Boxes in a Line UVA 12657
Expressions UVA 11234
UVA 11997
Cutting Sticks UVA 10003
Dividing coins UVA 562
Vacation UVA 10192
Divisibility UVA 10036
Longest Match UVA 10100
CF1057-D12-C
Alternative Thinki CF604-D2-C
String to Palindro UVA 10739
Trouble of 13-Dot UVA 10819
Woodcutters CF545-D2-C
Counting UVA 10198
Given Length and CF489-D2-C
S
Strategic DefenseUVAI 497
Hard problem CF706-D2-C
Boredom CF456-D2-C
Coloring Trees CF711-D2-C
Again PalindromeUVA 10617
Scheduling LecturUVA 607
Divide by Three CF792-D2-C
Wavio Sequence UVA 10534
Good Sequences CF265-D2-D
Dima and Salad CF366-D2-C
CF101-D1-B
Bubble Sort Grap CF340-D2-D
CF506-D1-A
Barcode CF225-D2-C
Vacations CF699-D2-C
Greenhouse EffecCF270-D2-D
Journey CF721-D2-C
CF264-D1-C
Cow Program CF284-D2-D
CF1066-D3-F
Optimal Array MulUVA 348
SRM569-D2-1000
Ilya and Roads CF313-D2-D
TIMUS 1156
Coloring BracketsCF149-D2-D
CF1012-D1-C
CF623-D1-B
CF1072-D2-D
CF1025-D2-D
FbHkrCup 18-R1-A
Kefa and Dishes CF580-D2-D
Permutations SPOJ PERMUT1
Assignments SPOJ ASSIGN
Pebble Solitaire UVA 10651
UVA 11825
Nuts for nuts UVA 10944
Shopping Trip UVA 11284
Gone Fishing UVA 757
Make Palindrome UVA 10453
Fast Food UVA 662
Palindromic Subs UVA 11404
Unidirectional TS UVA 116
Changing a StringCF56-D2-D
Caesar's Legions CF118-D2-D
UnsealTheSafe SRM354-D2-1000
k-Tree CF431-D2-C
Flowers CF474-D2-D
SRM428-D2-1000
SRM144-D1-500
SRM514-D1-500
Little Girl and M CF276-D2-D
Roman and NumbCF401-D2-D
Find Pair CF160-D2-C
BagsOfGold SRM228-D1-500
Bachet's Game UVA 10404
RowAndCoins SRM522-D1-250
CF1033-D12-C
EllysCheckers SRM534-D1-250
Bag of mice CF148-D2-D
The Game of 31 UVA 10578
Find the Winning UVA 10111
Tennis contest UVA 12457
First Digit Law CF54-D12-C
France '98 UVA 542
Bad Luck Island CF540-D2-D
TestBettingStrate SRM339-D1-500
Dice Throwing UVA 10759
Wizards and HugeCF168-D2-D
CF28-D12-C
Check the difficul PKU 2151
CF16-D2-E
Let’s Dance UVA 10218
Tribbles UVA 11021
Collecting Bugs PKU 2096
Winning Streak UVA 11176
Creating Palindro UVA 11753
CF101294-GYM-I
SRM441-D1-250
SRM536-D2-1000
MessageMess SRM149-D1-500
SRM555-D2-1000
SRM558-D1-250
Exploring PyramidUVA 1362
Brackets sequencUVA 1626
SRM509-D1-500
UVA 507
UVA 10667
Big Maximum Su CF75-D2-D
SPOJ FISHES
Reberland LinguistCF667-D2-C
Red-Green TowerCF478-D2-D
Cunning Gena CF418-D1-B
ZOJ 3305
An overnight dancCF814-D2-D
CF161-D12-D
Vertex Cover SPOJ PT07X
CF337-D2-D
Chloe and pleasanCF743-D2-D
Timus 1362
UVA 1218
Playing Cubes CF257-D2-B
Euclid's Game UVA 10368
CF1220-D12-C
Alice and Bob CF347-D2-C
Win or Freeze CF151-D2-C
Brownie Points UVA 10865
SRM436-D2-500
Points in Figures: UVA 476
Watering Flowers CF617-D2-C
Pouring Rain CF667-D2-A
Fourth Point !! UVA 10242
Captain Marmot CF474-D2-C
Overlapping RectaUVA 460
Xrange's PancakeHACKR xrange-and-pizza
HACKR a-circle-and-a-square
SPOJ FACENEMY
k-Multiple Free SeCF275-D2-C
Gerald's HexagonCF560-D2-C
View Angle CF257-D2-C
Watchmen CF651-D2-C
Bicycle Race CF659-D2-D
Pyramids SPOJ PIR
Pythagorean TriplCF707-D2-C
SPOJ BILLIARD
Cupboard and BalCF342-D2-C
CF1064-D2-E
CF961-D12-D
CF101917-D12-E
CF552-D2-D
CF1016-D2-E
CF1058-D2-D
UVA 1342
CF101864-GYM-L
CF80-D2-D
UVA 11648
UVA 1333
Hit Ball CF203-D2-D
UVA 453
Wifi Access UVA 12748
Rings and Glue UVA 10301
Square Pegs And UVA 356
The Circumference UVA 438
Points in Figures: UVA 477
Special Olympics CF199-D2-B
Biathlon CF84-D2-C
Packing polygons UVA 10005
SRM473-D1-500
SPOJ ALIENS
CF1059-D2-D
HACKR house-location
UVA 10180
Railway UVA 10263
Lining Up UVA 270
Campus Roads UVA 11473
Polyline CF617-D2-D
Jack Straws UVA 273
Isolated Segment UVA 11343
Intersecting Lines UVA 378
SRM373-D2-1000
Intersecting Line UVA 866
SRM368-D1-500
Gleaming the CubUVA 737
Water Falls UVA 833
How Many Points UVA 10790
River Crossing UVA 10514
BestTriangulation SRM278-D2-500
Triangle CF408-D2-C
UVA 11665
TIMUS 1599
UVA 881
CF340-D2-B
Volatile Kite CF801-D2-D
Polygons UVA 137
Area TJU 1011
Trees on My IslanUVA 10088
LIVEARCHIVE 2831
Video Surveillanc UVA 588
The Skyline Prob UVA 105
Marcus UVA 10452
Trees on the levelUVA 122
PT07Z SPOJ PT07Z
Roads in the Nort UVA 10308
CF1068-D2-C
Eternal Victory CF61-D2-D
Is It A Tree? UVA 615
Mahmoud and Ehab CF959-D2-C
Central Post OfficUVA 12379
The Tree Root UVA 10459
Xor-tree CF430-D2-C
Renting Bikes CF363-D2-D
Regular Bridge CF550-D2-D
CF486-D2-D
Cycles CF233-D2-C
CF459-D2-E
CF1060-D12-D
UVA 10982
CF592-D2-D
BITMAP - Bitmap SPOJ BITMAP
Pouring water SPOJ POUR1
Jugs UVA 571
Tic-Tac-Toe ( I ) SPOJ TOE1
Tic-Tac-Toe ( II ) SPOJ TOE2
Knight Moves UVA 439
King's Path CF242-D2-C
Theseus and labyrCF676-D2-D
Wandering QueenSPOJ QUEEN
Restore Graph CF404-D2-C
Key Task SPOJ CERC07K
Cleaning Robot SPOJ CLEANRBT
UVA 10888
Text Editor CF253-D2-C
Tobo or not Tobo SPOJ ANARC08A
CF1005-D3-F
TIMUS 1498
UVA 11573
CF787-D2-C
CF811-D2-D
UVA 10461
Roads in Berland CF25-D2-C
Party CF116-D2-C
Forming Teams CF216-D2-B
Block Tower CF327-D2-D
Soldier and CardsCF546-D2-C
Kefa and Park CF580-D2-C
Maze CF378-D2-C
Exchange Rates UVA 10113
Ice Cave CF540-D2-C
Ordering UVA 872
Directed Roads CF711-D2-D
SPOJ BIA
Choosing Capital CF219-D2-D
CF1075-D2-D
Infinite Maze CF197-D2-D
Cycle in Graph CF263-D2-D
T-decomposition CF237-D2-D
Robbery UVA 707
Persistent BookcaCF707-D2-D
Moodular ArithmetCF604-D2-D
The Seasonal WaUVA 352
Battleships UVA 11953
Maze Exploration UVA 784
Continents UVA 11094
SRM297-D1-500
Equivalent StringsCF560-D2-D
Subway tree syst LIVEARCHIVE 2935
Hierarchy SPOJ MAKETREE
Ordering Tasks UVA 10305
SRM419-D2-1000
Spreadsheet UVA 196
Rankings UVA 12263
Pick up sticks UVA 11686
SRM550-D2-1000
Robot Rapping Res CF645-D12-D
Gifts by the List CF681-D2-D
Sagheer and KindCF812-D2-D
Shopping SPOJ SHOP
Sending email UVA 10986
MELE3 SPOJ MELE3
Roads SPOJ ROADS
Lift Hopping UVA 10801
UVA 10740
Volleyball CF96-D2-D
UVA 12047
UVA 10342
Hotel booking UVA 11635
IP-TV UVA 1174
Count the Faces. UVA 10178
Learning LanguagCF278-D2-C
Virtual Friends UVA 11503
Almost Union-FindUVA 11987
Cthulhu CF104-D2-C
The Child and ZooCF437-D2-D
Mahmoud and a Di CF766-D2-D
CF1012-D1-B
UVA 12128
Connected CompoCF292-D12-D
Trip Routing UVA 186
Numbering Paths UVA 125
Frogger UVA 534
Travel in Desert UVA 10816
Identifying ConcurUVA 334
Greg and Graph CF296-D2-D
Dima and BacteriaCF400-D2-D
AlgoRace CF189-D2-D
Antifloyd UVA 10987
Unique World UVA 10448
Arbitrage UVA 104
Potholers SPOJ POTHOLE
Power TransmissiUVA 10330
The Problem with UVA 10092
Crimewave UVA 563
Intergalactic Map SPOJ IM
A Plug for UNIX UVA 753
March of the PengUVA 12125
Gopher II UVA 10080
Software AllocatioUVA 259
UVA 670
UVA 1184
UVA 1194
UVA 10349
UVA 11159
UVA 12168
SPOJ QUEST4
UVA 663
Sabotage UVA 10480
Unique Attack ZOJ 2587
Angry ProgrammeUVA 11506
PeopleYouMayKnSRM447-D1-500
SPOJ COCONUTS
SRM465-D1-500
Highways UVA 10147
Is There A SecondUVA 10462
UVA 10843
ACM contest and UVA 10600
TimeTravellingSa SRM492-D2-1000
CF472-D12-D
RACING UVA 1234
Arctic Network UVA 10369
KingdomReorganiz SRM531-D2-1000
Lazy Student CF606-D2-D
ActivateGame SRM470-D2-1000
Minimal Ratio Tre LIVEARCHIVE 4326
The Bottom of a SPOJ BOTTOM
Test UVA 10731
Dominos UVA 11504
CF467-D2-D
SRM312-D1-500
Proving EquivalenUVA 12167
SRM608-D2-1000
SRM391-D2-1000
SRM495-D1-500
CF403-D1-C
Summer sell-off CF810-D2-B
Minimum Ternary CF1009-D12-B
Towers CF479-D2-B
Semifinals CF378-D2-B
The Child and SetCF437-D2-B
Sort the Array CF451-D2-B
Mahmoud and a Tr CF766-D2-B
Escape from StonCF265-D2-C
Fixing Typos CF363-D2-C
Photographer CF203-D2-C
Booking System CF416-D2-C
Treasure Hunt CF979-D2-B
Assemble UVA 12124
CODECHEF KSUM
CF1064-D2-C
CF534-D2-D
CF1065-D2-C
CF445-D2-C
Geometric ProgreCF567-D2-C
SRM481-D1-500
Team CF401-D2-C
Drazil and FactoriaCF515-D2-C
Hiring Staff CF216-D2-C
Star sky CF835-D2-C
Vanya and ExamsCF492-D2-C
ZOJ 1200
CF729-D12-D
A and B and IntereCF519-D2-D
Palindrome TransfCF486-D2-C
Marina and VasyaCF584-D2-C
Tennis ChampionsCF735-D2-C
Anya and Ghosts CF508-D2-C
Terse princess CF148-D2-C
Lucky Permutatio CF287-D2-C
Balls and Boxes CF260-D2-C
CF313-D2-C
Upgrading Array CF402-D2-D
SRM456-D2-1000
End of Exams CF94-D2-D
Queue CF141-D2-C
SGU 321
Dispute CF242-D2-D
SRM292-D1-500
CF1038-D2-D
UVA 12325
SRM405-D2-1000
Boring Partition CF239-D2-D
No to PalindromesCF465-D2-C
CF709-D2-D
CODECHEF BJUDGE
CF1023-D12-E
Russian Roulette CF104-D2-D
CF1043-D12-E
DZY Loves ModificCF447-D2-D
AtCoder002-AGC-C
Of Zorcs and Axe CF101149-GYM-G
Robin Hood CF672-D2-D
SRM453.5-D2-1000
CF867-D12-E
SRM392-D1-1000
Tennis Game CF496-D2-D
Wasted Time CF127-D2-A
Juicer CF709-D2-A
Anton and PolyheCF785-D2-A
Valera and X CF404-D2-A
Tanya and PostcaCF518-D2-B
Mike and Fun CF548-D2-B
Covered Path CF534-D2-B
Print Check CF631-D2-B
Lucky Mask CF146-D2-B
Special Offer! SupCF219-D2-B
Non-square EquatCF233-D2-B
Flag Day CF357-D2-B
Sereja and MirroriCF426-D2-B
Little Pony and Sor
CF454-D2-B
MUH and Importan CF471-D2-B
Gena's Code CF614-D2-B
Opposites Attract CF131-D2-B
Little Pigs and WoCF116-D2-B
Cosmic Tables CF222-D2-B
Prime Matrix CF271-D2-B
Wet Shark and Bi CF621-D2-B
CF1030-D12-B
Facetook Priority CF75-D2-B
Queue CF490-D2-B
Hanoi Tower TIMUS 1054
Treasure CF495-D2-C
Game CF69-D2-C
Accordian PatiencUVA 127
Beautiful Sets of CF268-D2-C
Appleman and ToCF462-D2-C
Three Logos CF581-D2-D
Guess Your Way O CF507-D2-C
CF1042-D12-D
Mafia CF349-D2-C
Unusual Product CF405-D2-C
CF101187-GYM-F
Special Grid CF435-D2-D
Theatre Square CF1-D12-A
CF1204-D2-A
Balanced Rating CF1237-D12-A
The Drunk Jailer LIVEARCHIVE 2557
Product UVA 10106
To Carry or not toUVA 10469
Adding Reversed UVA 713
Dreamoon and WiCF476-D2-B
CF1051-D2-B
Escape CF148-D2-B
Restoring PaintingCF675-D2-B
Caisa and Pylons CF463-D2-B
T-primes CF230-D2-B
CODECHEF GCDMOD
Polycarpus' Dice CF534-D2-C
CF1059-D2-C
Number Sequenc UVA 10706
Divisible by SevenCF376-D2-C
Fractions Again?! UVA 10976
Plant CF186-D2-C
Magic Formulas CF424-D2-C
Duff in Love CF588-D2-B
Light, more light UVA 10110
Power of Cryptog UVA 113
Round Table KnigCF71-D2-C
Lucky PermutationCF304-D2-C
Vasya and Petya' CF577-D2-C
CF1239-D1-A
The ? 1 ? 2 ? ... UVA 10025
Secrets CF334-D2-C
The Meaningless CF834-D2-C
Find Maximum CF353-D2-C
Plus and Square CF716-D2-C
Bear and Prime 1 CF680-D2-C
CF1040-D2-D
Count Good SubstCF451-D2-D
Tavas and Karafs CF535-D2-C
As Fast As PossibCF701-D2-D
CF955-D2-C
CF45-D12-D
Ciel and Robot CF322-D2-C
Crazy Town CF499-D2-C
About Bacteria CF199-D2-C
DNA Alignment CF520-D2-C
Predict Outcome CF451-D2-C
Analyzing PolylineCF195-D2-D
CF1016-D12-D
Quantity of String CF151-D2-D
How many trees? CF9-D2-D
The Errant PhysiciUVA 126
Software CRC UVA 128
Jeff and Furik CF352-D2-D
Magical Array CF84-D2-B
Chocolate CF617-D2-B
Colorful Field CF79-D12-B
The World is a ThCF131-D2-C
Pocket Book CF152-D2-C
Black and white paUVA 11231
CF758-D2-C
CF459-D2-C
HACKR ajourney
Shaass and LightsCF294-D2-C
CF869-D2-C
Tourist Problem CF340-D2-C
Fox Dividing CheeCF371-D2-B
Permalex UVA 153
Prime Factors UVA 583
Easy Number ChalCF236-D2-B
Mr. Azad and his UVA 10490
Prime Land UVA 516
Perfect P-th PoweUVA 10622
Factovisors UVA 10139
CF1047-D2-C
DDF UVA 547
UVA 10174
Multifactorials UVA 11347
CF1033-D12-D
Remainders Gam CF688-D2-D
Primitive Root SPOJ PROOT
UVA 12869
Combinations UVA 369
Pi UVA 412
Trains CF88-D2-C
Mint UVA 10717
The Big Race CF592-D2-C
LCM Cardinality UVA 10892
Rational Resistan CF344-D2-C
LCM Challenge CF236-D2-C
CF1010-D1-C
AtCoder026-AGC-B
SPOJ EASYMATH
The Lottery UVA 10325
CF101933-GYM-K
CF372-D1-B
SPOJ MSKYCODE
CF101992-GYM-D
Equation UVA 727
Farm TIMUS 1349
Summation of PolUVA 10302
HACKR tower-3-coloring
R U Kidding Mr. UVA 10509
Polly the PolynomiUVA 498
Jzzhu and Seque CF450-D2-B
Mirror, Mirror UVA 466
Clear Symmetry CF202-D2-C
End of Fun SPOJ DCEPC12E
Uniform GeneratoUVA 408
Be Efficient UVA 11155
Quiz CF337-D2-C
Cows and Cars UVA 10491
What is the ProbabUVA 10056
HACKR sherlock-and-probability
Probability|Given UVA 11181
Another lottery UVA 11628
Mushroom ScientiCF186-D2-D
CF101864-GYM-A
SRM537-D2-1000
Airplane UVA 12461
Probability UVa 11346
SRM285-D1-500
CF26-D12-D
CF442-D1-B
SRM352-D2-1000
CF513-D12-C
UVA 557
SPOJ FUNPROB
CF163-D12-C
CF110-D2-D
God, Save me UVA 10777
SRM458-D2-500
CF839-D2-C
HACKR lazy-sorting
Andrey and Probl CF443-D2-D
Wet Shark and Fl CF621-D2-C
Little Pony and CF454-D2-C
HACKR vertical-sticks
SRM577-D1-250
SRM470-D1-500
CF500-D12-D
CF280-D1-C
Playlist CF268-D2-E
Big Mod UVA 374
Google first
Goldbach's
conjecture
Google first
Twin Primes UVA 10394 Goldbach's
Factorial Factors UVA 884 conjecture
Psycho SPOJ PSYCHON
Summation of FouUVA 10168
Primes or Palind CF569-D2-C
Divisibility of Fact UVA 10484
LIVEARCHIVE 4008
The New Rule in UVA 10742
Sum-up the PrimeUVA 10419
Flying Saucer Se CF227-D2-C
Dreamoon and S CF476-D2-C
CF201-D1-B
Spongebob and SCF599-D2-D
Largest RectangleSPOJ HISTOGRA
R2D2 and Droid ACF514-D2-D
Friends and Subs CF689-D2-D
Pair of Numbers CF359-D2-D
Square Subsets CF448-D2-C
Potentiometers LIVEARCHIVE 2191
Interval Product UVA 12532
Halt The War SPOJ CDC12_H
Multiples of 3 SPOJ MULTQ3
Horrible Queries SPOJ HORRIBLE
Counting Primes SPOJ CNTPRIME
Maximum Sum SPOJ KGSS
A Famous City SPOJ CITY2
Help R2-D2! SPOJ HELPR2D2
Light Switching SPOJ LITE
Circular RMQ CF52-D12-C
Brackets SPOJ BRCKTS
RMQ with Shifts UVA 12299
AND Rounds SPOJ ANDROUND
Ahoy, Pirates! UVA 11402
Present CF460-D2-C
Fence Obstacle CPKU 2374
CF61-D2-E
Sum of Squares wSPOJ SEGSQRSS
CF380-D1-C
SKYLINE UVA 1232
Ordering the SoldiSPOJ ORDERS
SPOJ IOPC1207
SPOJ BRCKTS2
Bookworm TIMUS 1638
Taxi TIMUS 1607
The Blocks Probl UVA 101
Oulipo PKU 3461
A Needle in the H SPOJ NHAY
Finding the TesseSPOJ TESSER
Period SPOJ PERIOD
Prefixes and Suffi CF432-D2-D
Tavas and MalekaCF535-D2-D
CF1147-D1-B
Messenger CF631-D2-D
CF1138-D2-D
FbHkrCup 18-RQ-C
UVA 11475
Phone List SPOJ PHONELST
Cellphone Typing UVA 12526
Disk Tree UVA 1556
Search in the dictiSPOJ DICT
Vasiliy's Multiset CF706-D2-D
LiveArchive 8015
CF842-D2-D
CF665-D12-E
LiveArchive 4682
CF455-D1-B
Spider's Web CF216-D2-D
Points on Line CF252-D2-C
Hometask CF155-D2-C
CF1043-D12-D
CODECHEF REDCGAME
Sereja ans Anagr CF368-D2-D
Vasya and String CF676-D2-C
To Add or Not to CF231-D2-C
Two Strings CF224-D2-D
Chips CF334-D2-D
CF309-D12-B
Maximum Xor SecCF281-D2-D
Caregory Code to match with Col O
1- Column K (learning order) is same
order as the sheets A-D
2- You may follow this order to learn
3- Column G is the category code as in

Column O 109
4- Example: You learned DFS. Codes
89, 101
for it are 60, 61, 63. Go and solve as u
want from the problems with these
codes. E.g. UVA 10461 60,61,63
45
45
6
89, 101
89, 101
99
57
10
10
45
48
65,76
84
117
118
3
10
32
32
32
95
113
41
64
48
47
15
18
37
68
62
114
122, 125
38
138
29
11
135
36
130
23
49
49
49
71,72,74
77
Total Problem By 1-2 line Comments about your approach
Category
Time(m) Level /10 yourself? is interesting?
0 0 0 0 0
to CF-D3). It has problems categories, levels and quality (last 4 columns)
d Order style (CF-A to CF-D3) and prefer Topics-Based style
etermine a category, go ahead and solve in order. Read Info Page. Read end of this page.
0 C++ Solution Example

0 This is from Round 379. Here is the editorial
0 Video Solution - Solver to be (Java)
0 Video Solution - Eng Ahmead Raafat (Python)
0 Video Solution - Eng Youssef Ali
0 Video Solution - Eng Samed Hajajla
0 Video Solution - Eng Yahia Ashraf
0 Video Solution - Eng John Gamal
0 Video Solution - Eng Youssef El Ghareeb
0 Video Solution - Eng Muntaser Abukadeja
0 Video Solution - Dr Mostafa Saad
0 Video Solution - Eng Ahmed Rafaat (Python)
0 Video Solution - Eng Omar Ashraf
0 Video Solution - Eng Belal Abdulnasser (Pytho
0 Learn Calender Leap Year
0 Stable sort exercise
0 Video Solution - Eng Mohamed Salah
0 Video Solution - Eng Ahmed Salah
0 Video Solution - Eng Abanob Ashraf
0 Video Solution - Eng Mohamed Adel
0
0 Video Solution - Eng Salma Yehia
0 Video Solution - Eng Hossam Yehia
0
0
0
0
0 Video Solution - SolverToBe (Java)
0
0
0
0
0
0
0
0
0
0 Find O(n) Solution
0
0
0
0
0 Sol - text clarification
0
0
0
0
0
0 Sol
0
0
0 Editorial - Eng Ahmed Osama
0
0
0
0
0 Sol
0
0 See Rushiose's code in arena summary
0
0
0 Editorial
0
0 Sol
0
0 Video Solution - Eng Mohamed Nasser
0 Video Solution - Eng Ayman Salah
0
0 Sol
0 Sol
0
0
0
0
0 Sol
0
0
0
0
0
0
0
0
0
0
0 Sol
0
0
0
0 Sol
0
0
0
0 Video Solution - Eng Youssef El Ghareeb
0 Video Solution - Eng Mahmoud Adel
0
0
0
0 Sol
0
0
0 Video Solution - Solve to be (Java)
0 Sol
0 Sol
Read SPOJ users' comments about IO. See here
0 sol
0
0 Sol
0
0 Sol
0
0
0
0
0
0
0 Sol
0 Sol - Must Read
0 Sol
0
0
0 Sol
0 Sol
0 Sol
0
0 Explained in the tutorial videos
0
0
0
0
0
0
0 Needs Big Integer: Have it in your cpp library o
0
0
0
0 Video Solution - Solver to be
0 Sol to read
0 Sol
0 Sol
0
0
0 Sol
0
0
0
0
0
0
0
0
0 Sol
0
0
0
0 Sol
0
0
0
0
0
0 Video Solution - Solver to be
0
0
0
0 Sol
0
0
0 Sol
0 Sol to read
0 Sol
0
0
0
0
0
0
0
0
0
0
0 See editorials
0
0
0
0 Sol
0
0
0
0
0 Sol
0 Sol
0 Sol
0
0 Sol
0
0
0 Sol
0
0
0 Sol
0
0 Sol
0 Sol
0 Sol
0 Sol
0 Video Solution - Eng Aya Elymany
0 Sol
0
0
0
0
0
0 Sol
0
0
0
0
0 Sol
0
0
0
0 Sol
0 Reading: DP on Trees
0 Sol
0 Sol
0
0 Sol
0 Sol
0
0 Video Solution - Eng Moaz Rashad
0
0 Video Solution - Eng Magdy Hasan
0
0
0
0
0 Sol
0
0 Sol
0
0
0 Editorial - Eng Ahmed Osama
0
0
0 Sol
0
0 Sol
0
0
0
0
0
0
0
0 Sol
0 Sol
0
0 Sol
0 Sol - Text/Background Clarification
0
0 Learn Handling Precisions
0 Sol
0 Sol
0 Sol to read
0 Sol
0 Sol
0
0
0 Sol
0
0 Sol - Practice on min enclosing circle
0
0 Sol
0 Sol
0 Sol to read
0 Video Solution - Eng Mohamed Nasser. Don't
0 Sol
0
0 Sol
0 Sol
0
0 Sol
0 Sol
0 Sol
0 Sol
0 Sol
0 Sol
0 Sol
0
0
0 Sol
0 Sol
0 Sol
0
0 Sol
0 Sol
0 Sol
0
0 Use polygon cut
0 Use polygon cut
0
0 Sol
0 Sol
0
0
0
0 Sol
0 Sol
0
0
0
0
0
0
0
0 Sol
0
0
0 Video Solution - Eng Essam AlNaggar
0
0 Sol to read
0
0
0
0
0
0 Sol
0
0
0 Learn 0/1 BFS
0
0
0
0
0
0
0
0
0
0
0
0
0 Sol
0
0
0
0
0
0 Sol
0 Sol
0 Sol
0 Video Solution - Eng Aya Elymany
0
0 Sol to learn
0 Sol
0
0
0 Sol
0 Sol
0
0
0
0 Sol
0
0
0 Sol
0 Sol
0
0 Sol
0
0 Sol
0 Sol - read the statement clarification
0 Sol
0
0 Read first Euler Formula
0
0 Sol
0
0
0
0
0
0 Sol
0 Sol
0 Sol
0 Sol
0
0
0
0 Sol
0 Sol
0 Sol
0 Sol
0 Sol
0
0 Sol
0 Sol
0 Sol
0 Sol
0 Sol
0 Sol
0 Sol
0 Sol
0 Sol
0 Sol - 2 ways
0 Sol
0 Sol
0 Sol
0 Sol
0 Sol
0 Sol
0 Sol
0 Don't use DP. Check it later in editorial. Sol
0 Sol
0 Sol
0
0 Theory result to read
0
0
0 Sol
0
0
0
0
0
0 Sol
0 Sol
0 Sol
0
0
0 Sol
0 Sol
0
0
0
0
0
0
0
0
0
0
0
0
0 Sol
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0 Sol
0
0
0
0 Prove your Solution
0
0 Sol. Find proof (See editorial comments)
0
0
0
0
0
0
0 Prove
0
0 Sol
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0 Video Solution - Eng Mahmoud Mabrok
0
0
0
0 Sol
0
0
0
0 Sol
0
0
0
0
0 Sol
0
0
0 Find a formula
0 Video Solution - Eng Youssef El Ghareeb. Don't
0 Sol
0 Don't use big integer class. Write simple arra
0
0
0
0
0 Sol uses __int128 to avoid overflow
0 Sol
0
0
0
0 Sol to read
0
0
0
0 Video Solution - Eng Amr Saud
0 Sol to read
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0 Sol
0 Sol
0
0 Video Solution - Eng Youssef Ali
0
0 Video Solution - Eng Amr Saud
0
0
0
0
0
0 Sol
0
0 Sol to read
0
0 Sol to read
0
0
0
0
0
0
0 Sol
0 Sol
0
0 Sol
0
0
0
Or shorter:
0
0 https://github.co
m/ilyesLtifi/Comp
0 Sol etitive-
0 Sol Programming/blo
0 b/master/UVA/U
VA
0 Video Solution - Eng Amr Bahaa %2010325.cpp
0 Sol
0
0 Sol
0 Sol
0
0 Know Fermat’s Last Theorem (Ignore proof)
0
0 Learn Fermat's little theorem
0
0
0
0
0
0
0
0
0 Revise Probability
0 Sol
0 Sol
0 Sol
0 Sol
0
0 Sol
0
0 Sol
0 Sol
0
0 Sol - must read
0
0
0 Sol
0 Sol
0 Sol
0
0
0 Sol
0
0
0 Revise Expected Value
0 Sol
0
0
0
0
0
0
0
0 Sol Or shorter:
http://naivered.gi
0 thub.io/2016/07/
03/Problem_Solv
ing/UVa/UVa-
10168-
Summation-of-
Four-Primes/
Or shorter:
http://naivered.gi
thub.io/2016/07/
0 03/Problem_Solv
ing/UVa/UVa-
0
10168-
0 Summation-of-
0 Video Solution - Eng Moaz Rashad Four-Primes/
0
0 Sol to read
0
0 Sol
0 Sol
0
0
0 Sol. Don't implement as adhock/greedy/Pure
0 STL. Use a data structure.
0 Use rmq
0
0 Sol
0
0
0
0
0 Sol
0
0
0
0 Sol
0
0
0
0 Sol
0 Sol
0 See sscanf and sprintf usage
0 Sol
0 Sol
0
0 Sol
0
0
0 Sol
0
0 Sol
0 Sol
0 Sol
0 Sol
0 Sol
0 Can you get AC first submission
0 Can you get AC first submission?
0
0
0
0
0
0
0
0
0
0
0
0 Sol
0
0
0
0
0
0 Sol
0
0
0 Sol
0
0
0
0
0
0
0 Sol
0
0
0 Sol
0
0
0
Code to match with Col O Learning Order Video
1 Watch - Approaching Problem Statement
2 Watch - Thinking - On papers Not on PC
3 Watch - Measuring Algorithms Perfromance - 1
4 Watch - Elementary Math - Introduction
5 Watch - Number Theory - Modular Arithmatic
6 Watch - Combinatorics - Counting Principles
7 Watch - Graph Theory - Intro
8 Watch - Graph Theory - DFS
9 Watch - Computational Geometry - Intro
10 Watch - Computational Geometry - Point and Vector
11 Watch - Search Techniques - Binary Search
12 Watch - Thinking - Problem Simplification
13 Watch - Thinking - Brainstorm - Rank - Approach
14 Study STL
15 Watch - Combinatorics - Permutations and Combinations - 1
16 Watch - Combinatorics - Permutations and Combinations - 2
17 Watch - Training-Secrets of Success
18 Watch - Training-Secrets of Success
19 Watch - Number Theory - Fib, GCD, LCM, Pow
20 Watch - Prefix Sum
21 Watch - Graph Theory - BFS
22 Review - Recursion
23 Watch - DP - intro 1
24 Watch - DP - intro 2
25 Watch - Computational Geometry - Complex Number and 2D Point
26 Watch - Computational Geometry - Lines and Distances
27 Watch - Focused and Diffused Thinking
28 Watch - Graph Theory - MST - Kruskal
29 Watch - Intro to Greedy
30 Watch - Thinking - Concretely - Symbolically - Pictorially
31 Watch - Thinking - Problem Constraints
32 Watch - Number Theory - Primes
33 Watch - Algebra - Number Bases and Polynomials
34 Watch - Algebra - Patterns in Sequences
35 Watch - Algebra - Summations
36 Watch - Algebra - Basic Matrix Operations
37 Watch - Thinking - Problem Abstraction
38 Watch - Thinking - Problem Reverse
39 Watch - Search Techniques - Backtracking
40 Review bitmasking
41 Watch - DP - Subset Style
42 Watch - DP - Consecutive Ranges Style
43 Watch - DP - Nested Ranges Style
44 Watch - DP - General Ranges Style
45 Watch - Thinking - Incrementally
46 Watch - Thinking - Problem Domain re-interpretation
47 Watch - Number Theory - Factorization
48 Watch - Probability - First 9 videos
49 Watch - Thinking - Search Space and Output Analysis
50 Watch - Thinking - Observations Discovery
51 Watch - Game Theory - Intro
52 Watch - Thinking - Misc - Solution Verification - Implementation
53 Watch - Graph Theory - Dijkstra
54 Watch - Computational Geometry - Lines Intersections
55 Watch - Computational Geometry - Circles
56 Watch - Thinking - Error Inspection - History - Contest Strategy
57 Watch - DP - Building Output
58 Watch - DP - Counting
59 Watch - Thinking - Let's Put All Together
60 Watch - DP - Table Method
61 Watch - Graph Theory - Floyd Warshal
62 Watch - Measuring Algorithms Perfromance - 2
63 Watch - Graph Theory - Tree Diameter and Isomorphism
64 Watch Video - Expected Value
65 Watch - Data Structures - Segment Tree (2 vid)
66 Reading: DP on Trees
67 Watch - Two pointers technique
68 Watch - DP - Probability
69 Watch - DP - Masks (2 vid)
70 Watch - String Processing - Trie
71 Watch - DP - Sub-rectangle style
72 Watch - String Processing - KMP (2 vid)
73 Watch - DP - Games (2 vid)
74 Watch - Computational Geometry - Simple and Convex Polygons
75 Watch - Computational Geometry - Polygon Area - Centroid - Cut
76 Watch - Computational Geometry - Point in polygon
77 Watch - Graph Theory - Maximum Flow (2 vid)
78 Watch - Graph Theory - SCC (2 vid)
Category
Mostafa Category Level Quality
Code
adhoc, NA 1 0.5
adhoc, NA 1 0.6
adhoc, NA 1 1
adhoc, NA 1 1
adhoc, NA 1 1
adhoc, NA 1 1
adhoc, NA 1 1
adhoc, NA 1 1
adhoc, NA 1 1
adhoc, NA 1 1
adhoc, NA 1 1
adhoc, NA 1 1
adhoc, NA 1 1
adhoc, NA 1 1
adhoc, NA 1 1
adhoc, NA 1 1
adhoc, NA 1 1
adhoc, NA 1 1
adhoc, NA 1 1
adhoc, NA 1 1
adhoc 1 1.5
adhoc 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, NA 1 1.5
adhoc, calender, leap year 1 2 p1
adhoc, stable sort 1 2 p1
adhoc, stl 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhock, prefix sum 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2
adhoc, NA 1 2 p2
adhoc, NA 1 2
adhoc, NA 1 2 p2
adhoc, prefix sum 1 2
adhoc, prefix sum 1 3 p3
adhoc, constructive 1 3 p2
adhoc, cycle detection for iterated function1 3 p1
adhoc, prefix sum 1 4 p5
adhoc, constructive, sweep 1 4 p3
adhoc 1 4 p2
adhoc 1 4 p2
adhoc, canonical form, [unclear text] 1 4 p1
adhoc, coordinate systems, math or simulati1 4 p1
adhoc, sorting, [bubble sort] 1 4 p1
adhoc 1 4
adhoc 1 4
adhoc, string, math 1 4.25 p3
adhoc, constructive 1 4.25 p3
adhoc 1 4.5
adhoc, canonical form, bf or greedy 1 4.5 p2
adhoc, string prefix 1 4.5 p1
adhoc, constructive 1 4.5
adhoc, string parsing 1 4.5
adhoc, string parsing 1 4.5
adhoc, binary search, bitmasks or rmq 1 5 p3
adhoc, bitmasks, [=spoj iitkwpch] 1 5 p3
adhoc, impl 1 5 p3
adhoc, cyclic shifts, partial sum or segment1 5 p2
adhoc 1 5 p2
adhoc, sorting, [print the smallest lexicogra1 5 p2
adhoc 1 5
adhoc 1 5
adhoc, constructive, impl 1 5
adhoc, sortings, overflow 1 5.25 p3
adhoc 1 5.75
adhoc, bitmasks, binary search 1 6 p3
backtrack 2 2
backtrack 2 4
backtrack, graph, maximum independent s 2 4
backtrack, datastructures, impl 2 5 p3
backtrack, expression parsing 3 4 p3
backtrack, expression parsing, [cnf] 3 5 p4
bf 5 1.5
bf 5 2
bf 5 2
bf 5 2
bf, two pointers 5 3 p2
bf 5 3
bf, constructive 5 3
bf, impl 5 4 p2
bf 5 4
bf or greedy 5 4
bf or greedy 5 4
bf, constructive, impl 5 4
bf, impl 5 4
bf, impl 5 4
bf, datastructures 5 4.5
bf, combinatorics 5 4.5 p2
bf, math 5 4.5 p1
bf 5 4.5
bf, [cases] 5 5 p3
bf, prune, binary base, bitmasks 5 5 p3
bf, impl or greedy 5 5 p2
bf or greedy 5 5 p2
bf, bitmasks or dp_adhoc 5 5.5 p3
bf, math, logs, [one solution use complex 5 5.5 p2
bf or dp 5 5.5 p2
bf, hashing, impl, [idea that functions like f 5 5.5 p2
bf, graph, bitmasks 5 5.5 p3
binary search 6 2.5
binary search, doubles 6 2.5 p2
binary search 6 3
binary search or simulation 6 3.5
binary search, gcd 6 3.5
binary search, greedy, math, impl 6 4 p3
binary search, bf, left-right trick 6 4 p2
binary search 6 4
binary search 6 4
binary search, math 6 4 p2
binary search, lower bound 6 4.5 p2
binary search 6 4.5 p1
binary search, two pointers, armortized ana6 5 p3
binary search 6 5 p2
binary search, math or formula 6 5 p3
binary search, [counting subarrays with su6 5.5 p3
binary search, d&c, [issues in io, seems diffc6 6 p3
bst, greedy, combinatorics 8 5.5 p2
datastructures, stack 9 3 p4
datastructures, set 9 3
datastructures, stack or dp, [count the l 9 4 p4
datastructures, grid compress 9 4 p2
datastructures, impl 9 4 p2
datastructures, multimap, hashing, bf 9 4 p2
datastructures, impl, sortings 9 4
datastructures, impl 9 4.5
datastructures, impl, trees 9 4.5
datastructures, heap, min_max heaps, [restri 9 5 p4
datastructures, heap, min_max or bbst or s 9 5 p2
datastructures, sets intersections and unio 9 5 p2
datastructures, lists or sets merging 9 5.5 p3
datastructures, stack or rmq or segment tr 9 5.5 p2
datastructures, linked list, impl 9 5.5 p1
datastructures, stack & queue 9 6 p2
datastructures, heap, [counting subarrays w9 6.25 p4
dp, [use scanf, you may need to avoid mems10 3 p2
dp 10 3
dp, lcs 10 3
dp, math 10 3
dp, lcs 10 3.5
dp, 2d grid 10 4 p2
dp or greedy 10 4 p2
dp 10 4
dp, [knapsack] 10 4
dp, dp_memo 10 4
dp, graph, cc 10 4
dp, greedy, impl 10 4
dp, lis, [direct lis] 10 4
dp 10 4.5 p1
dp 10 4.5
dp 10 4.5
dp 10 4.5
dp 10 4.5
dp, dp_memo or greedy 10 4.5
dp, lis efficient, lis indices or segment tree 10 5 p3
dp, sieve, binary search 10 5 p3
dp, knapsack 10 5 p2
dp, datastructures or binary search, impl 10 5 p2
dp, lis, onlogn, reduce to efficient lis or dp, 10 5 p2
dp, observation 10 5 p2
dp 10 5
dp 10 5
dp, lcs, analysis 10 5
dp, graph or dijkstra 10 5 p2
dp, [non standard] 10 5.5 p4
dp, analysis 10 5.5 p3
dp, cases 10 5.5 p3
dp, mcm 10 5.5 p3
dp, primes 10 5.5 p3
dp, tree 10 5.5 p3
dp, bicoloring, is bipartite 10 5.5 p2
dp, dp_conting, dp_ranges 10 5.5 p2
dp, [non standard] 10 5.5 p2
dp, gcd 10 5.75 p4
dp, greedy 10 5.75 p3
dp, d&c 10 6 p2
dp, dp_adhoc, [non standard] 11 5 p2
dp, dp_bitmasks 13 4 p2
dp, dp_bitmasks, mask-all-subsets, [direct 13 5 p2
dp, dp_bitmasks, tsp or bfs, impl 13 5
dp, dp_bitmasks, binary search or adhoc 13 5.5 p3
dp, dp_bitmasks, floyd 13 6
dp, dp_build_output 15 3
dp, dp_build_output, [similar to edit distan 15 3.5 p3
dp, dp_build_output 15 4.5 p2
dp, dp_build_output 15 4.5
dp, dp_build_output 15 4.5
dp, dp_build_output, [edit distance] 15 4.5
dp, dp_counting 18 3
dp, dp_counting 18 3
dp, dp_counting, dp_trees 18 3.5
dp, dp_counting 18 4 p2
dp, dp_counting 18 4.5 p2
dp, dp_counting or perm, adhoc 18 5 p2
dp, dp_counting or math, combinatorics 18 5
dp, dp_counting, dp_bitmasks 18 6.25 p4
dp, dp_digit or impl 22 4.5 p1
dp, dp_digit, dp_bitmasks or adhoc 22 5 p3
dp, dp_digit or binary search 22 5
dp, dp_games, minimax 23 3 p3
dp, dp_games 23 3
dp, dp_games, dp_bitmasks or adhoc 23 3
dp, dp_games, [harmonic progression] 23 4 p3
dp, dp_games, dp_bitmasks or game theory23 4
dp, dp_games, dp_probability 23 4.5 p2
dp, dp_games 23 4.5
dp, dp_games or backtrack, minmax (alpah 23 5.5 p3
dp, dp_probability or probability 29 3.5
dp, dp_probability 29 4 p2
dp, dp_probability, [=pku 3071] 29 4.5 p3
dp, dp_probability 29 4.5 p2
dp, dp_probability 29 4.5 p2
dp, dp_probability, counting style 29 4.5 p2
dp, dp_probability 29 4.5
dp, dp_probability, combinatorics or adhoc29 5 p3
dp, dp_probability 29 5 p3
dp, dp_probability, dp_table, masks 29 5 p3
dp, dp_probability or combinatorics 29 5 p1
dp, dp_probability, dp_table, [independece 29 5.5 p3
dp, dp_probability or math, [hard text for f 29 5.5 p2
dp, dp_probability 29 6
dp, dp_ranges, lcs or backtrack 32 4.5 p3
dp, dp_ranges 32 4.5 p1
dp, dp_ranges, [consective ranges, cyclic p 32 5 p2
dp, dp_ranges, [consective ranges] 32 5 p1
dp, dp_ranges, impl, [consective ranges] 32 5
dp, dp_ranges, [consective ranges] 32 5
dp, dp_ranges, [consective ranges] or bf 32 5.5 p2
dp, dp_ranges 32 5.5
dp, dp_ranges 32 5.5
dp, dp_ranges, floyd, [cases] 32 6 p4
dp, dp_subrectangle, 1d, [more direct uva 36 3
dp, dp_subrectangle, 2d 36 3
dp, dp_subrectangle, 2d, [actually greedy v 36 5 p2
dp, dp_subrectangle, 2d, observations, dot 36 5.5 p3
dp, dp_table 37 4.5 p3
dp, dp_table, dp_roll 37 5 p3
dp, dp_table, dp_roll, dp_bitmasks, sortings37 5.5 p4
dp, dp_table or dp_bitmasks, all submasks o37 5.5 p4
dp, dp_trees, geometry or greedy 38 5 p3
dp, dp_trees or dsu-on-trees 38 5 p2
dp, dp_trees 38 5
dp, dp_trees or diameter like, [tricky to gues38 5.5 p4
dp, dp_trees 38 5.5 p2
dp, dp_trees or greedy 38 5.5 p2
dp, dp_trees, [vertex cover releated] 38 5.75 p2
game theory, greedy 41 2.5
game theory, gcd, dfs or pattern, [why each41 3.5 p2
game theory, adhoc 41 3.5 p2
game theory, gcd 41 4 p1
game theory, divisors, greedy 41 4 p1
geometry 45 2 p1
geometry, [slopes comparison] 45 3 p1
geometry 45 3
geometry, bf 45 3
geometry, physics 45 3
geometry, vectors addition 45 3
geometry, check square, point rotation, bf 45 3.5 p2
geometry 45 3.5
geometry, adhoc 45 4 p2
geometry, ccw, parametric equ, in circle 45 4 p2
geometry, angles, precision 45 4 p1
geometry 45 4
geometry 45 4
geometry, angles 45 4
geometry, datastructures 45 4
geometry, impl, [very nice, o(1) and o(n) so45 4.5 p3
geometry, formula or matrix determinant 45 4.5 p1
geometry, triangles, formula 45 4.5 p2
geometry, angles, physics 45 5
geometry 45 5 p3
geometry, binary search, interactive 45 5 p3
geometry 45 5 p2
geometry, [ppl scared in contest, but easy] 45 5 p2
geometry, bf, counting, treemaps 45 5 p2
geometry, binary search 45 5 p2
geometry, triangles, number theory 45 5 p2
geometry, plane graph 45 5
geometry, binary search or bf, greedy 45 5.5 p3
geometry, probability or algebra 45 5.5 p2
geometry, trapezoid formula, binary search45 6 p2
geometry, triangles, angles, parallelogram 45 6 p1
geometry, 3d, impl, math, [physics, kinemat46 5 p2
geometry, circles, [direct circle intersectio 47 2
geometry, circles, distances 47 2
geometry, circles, dsu 47 3 p1
geometry, circles 47 3
geometry, circles 47 3
geometry, circles 47 3.5
geometry, circles, impl 47 4
geometry, circles, impl 47 4
geometry, circles, polygon, [polyon inside p47 5 p4
geometry, circles, triangles, thales' theore 47 5 p3
geometry, circles, min enclosing circle, [=sp47 5 p2
geometry, circles, binay search 47 5.25 p3
geometry, circles, algebra, impl 47 5.5 p3
geometry, circles, tangents, point on segme47 5.5 p2
geometry, lines, distances, [=uva 460] 48 3 p3
geometry, lines, line up 48 3 p3
geometry, lines, distances, impl 48 3 p2
geometry, lines, impl 48 3
geometry, lines, intersection, shortest path48 3
geometry, lines, intersections 48 3
geometry, lines 48 3.5
geometry, lines, lines intersection, rectangle48 4
geometry, lines, polyline intersection, bf, n 48 4
geometry, lines, distances, adhoc 48 4 p3
geometry, lines, intersections, counting, fo 48 4 p1
geometry, lines, distances, floyd 48 5
geometry, polygon, area, [just triangle area49 2
geometry, polygon 49 4
geometry, polygon, pip, polygons intersecti49 4
geometry, polygon, pip, winding numbers, [p 49 4.5 p1
geometry, polygon, pip, polygons inside po 49 4.5
geometry, polygon, bf 49 5 p2
geometry, polygon, binary search 49 5 p2
geometry, polygon, pip, intersections or co 49 5.5 p3
geometry, polygon, pick's theorem 52 4.5 p1
geometry, polygon, pick's theorem, gcd 52 5
geometry, polygon, polygon cut 53 4
geometry, polygon, polygon cut or adhoc 53 6 p5
greedy, geometry 3
graph 55 3
graph, trees 55 3
graph, tree diameter 55 3
graph, adhoc 55 4 p2
graph, greedy 55 4 p2
graph, trees 55 4 p1
graph, trees, constructive 55 4
graph, tree diameter 55 4.5 p3
graph, bf 55 5
graph, cycle, greedy 55 5
graph, prove using e.g. scc 55 5
graph, trees, dfs, prefix sum or dp_trees 55 5.5 p5
graph, cycle 55 5.5 p3
graph, dp, sortings 55 5.5 p3
graph, greedy 55 5.5 p3
graph, greedy, [close to max cut] 55 5.5 p3
graph, tree diameter 55 5.5 p3
graph, bfs, multisrc, multidest 57 3 p3
graph, bfs 57 3
graph, bfs 57 4 p1
graph, bfs 57 4
graph, bfs 57 4
graph, bfs, chess or dfs 57 4
graph, bfs 57 4.5
graph, bfs, impl 57 4.5 p2
graph, bfs 57 4.5 p1
graph, bfs 57 4.5
graph, bfs, bitmask 57 4.5
graph, bfs, bitmask or bfs preprocess then 57 4.5
graph, bfs, dp or weighted matching 57 5 p3
graph, bfs or greedy, [search in 2d grid] 57 5 p2
graph, bfs, trie, hashing or meet in middle 57 5
graph, bfs 57 5.25 p2
graph, bfs, [chess, tricky cases] 57 5.5 p2
graph, bfs, 0/1 bfs, [~spoj kaththi] 57 5.5 p2
graph, bfs, cyclic games 57 5.5 p1
graph, bfs, interactive 57 6 p2
graph, dfs, [finish computation times] 60 3 p1
graph, dfs 60 4 p2
graph, dfs 60 4 p1
graph, dfs 60 4
graph, dfs 60 4
graph, dfs 60 4
graph, dfs 60 4 p2
graph, dfs, [reverse thinking] 60 4.5 p1
graph, dfs, impl 60 4.5 p1
graph, dfs 60 4.5
graph, dfs 60 4.5
graph, dfs, combinatorics, formula 60 5 p3
graph, dfs or directed articulation points a 60 5 p2
graph, dfs or dp_trees 60 5
graph, dfs, interactive 60 5.5 p3
graph, dfs 60 5.5
graph, dfs 60 5.5
graph, dfs, greedy 60 5.5
graph, dfs or dp 60 5.75
graph, dfs, bitset or persistent segment tre 60 6 p3
graph, dfs, fermat, [rearangement propper 60 6 p2
graph, dfs, flood-fill 61 2
graph, dfs, flood-fill 61 3.5
graph, dfs, flood-fill 61 3.5
graph, dfs, flood-fill 61 4
graph, dfs, flood-fill or bfs, bf 61 5 p3
graph, dfs, isomorphism or d&c, hashing 62 4 p2
graph, dfs, isomorphism, canonical form o 62 4.5 p4
graph, dfs, topological sort 63 2
graph, dfs, topological sort 63 3
graph, dfs, topological sort, cycles 63 4
graph, dfs, topological sort or dp 63 4 p3
graph, dfs, topological sort 63 4 p2
graph, dfs, topological sort, detect cycles 63 4
graph, dfs, topological sort 63 5 p3
graph, dfs, topological sort, binary search 63 5 p3
graph, dfs, topological sort, impl 63 5 p2
graph, dfs, topological sort or euler, [ 63 6 p4
graph, dijkstra 64 3
graph, dijkstra 64 3
graph, dijkstra 64 4.5
graph, dijkstra or dp 64 4.5 p3
graph, dijkstra, kth sp. [k <= 10] 64 5 p3
graph, dijkstra, 2 dijkstra 64 5 p3
graph, dijkstra 64 5.5 p3
graph, dijkstra, kth sp (k=2) or floyd 64 5.5 p3
graph, dsu 65 2
graph, dsu or dfs, cycles 65 4 p2
graph, dsu 65 4
graph, dsu 65 4
graph, dsu 65 4.5 p3
graph, dsu 65 4.5
graph, dsu 65 5
graph, dsu, [offline processing] 65 5 p3
graph, dsu, dijkstra like or binary search, bf65 5.5 p2
graph, floyd, path print 68 4 p3
graph, floyd, paths counting 68 4.5 p5
graph, floyd, minimax or dsu 68 4.5 p4
graph, floyd, binary search 68 4.5
graph, floyd 68 4.5
graph, floyd 68 5 p2
graph, floyd, dfs 68 5 p2
graph, floyd 68 5.25 p4
graph, floyd, antifloyd 68 5.5 p4
graph, floyd, dp 68 5.5 p2
graph, floyd 68 6.25 p2
graph, max-flow 71 3
graph, max-flow, vertex constraints 71 4
graph, max-flow, [direct bipartite is slow] 71 4.5 p3
graph, max-flow, vertex constraints, spars 71 5.5 p4
graph, max-flow, [vertex disjoint path/ supe71 5.5 p2
graph, max-flow, impl 71 5.5 p2
graph, max-flow, vertex constraints 71 6
graph, max-flow, bipartite match 72 4
graph, max-flow, bipartite match or impl 72 4.5
graph, max-flow, bipartite match 72 5 p3
graph, max-flow, bipartite match, min path 72 5 p2
graph, max-flow, bipartite match, min verte72 5.5 p4
graph, max-flow, bipartite match, max ind 72 5.5 p3
graph, max-flow, bipartite match, min path 72 5.5 p3
graph, max-flow, bipartite match, konig's 72 6 p3
graph, max-flow, min-cut, [print, as in vide 74 4.5 p1
graph, max-flow, min-cut, cut edges 74 5 p2
graph, max-flow, min-cut, vertex constraint74 5.25 p3
graph, max-flow, min-cut or dp 74 5.5 p3
graph, max-flow, min-cut 74 6 p3
graph, max-flow, min-cut 74 6.25 p3
graph, mst 76 3
graph, mst, 2nd mst 76 3
graph, mst, # of spanning trees of complete76 4 p2
graph, mst, 2nd mst 76 4.5 p1
graph, mst 76 5 p3
graph, mst, [cases], [validate tree] 76 5 p3
graph, mst, max spanning tree 76 5 p2
graph, mst, [prime fails] 76 5 p2
graph, mst 76 5 p1
graph, mst 76 5
graph, mst 76 5.25
graph, mst, combinatorics 76 6
graph, scc 77 3
graph, scc 77 3.5
graph, scc or topological sort, [=uva 11770 77 4.5 p1
graph, scc, hashing or dijkstra 77 5
graph, scc, greedy, [scc floyd] 77 5.5 p2
graph, scc 77 5.5
graph, bf, floyd, cycles or max flow 5.75
graph, scc, dp, [scc may help thoughts] 77 6 p3
graph, scc, probability, [more about probabi77 6.25
graph, scc, matrix or optimized bf, [using t 77 6.25 p5
greedy 84 2 p2
greedy 84 2
greedy 84 2
greedy 84 2
greedy, sorting, bitmasks 84 2.5
greedy, sorting 84 2.5 p2
greedy 84 2.5 p3
greedy, impl 84 3
greedy, impl 84 3
greedy, sorting 84 3
greedy, sorting or dp 84 3.5 p3
greedy, [cases] 84 3.5 p1
greedy, bf or binary search 84 4
greedy, sets, finding max k subarrays 84 4 p3
greedy, palindromes 84 4 p3
greedy, set or grid compress 84 4 p2
greedy 84 4 p2
greedy 84 4 p2
greedy 84 4 p2
greedy, math 84 4 p2
greedy, constructive 84 4
greedy, math 84 4
greedy 84 4
greedy, prefix sum 2d 84 4
greedy, sorting 84 4
greedy, simulation, priority queue 84 4.5 p3
greedy, [pigeonhole principle] 84 4.5 p2
greedy, datastructures or dp 84 4.5 p2
greedy, impl, [reverse thinking] 84 4.5 p2
greedy, constructive, [reverse thinking] 84 4.5 p1
greedy, math, [reverse thinking] 84 4.5 p1
greedy 84 4.5
greedy, constructive 84 4.5
greedy, constructive 84 4.5
greedy, impl 84 4.5
greedy, constructive 84 5
greedy or dp 84 5
greedy, math, binary search 84 5 p3
greedy, math, impl 84 5 p3
greedy, constructive 84 5 p2
greedy, dfs , tree 84 5 p2
greedy, dfs or bfs, greedy 84 5 p2
greedy, graph 84 5 p2
greedy, impl 84 5 p2
greedy, knapsack, math 84 5 p2
greedy, math, strings 84 5 p2
greedy, sortings 84 5 p2
greedy or bf 84 5
greedy, math or pattern or segment tree 84 5.5 p3
greedy, constructive 84 5.5 p3
greedy, interactive, constructive 84 5.5 p3
greedy, math, adhoc 84 5.5 p3
greedy, sort, prefix sum, [maybe solve srm 84 5.5 p3
greedy or dp or datastructures 84 5.5 p2
greedy, datastructures, stl 84 5.5 p2
greedy or dijkstra, [multiple start nodes] 84 5.5 p1
greedy, binary search, [strict time] 84 5.5
greedy, math, sorting or dp 84 6 p3
greedy, observations 84 6 p3
greedy, bf, mask, impl 84 6 p2
greedy, bf, impl 84 6
impl 86 1.5
impl 86 1.5
impl 86 1.5
impl, stl, set 86 1.5
impl 86 2
impl 86 2
impl 86 2
impl 86 2
impl 86 2
impl 86 2 p2
impl 86 2
impl 86 2
impl 86 2
impl 86 2
impl 86 2
impl 86 2
impl 86 2
impl 86 2
impl 86 2
impl 86 2
impl 86 2
impl, math 86 2
impl, sorting 86 2
graph, constructive, adhoc 86 3 p2
impl, recursion, tower of hanoi 86 3 p2
impl 86 4
impl 86 4
impl 86 4 p1
impl, constructive 86 4
impl, sorting, huffman coding 86 4
impl 86 4.5 p2
impl, math 86 4.5 p2
impl or segment tree or bit 86 5 p2
impl, math 86 5 p2
impl, math, [symbolic thinking] 86 5 p1
impl 86 5.25 p2
impl, greedy 86 5.5 p2
math 87 1.5
math, log, binary, pattern observation 87 2 p2
math, analysis 87 2 p3
math or bf 87 2 p1
math 87 2
math 87 2
math 87 2
math, combinatorics, bitmasks 87 2 p3
math 87 2.5
math 87 2.5
math 87 2.5
math, impl 87 2.5
math, numberr theory 87 2.5
math, __int128 87 3 p3
math, greedy, careful impl 87 3 p3
math, constructive 87 4 p3
math 87 4 p2
math, number theory 87 4 p2
math 87 4
math 87 4
math 87 4
math 87 4
math, log, [double limits] 87 4 p3
math or dp 87 4
math, constructive 87 4
math, impl 87 4 p2
math, pattern 87 4.25 p3
math or binary search 87 4.5 p2
math 87 4.5
math 87 4.5
math, bits 87 4.5
math, constructive 87 4.5
math, constructive, interactive 87 4.5
math, randomization, binary search, intera 87 5 p4
math, adhoc, palyndromes, [short code] 87 5 p3
math, binary search 87 5 p2
math, binary search, precision 87 5 p2
math, randomization 87 5 p2
math, impl, [cases] 87 5 p1
math, number theory, greedy 87 5 p1
math 87 5
math 87 5
math, equations, impl 87 5 p2
math, sortings 87 5
math, xor, bitwise, constructive 87 5.25 p3
math, repeated squaring, graph 87 5.5 p4
math or dp_tree 87 5.5 p2
math 87 5.5
math 87 5.5
math or dp_expectation 87 6 p3
math, combinatorics 89 2.5
math, combinatorics 89 2.5
math, mod 89 2.5 p3
math, combinatorics 89 4
math, combinatorics 89 4
math, combinatorics, counting 89 4
math, combinatorics 89 5 p3
math, combinatorics, constructive 89 5 p3
math, combinatorics, first/last k digits 2^ 89 5 p3
math, combinatorics 89 5.5 p4
math, combinatorics or dp_counting 89 5.5 p3
math, combinatorics, impl 89 5.5 p1
math, factorial 94 2.5
math, factorial, permutations, dublicates, f 94 4.5 p3
math, factorization 95 2
math, factorization 95 4 p1
math, factorization, primes, [factorize x!] 95 4
math, factorization 95 4.5 p3
math, factorization, divisors sum, multivie 95 4.5
math, factorization, case analysis 95 5
math, factorization, divisors sum 95 5
math, factorization 95 5.5 p3
math, factorization, gcd, lcm, observations 95 6 p4
math, factorization, primitve roots 95 6.25 p4
math, formula 98 5 p2
math, gcd, comb formula 99 2
math, gcd 99 3
math, gcd or adhoc 99 4
math, gcd, lcm 99 4
math, gcd, lcm, [overflow] 99 4.5 p3
math, gcd, lcm 99 4.5
math, gcd 99 5 p3
Or shorter:
math, gcd, lcm 99 5
https://github.co
math, gcd, mod, number theory 99 5.5 p1
m/ilyesLtifi/Comp
math, gcd, cases
etitive- 99 6 p3
Programming/blo
math, inclusion-exclusion, lcm 101 3
b/master/UVA/U
math, inclusion-exclusion, binary search 101 3
VA
math, inclusion-exclusion, gcd, overflow
%2010325.cpp 101 4
math, inclusion-exclusion 101 4
math, inclusion-exclusion 101 5.75 p2
math, inclusion-exclusion 101 6 p3
math, inclusion-exclusion 101 6 p3
math, infix to postfix 102 4
math, math_adhoc, fermat last theorm 104 2 p2
math, math_adhoc, polynomials 104 2
math, math_adhoc, fermat little theorm 104 3 p1
math, math_adhoc, patterns 104 3.5
math, math_adhoc, polynomials 104 3.5
math, matrix, matrix exponient 105 2.5
math, matrix, rotate, reflect, impl 105 3 p1
math, matrix, bf 105 4
math, matrix 105 4.5
math, mod 109 3
math, mod 109 5
math, mod, pow, greedy 109 5.5 p3
math, probability, formula, fraction style 113 2
math, probability 113 3
math, probability, fractions style 113 3
math, probability, conditional probability 113 4 p2
math, probability, fraction style, gcd 113 4
math, probability or log, ternary search 113 5 p4
math, probability, combinatorics, math 113 5 p2
math, probability, graph, cycle 113 5 p2
math, probability, greedy 113 5 p1
math, probability, integration 113 5.25 p3
math, probability, bf or dp 113 5.5
math, probability, factorial, logarithm, comb113 5.5 p3
math, probability, sorting 113 5.5 p3
math, probability, recursion, precision 113 5.5
math, probability, bitmasks or dp_probabilit 113 6 p3
math, probability, combinatronics 113 6
math, probability, formula 113 6
math, probability 113 6.25
math, probability, combinatorics 113 6.25
math, probability, expectation or dp_probab114 4
math, probability, expectation, bitmasks 114 4
math, probability, expectation, dfs 114 4
math, probability, expectation, permutatio 114 4
math, probability, expectation, greedy or d 114 4.5 p3
math, probability, expectation 114 4.5
math, probability, expectation, pattern 114 4.5
math, probability, expectation, linearity of 114 5 p3
math, probability, expectation, linearity of 114 5 p3
math, probability, expectation 114 5.5 p2
math, probability, expectation, dfs 114 5.5 p2
math, probability, expectation, dfs or dp 114 6 p3
Orprobability,
math, shorter: expectation, formula, gr 114 6 p3
http://naivered.gi
math, repeated squaring, mod, direct
thub.io/2016/07/ 115 3
03/Problem_Solv
ing/UVa/UVa-
10168-
Summation-of-
Four-Primes/
Or shorter:
http://naivered.gi
thub.io/2016/07/
03/Problem_Solv
math, sieve 117 3
ing/UVa/UVa-
math, sieve, factorization
10168-
117 3.5
math, sieve, factorization, tricky big # test
Summation-of- 117 4 p2
Four-Primes/
math, sieve 117 4
math, sieve, palindromes 117 4.5 p3
math, sieve 117 4.5 p2
math, sieve, [last non zero digit of permuta117 5.5 p2
math, sieve, binary search 117 5.5
math, sieve, dfs, dp 117 5.5
math, summations 118 4.5 p3
math, summations, [in my videos] 118 5 p3
math, summations, seperate summations or118 t 5 p2
math, summations, bf, [overflow] 118 6 p2
rmq, d&c or datastructure, [largest recta 122 4.5 p4
rmq, binary search or bit or two pointers 122 5 p3
rmq, sparce table, binary search or datastr 122 5 p3
rmq, binary search, gcd, analysis or stack 122 5.5 p2
search, d&c, greedy 123 4.5
segment tree, [interval sum query] 125 2 p3
segment tree or bit, [~=tju 3440] 125 2
segment tree 125 3.5
segment tree, lazy propagation 125 4 p3
segment tree, lazy propagation or bit 125 4 p1
segment tree, sieve 125 4 p1
segment tree, [max pair sum] 125 4.5 p3
segment tree or adhoc 125 4.5 p2
segment tree, impl 125 4.5 p2
segment tree, lazy propagation, [edu] 125 4.5 p1
segment tree, lazy propagation, circular 125 4.5
segment tree, [bracket balance, 2 values in 125 5 p3
segment tree, [max sum, part of gss series 125 5 p3
segment tree, rmq shift 125 5 p3
segment tree 125 5 p2
segment tree, lazy propagation or datastru 125 5 p2
segment tree, lazy propagation, greedy or 125 5 p2
segment tree, dp or dp 125 5 p1
segment tree or wavelet tree, [boring, inv 125 5 p1
segment tree, [max sum+updates, spoj gss1125 5.5 p5
segment tree, lazy propagation, impl, [weak125 5.5 p4
segment tree, [~=spoj gss5], [spoj gss1] 125 5.5 p3
segment tree or bit, [classical] 125 5.5 p2
segment tree, [skyline overlap, tle] 125 5.5
segment tree, kth element or bit or bst or t 125 5.75 p3
segment tree, lazy propagation, [handle d 125 6 p3
segment tree, prefix sums or adhoc, recurs 125 6 p3
simulation, formula, [was, tricky] 126 2 p2
simulation, tricky 126 2 p1
simulation 126 3
string processing, kmp, [count word freque130 2
string processing, kmp, [find words positio130 3
string processing, kmp 130 4 p4
string processing, kmp, period max or suffi130 4.5 p3
string processing, kmp or z-function 130 5 p3
string processing, kmp or z-function, [~cf 130 5 p3
string processing, kmp 130 5.25 p2
string processing, kmp 130 5.5
string processing, trie 135 3.5
string processing, trie 135 4.5 p3
string processing, trie, trie using map, pretty
135 4.5 p3
string processing, trie 135 5 p2
string processing, trie, [xor] 135 5.5 p3
two pointers or adhoc 138 3
two pointers or binary search, combinatori138 4 p2
two pointers or dp 138 4.5
two pointers, [different solutions] 138 5 p3
two pointers 138 5 p2
two pointers or adhoc or kmp-like 138 5 p2
two pointers 138 5
two pointers, binary search 138 5
two pointers 138 5.5 p3
two pointers or adhoc 138 5.5 p2
two pointers, dp or greedy 138 5.5 p2
two pointers or segment tree 138 5.5
tatement
ot on PC
erfromance - 1
duction
ar Arithmatic
ng Principles
y - Intro
y - Point and Vector
nary Search
plification
Rank - Approach
ations and Combinations - 1

ations and Combinations - 2
cess
CD, LCM, Pow
y - Complex Number and 2D Point

y - Lines and Distances
hinking
ruskal
Symbolically - Pictorially
straints
s
s and Polynomials
quences
Operations
traction
erse
cktracking
s Style
le
yle
main re-interpretation
ization
s
e and Output Analysis
Discovery
on Verification - Implementation
y - Lines Intersections
y - Circles
ion - History - Contest Strategy
Together
arshal
erfromance - 2
meter and Isomorphism
ent Tree (2 vid)
P (2 vid)
y - Simple and Convex Polygons

y - Polygon Area - Centroid - Cut
y - Point in polygon
m Flow (2 vid)
vid)
AC Averages => 0 ### 0 0 0 0
- Problems in this topics2 page don't exist in any other sheet (A, B, C, D, T
- For juniors, you should ignore this page till finish the previous sheets FIRS
- These topics represent 'most' of the other algorithms that seniors may lea
- Problems per topic cover range of easy to medium level (hard Div2-D)
- The purpose is to allow some of the trainees who want to expand in severa
specific topic
- 50-70% of the problems here will be of right level/quality. However, many o
refinements may occur based on feedback
- Help me refine this list. Consider these cases:

- Problem that is so bad somehow
- Problem of 'p3, p4, p5' quality but actually is a repeated idea or not interes
- Problem of 'empty, p1, p2' quality but actually is very interesting to solve
- Problem of really wrong level (so easy/so hard) relative to my reported lev
If any of these issues, email me: mostafa.saad.fci@gmail.com
Also, if a problem doesn't have an editorial and you could provide it = great!
SRM629-D2-500
SPOJ KOPC12A
SPOJ TRICKTRT
CF439-D2-D
SRM287-D1-500
CF250-D2-D
UVA 10385
CF101102-GYM-I
CODECHEF AMITNITI
SPOJ SUBSUMS
SPOJ ABCDEF
SPOJ SUMFOUR
AtCoder026-AGC-C
CF490-D2-D
CF525-D2-E
CF1006-D3-F
CSA67-E
CF585-D1-D
SPOJ MATSUM
SPOJ MSE06H
UVA 1428
UVA 11495
SRM315-D2-1000
SRM424-D1-1000
SPOJ ORDERSET
UVA 12697
CF501-D2-D
SPOJ BRICKS
UVA 1513
CF538-D12-F
SRM488-D1-250
SRM568-D2-1000
SRM334-D1-500
SRM318-D1-500
CF102190-GYM-B
UVA 11755
CF837-D12-D
SRM511-D1-500
LightOJ 1126
CF1140-D12-E
SRM508-D1-500
CF559-D1-C
CF351-D1-C
CF30-D12-C
SRM249-D1-250
TC(BANKLOTTERY)
SRM518-D2-1000
SRM402-D2-1000
SRM533-D2-1000
SRM420-D1-500
UVA 10288
SRM561-D2-1000
CF697-D2-D
CF602-D2-E
SPOJ MMMGAME
SRM558-D2-1000
UVA 11892
SPOJ HUBULLU
PKU 1704
HACKR MOVE-THE-COINS
SPOJ QCJ3
UVA 11859
CODECHEF PSHTBRTH
HACKER prime-game-1
CF88-D2-E
CF15-D12-C
HACKR digits-square-board-1
CF256-D1-C
CF87-D1-C
CF604-D2-E
TIMUS 1540
SRM389-D1-1000
SPOJ TRIOMINO
CODECHEF ADAPWNS
SPOJ BSHEEP
LIVEARCHIVE 4558
UVA 11626
SPOJ VMILI
UVA 109
UVA 11168
UVA 361
UVA 10652
UVA 10750
SPOJ NKMARS
SPOJ CEPC08B
PKU 1177
CF101147-GYM-I
CF100622-GYM-C
SPOJ NICEDAY
SPOJ SHORTCUT
SPOJ WILD
HACKR spheres
UVA 10297
UVA 11817
LIVEARCHIVE 2233
CF203-D2-D
CF65-D12-C
SPOJ BLCONE
UVA 11232
ZOJ 2369
LIVEARCHIVE 2474
UVA 10449
UVA 10557
UVA 558
CF101498-GYM-L
UVA 11090
TIMUS 1137
UVA 117
UVA 10596
SRM268-D1-500
UVA 10054
CF788-D1-B
SRM298-D1-500
CF789-D2-D
CF1038-D2-E
SPOJ SCITIES
UVA 10594
TJU 2554
TC(ANGELDEMONGAME)
LIVEARCHIVE 2884
SPOJ BUGLIFE
LIVEARCHIVE 4185
CF228-D2-E
CF776-D2-D
CF469-D2-D
CODECHEF ADAMTR
LIVEARCHIVE 5010
PKU 2723
UVA 1146
SRM464-D1-500
UVA 10199
SPOJ SUBMERGE
UVA 315
UVA 10765
UVA 796
UVA 610
SPOJ QTREE2
CF192-D2-E
SPOJ DISQUERY
CF832-D2-D
CF519-D2-E
TIMUS 1752
CF466-D2-E
CF587-D1-C
CF863-D12-E
UVA 870
CF243-D1-C
UVA 308
UVA 306
SRM572-D1-250
CF986-D1-B
SRM391-D1-500
SRM379-D2-1000
FbHkrCup 18-R1-B
SPOJ LEONARDO
SRM280-D2-1000
SPOJ SEQ
SPOJ FIBTWIST
TJU 2300
UVA 10229
SPOJ SUMSUMS
CF222-D2-E
CF582-D1-B
CF621-D2-E
SPOJ PLHOP
UVA 11605
LIVEARCHIVE 4332
CF821-D2-E
SPOJ XMAX
CF1155-D12-E
CODECHEF TREASURE
TIMUS 1042
UVA 684
LIVEARCHIVE 4305
UVA 10104
UVA 10673
CF100812-GYM-L
UVA 10090
HACKR solve-equations
SRM385-D2-1000
LightOJ 1306
CF100506-GYM-C
UVA 11768
LIVEARCHIVE 5990
HACKR game-of-throne-ii
CF327-D2-C
HACKR choose-and-calculate
SRM467-D1-500
LIVEARCHIVE 4506
SRM735-D1-500
CF146-D2-E
SPOJ DIVEQL
SPOJ KOPC12B
CF816-D2-D
CF689-D2-E
CF785-D2-D
CF521-D1-C
UVA 11327
SPOJ DCEPCA03
CF101778-GYM-C
CF1009-D2-D
UVA 11424
UVA 10820
UVA 11426
UVA 10990
CF114-D2-F
CF100957-GYM-F
TIMUS 1456
LIVEARCHIVE 2116
CF900-D2-D
SPOJ SQFREE
CF803-D12-F
SPOJ SUB_PROB
SRM519-D1-500
SRM557-D2-1000
LIVEARCHIVE 5064
TIMUS 1269
CODECHEF LYRC
UVA 12244
SPOJ SUBST1
SPOJ MINMOVE
SPOJ SUBLEX
UVA 11107
SPOJ LPS
SPOJ LONGCS
CF113-D1-B
CF123-D1-D
LIVEARCHIVE 4477
CF149-D2-E
CF129-D2-D
SPOJ PLD
SPOJ ELCS
CF1003-D3-F
CF533-D1-E
CF101741-gym-K
CF101808-gym-B
HACKER kriti-and-her-birthday-gift
CF245-D12-H
CF1056-D12-E
CF101864-GYM-J
CF727-D2-E
CF985-D12-F
CF101627-GYM-D
SPOJ TWIST
SPOJ ADAAPHID
SPOJ HEAPULM
CF101864-GYM-K
SPOJ CERC07S
kattis hanoi18.lazylearner
SPOJ GSS6
UVA 12003
CF38-D12-G
SPOJ MEANARR
SPOJ DQUERY
CODECHEF IITI15
CF220-D1-B
HACKER substrings-count-3
SPOJ RACETIME
SPOJ ZQUERY
Timus 1167
CF321-D1-E
SPOJ NKLEAVES
HACKER sprint5-mining
CF834-D2-D
TIMUS 1553
SPOJ QTREE3
SPOJ QTREE
SPOJ GRASSPLA
PKU 2763
SPOJ GOT
CF101856-GYM-E
From a trainee:
CF321-D1-C txt clarification:
CF766-D2-E In this problem
FJ can actually
CF101174-GYM-F REARRANGE
CF914-D12-E the plots and
then groups
CF715-D1-C them. * I
LIVEARCHIVE 5133 misunderstood
SPOJ ACQUIRE the statement by
the word
CF319-D1-C 'successive'
CF1083-D1-E
CODECHEF CYCLRACE
CF311-D1-B
CF570-D2-D
CF208-D2-E
HACKER the-grass-type
CF246-D2-E
SGU 507
CF1009-D12-F
CF291-D2-E
CF103-D1-D
SPOJ FREQ2
CF797-D12-E
CF342-D2-E
CF13-D12-E
HACKR competitive-teams
CF551-D2-E
CODECHEF DOCSDEL
UVA 10304
UVA 12836
SPOJ BRKSTRNG
CODECHEF CHEFAOR
HACKER special-pairs-7
CF383-D1-E
CF165-D2-E
HACKER uchiha-brothers-and-two-products-circuit
CF632-D12-E
SPOJ POLYMUL
In case you want some (subjective) order to study these topics

This color means covered in my channel
geometry, sweep line

graph, lca
dp, dp_convex_hull
mo's Algorithm
sqrt decomposition
game theory, nim
game theory, grundy
string processing, polynomial hashing
graph, min-cost-max-flow
ternary search
binary indexed tree
math, extended gcd
math, mod inv
graph, scc, articulation point
graph, scc, biconnected components
math, matrix, matrix pow
graph, euler tour
dp, dp_d&c_opt
dp, dp_expectation
graph, bellmanford
meet in middle
graph, heavy light decomposition
graph, dsu-on-trees
graph, centroid-decomposition
grid compress
math, matrix, gaussian elimination
dp, dp_knuth
dp, dp_state_reduce
dp, dp_sos
graph, scc, 2-sat
math, cyclic permutation
string processing, suffix array
balanced binary search tree
math, diophantine
math, totient
math, mobius
string processing, aho_corasick
geometry, polygon, convex hull
math, fft
dp, dp_cyclic
geometry, 3d
Total Problem By 1-2 line Comments about your approach
Category
Time(m) Level /10 yourself? is interesting?
0 0 0 0 0
any other sheet (A, B, C, D, Topics1)
nish the previous sheets FIRST
orithms that seniors may learn
edium level (hard Div2-D)
who want to expand in several algorithms before going deeper or whoever want to enhance a
evel/quality. However, many of them are not evaluated by enough (or no) trainees. More future
a repeated idea or not interesting

y is very interesting to solve
d) relative to my reported level
.fci@gmail.com
d you could provide it = great!
Read the editorials
Sol
Sol
Don't use segment tree or pure STL. Sol

Sol
Sol-must read
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Notes to read
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol must read - video code has bug
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Prove your solution
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Find grid-compress based idea
Sol
Understand TC editorial
Sol
See Editorial
Sol
Sol.
Sol
Sol
Sol
Sol
Sol
Editorial (Google Sol)

Sol
Sol(no editorial)
Sol
Sol
Test cases are wrong. Case 1 4 1 82: judge out
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol - See CF post
Read this solution after trying

SolToMe
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Discu
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Sol (not intended)
Sol
Sol
Sol
Sol
Sol
Sol
Sol
Use knuth
Use knuth
Sol
Find O(NK) Sol
order to study these topics:

Category
Mostafa Category Level Quality
Code
ternary search 10 2
ternary search 10 3
ternary search 10 3
ternary search 10 3.5
ternary search, math 10 4
ternary search, discrete, geometry 10 5 p5
ternary search, tricky 10 5 p5
ternary search 10 6
meet in middle, bitmasks 11 3.5
meet in middle 11 4 p3
meet in middle 11 4
meet in middle, hashing, [solve SPOJ ABC 11 4.5
meet in middle, bf, hasing 11 5 p3
meet in middle, bfs 11 5
meet in middle, bitmasks, ternarymask 11 5.5 p1
meet in middle, dp 11 6 p3
meet in middle, dp, bitmasks, [non standa11 6.25 p5
meet in middle, [strict tl] 11 6.25 p2
bit, 2d bit 15 3
bit or merge sort, [=SPOJ RATING] 15 4 p3
bit or segment tree or datastructures 15 4 p2
bit or merge sort, game, [count inversion]15 4
bit or segment tree, [jouseph problem] 15 4.5 p2
bit 15 5
bit or segment tree or bbst, grid compress15 5.5 p3
bit or segment tree or solutions-bag 15 6 p4
bit, factoradics, permutation or order-stat 15 6 p4
bit, count inversion or merge sort, [= 15 6 p3
bit or segment tree, [standard] 15 6 p2
bit or segment tree, math or adhock 15 6.25 p4
dp, dp_cyclic, dp_expectation or dp_dept17 5
dp, dp_cyclic, expectation, [algebra handl17 5
dp, dp_cyclic 17 6
dp, dp_cyclic, expectation or bf, simulatio17 6
dp, dp_cyclic, dp_probability or dp_depth17 6.25 p3
dp, dp_cyclic, dp_probability or dp_depth17 6.25
dp, dp_state_reduce 18 5
dp, dp_state_reduce, dp_games 18 5
dp, dp_state_reduce, knapsack 18 5.5 p3
dp, dp_state_reduce, dp_counting 18 6 p2
dp, dp_state_reduce, dp_counting 18 6
dp, dp_state_reduce, dp_counting, inclu 18 6.25 p4
dp, dp_state_reduce, matrix pow 18 6.25 p3
dp, dp_probability, dp_expectation, max- 30 3.5
dp, dp_probability, dp_expectation, recur 30 4
dp, dp_probability, dp_expectation, recur 30 4
dp, dp_probability, dp_expectation 30 4.1
dp, dp_probability, dp_expectation 30 4.5
dp, dp_probability, dp_expectation or exp30 5 p2
dp, dp_probability, dp_expectation, dp_tabl 30 5 p2
dp, dp_probability, dp_expectation, gcd, fr30 5 p2
dp, dp_probability, dp_expectation, linear30 5
dp, dp_probability, dp_expectation or exp30 6 p3
dp, dp_probability, dp_expectation, lineari30 6.25 p3
game theory, nim, misere nim, [=LIVEA 34 3 p3
game theory, nim 34 3
game theory, nim 34 3
game theory, nim, [need a prove] 34 3
game theory, nim, [=UVA 11534] 34 4
game theory, nim, nim on tree 34 6.25 p3
game theory, grundy 35 3 p3
game theory, grundy, seive 35 4.5
game theory, grundy, segment tree 35 5 p5
game theory, grundy, sieve 35 5 p1
game theory, grundy, dp on segment tree35 5.5 p3
game theory, grundy, xor properties or g 35 5.5 p3
game theory, grundy, primes 35 5.75 p2
game theory, grundy, dp on segment tree35 6 p4
game theory, grundy, bitmasks 35 6 p3
game theory, grundy, mex sub-states fi 35 6 p3
game theory, grundy, observations 35 6 p3
geometry, polygon, convex hull 42 4
geometry, polygon, convex hull 42 4.5
geometry, polygon, convex hull, [print CH42 4.5
geometry, polygon, convex hull 42 5 p1
geometry, polygon, convex hull 42 5 p1
geometry, polygon, convex hull, distance 42 5
geometry, polygon, convex hull, pip 42 5
geometry, polygon, convex hull, rotate, p 42 6
geometry, sweep line, closest pair, [~=UR44 3.5
geometry, sweep line, [rectangles area, in44 4 p3
geometry, sweep line, polyline or greedy,44 4.5 p2
geometry, sweep line or segment tree, [re44 5 p3
geometry, sweep line, circles 44 5.5 p3
geometry, sweep line, [https://github. 44 5.5 p2
geometry, sweep line or segment tree, sor44 6 p3
geometry, sweep line, impl or bf 44 6 p3
geometry, sweep line, sets 44 6.25
geometry, 3d, ternary search 45 3.5
geometry, 3d, cones, volumes, formula 45 4
geometry, 3d, great circle distance 45 4
geometry, 3d, sphere, floyd 45 4.5
geometry, 3d, impl, math, [physics, kinem45 5 p3
geometry, 3d, lines, distances, binary sea45 5 p1
geometry, 3d, binary search 45 5
geometry, 3d, [differentiation needed for p45 5.5
geometry, 3d, integration, simpson, [cylin45 6
geometry, 3d, sphere, bf, next_permutati 45 6
graph, bellmanford 47 3
graph, bellmanford 47 3.5
graph, bellmanford 47 4
graph, bellmanford, [~CODECHEF BEST47 6 p4
graph, bellmanford, Minimum Mean Weigh 47 6.25 p4
graph, euler tour 54 3.5
graph, euler tour, dijkstra 54 3.5
graph, euler tour, is there euler cycle? 54 3.5
graph, euler tour, handshaking lemma, cc54 5 p1
graph, euler tour 54 5
graph, euler tour, combinatorics 54 5.25 p3
graph, euler tour, [solve first SRM268-D154 6 p3
graph, euler tour, math, [required a solid 54 6.1 p4
graph, euler tour 54 6.1 p3
graph, min-cost-max-flow, weighted bipar59 4.5
graph, min-cost-max-flow 59 5
graph, min-cost-max-flow 59 6 p4
graph, min-cost-max-flow 59 6
graph, scc, 2-sat or greedy 62 3
graph, scc, 2-sat, [simple dfs, Bipartite gr 62 4
graph, scc, 2-sat 62 5
graph, scc, 2-sat, dsu, topological sort or 62 5
graph, scc, 2-sat 62 5.5
graph, scc, 2-sat or dsu or greedy 62 6 p4
graph, scc, 2-sat 62 6 p3
graph, scc, 2-sat 62 6.25
graph, scc, articulation point 63 3 p3
graph, scc, articulation point 63 3
graph, scc, articulation point 63 3
graph, scc, articulation point or dsu, bf 63 4
graph, scc, biconnected components 64 4
graph, scc, biconnected components, [= 64 5.5 p3
graph, lca, [in video, ~=PKU 1986, LIV 65 4
graph, lca, [or with dp, binary lifting] 65 5 p3
graph, lca, dp, binary lifting, [educational 65 5 p3
graph, lca. math 65 5 p2
graph, lca, lca on tree, rmq, impl 65 5.5 p3
graph, lca, tree diameter, [~=KATTIS touri65 5.75 p3
graph, lca or dsu, offline queries 65 6.25 p3
graph, lca, dp, binary lifting, impl or segm65 6.25 p3
grid compress, prefix sum or segment tre67 6
grid compress, rectangles, dfs, counting 67 6
grid compress, dfs or bfs 67 6.5
grid compress, flood-fill 67 6.5
math, cyclic permutation 84 3
math, cyclic permutation or dfs 84 3
math, cyclic permutation 84 5 p2
math, cyclic permutation, stirling number 84 5 p2
math, cyclic permutation or backtrack, ds 84 5
math, cyclic permutation, dfs, trees 84 5.5 p2
math, cyclic permutation, graph cycles, e 84 5.75 p4
math, cyclic permutation or backtrack, 84 5.75 p3
math, matrix, matrix pow 89 3
math, matrix, matrix pow, [fib] 89 3
math, matrix, matrix pow 89 3.5 p3
math, matrix, matrix pow, fib, or pattern [d89 4 p2
math, matrix, matrix pow, [basic hint in vi 89 4.5 p1
math, matrix, matrix pow or dp 89 4.5
math, matrix, matrix pow, matrix pow max89 5 p5
math, matrix, matrix pow or dp, d&c 89 5.5 p3
math, matrix, matrix pow, graph, matrix po89 6 p4
math, matrix, matrix pow, linearity of expe89 6 p3
math, matrix, matrix pow, reccurance, gen89 6 p3
math, matrix, matrix pow, impl 89 6 p2
math, matrix, gaussian elimination, gauss90 5.5 p5
math, matrix, gaussian elimination 90 5.5 p2
math, matrix, gaussian elimination, bitset 90 6 p3
math, matrix, gaussian elimination 90 6
math, matrix, gaussian elimination 90 6
math, matrix, gaussian elimination, deter 90 6
math, extended gcd 94 3
math, extended gcd or gcd, simple math 94 3
math, extended gcd, totient 94 5 p1
math, extended gcd 94 5
math, extended gcd, geometry 94 5.5
math, diophantine 95 4.5
math, diophantine, extended gcd 95 5.5 p2
math, diophantine, extended gcd or number 95 6
math, diophantine, extended gcd, lattice 95 6.25
math, mod inv 96 4
math, mod inv, factorial inv or permutatio 96 4
math, mod inv 96 5
math, mod inv, combinatorics, binomial co96 5
math, mod inv, fermat's little theorem 96 5
math, mod inv, dp, combinations 96 5.5
math, mod inv, [easier version Timus 11396 6 p3
math, mod inv, factorial, dp_counting 96 6 p3
math, mod inv, gcd 96 6 p3
math, mod inv, combinations, pattern 96 6 p2
math, mod inv, combinatorics 96 6 p1
math, mod inv, combinatorics, impl 96 6
math, mod inv, summations, combinatoric96 6.25 p5
math, mod inv, factorials, combinatorics, 96 6.25 p4
math, totient 97 3
math, totient 97 4.5
math, totient 97 5 p2
math, totient, [cases] 97 5
math, totient, sieve, sums, gcd 97 5
math, totient 97 6 p3
math, totient 97 6
math, totient 97 6.25 p2
math, totient, sieve 97 6.25
math, mobius 98 4
math, mobius, inclusion-exclusion or dp_c98 6 p3
math, mobius, inclusion-exclusion 98 6.25 p4
math, mobius, inclusion-exclusion 98 6.25 p3
string processing, aho_corasick or suffix 103 4
string processing, aho_corasick 103 5
string processing, aho_corasick, dp or km103 5
string processing, aho_corasick, dp 103 6
string processing, aho_corasick or suffix 103 6.25 p2
string processing, suffix array, lcp, distinc104 3 p3
string processing, suffix array, lcp, sm 104 4 p1
string processing, suffix array 104 4
string processing, suffix array, lcp, b 104 5 p5
string processing, suffix array, lcp or rol 104 5 p3
string processing, suffix array, lcp, LCS 104 5 p2
string processing, suffix array 104 5.5
string processing, suffix array or suffix a 104 5.5
string processing, suffix array, [solve fir 104 5.5
string processing, suffix array or kmp or 104 6 p4
string processing, suffix array, Kth lexogr 104 6 p4
string processing, rolling hash, longest 105 4 p1
string processing, rolling hash 105 4
string processing, rolling hash 105 5 p2
string processing, rolling hash 105 5.5 p3
string processing, rolling hash, mo's algo 105 6 p3
string processing, rolling hash, dp 105 6 p2
string processing, rolling hash, math 105 6 p2
string processing, rolling hash, two pointe105 6 p2
string processing, rolling hash 105 6
string processing, rolling hash 105 6.25 p4
string processing, rolling hash, greedy, b 105 6.25 p3
bbst, treap 106 5 p2
bbst, treap or segment tree 106 5 p2
bbst, treap or cartesian tree or order-statis106 5
bbst, treap 106 6 p3
bbst, treap, segment tree, lazy or splay tr 106 6 p3
bbst, treaps, impl, offline query answerin 106 6 p3
bbst, treap or splay tree or avl tree, [sol 106 6 p2
bbst, treap, impl 106 6
bbst, treap, binary search 106 6.25 p3
bbst, treap or bit 106 6.25 p2
mo's algorithm or segment tree persistence 107 4
mo's algorithm, bit, [count inversion] 107 5 p1
mo's algorithm 107 5
mo's algorithm 107 5
mo's algorithm or segment tree or sqrt de107 5
mo's algorithm, [strict time/mem], [~ 107 6.25
dp, dp_d&c_opt or dp 112 5
dp, dp_d&c_opt or dp_knuth, [standard prob 112 6 p2
dp, dp_d&c_opt, [standard], [~UVA 125 112 6
dp, dp_d&c_opt or dp_convex_hull or dp 112 6.25 p4
dp, dp_d&c_opt, segment tree, [Mido: When 112 6.25 p4
graph, hld, lca 122 5 p2
graph, hld or segment tree or bfs 122 5
graph, hld, lca, segment tree or splay tree,122 5
graph, hld, segment tree 122 5
graph, hld or lca, bit 122 5.5 p2
graph, hld or lca, segment tree, presist 122 6 p2
graph, centroid-decomposition, primes 123 5 p2
graph, centroid-decomposition, [tutorial p 123 5.25
graph, centroid-decomposition or dp_tree123 5.5 p3
graph, centroid-decomposition or dsu-on-123 5.5 p3
graph, centroid-decomposition, bitmasks or 123 6 p3
graph, centroid-decomposition, dp, math or 123 6
dp, dp_convex_hull, [needs bbst (e.g. set)124 6 p4
dp, dp_convex_hull, [type 1], [in editoria 124 6 p3
dp, dp_convex_hull or LiChao, [straightfo124 6
dp, dp_convex_hull or segment tree, LiChao 124 6
dp, dp_convex_hull, dynamic, [https:/ 124 6.25 p3
dp, dp_convex_hull, [practice problem] 124 6.25
graph, dsu-on-trees or graph, euler tour, 125 4 p1
graph, dsu-on-trees or trees, dfs, binary 125 4
graph, dsu-on-trees 125 5
graph, dsu-on-trees, [standard] 125 5
graph, dsu-on-trees, [standard, , [Main a 125 5.5 p2
graph, dsu-on-trees, [standard] 125 5.75 p2
graph, dsu-on-trees or kmp on tree 125 6.25 p3
sqrt decomposition 126 5
sqrt decomposition or Mo's algorithm 126 5
sqrt decomposition, dp 126 5.5 p2
sqrt decomposition, bfs or centroid-decom126 5.75 p3
sqrt decomposition 126 6 p3
sqrt decomposition, dsu or segment tree 126 6 p3
sqrt decomposition, binary search 126 6
sqrt decomposition, datastructures 126 6.25 p3
dp, dp_knuth, [standard], [=UVA 12057] 128 5 p2
dp, dp_knuth, [standard] 128 5.25
dp, dp_knuth, [standard] 128 6 p3
dp, dp_knuth, sparse table or dp_d&c 128 6.25 p3
dp, dp_sos 134 5 p3
dp, dp_sos 134 6 p3
dp, dp_sos, math 134 6 p3
dp, dp_sos, inclusion-exclusion 134 6.25 p4
math, fft, [practice] 138 6
math, fft, [practice] 138 6
Reading
Thinking
Coding
Debugging
Code is ready!
Code Failed :(
Got it AC
Speed
Weakly contests
Sheet stats
Training Time
Training with?
Psychological issues
Weekly Check List
Training Secrets of Success Video
Read within 3-5 minutes for short text problem. If no, you need to work on your Reading English Skills
Never suspect later your problem understanding? If happens, you need to improve your comprehension / cases tracing
Ready and in the challenging mood before start solving.

Striving against the problem for a reasonable time. If no, you need to change your solving spirit. Be a fighter.
Found a solution; Do verifications: text cases / extra cases / correctness / time & memory
Sketch in your mind the big picture of the code first. Don't rush for coding
Code within 10 minutes. If more, you have coding skills problem or your understanding for the approach is not complete
A lot of copy paste? Something wrong. Need a better code organization
Needed more than 10 minutes to code medium size codes? Why? Identify the issue and solve it
Which will be faster to catch the mistake? Printing or Debugger

Don't know how to use a debugger? Learn this skill
Needed more than 10 minutes to solve bugs? Something is wrong. Why need all this time? How to solve this issue?
Just submit and see if passed? Wrong. Behave as if you are in the real contest. Are you almost sure it will be AC? If yes, su
TRAIN offline as if you are in a real contest. This shortens the gap between training and the real contest
Are you nervous / frustrated? Yes => Wrong behavior. Take it easy
Rush to test cases? Yes => Wrong, revise idea, then code, then trace more samples. Try for 15 minutes or more first
Read and Understood editorial solutions?

Checked 1-3 other AC solutions?
Tried to write a much shorter version of your code?
Tried to write a faster coder (better complexity)?
How much time do you need in Div2-A/Div2-B? Target (5, 10) minutes for semiseniors, (3, 6) for seniors
Not that fast? You need regular speed training on easy problems
Do you participate in 1-2 contests per week at least? If no, this is bad. Offline training != Online contests
You need to train yourself to behave in online contests similar to offline training. This is an important skill.
Recorded them? Yes: read your problem's row. Where do you consume the most of the time? These are your weak skills
No, I don't record! => How will you know your weak points?!
Can't record timing as I am mixing thinking with coding? => Wrong behavior. get done with thinking, then move to codin
Is it regular and scheduled? Yes => you will have regular improvements.
Your plan was to train X hours, Did so? If no, why?
Without regular and continous training, your mind might not improve well
Yourself only? You may feel bored. If can collaborate with others = longer commitment
Do you keep comparing yourself with others?

Do you have negative feelings? Like I am stupid..I am hopeless...I will never have a comparable level...?
Do you think of your image/appearance if failed in online contests so avoid contests?
Do you use another account with a weird name to train so that people don't know about your progress/failure?
Do you wish your friends fail in the contest? or get annoyed with their better performance?
Do you avoid teaching your friends something or give no support to remain better than them?
Do you feel bored/frustrated as no/weak community in your college?
Do you keep training day and night without breaks? No socialization at all?
Do you hate specific topics and avoid them (probability/geometry)?
‘Should I stop’ Dilemma? Keep thinking is it worth vs a waste of time?
If any of the above questions is YES, you probably have a problem and need to find a solution to it.
Submit Reading Thinking Coding
Problem Name Problem Status
Count Time(m) Time(m) Time(m)
AC Averages => 0 0 0 0 0
Debug Total Problem By
Category
Time(m) Time(m) Level /10 yourself?
0 0 0 0 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
Any Comments
This is your own sheet

Add here other external problems you solve
E.g. what you solve in codeforces contests

Junior Training Sheet V7.0 - READ Row 10 To Make Your Own EDITABLE

Caricato da

Informazioni sul documento

Descrizione originale:

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Junior Training Sheet V7.0 - READ Row 10 To Make Your Own EDITABLE

Caricato da

Copyright:

Formati disponibili

This google sheet is created by Dr Mostafa Saad Ibrahim.

Overall ~950 problems for

CF136-D2-A CF (codeforces), D2 (Division 2), (136, A) is the problem URL. No

CF483-D2-A White for a problem from codeforces

V1: initial release

artner(s) to work with to encourage each other.

B, C, D + Problems on knolwdge topics (Mainly from UVA, SPOJ)

wesome links - very helpful for English guys

Q) How much time do I need to finish the sheet?

Q) When should I give up and check the editorials and solutions?

Q) Is using C# ok? are official in UVA

Q) can't access the sheet in edit mode?

Q) Are problems really sorted based on easiness? I don't feel so.

Q) What are these problems colors?

Q) Are the problems sorted?

Q) Why problem-solving is that important?

Q) I feel bored when solving problems compare to doing projects?

Q) Who FInished my sheet? Their levels?

Q) How to share my sheet progress with you?

Watch - Approaching Problem Statement

Video Solution - Eng Youssef El Ghareeb

Watch - Measuring Algorithms Perfromance - 1

Watch - Number Theory - Modular Arithmatic

Video Solution - Eng Ahmed Rafaat (Python)

Video Solution - Solver to be (Java)

Watch - Graph Theory - Intro

Video Solution - Eng Muntaser Abukadeja

Watch - Computational Geometry - Intro

Video Solution - Eng Muntaser Abukadeja

Video Solution - Eng Magdy Hasan

Video Solution - Eng Muntaser Abukadeja

Watch - Search Techniques - Binary Search

Video Solution - Eng Youssef El Ghareeb

Petya and CountrysCF66-D2-B

Big Mod UVA 374

Kuriyama Mirai's CF433-D2-B

Tic-Tac-Toe ( I ) SPOJ TOE1

Students and ShoelCF129-D2-B

Roma and ChangingCF262-D2-B

Intersecting Lines UVA 378

Highways UVA 10147

Mashmokh and TokCF415-D2-B

Painting Eggs CF282-D2-B

Devu, the Dumb GCF439-D2-B

Settlers' Training CF63-D2-B

The Monster and thCF592-D2-B

George and Round CF387-D2-B

Walking in the Rai CF192-D2-B

Video Solution - Eng Mohamed Adel

Video Solution - Eng Muntaser Abukadeja

Watch - Graph Theory - BFS

Video Solution - Eng Abanob Ashraf

Video Solution - Dr Mostafa Saad

Video Solution - Eng Mohamed Salah

Video Solution - Eng Mohamed Salah

Watch - Computational Geometry - Complex Number and 2D Point

Video Solution - Eng Muntaser Abukadeja

Watch - Focused and Diffused Thinking

Video Solution - SolverToBe (Java)

Video Solution - Eng Salma Yehia

Video Solution - Eng Mohamed Adel

Video Solution - Eng Mahmoud Mabrok