AhmetKaan's blog

By AhmetKaan, history, 6 years ago, In English

Hello Codeforces! On Friday(May,15,2020) 17:35(GMT+3) Preparing for olympiads contest start. And it takes 2 hours. It will be mashup contest on codeforces. You can enter with this The problems were invented and prepared by me Ahmet Kaan AhmetKaan Avci , Faruk farukkastamonuda Avci and Halit Tugra Halit Celik Also huge thanks to to problemsetting and testing the round .We will be really happy if you join to our contest.

UPD:Last 1 hours!

The first solvers of problems!


A-) Gheal


B-) swapnil159


C-) swapnil159


D-) Sorting


E-) There are no people who solve this problem after rejudge but before the rejudge 16204 solve the first.


And the winner of the contest is 16204


I want to say Congratulations to who entered to this contest. I hope that you enjoyed it.

And now you can find the contest in this group.

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

| Write comment?
»
6 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

April 27?

»
6 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

link not working

»
6 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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

»
6 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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

»
6 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

What is average difficult of the problems?

»
6 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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

»
6 years ago, hide # |
 
Vote: I like it +3 Vote: I do not like it

It would be great if you guys create a group and add these contests to the contests tab.

»
6 years ago, hide # |
 
Vote: I like it +3 Vote: I do not like it

When does the contest start?

»
6 years ago, hide # |
 
Vote: I like it +16 Vote: I do not like it

Next time, please get a coordinator that can write clear English (I volunteer). The statements are, to be honest, quite disastrous.

»
6 years ago, hide # |
 
Vote: I like it +10 Vote: I do not like it

How to solve E?

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

    Me second.

  • »
    »
    6 years ago, hide # ^ |
     
    Vote: I like it +6 Vote: I do not like it

    Seeing as you are the only one with a solution better than O(n2) optimize (although even with the tightened limit highly optimized O(n2) would still pass), can you please elaborate on your idea?

    • »
      »
      »
      6 years ago, hide # ^ |
       
      Vote: I like it +10 Vote: I do not like it

      My solution is still O(n^2), I just had a time bomb and some more optimizations

  • »
    »
    6 years ago, hide # ^ |
     
    Vote: I like it +18 Vote: I do not like it

    We will publish it

    Spoiler
»
6 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

When will Editorial be published?

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

    We Will publish it in 1 || 2 hours :D

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

      Why not right now? Many users from East Asia such as Vietnam, Japan or China will have to wait until morning (it's over 12pm here).

      • »
        »
        »
        »
        6 years ago, hide # ^ |
        Rev. 2  
        Vote: I like it 0 Vote: I do not like it

        In Turkey we are fasting. And there is Time Difference between cities. When fasting is finished, we will publish it. (And There is a communucation problem)

»
6 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

It was very hard to understand the problems. And please don't change time limit between the contest, test the problem before the contest.

»
6 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

You should add IOI style scoring and subtasks next time for a better OI experience, just saying.

Great job, nevertheless

»
6 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it
»
6 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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

»
6 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

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