Pols_Agyi_Pols's blog

Invitation to CodeChef Starters 169(Rated upto 5 stars) — 15th January
By Pols_Agyi_Pols, 15 months ago, In English

We invite you to participate in CodeChef’s Starters 169, this Wednesday, 15th January, rated upto 5 stars (i.e. for users with rating < 2200).

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

Joining us on the problem setting panel are:

Note: Some problems may have subtasks.

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
  • +31
  • Vote: I do not like it

Comments Comments (18)
| Write comment?
»
15 months ago, hide # |
 
Vote: I like it -6 Vote: I do not like it

Are you guys ever gonna do anything to detect people copy pasting code directly from gpt?

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

interested in problems by Pols_Agyi_Pols

→ Reply
»
15 months ago, hide # |
← Rev. 3  
Vote: I like it -8 Vote: I do not like it

..

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

how to solve Tree Queries ? weights are also not given unique so we can't set max_depth to traverse = log(max_value of weight).

→ Reply
»
15 months ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

got it

→ Reply
  • »
    »
    15 months ago, hide # ^ |
     
    Vote: I like it +8 Vote: I do not like it

    Your solution can only give -1, 0, 1 or 2 as the answer, which is wrong!
    For the input

    1
6
ababcc

    The ouptput should be

    4
aabc
    → Reply
  • »
    »
    15 months ago, hide # ^ |
    ← Rev. 4  
    Vote: I like it 0 Vote: I do not like it

    (WRONG SOLUTION) possible solutions :-

    case 1 :- when there is only one character whose fre is odd(say character c1) .

    a) find some charater != c1 but less than c1

    b) take c1 odd times if c1 is less than all other charaters then find two other characters other than c1 such that c1 * (even times) + c2 * (odd2 times) + c3*(odd3 times) (subsequence is present in S) and c1 < c2 < c3 such that is lexicographically smallest

    case 2:- when there is no character with odd frequency

    take odd number of times two charaters such that

    c1 * (odd1 times) + c2*(odd2 times) is present as subsequence in the , c1 < c2 such that is lexicographically smallest

    i hope atleast with this u can find some counter

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

i guessed so much on no palindromes(little impr) , solution still is above what i finally thought .

→ Reply
»
15 months ago, hide # |
← Rev. 4  
Vote: I like it -9 Vote: I do not like it
WA

🤔

→ Reply