Tobby_And_Friends's blog

By Tobby_And_Friends, history, 3 years ago, ,

Does anyone maintain a list of problems he/she has solved so far which was interesting and a bit challenging? If so, please share.

• +88

•  » » 3 years ago, # ^ |   +124
•  » » 3 years ago, # ^ |   +24 Thanks a lot -Morass- for your hard work. It'd be great if you could use spoiler tag.
•  » » » 3 years ago, # ^ | ← Rev. 3 →   +36 (I've let there be just a single list) [some spam charges] :P
•  » » » 3 years ago, # ^ | ← Rev. 2 →   +13 (I've let there be just a single list) [some spam charges] :P
•  » » » » 3 years ago, # ^ |   +19 OMG ! This is something like, I wanted a bicycle and got an airplane. :) I really didn't expect that. This is huge <3 Actually I wanted to say you might use spoiler tag to make it easier to read the problems. Like: BFSProblem 1 Problem 2 DFSProblem 1 Problem 2 RMQProblem 1 Problem 2 DPProblem 1 Problem 2 KMPProblem 1 Problem 2 etc.
•  » » » » » 3 years ago, # ^ | ← Rev. 3 →   +84 (I've let there be just a single list) [some spam charges] :P
•  » » » » » » 3 years ago, # ^ |   +19 Exactly <3
•  » » » » » » 3 years ago, # ^ |   +16 So, can you please edit your first two replies ? Please only keep the last reply only.Since comment can not be deleted, you can just replace your first two replies by any single word.
•  » » » » » » » 3 years ago, # ^ |   +9 Good day to you, Oka, I've made it one list — hope it is OK like this?! :O Have nice day!
•  » » » » » » 3 years ago, # ^ |   +5 Yea, I'd appreciate as well if you could leave only spoilered version (third comment), because the list is really amazing but first two comments make it hard to read :|
•  » » » » » » » 3 years ago, # ^ |   0 Good day to you,Oka, I've made it one list — hope it is OK like this?! :O Have nice day!
•  » » » » » » » » 3 years ago, # ^ |   +4 Hell yeah, great!
•  » » » » » » » » 2 years ago, # ^ |   +1 Hey Morass, are u the person who contributed lots of test cases in udebug and saved a lots of people?!!!
•  » » » » » » » » » 2 years ago, # ^ |   0 No More Ass lmao
•  » » » » 3 years ago, # ^ |   +5 Hi Do both of your comments contain exactly the same problem?! Also,thanks for the great help,beginners like me benifit a lot..
•  » » » » » 3 years ago, # ^ |   +15 Good day tou you,well yes, just in different "format" [unless those two middle comments with "hints", those two commenst shall be one]Have nice day ^_^
•  » » » » 3 years ago, # ^ |   +11 I seriously think you should get a thousand upvotes for your effort. :)
•  » » 3 years ago, # ^ |   +13 Wow! Awesome effort! This is what makes the programming community so great! Just a thing, I can't access the problem of "Aho Corasick + DP" problem in SPOJ. It just takes me to the status page. Can you edit it?
•  » » » 3 years ago, # ^ |   +19 Good day to you,yes you are right — it shall be this linksorry ^_^ Good Luck!
•  » » » » 3 years ago, # ^ |   +5 thanks mate! ^_^ you are simply awesome! :D
•  » » » 3 years ago, # ^ |   +5 Thanks a lot :)
•  » » » 3 years ago, # ^ |   +5 Hi -Morass- maybe it's too much! but could you put a list of only dp on trees? It's a difficult topic for me and I want to train it! btw thank you for this list and your time You're awesome!
•  » » » » 3 years ago, # ^ | ← Rev. 3 →   +5 Good day to you,well they are slightly hard to recognize :/ {hard to find any keywords in it}... so there are just a few of them (and I also don't promise it is alway optimal solution) Tree DP13089 — Golden Coins (UVA)http://codeforces.com/problemset/problem/855/Chttp://codeforces.com/problemset/problem/718/Dhttps://www.codechef.com/problems/TWOCOINShttps://www.hackerrank.com/contests/101hack35/challenges/road- maintenance/problem7649 — Performance Review (LA)http://codeforces.com/problemset/problem/741/Dhttp://codeforces.com/problemset/problem/592/Dhttps://www.codechef.com/problems/TOMJERGAhttp://codeforces.com/problemset/problem/814/D1220 — Party at Hali-Bula (UVA)https://www.hackerrank.com/contests/june-world-codesprint/challenges/r- tree-decoration/problem12452 — Plants vs. Zombies HD SP (UVA)http://codeforces.com/problemset/problem/735/Ehttps://www.codechef.com/problems/COLTREE12466 — Ancestors (UVA)6829 — Intrepid climber (LA)https://www.hackerrank.com/contests/101hack35/challenges/jeanies-route12257 — The Queue (UVA)http://www.spoj.com/problems/ADASALES/http://codeforces.com/problemset/problem/805/Fhttp://codeforces.com/problemset/problem/763/D1218 — Perfect Service3346 — Perfect Domination on Trees (same as above -_-)12093 — Protecting Zonkhttp://codeforces.com/problemset/problem/23/Ehttp://www.spoj.com/problems/TWOPATHS/ //Same as above ~ bigger constraintsGood Luck & Have Nice Day ^_^
•  » » » 2 years ago, # ^ |   0 Hi there, the bounds for 727D look a little large for flow. How'd you do it? I passed with a greedy after realising that my Dinic's was too slow.
•  » » 3 years ago, # ^ |   +15 I don't know how should I thank you. You are too awesome ^_^ Thank You for your hard work. Ttttttttttttttttttttttttthhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaannnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk Yyyyyyyyyyyyyyyyyyyyyyyyyyyyooooooooooooooooooooooooooooooooooooooooooooouuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuu ^_^
•  » » 2 years ago, # ^ |   0 AMAZING DUDE.
•  » » 10 months ago, # ^ |   0 -Morass- you have numbers next to the problems can you tell me what is it. Is it the number of how hard is that problem or what? by the way thangs for such great comment.
•  » » » 10 months ago, # ^ |   +8 Good day to you,well kind-of.. it is a difficulty rating from 1→10 .. depending on what feeling I had ... yet it is pretty much biased by the current feeling xPUsually:1) Very trivial2) Trivial, but at least not just dull print from input :P3) Usually some lesser idea/algo but shall not be difficult4) Guess this shall be average problem, which is not too hard, yet requires some skill or maybe algo/DS.5) There shall be hard implementation or nontrivial ideas6+ Same as 5, but more and more difficult x)Good Luck!
•  » » » » 10 months ago, # ^ |   0 Thank you very much. you are very kind person.
•  » » » » 2 months ago, # ^ |   0 I have solved 4 problems which is in 5 catagory recently and a lot of problems which is in 4 catagory. Does this mean I have become better??
•  » » 5 months ago, # ^ |   0 How to solve Spoj Got using Mo's algo ? In case the tree given was a binary tree, I would have flattened it into array and do the normal MO's query sort and answer, but the tree can be non-binary as well. What to do ?
•  » » » 5 months ago, # ^ |   0 Good day to you,Hope I have correct blog.. here shall be tutorial!Good luck!
•  » » 3 months ago, # ^ |   0 Sorry, but what is UVA???
•  » » » 3 months ago, # ^ |   0 Well it is an online judge with plenty of problems (not really sure if not renamed yet :O )
•  » » » » 3 months ago, # ^ |   0 Thanks!
 » 3 years ago, # |   +24 Did anyone count how many problems -Morass- posted? :p btw thanks for this collection .
•  » » 3 years ago, # ^ |   +22 There are 94 topics and total of around 900 problems.
•  » » » 3 years ago, # ^ | ← Rev. 2 →   0 _/\ _ for your patience bro .
•  » » » » 3 years ago, # ^ |   +20 Nothing is difficult for a programer. Took me 5 minutes to write the program to count the number of lines in the text. Anyways, thank you.
•  » » » » » 3 years ago, # ^ |   +21 One could use "wc -l" (at least as soon as you are using bash) => "cat filename| wc -l"
•  » » » » » » 3 years ago, # ^ |   0 Or just "wc -l filename"?
•  » » » » » 3 years ago, # ^ |   -37 "Nothing is difficult for a programmer"Cyan coder
•  » » » » » » 3 years ago, # ^ |   +23 wow, nice attitude you got there! You know, being good at CF != being good at programming
•  » » » » » » » 3 years ago, # ^ |   +13 Never stated the opposite. However, "Nothing is difficult for a programmer" implies being able to handle both easily.
•  » » » » » » 3 years ago, # ^ |   +13 I meant in the sense that a non-programmer would have counted the lines but for a programmer most of the computer jobs are an easy work sometimes due to his programming skills. Sorry if I offended high rated guys.
•  » » » » » » » 3 years ago, # ^ |   +5 Yeah, I know you didn't mean it literally. My comment was meant to be a joke, not a form of offence.
•  » » » » » » » 7 months ago, # ^ |   0 How did you count the lines in the browser ?
•  » » » 3 years ago, # ^ |   +21 Exemplary persistence! I am not sure if I even solved 900 problems, let alone "interesting ones" and "recently".
•  » » » » 3 years ago, # ^ | ← Rev. 3 →   +5 I have solved around 1200 problems and I am still cyan. Some people are really lucky!
•  » » » » » 3 years ago, # ^ |   +5 Yes
•  » » » » » 11 months ago, # ^ |   0 Maybe You dont the correct way
•  » » » » » » 11 months ago, # ^ |   0
•  » » » » 2 years ago, # ^ |   0 Really? You are a red coder. You must be having strong math background:)
 » 3 years ago, # |   0 this link may be helpfull
•  » » 4 months ago, # ^ |   0 Well, A2 Online Judge is permanently shut down.
 » 3 years ago, # |   0 Good Contest