You are not logged in. Please login at www.codechef.com to post your questions!

×

PALINREP - Editorial

PROBLEM LINK:

Practice

Contest

Author: Akshay Venkataramani

Tester: Timothy

DIFFICULTY:

CAKEWALK

EXPLANATION:

All palindromes of length greater than 1 have characters that are repeated more than once. Hence, for all n > 1 the answer is -1. For n=1, the lexicographically smallest string of length 1 is 'a'.

AUTHOR'S SOLUTION:

Author's solution can be found here.

This question is marked "community wiki".

asked 21 Jan '18, 17:29

accelmage's gravatar image

4★accelmage
52
accept rate: 0%

edited 29 Jan '18, 15:58

admin's gravatar image

0★admin ♦♦
19.7k350498541

toggle preview
Preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here

By RSS:

Answers

Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text](http://url.com/ "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported
  • mathemetical formulas in Latex between $ symbol

Question tags:

×15,630
×1,643
×195
×29

question asked: 21 Jan '18, 17:29

question was seen: 189 times

last updated: 29 Jan '18, 15:58