Dominater069's blog

Invitation to CodeChef Starters 108 (Rated till 6-stars) — 15th November
By Dominater069, history, 13 months ago, In English

Invitation to CodeChef Starters 108 (Rated till 6-stars) — 15th November

We invite you to participate in CodeChef’s Starters 108, this Wednesday, 15th November, rated till 6-stars (ie. for users with rating < 2500).

Time: 8:00 PM — 10:15 PM IST

Read about the recent judge migration here.

Joining us on the problem setting panel are:

Written editorials will be available for all on discuss.codechef.com. Pro users can find the editorials directly on the problem pages after the contest. The video editorials of the problems will be available only to Pro users.

Also, if you have some original and engaging problem ideas, and you’re interested in them being used in CodeChef's contests, you can share them here.

Hope to see you participating.

Good Luck!

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

Comments Comments (23)
| Write comment?
»
13 months ago, # |
  Vote: I like it +9 Vote: I do not like it

Damn, Dominater069 and Everule finally came together for a contest!

→ Reply
»
13 months ago, # |
  Vote: I like it +39 Vote: I do not like it

expecting that Everule's problem will just be "print proof of your solution"

→ Reply
  • »
    »
    13 months ago, # ^ |
      Vote: I like it +7 Vote: I do not like it

    As a Tester I can't spoil much but you are not wrong

    → Reply
»
13 months ago, # |
  Vote: I like it +21 Vote: I do not like it

It is clashing with world cup semifinal between INDIA and NEWZEALAND.

→ Reply
»
13 months ago, # |
  Vote: I like it +8 Vote: I do not like it

OMG! Everule Round!!!

→ Reply
»
13 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Contest details states duration — 2hrs on the home page- Link

→ Reply
»
13 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Can someone clarify it shows problems will be available in 34 mins but the contest begins in 4 mins?

→ Reply
»
13 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Is contest starting at 8:30pm IST? The timer is showing half hour left for start of contest

→ Reply
»
13 months ago, # |
  Vote: I like it +13 Vote: I do not like it

19:55 PM IST: Due to some issue, we are forced to postpone the contest by 30 minutes. The contest will start at 20:30 IST. Apologies for the inconvenience.

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

    Sorry, we had to postpone by 10 more minutes.

    → Reply
    • »
      »
      »
      13 months ago, # ^ |
        Vote: I like it +24 Vote: I do not like it

      at this point just postpone it to tomorrow and we can all watch the semifinal

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

2 Aditya are problemsetters.

Aditya

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

    Aditya

    → Reply
  • »
    »
    13 months ago, # ^ |
    ← Rev. 3   Vote: I like it +29 Vote: I do not like it

    My class has 45 students among which 14 are Aditya...

    It's really like you throw stone on 3 random persons in my class and one will definitely hit an Aditya...

    Once a lab assistant called my name and he got scared after witnessing half of the class staring at him.

    Don't down vote me :_) I am one of a problem setter... One of my biggest fear while writing comments is downvotes.

    → Reply
»
13 months ago, # |
  Vote: I like it +7 Vote: I do not like it

How to prove that there is no palindromic prime number of even length other than 11?

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

    All even length palindromes are divisible by 11.

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

    the prime number will have length even

    a[1] — — — a[2n] are its digits

    than u know that

    a[1] = a[2n] a[2] = a[2n — 1] a[3] = a[2n — 2] | | a[n] = a[n + 1]

    if I rearrange this a little

    a[1] = a[2n] a[2n — 1] = a[2] a[3] = a[2n — 2] a[4] = a[2n — 3] | |

    I get sum of odd_digits = sum of even_digits i.e = a[1] + a[3] -- a[2n — 1] = a[2] + a[4] --a[2n]

    it is a divisibility check of 11

    → Reply
»
13 months ago, # |
  Vote: I like it 0 Vote: I do not like it

This was one of the most quality problem set.

→ Reply