All Tracks Problem

Noob's Problem
Tag(s):

Very-Easy

Problem
Editorial
Analytics

Killjee the Noob is stuck at most basic question of Algorithms Cup. Now, he is seeking your help.

You need to find lexicographically largest palindromic string of n letters, which contains lowercase english alphabets only .

INPUT CONSTRAINTS

\(1\le n \le 10^6\)

INPUT FORMAT

Input contains a single integer n.

OUTPUT FORMAT Output a single string as described in the problem.

SAMPLE INPUT
1
SAMPLE OUTPUT
z
Explanation

Killjee is so noob that he hasn't understood the samples yet.

Time Limit: 1,0 sec(s) for each input file.
Memory Limit: 256 MB
Source Limit: 1024 KB
Marking Scheme: Marks are awarded when all the testcases pass.
Allowed Languages: Bash, C, C++, C++14, Clojure, C#, D, Erlang, F#, Go, Groovy, Haskell, Java, Java 8, JavaScript(Rhino), JavaScript(Node.js), Julia, Kotlin, Lisp, Lisp (SBCL), Lua, Objective-C, OCaml, Octave, Pascal, Perl, PHP, Python, Python 3, R(RScript), Racket, Ruby, Rust, Scala, Swift, Swift-4.1, TypeScript, Visual Basic

CODE EDITOR

Initializing Code Editor...
Your Rating:

Contributor

This Problem was Asked in

The LNM Institute of Information Technology

Challenge Name

LNMIIT Algorithms Cup - June 2017

OTHER PROBLEMS OF THIS CHALLENGE
Уведомления
View All Notifications

?