预览加载中,请您耐心等待几秒...
1/2
2/2

在线预览结束,喜欢就下载吧,查找使用更方便

如果您无法下载资料,请参考说明:

1、部分资料下载需要金币,请确保您的账户上有足够的金币

2、已购买过的文档,再次下载不重复扣费

3、资料包下载后请先用软件解压,在使用对应软件打开

实验一熟悉VisualC++集成开发环境 实验目的: 复习程序设计的基础知识,熟悉VisualC++的使用方法 实验内容:请编写以下两个程序。 1.Vedicsquare(60分) ProblemDescription InancientIndianmathematics,aVedicsquareisavariationonatypical9×9multiplicationtable.Theentryineachcellisthedigitalrootoftheproductofthecolumnandrowheadings. 123456789112345678922468135793369369369448372615955162738496639639639775318642988765432199999999999 ByreplacingaspecificnumberbyasteriskwhereastheothersbyspacewithintheVedicsquare,youcanfindsomedistinctshapeseachwithsomeformofreflectionsymmetry. YouaretoprinttheVedicsquarefirst,andthentheshapesofeveryspecificnumber.Anexampleoftheshapeofnumber1isasfollows. 2.Elevator(40分) ProblemDescription Thehighestbuildinginourcityhasonlyoneelevator.ArequestlistismadeupwithNpositivenumbers.Thenumbersdenoteatwhichfloorstheelevatorwillstop,inspecifiedorder.Itcosts6secondstomovetheelevatoruponefloor,and4secondstomovedownonefloor.Theelevatorwillstayfor5secondsateachstop.Foragivenrequestlist,youaretocomputethetotaltimespenttofulfilltherequestsonthelist.Theelevatorisonthe0thflooratthebeginninganddoesnothavetoreturntothegroundfloorwhentherequestsarefulfilled. Input Therearemultipletestcases.EachcasecontainsapositiveintegerN,followedbyNpositivenumbers.Allthenumbersintheinputarelessthan100.AtestcasewithN=0denotestheendofinput.Thistestcaseisnottobeprocessed. Output Printthetotaltimeonasinglelineforeachtestcase. SampleInput 12 3231 0 SampleOutput 17 41