pkuACM课件3章节幻灯片.pptVIP

The problem In case the game ends (either because you won or there are no more soldiers in the game), the library will terminate your program correctly. Your program may not terminate in any other way. The problem Library interface The library libconq provides two routines: ? start – returns the number N and fills an array stairs with numbers of soldiers standing on the stairs (i.e. there are stairs[i] soldiers standing on stair i) The problem ? step – takes an array subset (with at least N1 elements), describing the group of soldiers you chose, and returns 1 or 2 as described above; the group of soldiers is specified by numbers of soldiers on each stair, as in the start function The problem If you fail to specify a valid group of soldiers, the game will be terminated and your program will score zero points for the particular test case. Please note that also in C/C++ the stairs are numbered starting from 1. The problem Following are the declarations of these routines in FreePascal and C/C++: procedure start(var N: longint; var stairs:array of longint); function step(subset:array of longint): longint; void start(int *N, int *stairs); int step(int *subset); The problem Below you can find examples of library usage in both FreePascal and C/C++; both fragments do the same – start the game and then play one round, with the chosen group containing all soldiers on randomly chosen stairs. Your real program will probably play the rounds in an infinite loop. The problem You are strongly encouraged to define the arrays stairs and subset in the same way as they are defined in the example below. The problem FreePascal example: uses libconq; var stairs: array[1..2000] of longint; subset: array[1..2000] of longint; i,N,result: longint; ... start(N,stairs); ... ... for i:=1 to N do if random(2)=0 then subset[i]:=0 else subset[i]:=stairs[i]; result:=step(subset); ... The problem C/C++ example: #include libconq.h int stairs[2001]; int subset[2001]; int i,N,result; ... start(N, s