Malek__'s blog

By Malek__, history, 12 months ago, In English

Hi to F solvers that got stuck on D ):

Seems like graph algorithms are much harder than topics taught in universities for you. Honestly Gaussian elimination is still hard for me, maybe that`s why I am still a specialist, what is your secret?

  • Vote: I like it
  • +74
  • Vote: I do not like it

»
12 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by Malek__ (previous revision, new revision, compare).

»
12 months ago, hide # |
 
Vote: I like it +22 Vote: I do not like it

would say gaussian elimination is a rather trivial subject, anyone with a rating of at least 1200 should know it.

»
12 months ago, hide # |
 
Vote: I like it +14 Vote: I do not like it

Ah shit here go again ... For the new generation of competitive programmers, Gaussian elimination is as obvious as a greedy algorithm. With these elites, we no longer need to fear AI overtaking humans.

  • »
    »
    12 months ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    I've never used Gaussian elimination in my life, and I can't recall any problem that would require it. I don't think it's the fault of the new generation.

»
12 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Not wanting to defend cheaters, but a problem that is basically applying Gaussian elimination is much easier than a problem that requires building a graph and doing some hard observations on it. Especially considering Gaussian elimination is a well know problem and there is plenty of code online for that.

  • »
    »
    12 months ago, hide # ^ |
    Rev. 3  
    Vote: I like it +3 Vote: I do not like it

    imo the problem is not just "apply gaussian elimination". There is still some thinking required to reduce the problem to this (and the most natural way to solve the problem, once you reduced it, is to use xor basis)