killjee's blog

By killjee, history, 4 months ago, In English,

Hi Codeforces Community

I would like to invite you all with great pleasure to Plinth Codeathon which is being organised by students of The LNM Institute Of Information Technology.

The Contest will have 2 rounds first an online eliminator which will be conducted on 15th January 2018 at 21:00 IST and the final round which will be conducted as an onsite event during our technical fest Plinth on 20th January 2017.

Online round date and time: 15th January 2018 21:00 IST Online round duration: 3:00 hours

Prizes For Onsite Round: 15,000INR cash + goodies Prizes For Online Round: T-shirt for top 2 participant

Problem setters for online round are: 8shubham, coderbond007, akhem301 and me

Contest Link: https://www.codechef.com/PLCO2018/

Registration Link For Prizes (Mandatory even for prizes of online round): Click here

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

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

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

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

Is there something wrong with checker of prime swaps because when I compare with my friends accepted solution using diff.all the 10^6 values were matching.

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

    N = 0

    • »
      »
      »
      4 months ago, # ^ |
      Rev. 2   Vote: I like it 0 Vote: I do not like it

      but constraints were clearly n>=1 right or was I missing something?

      Also I see something wrong with leaderboard with penalties. Was there any mistake with chef and chocolates question??

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

        Assert fails. :(

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

        yeah, we had to print happiness vals in increasing order, it was not written anywhere in the question.

        Loads of WAs due to that.

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

        We are extremely sorry for the bug in question Prime Swap for N=0 and for increasing order problem in the question Chef and Chocolates. We will try to rejudge the solutions as soon as possible.

»
4 months ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

why problems is not available for practise??

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

    They are.

    You can find them in the practice->peer section.

    Or simply open the problem in the contest and remove the contest code from the URL.

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

      I already checked peer section but was unable to find..

      Removed contest code and found.Thanks and Have a good day!!