All Tracks Math Number Theory Problem

Naina Function
Tag(s):

Easy

Problem
Editorial
Analytics

Arun has a keen interest in maths and recently he came to know about weird function known as Naina function. Arun gave you a number "N" and asked you to evaluate Naina's function. The definition of Naina function is

F ( X ) = X , X <= 9
         = F ( sum of digits in X )
where, X = N3

Input:
First line of input contains T - Total no. of test cases
Each test case contains the number "N".

Output:
For each testcase, print the value of Naina function.

Constraints
1<=T<=100
1<= Number of digits in N <= 104

Problem Setter : Satyam Swarnkar

SAMPLE INPUT
4
1
15
8
22
SAMPLE OUTPUT
1
9
8
1
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: C, C++, Clojure, C#, D, Erlang, F#, Go, Groovy, Haskell, Java, Java 8, JavaScript(Rhino), JavaScript(Node.js), Lisp, Lisp (SBCL), Lua, Objective-C, OCaml, Octave, Pascal, Perl, PHP, Python, Python 3, R(RScript), Racket, Ruby, Rust, Scala 2.11.8, Swift, Visual Basic

CODE EDITOR

Initializing Code Editor...
Your Rating:

Contributor

Notifications
View All Notifications