omeravci372742's blog

More Matrix Multiplication Problem Plz
By omeravci372742, history, 5 years ago, In English

I just recently figured out how to implement logarithmic matrix multiplication and I feel so bad that I couldn't find out before the last div 2 contest so please ask more matrix problems in the next exams.

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

Comments Comments (18)
| Write comment?
»
5 years ago, # |
← Rev. 2   Vote: I like it +3 Vote: I do not like it

it doesn't sound good

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it +4 Vote: I do not like it

No matrix please

→ Reply
»
5 years ago, # |
  Vote: I like it +6 Vote: I do not like it

I also learned matrix multiplication recently

→ Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it +7 Vote: I do not like it

I'dont like math problems.

→ Reply
»
5 years ago, # |
  Vote: I like it +2 Vote: I do not like it

https://codeforces.me/blog/entry/8544

→ Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

DON'T ASK MATH PROBLEMS...

This is CODEforces not MATHforces

there will be math problems too but last contests are full of math problems there is less algorithims and data structres and dps but there is too much math this is CODEforces CODEforces CODEforces.

Ask CODE problems much than math problems.

→ Reply
  • »
    »
    5 years ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    Not really, I hate math problems but this is definitely not one of them.

    → Reply
»
5 years ago, # |
← Rev. 2   Vote: I like it -21 Vote: I do not like it

You are bad at Matrix multiplication so code forces rounds should ask include this topic more often? LMAO. There are green and gray coders that are bad at DP, FFT, NTT, Greedy, segment tree, fenwick tree, binary search tree, ad-hoc, sorting, blah blah blah. So Codeforces rounds ought to include them all? GOOD IDEA. LMAO. How about we have rounds that has 100 problems so that we can have one problem for every topic? BUT, you will be the one preparing the round along with anyone who agrees with you. Let's see if you will make any more of this sort of nonsensical request.

TLDR: YOU ARE A BLOODY SELFISH PIECE OF SHIT.

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

    nonono, what the original poster is saying is that he just learned how to do it and that since he missed last round's matrix multiplication problem he wants more problems to compensate so that he can get the high rating since now he knows matrix multiplication

    → Reply
    • »
      »
      »
      5 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Erm. So what algorithm did you miss in the last round? Let's include it in the next round as well. And let's get the green and grays to propose theirs as well. The list never ends. Get the idea?

      → Reply
      • »
        »
        »
        »
        5 years ago, # ^ |
          Vote: I like it +17 Vote: I do not like it

        my guy i'm not sure you understand what a joke is

        → Reply
    • »
      »
      »
      5 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Yeah you kind sir got it right

      → Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 3   Vote: I like it +9 Vote: I do not like it

    What is wrong with you? LanceTheDragonTrainer

    → Reply
  • »
    »
    5 years ago, # ^ |
    ← Rev. 2   Vote: I like it +5 Vote: I do not like it

    I feel like the way we can find out who LTDT is find a once-orange coder who has had several high negative delta rounds in a row. wtf are these comments

    → Reply
    • »
      »
      »
      5 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Lol. Interesting. What makes you think that I was once orange? And what makes you think that I have had several high negative deltas in a row? Human imagination is really incredible.

      → Reply
      • »
        »
        »
        »
        5 years ago, # ^ |
        ← Rev. 2   Vote: I like it 0 Vote: I do not like it

        I think he is a master or candidate coder and had tried to be grandmaster for a long time and he failed and turned to be a such a ....

        → Reply