Junior Training Sheet

This google sheet is created by Dr Mostafa Saad Ibrahim.
Overall
[email protected] Ask.fm
Problem Solving Sheet
Video Introducing roadmap (Arabic) - to min 18 ONLY
Currenet Version V6.3
the specific topic
What is this Sheet? - It is still a good training roadmap. Actually used by most of people I think.
- Allows you to write down your statiscs to learn from them (e.g. you consume much time in deb
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. with old
For Whom? A junior is anyone who does't master solving codeforces Div2-D.
Basic Programming skills such in series C++ Programming
If you find my sheet is hard, Finish Assiut University provides an easier starting roadmap. Finis
Prerequisites?
Know about our community and what is programming competitions =>
Code with any language but preferred C++ or Java. For Java:
Training Style? You can train alone, but highly advised to find partner(s) to work with to encourage each other.
Skills Goals Moving from Junior Level to Semi-Senior Level: A one who do pretty well in CF-Div2 A, B, C, D
Knowledge Goals Understand and build fair knowledge in some algorithms in Number Theory, Dynamic Programm
Sheet pages are mainly for Codeforces Div2 A, B, C, D + Problems on knolwdge topics (Mainly
Each sheet has some sets, each set is ~10-15 problems....The top sets are mandatory....The b
If you did well in the mandatory sets, move to next sheet...otherwise you still need training on s
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 take per a
Sheets In the level column give an estimate to the problem level from 1-2 (easy), 3-4 (medium), 5-6(ha
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/solutions. If s
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. But it ca
Problem Level Column
CF136-D2-A CF (codeforces), D2 (Division 2), (136, A) is the problem URL. Note this is
Notations
SRM150-D2-1000 SRM 150
Topcoder nowadays maybe (Topcoder),
slow. So wait forD2
5 (Division
min for a 2), 1000 (3rd
problem problem)
to open. If did not work, try in
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 SPOJ CDOWN A knowledge problem on topic you watched before, will be harder than ba
CF518-D2-B Problem of easier level than current sheet page level to enhance multiple
Moving faster Do I have to solve every problem? For Div2 (A, B, C1) => No. If you can move faster, do it. For
Others Solutions If you solved a problem, please see some other accepted solutions in codeforces. You don't ne
Awesome Competitive Programming Many awesome links - very helpful for English guys
Ahmed Elsaghir Trainnig Ahmed is senior from GUC
A2oj Ladders Don't like my sheet? Go with Ahmed Aly Ladders
External Resources
Prgramming Ahmed M sayd Arabic Programming Playlist
External Resources
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, P2D merged
V3: Added
4- More problem
smooth names. from
transitions P3A,aP3B split
sheet to over 3 sheets, reordered to be more incremental rat
another
History 5- Utilizing the new many problems added by CF since initial sheet creation
-V5Then Remove Misc sheet
- Click
you areon
in the arrow
middle forFinish
C1. Div2-D sheets,
it first. and
Then make C2,
remove copyD1,
for D2,
yourD3.
sheet
In the new version, click a sh
words, migration should be 5-min process. If need more, you are doing it wrongly.
Thanks for all guys who sent sheet feedback: Mariam Alshereef, Magdy Hassan, Ahmed Yasser, Ahmed Elsayed Awad, Moham
shenouda, Others.
Special Thanks for Coach Alhussain Aly for his continuous help
Special Thanks for All volunteers in videos recording / Editorials writing
rahim. Overall ~950 problems for newcomers to problem solving.
Site / More Contacts
Video explaining the sheet
Latest Version
most of people I think.

m them (e.g. you consume much time in debugging)
u are again opening my sheet (e.g. with old name), NOT your copy
rces Div2-D.
+ STL + Debugging Skills C++ is highly recommended
y provides an easier starting roadmap. Finish it first Novice RoadMap Online Judge
g competitions => Watch these videos for more details
Solver to be Channel Code El Masry Channel
er(s) to work with to encourage each other.
ne who do pretty well in CF-Div2 A, B, C, D and similar levels (e.g. TC-Div2-1000)

hms in Number Theory, Dynamic Programming, Greedy, Graph Theory and Search
, D + Problems on knolwdge topics (Mainly from UVA, SPOJ)

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

senior from GUC
my sheet? Go with Ahmed Aly Ladders
ogramming Playlist
ogramming Playlist
eo is part of a playlist
aced + reordering. P2B, P2C, P2D merged in P2B. P3A and P3B: new knowledge sheets
eets, reordered to be more incremental rather than random
ce initial sheet creation
py forD2,
, D1, yourD3.
sheet
In the new version, click a sheet page and select Copy To, then copy to your sheet. In other
more, you are doing it wrongly.
med Yasser, Ahmed Elsayed Awad, Mohamed Nasser, Mostafa Ali Mansour, Aya elymany, Ayyad
93 problems of level <= 3.5 (avg 30 min per problem)
-127ONLY programming
problems of level skills
<= 5.75(e.g. Programming
(avg 75 min per 1 level). It is highly advised to implement 2-3 projects
problem)
- NO
53 for OOPof level > 5.75 (avg 90 min per problem)
problems
- NO for datastructures, but learn STL (or Collections in Java/C#). It helps alot
Q) What is the sheetthe
requirements?
-215*20+93*30+270*40+178*60+127*75+53*90
NO for algorithms, sheet will teachShould I study
you that aalgorithms and Data structures?
=in~700
smooth
hours way
(say max 900 hours)
- For C++ guys (and others as guide) - first 18 videos here: https://www.youtube.com/playlist?list=PLPt2dINI2MIZPFq6HyUB1U
If you trained in the summer vacation seriously for 2 month (e.g. 10 hours * 30 days * 2 month = 600 hours) + the reamining of t
level goal
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
- No, remember in a real contest you only know your problem status (WA, TLE, ...etc)
- Struggle to find the wrong case by yourself. At least 15-30 minutes.
Q) Got keep
- Don't WA, should I checkjust
trying longer, directly
checkthe test
the cases?
test cases
- If you can write a brute force solution for your problem, write a stress test: Generate random cases and compare the optimal a
- Once you finish coding and start testing, you verify if the program is working as expected or not
- If not, there are bugs that you need to find to make the program behave as expected. From this moment till getting the program
Q) What is
- People the debug
could debug using
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=PLPt2dINI2MIZPFq6HyUB
Q) Should I solve
- Generally, every
preferred, problem?
but 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
- Many juniors find UVA problems in Div2-A hard, I understand
- Yes, almost same for DIv2-B. But don't do that in next sheets as order might matter, because all of such knowledge are mainly
Q) Just started
- However, in Div2-A,
following couldisI afinish
the order muchitsbetter
codeforces
idea problems first, then solve the UVA/Colored problems?
-- Similarly,
Generallyone
yes,could finish
but you All Div2-A/Div2-B
won't be able to submit codeforces problems,
in UVA judge, as C#then solve
is not their colored problems. Again, this is not the best
supported
- For such problems, write your code, but heavily test it. You may download an internet code and evalaute the test case on both
- On the other hand, learning Basic C++ + STL is not hard for C#/Java guys
Q) Is using C# ok? are official in UVA
- C++/Java/Python
- Codeforces allows more such as Javascript
Q) When I watch a video, should I solve the problems in its info section?
- No, sheet has subset of these problems already in specific order
- Sheet is self-contained
Q) I watched the video, but it is hard, any tips?

- Algorithms are hard, learn to struggle
- Watch the video 2-3 times, try to rewrite its code by yourself
- Still can't get it? Google for more materials from the web (ppt/pdf/videos) and try to learn
- In worst case, leave it for now and return to it later
Q) How does your sheet prepare for ECPC/ACPC?

- The sheet prepares you to reach level 5-5.5/10 in several categories
- If a team of 3 members solved the whole sheet, they may rank in the top 15 in the contest
But let's go in details. Individual sucess in contests depends on several factors. Let me state some of them.
- Solving many problems of good quality
- Improving your different skills (reading, thinking, coding and accuracy).
-- 2 persons could solve in training the same problem. One got it in 20 min first submission, and the 2nd needed 90 minutes due
- Healthy training: Regular / good times for training (e.g. morning) / weekly contests / reading other codes / collaboration with ot
- Stress management during contests
- Emotions management when fail in solving or feel performance is not improving enough
- Avoiding Psychological issues: Comparing to others, Negative feelings, Your image, Regretting trainging time
Moving toward a team contest, you need more concerns:

- Serious team members. If only one active member, they may end up in bad performance. So EACH team member need to fin
- Tolerating team mistakes during the contest
- PC management
- Suitable strategy + several team contests to tune it
As you may notice, there are MANY factors for sucess.

- This sheet provides you with high quality problems and good topics distribution + way to record your stats to know your weak
- 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 Solutions" bo
- Also watch: https://www.youtube.com/watch?v=39vqarATPyM
Q) How different is your sheet versus Ahmed Aly Ladders?
- Ladder problems are selected automatically, no personal investigation for the actual benefit/need from the problem
- Mine is mixed between automated and manual.
- At the current moments, many of my trainees and students feedback, I am aware of the problem level and its category.
- I updated the sheet many times because of the received feedback
- My sheet involves the algorithms videos to learn, in order, while you grow up.
- I selected videos to prepare you as soon as possible for Div2-C/Div2-D where many algorithms starts to appear
- It is a sheet..ready for you to record your times, notes...etc...this help to improve yourself
- 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 when s
Q) How did you select problems for the sheet?
- Long story, many versions were there, from a version to another improvements were applied
- Codeforces problems where rated based on this CF tool: http://codeforces.com/blog/entry/46304?mobile=true#_=_
- Any rating is just an estimation. I found this one a pretty reasonable measure
- The videos are selected such that when comes to Div2-C/, you are ready
- Manual selections and investigations for non-CF problems to be used in the sheet
- Lots of manual efforts and investigations and feedback processing
Q) what is the next step after finishing your sheet ?

- Joining directly my ICPC semi-seniors supervision, BUT
- Email me with your online sheet copy link and it must have
- Each row should have: code link, time details, problem level, category and comment per a problem
- I will review and decide
- Side note: If you started in Div2-C1 and solved first 15 problems, you can share the sheet with me to follow your updates
Q) can't access the sheet in edit mode?

- Don't download the sheet, Work over it online "better"
- Can't edit it? Because it is read-only. Read below notes.
- Just make a copy to your google driver
- Then work over it online. Following are the details
- Login to ur google Gmail

- Go to my sheet
- In the sheet click on 'file' menu
- select Make copy
- it will create copy for u
- RENAME it to Junior Training Sheet
- Now the copied sheet is opened for you (or go inside ur Google drive and you will find it)
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 write in the category column?
The algorithm used to solve a problem. In Div2-A, this might be:
- This column is for the algorithm you used during solving. Usually, new guys in CF-A are confused. If so, leave it CF-A and star
- The more you go in the sheet you will learn algorithms (e.g. Binary search, DP, DFS, etc). Then this what you write in level col
- The problem that has no algorithm but a specific idea called ad-hoc, This is the case for most of CF-A and less later
- Implementation: Means the problem request is almost direct, just code it
- Brute Force: Means instead of finding elegant solution, try all possible solutions (e.g. 3 nested loops) and select the solution
- Ad-hoc: Just per-problem 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.
They are sorted by easiness already. But, whatever order, anyone will find some are easy and some are hard in some order.
That is, no one can give you a list that every problem for YOU is easier than the next problem.
In other words, If we gave 100 problems to 10 students of same level to solve and told them rank from easy to hard, they will ra
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?

Yes, but this is tricky as sorting is subjective.
That is imagine 10 prblems given for 100 people to order based on its level, people will arrange in different ways based on theie
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 like to freeze my study for 1-2 years to be good in problem-solving?

I never liked that. Graduate on time. In your free times and vacations do more problem solving
Relevant: https://ask.fm/mostafasaad87/answers/145151822818
Q) Topics based-training vs Blind Order
In topics training, we study a topic, then solve a lot of problems over it.
Advantages:
- Mastering the algorithm till solving some hard problems in short time
Disadvantages:
- Discovering the algorithm behind the problem is an important skill. Given that you know the topic, you lose a good space to im
- Being in the mode of specific algorithm lets you solve many of it easier. However, when solving in real contests, your mind is n
In my sheets - Blind style:

- You solve 3-5 per topic. Then you have to discover the other problems by yourself. So you train to avoid the missing 2 points
Claim:
- Although topics training let guys be so good early, they level stuck early and they don't improve. Seems to me, topics training i
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 after the sheet?

- There are 2 other levels, each has around 1000 problems. Semi-senior level and seniors level
- Generally speaking, the region stars will solve a lot of problems, e.g. 2000-3000 problems with many of them of hard level
- Whoever finish the sheet, I join him in my supervision for the next levels
Submit Reading Thinking Coding Debug Total
Problem Name Problem Code Status
Count Time(m) Time(m) Time(m) Time(m) Time(m)
AC Averages => 3 #NAME? 5 13 15 18 50
Sample Name1 Sample Link1 AC 5 4 8 6 32 50
Sample Name4 Sample Link4 WA 5 4 25 20 2 51
Sample Name5 Sample Link5 CS 6 5 30 25 31 91
0
0
0
Vanya and Fenc CF677-D2-A 0
Anton and DanikCF734-D2-A 0
0
0
0
Bear and Big BroCF791-D2-A 0
Team CF231-D2-A 0
Beautiful Matrix CF263-D2-A 0
Gravity Flip CF405-D2-A 0
Petya and StringCF112-D2-A 0
Boy or Girl CF236-D2-A 0
Word CF59-D2-A 0
Magnets CF344-D2-A 0
Sereja and DimaCF381-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 horseshoCF228-D2-A 0
Colorful Stones (CF265-D2-A 0
Die Roll CF9-D2-A 0
Shaass and Osko CF294-D2-A 0
Juicer CF709-D2-A 0
Carrot Cakes CF799-D2-A 0
Anton and LetterCF443-D2-A 0
Way Too Long WCF71-D2-A 0
Free Ice Cream CF686-D2-A 0
Helpful Maths CF339-D2-A 0
Team Olympiad CF490-D2-A 0
New Password CF770-D2-A 0
0
0
Light, more light UVA 10110 0
Product UVA 10106 0
Uniform GeneratUVA 408 0
Black and white UVA 11231 0
SPOJ
0
EASYMATH
Electricity UVA 12148
0
Presents CF136-D2-A 0
Lineland Mail CF567-D2-A 0
Mahmoud and L CF766-D2-A 0
Snacktower CF767-D2-A 0
Oath of the NighCF768-D2-A 0
Pangram CF520-D2-A 0
Twins CF160-D2-A 0
Keyboard CF474-D2-A 0
0
0
0
The Seasonal WUVA 352 0
Marcus UVA 10452 0
Battleships UVA 11953 0
0
Forming Teams CF216-D2-B 0
SPOJ
0
Hierarchy MAKETREE
Ordering Tasks UVA 10305 0
0
Even Odds CF318-D2-A 0
I Wanna Be the CF469-D2-A 0
Is it rated? CF807-D2-A 0
Olesya and RodiCF584-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 exa CF742-D2-A 0
Calculating FuncCF486-D2-A 0
Theatre Square CF1-D12-A 0
Anton and PolyhCF785-D2-A 0
Panoramix's PredCF80-D2-A 0
CounterexampleCF483-D2-A 0
0
0
0
Wasted Time CF127-D2-A 0
Points in Figure UVA 476 0
Overlapping RecUVA 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 ScenerCF218-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 Collid CF699-D2-A 0
Polo the Pengui CF289-D2-A 0
IQ Test CF287-D2-A 0
Yaroslav and PeCF296-D2-A 0
Snow Footprints CF298-D2-A 0
Raising BacteriaCF579-D2-A 0
BowWow and theCF1204-D2-A 0
0
0
The Playboy Ch UVA 10611 0
Pipeline CF287-D2-B 0
Burning MidnightCF165-D2-B 0
Aggressive cowsSPOJ AGGRCOW 0
0
0
Optional Problems 0
0
Word CapitalizatCF281-D2-A 0
Next Round CF158-D12-A 0
Young Physicist CF69-D2-A 0
Bit++ CF282-D2-A 0
Case of the Zer CF556-D2-A 0
Translation CF41-D2-A 0
String Task CF118-D2-A 0
Laptops CF456-D2-A 0
Left-handers, Ri CF950-D2-A 0
George and Acc CF467-D2-A 0
Vasya the HipsteCF581-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 MatheCF61-D2-A 0
Little Pony and CCF454-D2-A 0
One-dimensionalCF721-D2-A 0
Soldier and Ban CF546-D2-A 0
0
Bus to UdaylandCF711-D2-A 0
Cookies CF129-D2-A 0
Second Order Sta CF22-D2-A 0
Nearly Lucky NuCF110-D2-A 0
Playing with Dic CF378-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 LCF415-D2-A 0
Triangular numb CF47-D2-A 0
0
Roma and LuckyCF262-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 LocCF540-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 Card CF401-D2-A 0
Squats CF424-D2-A 0
Arrival of the Ge CF144-D2-A 0
Sinking Ship CF63-D2-A 0
LLPS CF202-D2-A 0
Candy Bags CF334-D2-A 0
0
Game With StickCF451-D2-A 0
Vasya and Sock CF460-D2-A 0
Dima and FriendCF272-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 Orange CF244-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 PasswCF94-D2-A 0
Valera and PlateCF369-D2-A 0
Minimum DifficulCF496-D2-A 0
Little Elephant a CF221-D2-A 0
Collecting Beats CF373-D2-A 0
Letter CF14-D2-A 0
Kefa and First S CF580-D2-A 0
0
Ilya and Bank AcCF313-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 poCF124-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 SCF435-D2-A 0
Bicycle Chain CF215-D2-A 0
Little Elephant a CF205-D2-A 0
Amr and Music CF507-D2-A 0
Marks CF152-D2-A 0
Postcards and p CF137-D2-A 0
0
Business trip CF149-D2-A 0
Drazil and Date CF515-D2-A 0
Multiplication Ta 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 Zer CF75-D2-A 0
Problem By
Category
Level /10 yourself?
#NAME? #NAME? 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 next and so
parallel, up to you.
Solution in mind is O(n^2): for each pair of points, get the equation of the straight line linking between
1-2 line Comments
them,
About and
youradd 2 to its count. Print the count of the line having the max count. Problem is how to hash
approach
a
2 line equation (coefficients are double).
I had to check the editorial
My Performance Notes: This is so bad performance. Needed many submissions per problem. Always
Please
My
submit always
as if youwrite
Performance are and
Notes:
in study
realThis your
is
contest. timings.
so Submit
bad performance. Hesee
to AC, not to thought for little
if we will passtime andTarget
or not. continued thinking
AC from 1st
while coding. As a result, much debug
submission. Think more before submission. time too. RULE: Think More, Code Faster
My
OtherPerformance
Status values: Notes: ThisCS,
AC, WA, is soTLE,
good performance.
MLE, RTE, ... 1st submission. Thinking is the higher.
Code/Debug
These values and comments are just examples. will
is so low. By time, thinking column Justbe improved. them.
remove/ignore
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.
ouraged to solve the next problem. If you felt you need so, try some of them. Or Proceed to next and solve in

Video Solution - Eng Hossam Yehia
Problem Code Status
AC Averages => 0 ### 0 0 0 0 0
0
0
0
0
0
Petya and CountrysCF66-D2-B 0
Bear and Finding CrCF680-D2-B 0
Burglar and MatcheCF16-D2-B 0
Caisa and Pylons CF463-D2-B 0
Sum of Digits CF102-D2-B 0
Coins CF47-D2-B 0
Effective Approach CF227-D2-B 0
Easter Eggs CF78-D2-B 0
Decoding CF746-D2-B 0
0
0
0
Big Mod UVA 374 0
Combinations UVA 369 0
Pi UVA 412 0
Adding Reversed NUVA 713 0
Taxi TIMUS 1607 0
The Drunk Jailer LIVEARCHIVE 2557 0
Vanya and LanternsCF492-D2-B 0
0
Kuriyama Mirai's St CF433-D2-B 0
Fence CF363-D2-B 0
President's Office CF6-D2-B 0
Lovely PalindromesCF688-D2-B 0
Sort the Array CF451-D2-B 0
Summer sell-off CF810-D2-B 0
Colorful Field CF79-D12-B 0
Keyboard CF88-D2-B 0
Mahmoud and a Tri CF766-D2-B 0
0
Tic-Tac-Toe ( I ) SPOJ TOE1 0
Tic-Tac-Toe ( II ) SPOJ TOE2 0
Knight Moves UVA 439 0
King's Path CF242-D2-C 0
Bookworm TIMUS 1638 0
UVA 10461 0
SPOJ POSTERIN 0
0
Students and ShoelCF129-D2-B 0
Dreamoon and WiFiCF476-D2-B 0
Chat Online CF469-D2-B 0
Olympic Medal CF215-D2-B 0
Filya and Homewor CF714-D2-B 0
Inna and New MatrixCF400-D2-B 0
Steps CF152-D2-B 0
Growing MushroomCF186-D2-B 0
Escape CF148-D2-B 0
0
0
0
Vacations CF699-D2-C 0
Woodcutters CF545-D2-C 0
Barcode CF225-D2-C 0
Continents UVA 11094 0
Brownie Points UVA 10865 0
Hanoi Tower TIMUS 1054 0
0
Roma and ChangingCF262-D2-B 0
Bear and Strings CF385-D2-B 0
I.O.U. CF376-D2-B 0
Jeff and Periods CF352-D2-B 0
Meeting CF144-D2-B 0
Chocolate CF617-D2-B 0
Easy Number Chall CF236-D2-B 0
Han Solo and LazerCF514-D2-B 0
Physics Practical CF253-D2-B 0
Two Buttons CF520-D2-B 0
0
0
0
Intersecting Lines UVA 378 0
The Stern-Brocot N UVA 10077 0
Mr. Kitayuta's Color CF505-D2-B 0
0
DZY Loves ChemistCF445-D2-B 0
Kolya and Tanya CF584-D2-B 0
Suffix Structures CF448-D2-B 0
Complete the Word CF716-D2-B 0
Sea and Islands CF544-D2-B 0
Hopscotch CF141-D2-B 0
Valera and Contest CF369-D2-B 0
Bear and FriendshipCF791-D2-B 0
Preparing OlympiadCF550-D2-B 0
0
0
0
Highways UVA 10147 0
ACM contest and BlUVA 10600 0
Virtual Friends UVA 11503 0
Arctic Network UVA 10369 0
Trees on the level UVA 122 0
Final Standings TIMUS 1100 0
Farm TIMUS 1349 0
0
Mashmokh and Tok CF415-D2-B 0
Approximating a CoCF602-D2-B 0
Gena's Code CF614-D2-B 0
OR in Matrix CF486-D2-B 0
Fox And Two Dots CF510-D2-B 0
Routine Problem CF337-D2-B 0
Vasya and Wrestlin CF493-D2-B 0
Hamming Distance CF608-D2-B 0
Wet Shark and BishCF621-D2-B 0
Kefa and Company CF580-D2-B 0
Tavas and SaDDas CF535-D2-B 0
0
Minimum Ternary StCF1009-D12-B 0
CF1030-D12-B 0
CF1051-D2-B 0
0
0
Painting Eggs CF282-D2-B 0
Pasha Maximizes CF435-D2-B 0
Little Girl and GameCF276-D2-B 0
Pasha and String CF525-D2-B 0
Booking System CF416-D2-C 0
Vanya and Exams CF492-D2-C 0
The Skyline Proble UVA 105 0
Hanoi Tower TroubleUVA 10276 0
Maze Exploration UVA 784 0
IP-TV UVA 1174 0
0
0
Optional Problems 0
0
Devu, the Dumb GuCF439-D2-B 0
Find The Bone CF796-D2-B 0
Regular Bracket SeCF26-D12-B 0
Inbox (100500) CF465-D2-B 0
Different is Good CF672-D2-B 0
Permutation CF137-D2-B 0
Little Elephant and CF259-D2-B 0
Airport CF218-D2-B 0
Cormen --- The BestCF732-D2-B 0
Prison Transfer CF427-D2-B 0
A and B and Compila CF519-D2-B 0
Letter CF43-D2-B 0
Game of Robots CF670-D2-B 0
0
African Crossword CF90-D2-B 0
Cows and Poker G CF284-D2-B 0
Find Marble CF285-D2-B 0
Interesting drink CF706-D2-B 0
Megacity CF424-D2-B 0
Beautiful Paintings CF651-D2-B 0
Ilya and Queries CF313-D2-B 0
Code Parsing CF255-D2-B 0
Hungry Sequence CF327-D2-B 0
Chloe and the sequCF743-D2-B 0
Luxurious Houses CF581-D2-B 0
0
Settlers' Training CF63-D2-B 0
Far Relative’s Prob CF629-D2-B 0
Wilbur and Array CF596-D2-B 0
Text Document AnalCF723-D2-B 0
Shower Line CF431-D2-B 0
Misha and Changin CF501-D2-B 0
Coat of Anticubism CF667-D2-B 0
Ternary Logic CF136-D2-B 0
Counting Rhombi CF189-D2-B 0
Pashmak and FloweCF459-D2-B 0
0
The Monster and theCF592-D2-B 0
The Fibonacci Seg CF365-D2-B 0
Spider Man CF705-D2-B 0
Little Robber Girl's CF686-D2-B 0
Unary CF133-D2-B 0
Canvas Frames CF127-D2-B 0
Ohana Cleans Up CF554-D2-B 0
Garland CF408-D2-B 0
Petya and StaircaseCF362-D2-B 0
Equidistant String CF545-D2-B 0
Vanya and Food ProCF677-D2-B 0
Calendar CF304-D2-B 0
Amr and Pins CF507-D2-B 0
Polo the Penguin anCF289-D2-B 0
0
George and Round CF387-D2-B 0
Alyona and flowers CF740-D2-B 0
Urbanization CF735-D2-B 0
Testing Pants for S CF104-D2-B 0
Cells Not Under Att CF701-D2-B 0
Vanya and Books CF552-D2-B 0
Worms CF474-D2-B 0
Fortune Telling CF59-D2-B 0
0
Walking in the Rain CF192-D2-B 0
Dima and To-do ListCF366-D2-B 0
Sail CF298-D2-B 0
Fox and Cross CF389-D2-B 0
Rebranding CF591-D2-B 0
Increase and DecreCF246-D2-B 0
Alyona and Mex CF682-D2-B 0
Coins CF58-D2-B 0
Berland National LibCF567-D2-B 0
Art Union CF416-D2-B 0
0
BerSU Ball CF489-D2-B 0
Random Teams CF478-D2-B 0
Friends CF94-D2-B 0
War of the CorporatCF625-D2-B 0
Road Construction CF330-D2-B 0
Binary Number CF92-D2-B 0
Before an Exam CF4-D2-B 0
Running Student CF9-D2-B 0
Anton and currency CF508-D2-B 0
Phone Numbers CF151-D2-B 0
Problem By
Category
Level /10 yourself?
#NAME? #NAME? 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



Submit Reading Thinking Coding Debug
Count Time(m) Time(m) Time(m) Time(m)
AC Averages => 38 #NAME? 0 0 0 0
Drazil and Factorial CF515-D2-C AC

Lucky Permutation TCF304-D2-C AC
Soldier and Cards CF546-D2-C ACX
Watchmen CF651-D2-C AC
Fox Dividing Chees CF371-D2-B AC

Duff in Love CF588-D2-B AC
Twin Primes UVA 10394 AC
Summation of Four UVA 10168 AC
The Lottery UVA 10325 Ac
Hamburgers CF371-D2-C AC 2
Mint UVA 10717 AC 2
BITMAP - Bitmap SPOJ BITMAP AC
UVA 12952 AC 0
CODECHEF GCDMOD ACX
UVA 10843 AC
The Child and Set CF437-D2-B E
Tanya and PostcardCF518-D2-B E
Mike and Fun CF548-D2-B E
Greg and Array CF296-D2-C E

The World is a TheaCF131-D2-C AC
Trains CF88-D2-C AC
Semifinals CF378-D2-B E
Towers CF479-D2-B AC
Gerald is into Art CF560-D2-B E
To Carry or not to CaUVA 10469 AC

Beat the Spread! UVA 10812 E
Summation of PolynUVA 10302 AC

Polly the PolynomialUVA 498 E
UVA 11053 E
LiveArchive 8078 E
R U Kidding Mr. Fe UVA 10509 E

Wandering Queen SPOJ QUEEN ACX
Spreadsheet UVA 196 E
HACKR sherlock-and-prob AC
Searching for GraphCF402-D2-C ACX
Flying Saucer SegmCF227-D2-C ACX
Vasya and Petya's CF577-D2-C AC
Round Table Knight CF71-D2-C AC
Kefa and Park CF580-D2-C AC
Knight Tournament CF357-D2-C ACX
Special Offer! SuperCF219-D2-B ACX
Graph Coloring UVA 193 AC

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

Pythagorean TriplesCF707-D2-C AC
Gerald's Hexagon CF560-D2-C AC
Points on Line CF252-D2-C Ac

Find Maximum CF353-D2-C AC
Jzzhu and Sequenc CF450-D2-B AC
Simple Game CF570-D2-B AC
Prime Matrix CF271-D2-B L
Vacation UVA 10192 ACX

Dividing coins UVA 562
TC(CuttingBitString,
Stamp,
SentenceDecompositi
on, MessageMess) AC
SRM149-D1-500
SRM536-D2-1000
The Blocks ProblemUVA 101 AC
Divisibility UVA 10036 AC
UVA 11628 L
Rational ResistanceCF344-D2-C AC
k-Multiple Free Set CF275-D2-C AC
Polycarpus' Dice CF534-D2-C
Print Check CF631-D2-B
Playing Cubes CF257-D2-B
T-primes CF230-D2-B
Creating PalindromeUVA 11753

Again Palindrome UVA 10617
Exploring Pyramids UVA 1362
Cutting Sticks UVA 10003
Optimal Array MultipUVA 348
Accordian Patience 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 TransforCF486-D2-C
Removing Columns CF496-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 SoUVA 10490
Perfect P-th PowersUVA 10622
Prime Land UVA 516
UVA 10920
SRM274-D1-500
Text Editor CF253-D2-C

Alternative Thinking CF604-D2-C
Tennis ChampionshiCF735-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 WaCF75-D2-B
Treasure Hunt CF979-D2-B
How Many Points ofUVA 10790

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

What is the ProbabilUVA 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 PermutationCF483-D2-C
Replacement CF136-D2-C
Homework CF102-D2-C
Little Elephant and CF221-D2-C
Developing Skills CF581-D2-C
Maxim and DiscountCF262-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 EverywherCF701-D2-C

Monitor CF16-D2-C
System AdministratoCF22-D2-C
Lucky Sum CF122-D2-C
NP-Hard Problem CF688-D2-C
Vladik and fractions CF743-D2-C
Case of MatryoshkaCF556-D2-C
Vanya and Label CF677-D2-C
Exams CF479-D2-C
Boredom CF456-D2-C
Learning LanguagesCF278-D2-C
Beautiful Sets of PoiCF268-D2-C
Strategic Defense IniUVA 497

String to PalindromeUVA 10739
Trouble of 13-Dots UVA 10819
Sagheer and NubianCF812-D2-C
Purification CF330-D2-C
Division into Teams CF149-D2-C
Disposition CF49-D2-C
Mashmokh and NumCF415-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 ToasCF462-D2-C

Anya and SmartphoCF518-D2-C
Little Girl and Max CF276-D2-C
Sereja and Algorith 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 ElectionsCF369-D2-C
Total Problem By
Category
Time(m) Level /10 yourself?
0 #NAME? #NAME? 0
0
0
0
120 No Easy
0
0
0
0
5 Yes Easy
5 Yes Easy
0
0 3 yes Easy
0 3 yes Easy
0 6 YES Medium
5 5 yes Easy
0
0
0
0 No Hard
0
0
0
0
0
0 Yes Easy
0 Yes Easy
0
0 Yes Easy
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0 Yes Easy
0
0
0
0
0
0
0 No Easy
0 Yes Easy
0 Yes Easy
0
0 No Easy
0
0 Yes Easy
0 Yes Easy
0 No Medium
Easy-
0 Yes
Medium
0 Yes Easy
0
0
0
0
0
0
0
0
0
0
0
Don’t
0
Assume
0
0 No
0 Yes
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
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 Proceed to n
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
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
Remove the given link and write a comment. Start your comment with a classification for the
DON'T Skip
problem: coloredrepeated
Useless, problems.idea,
Don'tboring,
skip others unless
normal, a block
good is really
problem, easy for you
interesting problem or
important problem.
Taken Wrong Assumption
Watch - Thinking - Concretely - Symbolically - Pictorially

Watch - Thinking - Problem Constraints
Watch - Number Theory - Primes
Taken Wrong Assumption again!!

Sol
Simple Implementation
Sol
Sol uses __int128 to avoid overflow

Theory result to read
Video Solution - Eng Youssef Ali

Implementaion is lengthy
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
Did Some mistake while typing

Watch - Thinking - Problem Abstraction

Watch - Thinking - Problem Reverse
Watch - Search Techniques - Backtracking
Sol
Sol
Was fun to solve
try by pen
Review bitmasking
Watch - DP - Subset Style
Explained in the tutorial videos
Watch - DP - Consecutive Ranges Style
Sol
Hard maths
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


Sol
AC Averages => 0 ### 0 0 0 0 0
0
0
0
Win or Freeze CF151-D2-C 0
Euclid's Game UVA 10368 0
Pyramids SPOJ PIR 0
Power of Cryptograp UVA 113 0
SRM458-D2-500 0
Is There A Second WaUVA 10462 0
SRM381-D2-1000 0
0
Modified GCD CF75-D2-C 0
Alyona and mex CF740-D2-C 0
Hamburgers CF371-D2-C 0
Wet Shark and FloweCF621-D2-C 0
Predict Outcome of CF451-D2-C 0
Balls and Boxes CF260-D2-C 0
Alice and Bob CF347-D2-C 0
Mahmoud and Ehab an
CF959-D2-C 0
Almost Equal CF1206-D2-C 0
CF1220-D12-C 0
CF1065-D2-C 0
CF1036-D2-C 0
CF1068-D2-C 0
CF313-D2-C 0
Balls Game CF430-D2-B 0
Magical Array CF84-D2-B 0
0
0
Jugs UVA 571 0
Sending email UVA 10986 0
Lift Hopping UVA 10801 0
Shopping SPOJ SHOP 0
Ordering UVA 872 0
CF1064-D2-C 0
CF1059-D2-C 0
CF101933-GYM-K 0
Karen and Coffee CF816-D2-B 0
0
Bulls and Cows CF63-D2-C 0
Xor-tree CF430-D2-C 0
Median Smoothing CF591-D2-C 0
Coloring Trees CF711-D2-C 0
Clear Symmetry CF202-D2-C 0
Sereja and Mirroring CF426-D2-B 0
Restoring Painting CF675-D2-B 0
0
Gleaming the Cubes UVA 737 0
Intersecting Line Se UVA 866 0
0
The Circumference ofUVA 438 0
Points in Figures: Re UVA 477 0
Square Pegs And RoUVA 356 0
UVA 453 0
Divisibility of Factors UVA 10484 0
SRM436-D2-500 0
CF975-D2-C 0
CF1047-D2-C 0
CF1075-D2-C 0
CF758-D2-C 0
UVA 10525 0
0
Prime Permutation CF124-D2-C 0
Hometask CF155-D2-C 0
Terse princess CF148-D2-C 0
Hacking Cypher CF490-D2-C 0
Dreamoon and SumsCF476-D2-C 0
Try and Catch CF195-D2-C 0
Primes or PalindromeCF569-D2-C 0
View Angle CF257-D2-C 0
Little Pony and Sort bCF454-D2-B 0
0
0
Unidirectional TSP UVA 116 0
Make Palindrome UVA 10453 0
Fast Food UVA 662 0
Palindromic SubsequUVA 11404 0
Gone Fishing UVA 757 0
Special Olympics CF199-D2-B 0
Rings and Glue UVA 10301 0
0
k-Tree CF431-D2-C 0
Caesar's Legions CF118-D2-D 0
UnsealTheSafe SRM354-D2-1000 0
DiceGames SRM349-D1-500 0
SPOJ TWINSNOW 0
SPOJ FACENEMY 0
0
No to Palindromes! CF465-D2-C 0
Triangle CF408-D2-C 0
To Add or Not to Add CF231-D2-C 0
Number of Ways CF466-D2-C 0
Queue CF141-D2-C 0
Magical Boxes CF270-D2-C 0
Find Pair CF160-D2-C 0
Multitasking CF384-D2-B 0
Non-square EquationCF233-D2-B 0
0
0
0
Frogger UVA 534 0
Identifying ConcurrentUVA 334 0
Numbering Paths UVA 125 0
Jack Straws UVA 273 0
Longest Match UVA 10100 0
Isolated Segments UVA 11343 0
Counting UVA 10198 0
0
Mafia CF349-D2-C 0
Sereja and Prefixes CF381-D2-C 0
About Bacteria CF199-D2-C 0
DNA Alignment CF520-D2-C 0
Geometric Progressi CF567-D2-C 0
Watering Flowers CF617-D2-C 0
Quiz CF337-D2-C 0
Secret Combination CF496-D2-B 0
MUH and Important TCF471-D2-B 0
Lucky Mask CF146-D2-B 0
0
0
0
PT07Z SPOJ PT07Z 0
Roads in the North UVA 10308 0
Subway tree systemsLIVEARCHIVE 2935 0
0
Shaass and Lights CF294-D2-C 0
Journey CF721-D2-C 0
Captain Marmot CF474-D2-C 0
The Big Race CF592-D2-C 0
Molly's Chemicals CF776-D2-C 0
Anatoly and Cockroa CF719-D2-B 0
Opposites Attract CF131-D2-B 0
0
Railway UVA 10263 0
Factorial Factors UVA 884 0
Wifi Access UVA 12748 0
Lining Up UVA 270 0
Pouring water SPOJ POUR1 0
CF23-D12-C 0
CF869-D2-C 0
SRM321-D1-500 0
0
0
God, Save me UVA 10777 0
CF839-D2-C 0
CF454-D2-C 0
SRM577-D1-250 0
HACKR lazy-sorting 0
SPOJ ALIENS 0
CF340-D2-B 0
0
0
Optional Problems 0
0
Checkposts CF427-D2-C 0
Literature Lesson CF139-D2-C 0
Arpa's loud Owf and M
CF742-D2-C 0
Parity Game CF298-D2-C 0
Beauty Pageant CF246-D2-C 0
Heroes CF80-D2-C 0
Dynasty Puzzles CF192-D2-C 0
Buns CF106-D2-C 0
Counting Kangaroos CF373-D2-C 0
Corporation Mail CF56-D2-C 0
Matrix CF365-D2-C 0
Pick up sticks UVA 11686 0
0
Little Elephant and InCF205-D2-C 0
Sereja and Contest CF315-D2-C 0
Vasya and Robot CF355-D2-C 0
Hockey CF96-D2-C 0
Petya and File Syste CF66-D2-C 0
Kyoya and Colored Ba CF554-D2-C 0
George and Job CF467-D2-C 0
Harmony Analysis CF610-D2-C 0
Anton and Making PoCF734-D2-C 0
Table Decorations CF478-D2-C 0
Recycling Bottles CF672-D2-C 0
0
Message CF157-D2-C 0
Wilbur and Points CF596-D2-C 0
Cows and Sequence CF284-D2-C 0
Ladder CF279-D2-C 0
Not Wool SequencesCF239-D2-C 0
Anagram CF254-D2-C 0
DZY Loves SequenceCF447-D2-C 0
DZY Loves Physics CF445-D2-C 0
Misha and Forest CF501-D2-C 0
Jzzhu and ChocolateCF450-D2-C 0
Cinema CF670-D2-C 0
0
Report CF631-D2-C 0
Bear and Prime NumCF385-D2-C 0
Robbery CF90-D2-C 0
Vasya and BasketballCF493-D2-C 0
Vanya and Scales CF552-D2-C 0
Pashmak and Buses CF459-D2-C 0
Fancy Number CF118-D2-C 0
Problem By
Category
Level /10 yourself?
#NAME? #NAME? 0
in parallel, up to you.
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
ouraged to solve the next problem. If you felt you need so, try some of them. Or Proceed to next and solve
Sol
AC Averages => 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 MatterhCF697-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 ArmCF514-D2-D
Ahoy, Pirates! UVA 11402
Brackets SPOJ BRCKTS
Present CF460-D2-C
MessageMess SRM149-D1-500
DiceGames SRM349-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 CompuLiveArchive 3634
Database UVA 1592
Can you answer these
SPOJ GSS1
SPOJ BILLIARD
Can you answer these
SPOJ GSS3
SPOJ ABA12E
UVA 11825
CF472-D12-D
UVA 12325
UVA 12047
UVA 10705
CF101294-GYM-I
UVA 1555
CF80-D2-D
Mahmoud and a DictiCF766-D2-D

An overnight dance iCF814-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 Linguistic CF667-D2-C
Lucky Permutation CF287-D2-C
Dice Throwing UVA 10759

TestBettingStrategy SRM339-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 BallooCF342-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 ResulCF645-D12-D
Wavio Sequence UVA 10534
CF1012-D1-A
UVA 10342
Directed Roads CF711-D2-D

Block Tower CF327-D2-D
A and B and Interest CF519-D2-D
As Fast As Possible CF701-D2-D
Chloe and pleasant pCF743-D2-D
Roads in Berland CF25-D2-C
Photographer CF203-D2-C
LCM Challenge CF236-D2-C
Search in the diction SPOJ 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 Table CF448-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 PartitioningCF439-D2-C
Arthur and Table CF557-D2-C
Total Problem By
Category
0 #NAME? #NAME? 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
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

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
Oulipo PKU 3461

A Needle in the HaySPOJ NHAY
Finding the TessereSPOJ TESSER
Period SPOJ PERIOD
Prefixes and Suffix CF432-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 ScientistCF186-D2-D
Analyzing Polyline CF195-D2-D
CF1023-D12-E
CF1060-D12-C
Bear and Prime 10 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 SoldieSPOJ ORDERS
Playlist CF268-D2-E
SRM481-D1-500
Little Girl and Ma CF276-D2-D

Two Strings CF224-D2-D
Big Maximum Sum CF75-D2-D
SPOJ BRCKTS2
CF1057-D12-C
CF1066-D3-F
CF1064-D2-E
CF459-D2-E
UVA 10888
CF1043-D12-D
Football ChampionsCF200-D2-C
Given Length and Su
CF489-D2-C
Trip Routing UVA 186

Scheduling LectureUVA 607
Weird Function SPOJ WEIRDFN
The ? 1 ? 2 ? ... ? UVA 10025
Dictionary SubsequSPOJ DICTSUB
Jimmi's Riddles UVA 10058
Friends and Subse CF689-D2-D
Sum of Squares witSPOJ SEGSQRSS
Travel in Desert UVA 10816
Almost Union-Find UVA 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 Effect CF270-D2-D
CF645-D12-D
CF459-D2-C
CODECHEF
REDCGAME
CF1005-D3-F
Pocket Book CF152-D2-C
Levko and Array ReCF361-D2-C
Ice Cave CF540-D2-C
Robbery UVA 707

The Errant PhysicisUVA 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 Anagra CF368-D2-D
Choosing Capital foCF219-D2-D
Coloring Brackets CF149-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 StoneCF265-D2-C
BestTriangulation SRM278-D2-500
Trees on My Island UVA 10088
Packing polygons UVA 10005
LIVEARCHIVE 2831
Video Surveillance UVA 588
SRM514-D1-500
SRM473-D1-500
SRM555-D2-1000
UVA 557
SRM285-D1-500
Xrange's PancakesHACKR 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 Transmissio UVA 10330
Gopher II UVA 10080
Software Allocation UVA 259
UVA 10349
UVA 12168
A Plug for UNIX UVA 753
UVA 10349
Intergalactic Map SPOJ IM
UVA 11159
UVA 1194
Fence Obstacle CoPKU 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 #NAME? #NAME? 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
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
The Bottom of a GrSPOJ BOTTOM

Test UVA 10731
SRM312-D1-500
CF467-D2-D
Theseus and labyri CF676-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 ModificaCF447-D2-D
Mike and Feet CF548-D2-D
Special Grid CF435-D2-D
Roman and NumberCF401-D2-D
Persistent BookcasCF707-D2-D
Regular Bridge CF550-D2-D
CF1059-D2-D
Almost Arithmetical CF255-D2-C
Title CF59-D2-C
Treasure CF495-D2-C
Unique Attack ZOJ 2587

End of Fun SPOJ DCEPC12E
Grammar EvaluatioUVA 622
Find the Winning MUVA 10111
Check the difficulty PKU 2151
Proving EquivalencUVA 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 Towers CF478-D2-D

Renting Bikes CF363-D2-D
Lucky Number 2 CF146-D2-D
Tennis Game CF496-D2-D
Bubble Sort Graph 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 RoCF716-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 Axes CF101149-GYM-G
Connected ComponCF292-D12-D
AND Rounds SPOJ ANDROUND
Campus Roads UVA 11473
The Child and Zoo CF437-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 SecoCF281-D2-D
Ilya and Roads CF313-D2-D
Mr. Bender and SquCF255-D2-D
Fish Weight CF298-D2-D
T-decomposition CF237-D2-D
Wizards and Huge PCF168-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 PrimesUVA 10419
Largest Rectangle iSPOJ HISTOGRA
UVA 663
KingdomReorganizaSRM531-D2-1000
The Problem with t UVA 10092
Psycho SPOJ PSYCHON
Minimal Ratio Tree 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 ArithmeticCF604-D2-D
Lucky Transformati CF122-D2-D
Boring Partition CF239-D2-D
Spongebob and SqCF599-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 Programmer UVA 11506

The New Rule in E UVA 10742
Multiples of 3 SPOJ MULTQ3
TimeTravellingSal SRM492-D2-1000
March of the PenguUVA 12125
PeopleYouMayKno SRM447-D1-500
The Game of 31 UVA 10578
Can you answer theSPOJ 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 KinderCF812-D2-D
Dispute CF242-D2-D
Remainders Game CF688-D2-D
CF1075-D2-D
CF1033-D12-D
CF442-D1-B
CF1025-D2-D
CF1072-D2-D
Total Problem By
Category
0 #NAME? #NAME? 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
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
This page has the SAME problems in (CF-A to CF-D3). It has problems catego
Some trainees don't like to train using Blind Order style (CF-A to CF-D3) and p
This sheet page is another training style. Determine a category, go ahead and
Vanya and Fence CF677-D2-A

Anton and Danik CF734-D2-A
Petya and Strings CF112-D2-A
Is your horseshoe oCF228-D2-A
Team CF231-D2-A
Boy or Girl CF236-D2-A
Beautiful Matrix CF263-D2-A
Colorful Stones (Sim
CF265-D2-A
Stones on the TableCF266-D2-A
Games CF268-D2-A
Word CapitalizationCF281-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 Museu CF731-D2-A
Buy a Shovel CF732-D2-A
Bear and Big Broth CF791-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 Scenery CF218-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 OskolsCF294-D2-A
Yaroslav and PermuCF296-D2-A
Even Odds CF318-D2-A
Helpful Maths CF339-D2-A
Ksenia and Pan ScaCF382-D2-A
Translation CF41-D2-A
Football CF43-D2-A
Anton and Letters CF443-D2-A
Laptops CF456-D2-A
I Wanna Be the Gu CF469-D2-A
Keyboard CF474-D2-A
Counterexample CF483-D2-A
Calculating Functio CF486-D2-A
Team Olympiad CF490-D2-A
Chewbaсca and NuCF514-D2-A
Pangram CF520-D2-A
Case of the Zeros CF556-D2-A
Lineland Mail CF567-D2-A
Raising Bacteria CF579-D2-A
Olesya and RodionCF584-D2-A
Alyona and NumberCF682-D2-A
Free Ice Cream CF686-D2-A
Young Physicist CF69-D2-A
Launch of Collider CF699-D2-A
Brain's Photos CF707-D2-A
Way Too Long Wor CF71-D2-A
Arpa’s hard exam aCF742-D2-A
Mahmoud and LongCF766-D2-A
Snacktower CF767-D2-A
Oath of the Night's CF768-D2-A
New Password CF770-D2-A
Carrot Cakes CF799-D2-A
Panoramix's PredictCF80-D2-A
Is it rated? CF807-D2-A
Die Roll CF9-D2-A
CF1204-D2-A
Electricity UVA 12148
Final Standings TIMUS 1100
President's Office CF6-D2-B
Sum of Digits CF102-D2-B
Students and ShoeCF129-D2-B
Meeting CF144-D2-B
Steps CF152-D2-B
Burglar and MatcheCF16-D2-B
Growing MushroomCF186-D2-B
Olympic Medal CF215-D2-B
Effective Approach CF227-D2-B
Roma and Changing CF262-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 MatriCF400-D2-B
Mashmokh and TokCF415-D2-B
Pasha Maximizes CF435-D2-B
DZY Loves ChemistCF445-D2-B
Suffix Structures CF448-D2-B
Chat Online CF469-D2-B
Coins CF47-D2-B
Dreamoon and WiFiCF476-D2-B
OR in Matrix CF486-D2-B
Vasya and WrestlinCF493-D2-B
Secret CombinationCF496-D2-B
Mr. Kitayuta's ColorCF505-D2-B
Fox And Two Dots CF510-D2-B
Pasha and String CF525-D2-B
Sea and Islands CF544-D2-B
Kefa and CompanyCF580-D2-B
Kolya and Tanya CF584-D2-B
Approximating a CoCF602-D2-B
Hamming Distance CF608-D2-B
Petya and CountrysCF66-D2-B
Bear and Finding CrCF680-D2-B
Filya and HomeworCF714-D2-B
Complete the WordCF716-D2-B
Easter Eggs CF78-D2-B
Hopscotch CF141-D2-B
Physics Practical CF253-D2-B
Little Girl and Gam CF276-D2-B
Painting Eggs CF282-D2-B
Fence CF363-D2-B
Valera and Contest CF369-D2-B
Sort the Array CF451-D2-B
Vanya and Lantern CF492-D2-B
Han Solo and LazeCF514-D2-B
Two Buttons CF520-D2-B
Tavas and SaDDasCF535-D2-B
Preparing OlympiadCF550-D2-B
Lovely PalindromesCF688-D2-B
Anatoly and Cockr CF719-D2-B
Decoding CF746-D2-B
Mahmoud and a TriCF766-D2-B
Colorful Field CF79-D12-B
Bear and FriendshipCF791-D2-B
Keyboard CF88-D2-B
Kuriyama Mirai's S CF433-D2-B
Vika and Squares CF610-D2-B
Karen and Coffee CF816-D2-B
Alyona and mex CF740-D2-C
UVA 11053
CF1043-D12-C
CF1075-D2-C
Molly's Chemicals CF776-D2-C
Number of Ways CF466-D2-C
SPOJ TWINSNOW
UVA 10920
SRM381-D2-1000
Cutting Figure CF194-D2-C
Hacker, pack your bCF822-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 Permutation CF124-D2-C
Try and Catch CF195-D2-C
Title CF59-D2-C
CF309-D1-C
SPOJ KOMPICI
Lucky Transformati CF122-D2-D
SPOJ PARSUMS
CODECHEF OPPOSITE
SRM321-D1-500
Fish Weight CF298-D2-D
Dividing Island CF63-D2-D
Median Smoothing CF591-D2-C
CF23-D12-C
CF101589-GYM-F
Atcoder092-ARC-B
23 out of 5 UVA 10344
8 Queens Chess PrUVA 750
Graph Coloring UVA 193
Safe CF47-D2-D
Jimmi's Riddles UVA 10058
Grammar EvaluatioUVA 622
Help Vasilisa the WCF143-D2-A
Balls Game CF430-D2-B
Gerald is into Art CF560-D2-B
Simple Game CF570-D2-B
Cut Ribbon CF189-D2-A
Searching for Grap CF402-D2-C
Bulls and Cows CF63-D2-C
Almost Arithmetical CF255-D2-C
Fancy Number CF118-D2-C
Recycling Bottles CF672-D2-C
Devu and PartitioninCF439-D2-C
Football ChampionsCF200-D2-C
Sereja and Algorith CF368-D2-C
Arthur and Table CF557-D2-C
CF1036-D2-C
Matrix CF365-D2-C
Removing ColumnsCF496-D2-C
UVA 12261
UVA 10705
Lucky Number 2 CF146-D2-D
Levko and Array ReCF361-D2-C
CF1017-D12-D
CF621-D2-D
SRM513-D2-1000
CF633-D12-D
SRM525-D1-500
Pipeline CF287-D2-B
Aggressive cows SPOJ AGGRCOW
Hanoi Tower Trouble UVA 10276
The Stern-Brocot UVA 10077
Magical Boxes CF270-D2-C
Image Preview CF651-D2-D
Sagheer and NubiaCF812-D2-C
The Playboy ChimpUVA 10611
Dictionary SubsequSPOJ DICTSUB
Mr. Bender and SquCF255-D2-D
Modified GCD CF75-D2-C
CF1060-D12-C
Multiplication Table CF448-D2-D
SPOJ ABA12E
Garland UVA 1555
Showstopper SPOJ MSE07E

SRM319-D1-500
SPOJ POSTERIN
Knight Tournament CF357-D2-C
LiveArchive 8078
Queue CF92-D2-D
Thor CF705-D2-C
Database UVA 1592
Little Girl and Ma CF276-D2-C
Anya and SmartphoCF518-D2-C
Lorenzo Von MatterCF697-D2-C
Weird Function SPOJ WEIRDFN
Black Box UVA 501
The SetStack CompLiveArchive 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 ThinkingCF604-D2-C
String to PalindromUVA 10739
Trouble of 13-Dots UVA 10819
Woodcutters CF545-D2-C
Counting UVA 10198
Given Length and Su CF489-D2-C
Strategic Defense InUVA 497
Hard problem CF706-D2-C
Boredom CF456-D2-C
Coloring Trees CF711-D2-C
Again Palindrome UVA 10617
Scheduling LectureUVA 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 Graph CF340-D2-D
CF506-D1-A
Barcode CF225-D2-C
Vacations CF699-D2-C
Greenhouse Effect CF270-D2-D
CF264-D1-C
Cow Program CF284-D2-D
CF1066-D3-F
Optimal Array Multi UVA 348
SRM569-D2-1000
Ilya and Roads CF313-D2-D
TIMUS 1156
Coloring Brackets CF149-D2-D
CF1012-D1-C
Journey CF721-D2-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 Subse UVA 11404
Unidirectional TSP UVA 116
Changing a String CF56-D2-D
Caesar's Legions CF118-D2-D
UnsealTheSafe SRM354-D2-1000
k-Tree CF431-D2-C
DiceGames SRM349-D1-500
Flowers CF474-D2-D
SRM428-D2-1000
SRM144-D1-500
SRM514-D1-500
Little Girl and Ma CF276-D2-D
Roman and NumberCF401-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 MUVA 10111
Tennis contest UVA 12457
First Digit Law CF54-D12-C
France '98 UVA 542
Bad Luck Island CF540-D2-D
TestBettingStrategySRM339-D1-500
Dice Throwing UVA 10759
Wizards and Huge P CF168-D2-D
CF28-D12-C
Check the difficulty PKU 2151
CF16-D2-E
Let’s Dance UVA 10218
Tribbles UVA 11021
Collecting Bugs PKU 2096
Winning Streak UVA 11176
Creating PalindromUVA 11753
CF101294-GYM-I
SRM441-D1-250
SRM536-D2-1000
MessageMess SRM149-D1-500
SRM555-D2-1000
SRM558-D1-250
Exploring PyramidsUVA 1362
Brackets sequenceUVA 1626
SRM509-D1-500
UVA 507
UVA 10667
Big Maximum Sum CF75-D2-D
SPOJ FISHES
Reberland LinguistiCF667-D2-C
Red-Green Towers CF478-D2-D
Cunning Gena CF418-D1-B
ZOJ 3305
An overnight danceCF814-D2-D
CF161-D12-D
Vertex Cover SPOJ PT07X
CF337-D2-D
Chloe and pleasantCF743-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 RectanUVA 460
Xrange's PancakesHACKR xrange-and-pizza
HACKR a-circle-and-a-square
SPOJ FACENEMY
k-Multiple Free Set CF275-D2-C
Gerald's Hexagon CF560-D2-C
View Angle CF257-D2-C
Watchmen CF651-D2-C
Bicycle Race CF659-D2-D
Pyramids SPOJ PIR
SPOJ BILLIARD
Cupboard and Ball CF342-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 RUVA 356
The Circumference UVA
o 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 Segments UVA 11343
Intersecting Lines UVA 378
SRM373-D2-1000
Intersecting Line UVA 866
SRM368-D1-500
Gleaming the CubeUVA 737
Water Falls UVA 833
How Many Points ofUVA 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 Island UVA 10088
LIVEARCHIVE 2831
Video Surveillance UVA 588
The Skyline Proble UVA 105
Queue CF490-D2-B
Marcus UVA 10452
Trees on the level UVA 122
PT07Z SPOJ PT07Z
Roads in the North UVA 10308
CF1068-D2-C
Eternal Victory CF61-D2-D
Is It A Tree? UVA 615
Mahmoud and EhabCF959-D2-C
Central Post Office UVA 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 labyri CF676-D2-D
Wandering Queen SPOJ 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 Cards CF546-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 foCF219-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 BookcasCF707-D2-D
Moodular ArithmeticCF604-D2-D
The Seasonal War UVA 352
Battleships UVA 11953
Maze Exploration UVA 784
Continents UVA 11094
SRM297-D1-500
Equivalent Strings CF560-D2-D
Subway tree syste 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 Resu CF645-D12-D
Gifts by the List CF681-D2-D
Sagheer and KinderCF812-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 LanguageCF278-D2-C
Virtual Friends UVA 11503
Almost Union-Find UVA 11987
Cthulhu CF104-D2-C
The Child and Zoo CF437-D2-D
Mahmoud and a DicCF766-D2-D
CF1012-D1-B
UVA 12128
Connected ComponCF292-D12-D
Trip Routing UVA 186
Numbering Paths UVA 125
Frogger UVA 534
Travel in Desert UVA 10816
Identifying ConcurreUVA 334
Greg and Graph CF296-D2-D
Dima and Bacteria CF400-D2-D
AlgoRace CF189-D2-D
Antifloyd UVA 10987
Unique World UVA 10448
Arbitrage UVA 104
Potholers SPOJ POTHOLE
Power Transmissio UVA 10330
The Problem with t UVA 10092
Crimewave UVA 563
Intergalactic Map SPOJ IM
A Plug for UNIX UVA 753
March of the PenguUVA 12125
Gopher II UVA 10080
Software Allocation UVA 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 Programmer UVA 11506
PeopleYouMayKno SRM447-D1-500
SPOJ COCONUTS
SRM465-D1-500
Highways UVA 10147
Is There A Second UVA 10462
UVA 10843
ACM contest and BlUVA 10600
TimeTravellingSal SRM492-D2-1000
CF472-D12-D
RACING UVA 1234
Arctic Network UVA 10369
KingdomReorganizaSRM531-D2-1000
Lazy Student CF606-D2-D
ActivateGame SRM470-D2-1000
Minimal Ratio Tree LIVEARCHIVE 4326
The Bottom of a GrSPOJ BOTTOM
Test UVA 10731
Dominos UVA 11504
CF467-D2-D
SRM312-D1-500
Proving EquivalencUVA 12167
SRM608-D2-1000
SRM495-D1-500
CF403-D1-C
SRM391-D2-1000
Summer sell-off CF810-D2-B
Minimum Ternary StCF1009-D12-B
Towers CF479-D2-B
Semifinals CF378-D2-B
The Child and Set CF437-D2-B
Escape from StoneCF265-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 ProgressCF567-D2-C
SRM481-D1-500
Team CF401-D2-C
Drazil and FactorialCF515-D2-C
Hiring Staff CF216-D2-C
Star sky CF835-D2-C
Vanya and Exams CF492-D2-C
ZOJ 1200
CF729-D12-D
A and B and InteresCF519-D2-D
Palindrome TransfoCF486-D2-C
Marina and Vasya CF584-D2-C
Tennis ChampionshCF735-D2-C
Anya and Ghosts CF508-D2-C
Terse princess CF148-D2-C
Lucky Permutation 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
CF1012-D1-A
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 Palindromes! CF465-D2-C
CF709-D2-D
CODECHEF BJUDGE
CF1023-D12-E
Russian Roulette CF104-D2-D
CF1043-D12-E
DZY Loves ModificaCF447-D2-D
AtCoder002-AGC-C
Of Zorcs and Axes 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 Polyhed CF785-D2-A
Valera and X CF404-D2-A
Tanya and PostcardCF518-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! SupeCF219-D2-B
Non-square Equati CF233-D2-B
Flag Day CF357-D2-B
Sereja and Mirrorin CF426-D2-B
Little Pony and SortCF454-D2-B
MUH and ImportantCF471-D2-B
Gena's Code CF614-D2-B
Opposites Attract CF131-D2-B
Little Pigs and Wol CF116-D2-B
Cosmic Tables CF222-D2-B
Prime Matrix CF271-D2-B
Wet Shark and Bis CF621-D2-B
CF1030-D12-B
Facetook Priority WaCF75-D2-B
Hanoi Tower TIMUS 1054
Treasure CF495-D2-C
Game CF69-D2-C
Accordian PatienceUVA 127
Beautiful Sets of PoCF268-D2-C
Appleman and Toa CF462-D2-C
Three Logos CF581-D2-D
Guess Your Way OuCF507-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
The Drunk Jailer LIVEARCHIVE 2557
Product UVA 10106
To Carry or not to CUVA 10469
Adding Reversed NUVA 713
CF1051-D2-B
Escape CF148-D2-B
Restoring Painting CF675-D2-B
Caisa and Pylons CF463-D2-B
T-primes CF230-D2-B
CODECHEF GCDMOD
CF1059-D2-C
Number Sequence UVA 10706
Divisible by Seven CF376-D2-C
Fractions Again?! UVA 10976
Plant CF186-D2-C
Magic Formulas CF424-D2-C
Duff in Love CF588-D2-B
Pythagorean Triple CF707-D2-C
Light, more light UVA 10110
Power of CryptograUVA 113
Round Table KnightCF71-D2-C
Lucky Permutation T CF304-D2-C
Vasya and Petya's CF577-D2-C
The ? 1 ? 2 ? ... ? UVA 10025
Secrets CF334-D2-C
The Meaningless CF834-D2-C
Find Maximum CF353-D2-C
Plus and Square RoCF716-D2-C
Bear and Prime 10 CF680-D2-C
CF1040-D2-D
Count Good SubstrCF451-D2-D
Tavas and Karafs CF535-D2-C
As Fast As PossibleCF701-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 ofCF451-D2-C
Analyzing Polyline CF195-D2-D
CF1016-D12-D
Quantity of Strings CF151-D2-D
How many trees? CF9-D2-D
The Errant PhysicisUVA 126
Software CRC UVA 128
Jeff and Furik CF352-D2-D
Magical Array CF84-D2-B
Chocolate CF617-D2-B
The World is a TheaCF131-D2-C
Pocket Book CF152-D2-C
Black and white paiUVA 11231
CF758-D2-C
CF459-D2-C
HACKR ajourney
Shaass and Lights CF294-D2-C
CF869-D2-C
Tourist Problem CF340-D2-C
Fox Dividing CheesCF371-D2-B
Permalex UVA 153
Prime Factors UVA 583
Easy Number ChallCF236-D2-B
Mr. Azad and his S UVA 10490
Prime Land UVA 516
Perfect P-th Power UVA 10622
Factovisors UVA 10139
CF1047-D2-C
DDF UVA 547
UVA 10174
Multifactorials UVA 11347
CF1033-D12-D
Remainders Game 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 Resistanc CF344-D2-C
LCM Challenge CF236-D2-C
CF1010-D1-C
AtCoder026-AGC-B
SPOJ EASYMATH
Hamburgers CF371-D2-C
The Lottery UVA 10325
CF101933-GYM-K
CF372-D1-B
SPOJ MSKYCODE
CF101992-GYM-D
Equation UVA 727
Farm TIMUS 1349
Summation of PolynUVA 10302
HACKR tower-3-coloring
R U Kidding Mr. F UVA 10509
Polly the PolynomiaUVA 498
Jzzhu and SequencCF450-D2-B
Mirror, Mirror UVA 466
Clear Symmetry CF202-D2-C
End of Fun SPOJ DCEPC12E
Uniform Generator UVA 408
Be Efficient UVA 11155
Quiz CF337-D2-C
UVA 12952
Cows and Cars UVA 10491
What is the ProbabilUVA 10056
HACKR sherlock-and-probability
Probability|Given UVA 11181
Another lottery UVA 11628
Mushroom ScientistCF186-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 Proble CF443-D2-D
Wet Shark and FlowCF621-D2-C
Little Pony and Ex 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
Twin Primes UVA 10394
Factorial Factors UVA 884
Psycho SPOJ PSYCHON
Summation of Four UVA 10168
Primes or Palindro CF569-D2-C
Divisibility of FactorUVA 10484
LIVEARCHIVE 4008
The New Rule in E UVA 10742
Sum-up the PrimesUVA 10419
Polycarpus' Dice CF534-D2-C
Flying Saucer Seg CF227-D2-C
Dreamoon and SumCF476-D2-C
CF201-D1-B
Spongebob and SqCF599-D2-D
Largest Rectangle iSPOJ HISTOGRA

R2D2 and Droid Ar CF514-D2-D
Friends and Subse 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 CoPKU 2374
CF61-D2-E
Can you answer thes SPOJ GSS3
Sum of Squares witSPOJ SEGSQRSS
CF380-D1-C
SKYLINE UVA 1232
Ordering the SoldieSPOJ ORDERS
SPOJ IOPC1207
SPOJ BRCKTS2
Bookworm TIMUS 1638
Taxi TIMUS 1607
The Blocks Proble UVA 101
Oulipo PKU 3461
A Needle in the HaySPOJ NHAY
Finding the TessereSPOJ TESSER
Period SPOJ PERIOD
Prefixes and Suffix CF432-D2-D
Tavas and MalekasCF535-D2-D
Messenger CF631-D2-D
CF1147-D1-B
CF1138-D2-D
FbHkrCup 18-RQ-C
UVA 11475
Phone List SPOJ PHONELST
Cellphone Typing UVA 12526
Disk Tree UVA 1556
Search in the dictioSPOJ DICT
Vasiliy's Multiset CF706-D2-D
CF842-D2-D
LiveArchive 8015
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 Anagra CF368-D2-D
Vasya and String CF676-D2-C
To Add or Not to AdCF231-D2-C
Two Strings CF224-D2-D
Chips CF334-D2-D
CF309-D12-B
Maximum Xor SecoCF281-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

109
Column O
4- Example: You learned DFS. Codes for it 89, 101
are 60, 61, 63. Go and solve as u want
from the problems with these codes. E.g. 60,61,63
UVA 10461 45
45
6
89, 101
89, 101
99
57
10
10
45
48
65,76
84
117
118
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 #NAME? #NAME? 0 0
CF-D3). It has problems categories, levels and quality (last 4 columns)
der style (CF-A to CF-D3) and prefer Topics-Based style
mine a category, go ahead and solve in order. Read Info 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 (Python)
0 Learn Calender Leap Year
0 Stable sort exercise
0 Video Solution - Eng Abanob Ashraf
0 Video Solution - Eng Mohamed Salah
0 Video Solution - Eng Ahmed Salah
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 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 or le
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 Sol
0
0
0
0 Sol
0
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 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 Cod
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
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
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 Sol
0
0
0
0 Sol
0
0
0
0
0 Sol
0
0 Find a formula
0 Video Solution - Eng Youssef El Ghareeb. Don't so
0 Sol
0 Don't use big integer class. Write simple array co
0
0
0
0
0 Sol uses __int128 to avoid overflow
0
0
0
0 Sol to read
0
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 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
0
0
0 Sol
0 Sol
0
0 Sol
0 Sol
0
0 Sol
0 Sol
0
0 Learn Fermat’s Last Theorem
0
0 Learn Fermat's little theorem
0
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
0
0
0
0
0
0 Sol to read
0
0 Sol
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
0 Sol
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)
Caregory
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
math, log, binary, pattern observation 87 2 p2
adhoc, calender, leap year 1 2 p1
adhoc, stable sort 1 2 p1
adhoc, stl 1 2
adhoc, NA 1 2
bf 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
math, combinatorics, bitmasks 2 p3
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
greedy, sorting 2.5 p2
binary search, doubles 2.5 p2
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
greedy 2.5 p3
math, mod 2.5 p3
adhoc, NA 1 2
adhoc, NA 1 2 p2
adhoc, prefix sum 1 2
adhoc, prefix sum 1 4 p5
adhoc, constructive 1 3 p2
adhoc, cycle detection for iterated function 1 3 p1
adhoc, constructive 1 4 p3
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 simulation1 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 segment t 1 5 p2
adhoc 1 5 p2
adhoc, sorting, [print the smallest lexicograph1 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 set2 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, two pointers 5 3 p2
bf 5 2
bf 5 2
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 nu 5 5.5 p2
bf or dp 5 5.5 p2
bf, hashing, impl, [idea that functions like fib 5 5.5 p2
bf, graph, bitmasks 5 5.5 p3
binary search 6 2.5
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, lower bound 6 4.5 p2
binary search 6 4.5 p1
binary search, math 6 4 p2
binary search, two pointers, armortized analy6 5 p3
binary search 6 5 p2
binary search, [counting subarrays with sum 6 5.5 p3
binary search, math or formula 6 5 p3
binary search, d&c, [issues in io, seems diffcu6 6 p3

bst, greedy, combinatorics 8 5.5 p2
datastructures, stack 9 3 p4
datastructures, set 9 3
datastructures, stack or dp, [count the long 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, [restrict 9 5 p4
datastructures, heap, min_max or bbst or se 9 5 p2
datastructures, sets intersections and union 9 5 p2
datastructures, lists or sets merging 9 5.5 p3
datastructures, stack or rmq or segment tree9 5.5 p2
datastructures, linked list, impl 9 5.5 p1
datastructures, stack & queue 9 6 p2
datastructures, heap, [counting subarrays wit9 6.25 p4
dp, [use scanf, you may need to avoid memse 10 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, bi10 5 p2
dp, observation 10 5 p2
dp 10 5
dp 10 5
dp, lcs, analysis 10 5
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, graph or dijkstra 10 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 pr13 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 distance]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 theory 23 4
dp, dp_games, dp_probability 23 4.5 p2
dp, dp_games 23 4.5
dp, dp_games or backtrack, minmax (alpah b23 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 adhoc 29 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 p 29 5.5 p3
dp, dp_probability or math, [hard text for few]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 per32 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 1 36 3
dp, dp_subrectangle, 2d 36 3
dp, dp_subrectangle, 2d, [actually greedy ver36 5 p2
dp, dp_subrectangle, 2d, observations, dot pr36 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, sortings 37 5.5 p4
dp, dp_table or dp_bitmasks, all submasks of37 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 guess38 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 each ti41 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) solu45 4.5 p3
geometry, formula or matrix determinant 45 4.5 p1
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 search or45 6 p2
geometry, triangles, angles, parallelogram la 45 6 p1
geometry, 3d, impl, math, [physics, kinematic46 5 p2
geometry, circles, [direct circle intersection, 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 pol47 5 p4
geometry, circles, triangles, thales' theorem, 47 5 p3
geometry, circles, min enclosing circle, [=spoj47 5 p2
geometry, circles, binay search 47 5.25 p3
geometry, circles, algebra, impl 47 5.5 p3
geometry, circles, tangents, point on segment47 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 path 48 3
geometry, lines, intersections 48 3
geometry, lines 48 3.5
geometry, lines, lines intersection, rectangles48 4
geometry, lines, polyline intersection, bf, na? 48 4
geometry, lines, distances, adhoc 48 4 p3
geometry, lines, intersections, counting, form48 4 p1
geometry, lines, distances, floyd 48 5
geometry, polygon, area, [just triangle areas]49 2
geometry, polygon 49 4
geometry, polygon, pip, polygons intersection49 4
geometry, polygon, pip, winding numbers, [pr49 4.5 p1
geometry, polygon, pip, polygons inside poly 49 4.5
geometry, polygon, bf 49 5 p2
geometry, polygon, binary search 49 5 p2
geometry, polygon, pip, intersections or conv49 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
geometry, sweep line or greedy 54 3
graph, constructive, adhoc 86 3 p2
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 d 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 algo60 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 tree 60 6 p3
graph, dfs, fermat, [rearangement propperty 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 or 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, [http 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 p2
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, bfs 65 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, sparse 71 5.5 p4
graph, max-flow, [vertex disjoint path/ super si
71 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 co72 5 p2
graph, max-flow, bipartite match, min vertex 72 5.5 p4
graph, max-flow, bipartite match, max indep 72 5.5 p3
graph, max-flow, bipartite match, min path cov 72 5.5 p3
graph, max-flow, bipartite match, konig's the 72 6 p3
graph, max-flow, min-cut, [print, as in video] 74 4.5 p1
graph, max-flow, min-cut, cut edges 74 5 p2
graph, max-flow, min-cut, vertex constraints 74 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 complete 76 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 77 5.75
graph, scc, probability, [more about probabilit77 6.25
graph, scc, matrix or optimized bf, [using the 77 6.25 p5
graph, scc, dp, [scc may help thoughts] 77 6 p3
greedy 84 2 p2
greedy 84 2
greedy 84 2
greedy 84 2
greedy, sorting, bitmasks 84 2.5
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, brute force, sorting 84 5 p2
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 srm502
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
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 or bf 87 2 p1
math 87 2
math 87 2
math 87 2
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, constructive 87 4 p3
math 87 4 p2
math, number theory 87 4 p2
math 87 4
math 87 4
math 87 4
geometry, triangles, formula 45 4.5 p2
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 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, interacti87 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 87 5.5 p2
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, 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^n, [ 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, fac 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, multiview 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
math, gcd, lcm 99 5
math, gcd, mod, number theory 99 5.5 p1
math, gcd, cases 99 6 p3
math, inclusion-exclusion, lcm 101 3
math, inclusion-exclusion, binary search 101 3
math, inclusion-exclusion, gcd, overflow 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 113 2
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, combina 113 5.5 p3
math, probability, sorting 113 5.5 p3
math, probability, recursion, precision 113 5.5
math, probability, bitmasks or dp_probability, 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_probabili114 4
math, probability, expectation, bitmasks 114 4
math, probability, expectation, dfs 114 4
math, probability, expectation, permutation 114 4
math, probability, expectation, greedy or dp 114 4.5 p3
math, probability, expectation 114 4.5
math, probability, expectation, pattern 114 4.5
math, probability, expectation, linearity of ex 114 5 p3
math, probability, expectation, linearity of ex 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
math, probability, expectation, formula, greed114 6 p3
math, repeated squaring, mod, direct 115 3
math, sieve 117 3
math, sieve, factorization 117 3.5
math, sieve, factorization, tricky big # test ca 117 4 p2
math, sieve 117 4
math, sieve, palindromes 117 4.5 p3
math, sieve 117 4.5 p2
math, sieve, [last non zero digit of permutati 117 5.5 p2
math, sieve, binary search 117 5.5
math, sieve, dfs, dp 117 5.5
math, greedy, careful impl 87 3 p3
math, summations 118 4.5 p3
math, summations, [in my videos] 118 5 p3
math, summations, seperate summations or ter 118 5 p2
math, summations, bf, [overflow] 118 6 p2
rmq, d&c or datastructure, [largest rectang 122 4.5 p4

rmq, binary search or bit or two pointers 122 5 p3
rmq, sparce table, binary search or datastruc122 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 s125 5 p3
segment tree, [max sum, part of gss series: ht 125 5 p3
segment tree, rmq shift 125 5 p3
segment tree 125 5 p2
segment tree, lazy propagation or datastruct 125 5 p2
segment tree, lazy propagation, greedy or bi 125 5 p2
segment tree, dp or dp 125 5 p1
segment tree or wavelet tree, [boring, invers 125 5 p1
segment tree, [max sum+updates, spoj gss1 125 f 5.5 p5
segment tree, lazy propagation, impl, [weak 125 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 tre 125 5.75 p3
segment tree, lazy propagation, [handle dim 125 6 p3
segment tree, prefix sums or adhoc, recursio125 6 p3
simulation, formula, [was, tricky] 126 2 p2
simulation, tricky 126 2 p1
simulation 126 3
string processing, kmp, [count word frequenc130 2
string processing, kmp, [find words positions]130 3
string processing, kmp 130 4 p4
string processing, kmp, period max or suffix 130 4.5 p3
string processing, kmp or z-function 130 5 p3
string processing, kmp or z-function, [~cf127 130 5 p3
string processing, kmp 130 5.5 p3
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 pr
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, combinatorics 138 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
ment
n PC
omance - 1
tion
rithmatic
Principles
ntro
Point and Vector
Search
cation
k - Approach
ns and Combinations - 1
ns and Combinations - 2
s
LCM, Pow
Complex Number and 2D Point

Lines and Distances
king
kal
mbolically - Pictorially
ints
d Polynomials
nces
ations
tion
e
acking
tyle
re-interpretation
ion
d Output Analysis
scovery
erification - Implementation
Lines Intersections
Circles
- History - Contest Strategy
ether
hal
omance - 2
er and Isomorphism
Tree (2 vid)
vid)
Simple and Convex Polygons

Polygon Area - Centroid - Cut
Point in polygon
low (2 vid)
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 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, submi
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 coding. Don't
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.
Problem Name Problem Status
AC Averages => 0 ### 0 0 0 0
Total Problem By
Category
0 #NAME? #NAME? 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
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

Uploaded by

Copyright:

Available Formats

Junior Training Sheet

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Junior Training Sheet

Uploaded by

Copyright:

Available Formats

This google sheet is created by Dr Mostafa Saad Ibrahim.

CF483-D2-A White for a problem from codeforces

V1: initial release

most of people I think.

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

ne who do pretty well in CF-Div2 A, B, C, D and similar levels (e.g. TC-Div2-1000)

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

esome links - very helpful for English guys

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

Q) I watched the video, but it is hard, any tips?

Q) How does your sheet prepare for ECPC/ACPC?

Moving toward a team contest, you need more concerns:

As you may notice, there are MANY factors for sucess.

Q) How different is your sheet versus Ahmed Aly Ladders?

Q) How did you select problems for the sheet?

Q) what is the next step after finishing your sheet ?

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

- Login to ur google Gmail

Q) What to write in the category column?

The algorithm used to solve a problem. In Div2-A, this might be:

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

Q) What are these problems colors?

Q) Are the problems sorted?

So if you felt they are not sorted, just keep going

Q) Why problem-solving is that important?

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

Q) I would like to freeze my study for 1-2 years to be good in problem-solving?

Q) Topics based-training vs Blind Order

In my sheets - Blind style:

Q) Who FInished my sheet? Their levels?

Q) How to share my sheet progress with you?

Q) What is after the sheet?

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

Watch - Search Techniques - Binary Search

Video Solution - Eng Youssef El Ghareeb

Video Solution - Solver to be (Java)

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

Video Solution - Eng Yahia Ashraf

Watch - Focused and Diffused Thinking

Video Solution - SolverToBe (Java)

Video Solution - Eng Salma Yehia