a:array[1..1000] of integer;
i,j:longint;
b,n:integer;
begin
for i:=1 to 1000 do
a[i]:=0;
begin
readln(n);
for i:=1 to n do
begin
read(b);
a[b]:=a[b]+1;
end;
for i:=1 to 1000 do
if a[i]>=1 then inc(j);
writeln(j);
for i:=1 to 1000 do
if a[i]>=1 then write(i,' ');
end;
end.
a,b:array[1..1005]of longint;
n,i,j,t,k,v:longint;
begin
readln(n);
for i:=1 to n do
begin
read(t);
inc(a[t]);
end;
for i:=1 to 1005 do
if a[i]>0 then
begin inc(v);b[v]:=i; end;
writeln(v);
for i:=1 to v-1 do write(b[i],' ');
writeln(b[v]);
end.
t,i,j,sum,n:integer;
begin
readln(n);
for i:=1 to n do
read(a[i]);
for i:=1 to n do
for j:=i+1 to n do
if a[i]>a[j] then
begin
t:=a[i];
a[i]:=a[j];
a[j]:=t;
end;
sum:=1;
b[1]:=a[1];
for i:=2 to n do
if a[i]>a[i-1] then
begin
inc(sum);
b[sum]:=a[i];
end;
writeln(sum);
for i:=1 to sum do
write(b[i],' ');
end.
b:array[1..1000] of integer;
v,j,k,l:integer;
begin
readln(v);
l:=v;
for j:=1 to 1000 do
b[j]:=0;
for j:=1 to v do
begin
read(k);
if b[k]=0 then b[k]:=1
else dec(l);
end;
writeln(l);
for j:=1 to 1000 do
if b[j]=1 then write(j,' ');
end.
v,j,k,l:integer;
begin
readln(v);
l:=v;
for j:=1 to 1000 do
b[j]:=0;
for j:=1 to v do
begin
read(k);
if b[k]=0 then b[k]:=1
else dec(l);
end;
writeln(l);
for j:=1 to 1000 do
if b[j]=1 then write(j,' ');
end.
输出的时候先发出最后总人数,然后按照学号顺序,判断有没有,然后输出
简单的思想, 没有用什么高难得函数,但觉得很容易理解