Last But not the least
All submissions for this problem are available.
Your Friend asked you a question. A simple one. He said if you are given a integer number N (1<=n<=2^64).
Find the last digit of
Input starts with T, no. of test cases.
T cases follow, each having one integer N.
For each N give a line containing only one digit, which is the last digit of S.
Input: 3 1 2 3 4563 Output: 1 5 2 4
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||ADA, ASM, BASH, BF, C, C99 strict, CAML, CLOJ, CLPS, CPP 4.3.2, CPP 6.3, CPP14, CS2, D, ERL, FORT, FS, GO, HASK, ICK, ICON, JAVA, JS, LISP clisp, LISP sbcl, LUA, NEM, NICE, NODEJS, PAS fpc, PAS gpc, PERL, PERL6, PHP, PIKE, PRLG, PYTH, PYTH 3.5, RUBY, SCALA, SCM guile, SCM qobi, ST, TCL, TEXT, WSPC|
Fetching successful submissions
If you are still having problems, see a sample solution here.