Google kickstart round E| Discussion

Правка en1, от loverBoUy, 2022-08-21 10:54:44

As I didn't find any blog regarding this. Let's discuss our approach here :) Question A) Simple but tricky. Question B) I used binary search on multiset to find the largest number <=2*ri. Question C) My logic was to find the minimum index I (0<= I <=n) such that both sides should be a palindrome. Question D) I thought to use some brute force and don't know why it passed partially.

Your approach will be welcome in the comment box. Thank you

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en5 Английский loverBoUy 2022-08-21 14:31:55 202
en4 Английский loverBoUy 2022-08-21 11:03:39 88
en3 Английский loverBoUy 2022-08-21 11:02:31 89
en2 Английский loverBoUy 2022-08-21 10:55:46 99
en1 Английский loverBoUy 2022-08-21 10:54:44 489 Initial revision (published)