DSH - detective sherlock holmes

no tags 

Detective Sherlock Holmes undertook a case, he found a clue against the culprit.  He got a clue in lower case letters and he predicts that  if he decodes these characters into respective numeric value, then he would find the culprit. the total number of individual numeric values that are greater than q’s numeric value is the required solution. Vexed of solving the case he is asking for your help, so please help him.

Input

  • There is several test cases and the last case is contained by “length of clue<=3”,
  • each line contains a string(should  contain only lowercase letters) (length of clue is(3 <l<=26)) .

Output

For each test case print two lines, the former containing the numeric value of string and the later containing the total number whose value is greater than q if not then print ”no one.”

Example

Input:

aknpz

luxo

aven

abcds

out

Output:

16 26 20 22 23

1

27 18 21 21

1

16 19 20 20

no one.  

16 17 18 19  25

1

 

Problem Setter:-Farhan khan


hide comments
Simes: 2018-01-07 21:56:53

Sherlock was known for his logic, not the guesswork needed for this nonsense. No need to read til EOF, stop after reading a word of three characters or fewer.

Last edit: 2018-01-07 23:04:03
yash1gupta: 2018-01-05 15:32:45

what the hell ,remeber "." after "no one" it gives me 1WA

avi_pandey: 2017-03-03 20:54:04

thanks @shubham_cs_iet. your comment helped me.

Last edit: 2017-03-03 20:55:30
rohanverma: 2017-02-18 09:15:12

AC in one go!!

sachinsharma12: 2017-01-22 15:44:23

Got 6 time runtime error (SIGXFSZ),,,,
Ac after using while(!feof(stdin))

shreyanshid: 2017-01-21 15:25:42

Scan till EOF otherwise u will get tle;
AC after 1 tle.....

aman_agarwal19: 2017-01-15 21:37:33

That period(.) after "no one" costed me 2 WA....

shubham_cs_iet: 2017-01-13 20:50:50

while(!feof(stdin)) would help in scanning till EOF.
assume m=28, t=26...:):)

cs_abhi2000: 2017-01-06 15:11:18

0.6 points for this problem...
m=28,t=26.

hodobox: 2016-07-05 07:49:44

To be honest, not a nice problem with a very unclear description.
Each character from 'a' to 'z' has been given some number according to some pattern, which although arbitrary, through sample cases is enough to deduce values for most letters... except 'm' and 't', since as far as I (or anyone in the comments) is aware of there is no indication whether the pattern continues or resets at those points. (m=28, t=26).
You have to find how many characters in the input string have a value higher than the value of character 'q'.
Read till EOF, ignore the whole 'length of input<=3 deal.


Added by:Khansaab
Date:2016-01-28
Time limit:0s-2s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ADA95 ASM64 C99 D-DMD D GOSU HASK ICK JS-MONKEY NICE NIM PICO PIKE SCALA CHICKEN WHITESPACE
Resource:own