FAMILYP - Family Problems
Asif and Nafisa are very interested in solving puzzles.They always try to give one another puzzles to see who is the best.So ,as usual, one day, Nafisa gave Asif a matrix.
The matrix is as follows
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z A B C ......
B C D E F G H I J K L M N O P Q R S T U V W X Y Z A B C D ......
C D E F G H I J K L M N O P Q R S T U V W X Y Z A B C D E ......
D E F G H I J K L M N O P Q R S T U V W X Y Z A B C D E F .......
.........................................................................................
.
.
Assume that the matrix is very huge(both row and column wise). Nafisa describes a special sequence as a sequence whose first term is 'A'[element at (0,0)], second term is 'B'[element at (0,1)],third term is 'B'[element at (1,0)],fourth term is 'C'[element at (2,0)]. Now,she asks Asif to find the nth term of this special sequence. Help Asif To solve the problem.
Input
There will be multiple test cases with number N(1<=N<=1000000) per line.
Output
A character ['A'-'Z'] per line for each number N representing the Nth number in the special sequence.
Example
Input:
3
6
10
Output: TERM 3 IS B
TERM 6 IS C
TERM 10 IS D
hide comments
|
kartikay singh:
2014-12-11 09:00:26
no of test cases???? |
|
abdelkarim:
2013-05-05 19:05:23
int main () {}
|
|
Ashhar Jawaid:
2012-06-13 18:01:19
admins.. plz check the output file to this problem and re-include it in the classical section |
|
:D:
2012-06-13 11:31:02
Problem doesn't have any test data!! |
|
noju:
2012-06-12 23:34:07
WhAt A LOL, do not do any thing, just submit this problem in text, w/o writing any thing..u'll get .1 point. |
|
akb:
2012-06-12 22:10:08
I/O problems !!! |
|
mAddy:
2012-06-02 08:55:16
Ranker is correct.Accept input till EOF. No output.got AC :P |
|
Aditya Pande:
2012-05-19 09:35:35
Last edit: 2012-12-09 04:13:29 |
|
|
Aditya Pande:
2012-05-19 09:09:54
|
|
Szabolcs Szucs:
2012-05-14 13:24:30
hereby I confim (got AC): there can be many inputs in the same line |
| Added by: | Hemant Verma |
| Date: | 2009-11-14 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM64 NODEJS OBJC PERL6 SQLITE VB.NET |
| Resource: | Alkhwarizm 2009 |
RSS