Karvalian's blog

By Karvalian, history, 10 days ago, In English

need cool guy to be my mentor, ive been programming for 6 — 7 years, game dev, binary exploitation, software development, I have about 6 months now to do anything I want and cp looks pretty cool, I come to cp every year and put a week and then disappear but this time I want to stick, having someone to talk to that's way better than you is cool and helps improve i hope, people in my rating can contact too, cool to know how people are trying to get better, don't care about rating, just want to be able to solve fun problems. my discord is "eip127"

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

»
10 days ago, # |
Rev. 2   Vote: I like it +33 Vote: I do not like it

contect with tourist

»
10 days ago, # |
  Vote: I like it +11 Vote: I do not like it

contect with PEIMUDA

»
10 days ago, # |
Rev. 2   Vote: I like it +9 Vote: I do not like it

When I read your post's title, I thought you were looking for a dating partner.

»
10 days ago, # |
Rev. 2   Vote: I like it -19 Vote: I do not like it

contact NeverCompromise, Sparky_Master_WCH1226 or WeaponizedAutist for their enlightenment -> the Gods of competitive programming

»
10 days ago, # |
  Vote: I like it -32 Vote: I do not like it

yo can a red contact me already? 18 upvotes and still no red :(

  • »
    »
    9 days ago, # ^ |
      Vote: I like it +10 Vote: I do not like it

    don't care about rating

    18 upvotes and still no red :(

    Ok

    • »
      »
      »
      9 days ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      got no gray either or any other rank for that matter

  • »
    »
    9 days ago, # ^ |
      Vote: I like it +41 Vote: I do not like it

    Why do you think someone skilled would want to contact noob at topic with no incentive for them?

    Just try to search some public competitive programming discord and discuss there.

»
9 days ago, # |
  Vote: I like it 0 Vote: I do not like it

contact with galen_colin

»
9 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Is a coolboy alright?

»
9 days ago, # |
  Vote: I like it +4 Vote: I do not like it

Bro I will help if you want, just message me!!!

  • »
    »
    9 days ago, # ^ |
      Vote: I like it +9 Vote: I do not like it

    Bro you got CM. orz

    • »
      »
      »
      9 days ago, # ^ |
        Vote: I like it +5 Vote: I do not like it

      Yesss after getting trolled twice by MikeMirzayanov then I locked in whem it was round 941 and made fast ABCD even though I coded from my cellphone!

      Thank youu terracottalite <3

      • »
        »
        »
        »
        9 days ago, # ^ |
          Vote: I like it +9 Vote: I do not like it

        You coded from your cellphone and did ABCD fast ?! this is strong

        • »
          »
          »
          »
          »
          9 days ago, # ^ |
            Vote: I like it +4 Vote: I do not like it

          Thankyouu

          I think it was luck that the problems in this contests were hard in the ideas but simple codes

          I am very bad implementation for data structures like heaps and maps. Maybe I must stop using C and learn C++ but it is ugly

          • »
            »
            »
            »
            »
            »
            9 days ago, # ^ |
            Rev. 3   Vote: I like it 0 Vote: I do not like it

            yoo CM using C ?! I was stubborn about using C when I started but when problems started using pq's and vectors for adjacency lists I couldn't continue unlike you. orz

            If you want to use C maybe use templates or smth? It shouldn't be too hard to have a pq_push function which takes a struct pq* argument ?

            • »
              »
              »
              »
              »
              »
              »
              9 days ago, # ^ |
                Vote: I like it 0 Vote: I do not like it

              Yes after fighting with a few rounds I have some codes for heap and graph :)

              If you want the adjaycent list in C I give you a code: 225145338 I use linked list but without pointers, so it is more fast (put MAXN nodes and MAXM edges to use)

              Now i am work in progress in binary search tree with the idea of TREAP.

              • »
                »
                »
                »
                »
                »
                »
                »
                9 days ago, # ^ |
                  Vote: I like it +5 Vote: I do not like it

                Damn. An actual practical use case for linked lists.