05暑假实践训练习题6简单题

1、Time limit: 1 Memory limit: Time limit: 1 Memory limit: theirspelling.Forexample,canandkhawn,conandgonewould be equivalent under Soundex coding.which each digit represents a letter:123456B, F, P, or C, G, J, K, Q, S, X, or DorT MorN ThelettersA,E,I,O,U,H,W,andYarenotrepresentedinSoundexcoding, andre

2、peatedletterswiththesamecodedigitarerepresentedbyasingle instanceofthatdigit.WordswiththesameSoundexcodingareconsidered Eachlineofinputcontainsasingleword,alluppercase,lessthan20 letters long.Foreachlineofinput,producealineofoutputgivingtheSoundexSampleSampleTime limit: 10 Memory limit: In 1949 the

3、Indian D.R. Kaprekar discovered a class numberscalledself-numbers.SampleTime limit: 10 Memory limit: In 1949 the Indian D.R. Kaprekar discovered a class numberscalledself-numbers.Foranypositiveintegern,defined(n)to benplusthesumofthedigitsofn.(Thedstandsfordigitadition,a termcoinedbyKaprekar.)Forexa

4、mple,d(75)=75+7+5=87.Givenany positiveintegernasastartingpoint,youcanconstructtheinfinite increasingsequenceofintegersn,d(n),d(d(n),d(d(d(n), example,ifyoustartwith33,thenextnumberis33+3+3=39,the nextis39+3+9=51,thenextis51+5+1=57,andsoyougenerate the sequence33, 39, 51, 57, 69, 84, 96, 111, 114, 12

5、0, 123, 129, 141, Thenumberniscalledageneratorofd(n).Inthesequenceabove,33is ageneratorof39,39isageneratorof51,51isageneratorof57,and soon.Somenumbershavemorethanonegenerator:forexample,101has twogenerators,91and100.Anumberwithnogeneratorsisaself-number. Therearethirteenself-numberslessthan100:1,3,5

6、,7,9,20,31,53, 75, 86, and Writea programtooutputallpositiveself-numberslessthanorequal in increasing order, one per line.题意梗概：例如 又如那么39 57 不是SELF NUMBERSELF NUMBER，每个数字一行。本题无输入。Sample13579| -13579| -|aJolly Time limit: 1 Memory limit: ofthedifferencebetweensuccessiveelementstakeonallthevalues1 thro

7、ugh n-1. For instance,1 4 2 is a jolly jumper, because the absolutes differences are 3, 2, and 1 isajollyjumper.Youaretowriteaprogramtodeterminewhetherornot each of a number of sequences is a jolly jumper.NN-11N-1JOLLY JUMP。每行输NNN-11N-1JOLLY JUMP。每行输NNNJolly,NotjollyEachlineofinputcontainsanintegern3000followedbynintegers repre