解題報告第二賽office

LSBre InformationInformationomputerscienceisthe ipleofhidingofdesigninacomputerprogramthataremostlikelytochange,thusprotectingotherpartsoftheprogramfromchangeifthedesigndecisionischanged.Theprotectioninvolvesprovidingastableinterfacewhichshieldstheremainderoftheprogramfromtheimplementation(thedetailsthataremostlikelytochange).Steganographyisanapplicationofinformationahiding.TheLSB(Least-significant-bit)ismostwidelyused.LSBre cementembedsamessageintothecoverimagebyre cingtheLSBsofthecoverimagewithmessagebitstogetthestegoimage.LSBre reasesevenpixelvalueseigherbyoneorleavesthemunmodified,whileoddvaluesareleftunchangedordecreasedbyone.eg.wewanttoembedthesecretmessage‘0101’tothecoverdata‘13121110’,wethengetthestegodata’12131011’.Firstweembedthebinarybit0to13,s e13’sbinaryformatis‘1101’,so,we cethelastbit1with0.Nowwegetthestegodata1100=Nowgiveyouthesecretmessageandthecoverimages,canyourembeddedmessageintothecoverthetherearetwointegern,m,(n,m<513),thenthecoverimagedata,mlineandeachlinenintegers.thenextlineisthesecretmessage.Firstyouneedtochangethemessagethetherearetwointegern,m,(n,m<513),thenthecoverimagedata,mlineandeachlinenintegers.thenextlineisthesecretmessage.Firstyouneedtochangethemessagetobinarystream,themessageuseASCIIcode.Thenembedthebinarystreamintothecoverimagessequently.OutputOutputthestegoimagedata.Ifcannotembedallofthemessageinthecoverimage,youshouldprint:LSBembeddingError!881234567A03244660324466Bubble BubbleBubblesortisoneofthesimplestsortingalgorithms.Itworksbyrepeatedlyitingthruthearraytobesorted,comparinoadjacentnumbersinthearray,andswapthemiftheyareinthewrongorder.Theitionsthruthelistarerepeateduntilnoswapsareneeded,whieansthatthearrayissorted.Thecodebelowwillshowyouhowbubblesortworks:voidBubbleSort(Vectora,int{for(intj=n-1;j>0;j--)for(intk=0;k<j;k++)if(a[k+1]<a[k])}Asaprogrammer,weareconcernedabouttheexpectednumberofswapsandhowmuchwouldtheswap numberchangewhenthegivenvectorisrandomlyordered.Forsuchpurpose,letusconsiderthegeneralproblem.Supposethatisapermutationofnnumbers,drawnuniformlyatrandomfromthesetofalln!permutations.LetXbetherandomvariablewhichcountsthenumberofinversionsof,i.e.,thenumberofpairsofindicesi<jsuchthat(i)>(j).WewantyoutodetermineexpectationE[X]andvarianceVar[X].Suppo isarandomvariable,itcantakesvaluexi(i=1,2,…,n)andtheprobabilityittakesvaluexiisPr(xi).E[X]andVar[X]aretwoimportantstatisticsinprobabilitytheory,theirformulasaregivenForeachcase,youshouldoutputtheexpectationE[X]andvarianceVar[X],whichareseparatedbyablankspace,onaline.Youneedtooutputtheanswerto2decimalThefirstlineoftheinputcontainsthenumberk,thenumberoftestcasestosolve≤k≤200).Eachtestcaseconsistsofasingleinteger2≤n≤1000ona 332450.500.503.005.00AProblemWithFibonacci Fibonaccisequenceiswell-knownintheworld.WedefineFibonaccisequenceasfollows:Fibonaccisequenceiswell-knownintheworld.WedefineFibonaccisequenceasfollows:F(0)=0,F(1)=1.F(n)=F(n-1)+F(n-2),n>=2.It’seasyforustocalculateF(n)modm.Butthistimewewanttomaketheproblemmoredifficult.Wewanttocalculatetheformula:isthecombinationTheThefirstlineisthetestcaseT.FollowingTlines,eachlineistwointegersn,m(0n≤109,1≤m≤30000OutputOutputtheanswermod2212113Thenearesttaller FarmerZhao'sNcows(1FarmerZhao'sNcows(1≤N≤1,000,000)arelinedupinarow.Soeachcowcanseethenearestcowwhichistallerthanit.Yourtaskissimple,giventheheight(0<height≤109)ofeachcowlinedupintherow,tocalculatethedistanc eachcowanditsnearesttallercow,ifitisthetallestcowintherow,suchdistanceisregardedasn.Youshouldoutputtheaveragedistance.ForeachtestForeachtestLine1:Oneintegers,Lines2:Nintegers.TheithintegeristheheightoftheithcowintheTheTheaveragedistancetotheirnearesttallercow,roundedupto277765864a.a.Inthesamplecase,thedistancestotheirnearestcoware3113117.Thenansweris(3+1+1+3+1+1+7)/7=2.43.HugeSuitTilessuittilesisoneoftraditionalDicegame,itsoriginscanbetracedbacktobeforetheHanDynasty,accordingtolegend,suittilesand belongtothesamepulse,condensedtheessenceofancientcivilization,isalsoaquintessenceofculture. tesspreadwidely,basicallycoveringmostpartsof.suittilesandmahjongcardgamesareyedsimilar,butmorethanmahjongskillsandflexibility.Twotofourpeoplecany,tohoneandimprovethe yticalskillsofthinkingisvery suittilescontainstwentykindsofcards,such as"一二三四， hasfourcards. Therulesofsuittilesisrelativelysimple,butmoreflexible.Tomhasspecialhobbyhinesesuittiles.Asthiskindgameisveryflexible,Tomisverydifficulttoseeifheisthewinner.Asaverycleverprogrammer,canyouhelpEachonehasn(0<n≤21)cards,thesecardsmustdivideintosomegroup,eachgroupmusthavethreecards,andeachgroupmustsatisfyoneoffollowingThevalueofeachcardsisequal,forexample:thevalueof"一"isequalto"壹Thevalueofeachcardsisconsecutivenumbers,andeachcardsmustbelowercasecharacterdigitalorcapitalcharacterdigital.Forexample:"一二三"issatisfiedthecondition,but"一貳三"isnotsatisfiedtheIfthenumberofakindcardisequaltoormorethanthree,theymustinthesamegroup.(So"一一一一二三"or"一二三一一壹"isnotsatisfiedthecondition)Whoescardssatisfytherules,heistheThefirstlinecontainanumbern(0≤n≤21),thenumberofcards.Ifinput0istheendofthecase.Thefollowinglinecontainastringof七，，十，壹，貳，叁，肆，伍，陸，柒，捌，玖，拾".Ifthecardssatisfytherules,outputIfthecardsdon’tsatisfytherules,outputSample OutputforSample3BeeBarryB.Bensonis"justanordinarybee"inahivelocatedinSheep'sMeadowentralParkinNewYorkCity.Barryrecentlygraduatedfromcollegeandisabouttoenterthehive'sHonexIndustries(adivisionofHonescoCorporationandownedbytheHexagonGroup)honey-makingwork.AlongwithhisbestfrienmFlayman(voicedbyMatthewBroderick)Barryisinitiallyveryexcited,buthislatent,non-conformistattitudeemergesuponfindingoutthathischoiceofjobwillneverchangeoncepicked.Heabsoluydisappointed,hejoinstheteamresponsibleforbringingthehoneyandpollinationoftheflowerstovisittheworldoutsidethehive.Thebeewilldrawoutinbattlearraywhentheywanttogooutside.Actually,thisproblemisaboutalignmentofN(1≤N≤455)bees.Nwhoaregrazingintheirfieldthatisabout15,000×15,000units.Theirgrazinglocationsallfallonintegercoordinatesinastandardx,yscheme(coordinatesareintherange0..15,000).Barrylooksupandnoticesthatshei actlylinedupwithHuacm534(bee)andAcmIcpc20060820322(bee).Hewondershowmanygroupsofthreealignedbeesexistwithinthefield.Giventhelocationsofallthebees(notwobeesoccupythesamelocation),figureoutallsetsofthreebeesareexactlycollinear.Keeptrackofthesets,sortingthebeesineachsetbytheirIDnumber,lowestfirst.ThensortthesetsbythethreeIDnumbers(lowestfirst),breakingtiesbyexaminingthesecondandthirdIDLine1