介个吧~~~可能可以算到是 hash 或者 桶排序
没什么可以总结的(主要是在测试这个空间 【还可啦】)
01 var n,i,j,tmp:integer;
02 a:array[0..100] of integer;
03
04 begin
05 readln(n);
06 for i:=1 to n do
07 read(a[i]);
08
09 for i:=1 to n-1 do
10 for j:=i+1 to n do
11 if a[i]>a[j] then
12 begin
13 tmp:=a[i];
14 a[i]:=a[j];
15 a[j]:=tmp;
16 end;
17
18 i:=1;
19 while i<=n do
20 begin
21 inc(i);
22 if a[i-1]=a[i] then a[i-1]:=-1;
23 end;
24
25 j:=0;
26
27 for i:=1 to n do
28 if a[i]>=0 then inc(j);
29 writeln(j);
30
31
32 for i:=1 to n do
33 if a[i]>=0 then write(a[i],' ');
34
35 end.
02 a:array[0..100] of integer;
03
04 begin
05 readln(n);
06 for i:=1 to n do
07 read(a[i]);
08
09 for i:=1 to n-1 do
10 for j:=i+1 to n do
11 if a[i]>a[j] then
12 begin
13 tmp:=a[i];
14 a[i]:=a[j];
15 a[j]:=tmp;
16 end;
17
18 i:=1;
19 while i<=n do
20 begin
21 inc(i);
22 if a[i-1]=a[i] then a[i-1]:=-1;
23 end;
24
25 j:=0;
26
27 for i:=1 to n do
28 if a[i]>=0 then inc(j);
29 writeln(j);
30
31
32 for i:=1 to n do
33 if a[i]>=0 then write(a[i],' ');
34
35 end.