BestCoder Round #11 题解集合

1 var
2   m, n, x, y : int64;
3   
4 begin
5   while not eof do begin
6     readln(m, n, x, y);
7     if (m = 2 * x) and (n = 2 * y) then writeln(‘YES‘) else writeln(‘NO‘);
8   end;
9 end.

 1 var
 2   num : array[0..9] of longint;
 3   n, ch, i, j, x : longint;
 4 
 5 function find : boolean;
 6 var
 7   i : longint;
 8   flag : boolean;
 9 
10 begin
11   flag := true;
12   for i := 1 to 9 do
13     if num[i] > 0 then flag := false;
14   find := flag and (n <> 1);
15 end;
16 
17 begin
18   while not eof do begin
19     readln(n);
20     fillchar(num, sizeof(num), 0);
21     for i := 1 to n do begin
22       read(x);
23       inc(num[x]);
24     end;
25     ch := 0;
26     for i := 1 to 5 do begin
27       j := i * 2 - 1;
28       if num[j] > 0 then begin
29         ch := j;
30         dec(num[j]);
31         break;
32       end;
33     end;
34     if (ch = 0) or find then begin
35       writeln(-1);
36       continue;
37     end;
38     for i := 9 downto 0 do
39       while num[i] > 0 do begin
40         write(i);
41         dec(num[i]);
42       end;
43     writeln(ch);
44   end;
45 end.

 1 var
 2   i, x, k, len, left, t1 : longint;
 3   first, next, num, last : array[0..150000] of longint;
 4   s : ansistring;
 5   T : longint;
 6   ans : int64;
 7 
 8 begin
 9   readln(T);
10   while T > 0 do begin
11     dec(T);
12     ans := 0;
13     readln(s);
14     readln(k);
15     len := length(s);
16     left := 0;
17     fillchar(first, sizeof(first), 0);
18     fillchar(last, sizeof(last), 0);
19     fillchar(num, sizeof(num), 0);
20 
21     for i := 1 to len do begin
22       x := ord(s[i]);
23       if first[x] = 0 then first[x] := i;
24       inc(num[x]);
25       next[last[x]] := i;
26       last[x] := i;
27       if num[x] > k then begin
28         dec(num[x]);
29         t1 := first[x];
30         first[x] := next[first[x]];
31         if t1 > left then left := t1;
32       end;
33       inc(ans, i - left);
34     end;
35     writeln(ans);
36   end;
37 end.