I like graph and geometry problems. These problems I can see solution and draw for small values, which I really like.
I don't like BIT manipulation at all.
What do all you like and not like ?
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
I like graph and geometry problems. These problems I can see solution and draw for small values, which I really like.
I don't like BIT manipulation at all.
What do all you like and not like ?
Name |
---|
I like Segment Tree and I hate graphs... :)
I absolutely love anything related to processing queries.
Maybe you know him: PrinceOfPersia :]
Don't you get tired after solving 50th problem about segment tree with slightly changed information which it needs to keep :P?
Not really. And if you get tired of trees then sqrt-decomposition is always there to spice things up :)
I love technical problems involving algorithms and/or data structurs (Segment Trees, Maximum Matching, Suffix Arrays, KMP, some kind of DP, SQRT decomposition, sweep line, query processing, etc.).
I hate Geometry, math-heavy or uncategorized problems. That's mostly because you must handle a lot of corner cases and usually the solution doesn't require any special data structure or algorithm. For example, I don't like constructive algorithms at all.
I love constructive algorithms and, finally, every problem for brain, not for technique, accuracy or some special knowledges. It is certanly because I can solve it little better than other types. But I tried to increase my technique skills, my accuracy and so on.
I do REAL work instead of solving kiddish problems here
kiddish problems? don't kid yourself
html code for food?
Real work? Like posting comments?
saiprajna_nayak : I don't solve kiddish problems Says a person who has NOT participated in 1 contest And has solved 1 problem till now
He hasn't solved even one problem.
He just sent huhanwen's solution code.
Just curious,
How did you know which code he copied? (Is there a tool for this or ?)
I didnt use tool
Constructive Algorithms, or problems that can be solved by heavily modifying a current algorithm, or using a property in it. Plus some DP type problems.
I hate problems that are just implementation heavy, as I learn/gain nothing in problem solving aspect, I'm not doing a project..By implementation heavy, I mean problems where you are just translating English to code. I think it's stupid unless you are in a team contest, and it' a time waster.
I'm a beginner so i like Programs involving straight implementation like mist div2 A problems.Hope to Learn Dijkstra , Trees soon.And i like problems involving Math a little :)
I love problems from the graph theory. Especially Dijkstra and problems connected with SCC(Strongly Connected Components).
I hate working with strings very very much and I love graphs :)
My favorite type of problems are the ones that i can solve
and what i hate is computational geometry
Hate any kind of geometry.
I like DP + trees , and hate segment tree/BIT
I love problems that don't have many (preferably any) corner cases, so that I spend my time in logic rather than fixing corner cases. I don't like problems that need lot of bookish knowledge, such as geometric formulas . I love problems that you can solve with logic, such as DP, some graph problems, etc. Basically anything that I can solve even without much theory knowledge. I also love segment trees and BITs because I think they are conceptually amazing data structures. I hate problems where cin/cout gives TLE, and other such silly optimizations. I mean, those are the worst kind of bugs.
I mostly like data structures, DP, graphs. I also like problems about strings since almost all are related to some structures (suffix arrays/trees, hashing, tries ans some I haven't heard of, I guess). I don't like too "mathy" problems and some hard geometry problems based on messy formulas (if it's convex hull or something, then it's OK, but this — http://www.spoj.com/problems/TETRA/ ... :X), however I want to be good at those topics :)
I like greedy problems at most. Also problems with binary search + dp are always interesting :)
I like ad-hoc problems. The less it resembles anything I've seen before, the better!
love number theory and graph most .... afraid of geometry :(
Problems about money and stock trading, like recent 572B - Order Book ))
I like problems that I can solve.
I like graphs, geometry, data structures, game theory. Most of all I like marathons. And I don't like problems about strings.
I love all of A div.2 problems ^_^
And also problems that you can hack on them...
I like problems that require no more knowledge than Algorithms 101.
I love all problems!
Easy problems are like a nice breeze! Moderate problems makes me feel warm inside when I solve them! Challenging problems inspires me to work harder!
I especially like probability questions and combinatorial ones about counting ways to do something or number of some arrangements (some people will call them math). Another type of problems I really like are problems whose statement has nothing to do with geometry but it turns out that we need to interpret them geometrically and compute some e.g. convex hulls.
And I also really like when problem is a heavy one, but has a really short solution, I prefer thinking over coding :P.
And I really hate strings :(. And problems which follow well known techniques and from top level resemble many other ones.
Could you please give me some useful resources, tutorials for solving counting and probability problems? I am having a hard time with these problems.
Sadly, I can't. Requests about resources are always troublesome for me, I haven't ever really learnt anything from one big resource.
You should start responding to this kind of questions with Google. Or Codeforces.
i love DP problems a lot ! but i hate geometry problems or JUST math(not math) problems!
the math problems like Combinatorics are very fun too!
My favourite type is DP mixed with some combinatorics !
I like combinatorics,dp,string(related to trie,sufix automaton,KMP,hashing),number theory,data structures(a lot),hard geometry(where you don't need many formulas but you need basics), ans a bit of graphs(problems with nice solutions and where you don't need to prove anything).
math and number theory...
Combinatorics/probability involving graph theory!
I like problems about greedy, because I'm greedy.
:D
I like Segment Tree, Fenwick Tree, Bit manipulation, Sparse Table, LCA and everything related with binary numbers or trees.
I hate geometry problems. And I don't really like solving graph problems.
I like graph problems, Data structure like segTree and BIT and Tries, although I'm not that good in them, Dynamic programming, and some of A and B on CF that need a small idea to pop into your head when you read them.
I hate math and geometric problems, and problems with UNCLEAR statements.
I like Graph problems and Hate Geometry & Advanced Math problems.
I love any problem that's unconventional and have beautiful solution. And I hate problem that have difficult input/output implementation.
I like Computational Geometry problems and the ones which you should think on more than coding or you should find a pattern , I liked this problem : 560C - Gerald's Hexagon
i loved that problem eventhough i took me a while to recognize the pattern