label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
|---|---|---|
13 | 6400 | /*
* repeatnumber.cpp
*
* Created on: 2012-11-16
* Author: ???
*/
int main() {
int n, i, j = 2, m; //??int???
int a[20010], b[100]; //????????
cin >> n; //??n
for (i = 1; i <= n; i++) {
cin >> a[i];
}
b[1] = a[1];
for (i = 2; i <= n; i++) {
for (m = 1; m <= i - 1; m++) {
if (a[m] == a[i])
break; //??a[m]??a[i]???????
}
if (m == i) {
b[j] = a[i];
j++;
}//?m??i??b[j]??a[i]
}
for (i = 1; i <= j - 1; i++) {
if (i < j - 1) {
cout << b[i] << " ";
} else
cout << b[i];
}//?b[100]??????????
return 0;
}
|
13 | 6401 | int main()
{
int n , i , j , a[20010] , b[20010] ={0} , m= 0;
cin >> n;
for(i = 1 ; i <= n ; i++)
{
cin >> a[i];
for(j = 0;j<=m ;j++)
{
if(a[i] == b[j])
{
break;
}
if(j == m)
{
b[m] = a[i];
m++;
break;
}
}
}
for(i = 0 ; i< m; i++)
{
if(i == m - 1)
cout << b[i];
else
cout << b[i] << " ";
}
return 0;
} |
13 | 6402 | int main()
{
int n,a[10000],i,j,x=0;
scanf("%d\n",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<=n-1;i++)
{
if(a[i]==0)
continue;
for(j=i+1;j<=n-1;j++)
{
if(a[i]==a[j])
{
a[j]=0;
}
}
}
printf("%d",a[0]);
for(i=1;i<=n-1;i++)
{
if(a[i]!=0)
printf(" %d",a[i]);
}
return 0;
} |
13 | 6403 | int main()
{
int n,i,a[100000],j;
scanf("%d\n",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("%d",a[0]);
for(i=1;i<n;i++)
if(a[i]==a[0]) a[i]=0;
for(i=1;i<n;i++)
{
if(a[i]!=0)
{
printf(" %d",a[i]);
for(j=i+1;j<n;j++)
if(a[j]==a[i]) a[j]=0;
}
}
return 0;
} |
13 | 6404 | int main()
{
int k, n, a[20001], i, j, b[20001] = {0};
cin >> n;
for (i = 1; i <= n; i++)
cin >> a[i];
for (i = 1; i <= n; i++)
for (j = i + 1; j <= n; j++)
if (a[i] == a[j])
b[j] = 1;
for (k = n; k > 0; k--)
if (b[k] == 0)
break;
for (i = 1; i < k; i++)
if (b[i] == 0)
cout << a[i] << ' ';
cout << a[k];
return 0;
}
|
13 | 6405 | int main()
{
int n,num[20001],sum=0;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>num[i];
}
for(int i=0;i<n;i++)
for(int j=i+1;j<n;j++){
if(num[i]==101)break;
if(num[j]==num[i])num[j]=101; //?????????????
}
for(int i=0;i<n;i++){
if(num[i]==101&&num[i+1]!=101){//????????????????
for(int m=i;m<n;m++){
num[m]=num[m+1];
}
sum++;
}
else if(num[i]==101&&num[i+1]==101){
for(int m=i;m<n;m++){
num[m]=num[m+1];
}
sum++;
i--;
}
}
for(int i=0;i<n-sum-1;i++){
cout<<num[i]<<" ";}
cout<<num[n-sum-1];
return 0;
} |
13 | 6406 | int main()
{
int n,i,a[100000],sum=0,j;
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
}
if(n==1)
{
printf("%d",a[0]);
}
else
{
printf("%d",a[0]);
for(i=1;i<=n-1;i++)
{
sum=0;
for(j=0;j<=i-1;j++)
{
if(a[i]==a[j])
{
sum=1;
}
}
if(sum==0)
{
printf(" %d",a[i]);
}
}
}
} |
13 | 6407 | /************************
???????????
???:???
*********************/
int main ()
{
int a[20000],n,i,j; //????n,i,j,n?????????a[20000]???
cin>>n; //??n
for(i=0;i<n;i++) //??????
cin>>a[i]; //??a[i]
for(i=0;i<n;i++) //????
{
for(j=n-1;j>i;j--)
{
if( a[j]==a[i]) //????,??a[j]=a[i]?a[j]=-1
a[j]=-1;
}
}
cout<<a[0]; //??a[0]
for(i=1;i<n;i++) //????
if(a[i]!=-1)
cout<<" "<<a[i]; //??a[i]?????????????a[i]
return 0;
} |
13 | 6408 | /*
*????HW5_02.cpp
*??????1100019007?
*???2012-10-29
*???????????
*/
int src[20000];//???
int dst[100];//?????
int main()
{
int n,i,j,flag;//??n,i,j
int current_pos=0;//dst????
cin>>n;
for(i=0;i<n;i++)cin>>src[i];//????
for(i=0;i<n;i++)
{
if(current_pos)
{
flag=1;
for(j=0;j<current_pos;j++)
{
if(dst[j]==src[i])flag=0;//??????????flag???0
}
if(flag==1)
{
dst[current_pos]=src[i];
current_pos++;
}
}
else
{
dst[0]=src[0];
current_pos++;
}
}
for(i=0;i<current_pos;i++){
cout<<dst[i];//????
if(i<current_pos-1)cout<<" ";
}
cout<<endl;
return 0;//????
}
|
13 | 6409 | /*
* ????shuchushuzi.cpp
* ??????
* ?????2012 11 10
* ???????????
*/
int main(){
int n,m,i,j,k; //????
cin >>n; //??????
int N[n];
for (i=0,k=0;i<n;i++,k++){ //???????
cin >>N[k];
for (j=0;j<k;j++){
if (N[j]==N[k]) k--; //????????????????????????????????????
}
}
for (i=0;i<k;i++){
if (i==(k-1)) cout <<N[i];
else cout<<N[i]<<" "; //????????
}
return 0;
}
|
13 | 6410 | int main()
{
int a[200000],n,m,i,j;
cin >>n;
for(i=0;i<n;i++)
{
cin >>a[i];
}
i=0;
while(i<n)
{
m=0;
for(j=0;j<n;j++)
{
if(a[i]==a[j]&&i>j)
{
m=m+1;
}
}
if(m==0&&i==0)
cout<<a[i];
if(m==0&&i!=0)
cout<<' '<<a[i];
i=i+1;
}
return 0;
}
|
13 | 6411 | /*
* ????????????
* ??? ???
* ????? 2010-11-3
* ???????????????????????
*/
int main(){
int n, i, temp; //n???????????i?????temp??????
cin >> n; //?????
const int N = n;
int ia[N]; //????
for(i=0; i!=n; i++) //????
cin >> ia[i];
i=1;
while(i<n){ //
temp = n; //??n????????
//for??????????????
for(int j=0; j<i; j++){
if(ia[i] == ia[j]){ //??????????
for(int k=i; k<n-1; k++)
ia[k] = ia[k+1];
n--;
break;
}
}
if(n == temp) i++; //?????????????????
}
for(i=0; i<n-1; i++) //???????
cout << ia[i] << " ";
cout << ia[n-1] << endl;
return 0; //????
}
|
13 | 6412 | int main()
{
int n,a[20000],i,j,b[20000],m=0,k;
cin>>n;
for(i=0;i<n;i++)
cin>>a[i];
b[0]=a[0];
for(i=1,j=1;i<n;i++)
{
for(k=0;k<j;k++)
if(a[i]==b[k])
m=1;
if(m!=1)
{
b[j]=a[i];
j++;}
m=0;}
for(i=0;i<j-1;i++)
cout<<b[i]<<' ';
cout<<b[j-1]<<endl;
return 0;
}
|
13 | 6413 | //**********************
//file homework 5 *
// author ?? *
//data 10/10/29 *
// ?? ??????? *
//**********************
int main ()
{
int i, n, j, c;
int a[20000] = {0};
cin >> c;
for(i = 0;i < c;i ++)
{cin >> a[i];}
cout<<a[0];
for(n = 1; n < c; n ++)
{
for(j = n - 1; j >= 0; j --)
{if (a[j] == a[n])
break;
else
continue;
}
if (j == -1)
cout<<" "<<a[n];
}
return 0 ;
} |
13 | 6414 | int main()
{
int n;
cin >> n;
int a, i, j, l, k = 1;
cin >> a;
int s[20000] = {a};
for (i = 1; i < n; i ++)
{
cin >> a;
j = 0;
while (s[j] != a)
{ j ++;
if (j == k)
{
s[k] = a;
k ++;
}
}
}
for (l = 0; l < k - 1; l ++)
cout << s[l] << ' ';
cout << s[k - 1];
return 0;
} |
13 | 6415 | int main()
{
int i,n,j;
int a[20000];
scanf("%d",&n);
for(i=0;i<=n-1;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<=n-1;i++)
{
if(i==0)printf("%d",a[i]);
else
{
for(j=0;j<i;j++)
{
if(a[i]==a[j])break;
}
if(j==i)printf(" %d",a[i]);
}
}
}
|
13 | 6416 | /*
* ????????.cpp
*
* Created on: 2011-10-21
* Author: sony
*/
int main()
{
int n,i,j,q=0,a[20000];
cin>>n;
for(i=0;i<n-q;i++)
{
cin>>a[i];
for(j=0;j<i;j++)
{
if(a[i]==a[j])
{
q++;
i--;
}
}
}
for(i=0;i<n-q-1;i++)
cout<<a[i]<<" ";
cout<<a[n-q-1];
return 0;
} |
13 | 6417 |
int main()
{
struct number
{
int num,status;
}
a[20000];
int n,i,j,count;
scanf("%d",&n);
count=n;
for (i=0;i<n;i++)
{
scanf("%d",&a[i].num);
a[i].status=1;
}
for (i=0;i<n;i++)
{
for (j=0;j<i;j++)
{
if (a[i].num==a[j].num)
{
a[i].status=0;
count--;
break;
}
}
}
for (i=0,j=0;i<n;i++)
{
if (a[i].status && j!=count-1)
{
printf("%d ",a[i].num);
j++;
continue;
}
if (a[i].status && j==count-1)
{
printf("%d\n",a[i].num);
break;
}
}
return 0;
} |
13 | 6418 | void main()
{
int n,a[20000],b[20000],i,j,k;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
b[i]=a[i];
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(b[j]==a[i])
{
b[j]=0;
}
}
}
printf("%d",b[0]);
for(i=1;i<n;i++)
if(b[i]!=0)printf(" %d",b[i]);
} |
13 | 6419 | int main()
{
int n;
int number[1000000];
cin >> n;
for (int i1=0;i1<n;i1++)
{
cin >> number[i1];
}
for (int i2=0;i2<n;i2++)
{
for (int i3=i2+1;i3<n;i3++)
{
if (number[i2]==number[i3])
{
number[i3]=0;
}
}
}
cout << number[0];
for (int i4=1;i4<n;i4++)
{
if (number[i4]!=0)
{
cout << " " <<number[i4];
}
}
return 0;
} |
13 | 6420 | int main()
{
int n,a[20000],i,j,m=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);}
for(i=0;i<n;i++){
m=0;
for(j=0;j<i;j++){
if(a[j]==a[i])
m=1;
}
if (m==0&&i==0)
printf("%d",a[i]);
if(m==0&&i>0)
printf(" %d",a[i]);
}
return 0;
}
|
13 | 6421 | int main()
{
int i,j,n,m,b,a[20000];
i=0;
scanf("%d\n",&n);
for(;i<=n-1;i++)
{
if(i<n-1)
scanf("%d ",&a[i]);
else
scanf("%d\n",&a[i]);
}
for(j=0;j<n;j++)
{
if(j==0)
printf("%d",a[j]);
else
{
for(m=0,b=0;m<j;m++)
{
if(a[j]==a[m])
b++;
}
if(b==0)
printf(" %d",a[j]);
}
}
return 0;
}
|
13 | 6422 | int main ()
{
// ????????
// ??? ??? ???????
// ???k??? ???k-1?????? ????? ????????
// ??????
int n, i, j, k, p, t;
int a[20002];
cin >> n;
cin >> a[0];
p = 0;
for (i = 1; i <= n - 1; i++)
{
cin >> k;
t = 0;
for (j = 0; j <= p; j++)
{
if (a[j] == k)
{
t = 1;
break;
}
}
if (t == 1) continue;
else
{
p = p + 1;
a[p] = k;
}
}
cout << a[0];
for (i = 1; i <= p; i++)
{
cout << " " << a[i] ;
}
cout << endl;
return 0;
} |
13 | 6423 | int main(){
int n,i,j,k=0,h=0; //???????n?????????i?j??????k??????????h??????????
cin>>n; //??n
int a[n],b[n]; //??a?b????
for (i=0;i<=(n-1);i++) //????????a????
cin>>a[i];
for (i=0;i<=(n-1);i++){
if (a[i]!=-1){ //?a?????-1?
for (j=i+1;j<=(n-1);j++){ //????????????
if (a[i]==a[j]){ //????????
a[j]=-1; //?????????-1
k=k+1; //?????
}
}
}
}
for (i=0;i<=(n-1);i++) //?a?????????b?
b[i]=a[i];
for (i=0;i<=(n-1);i++){ //????????
if (b[i]!=-1){ //?b?????-1?
cout<<b[i]; //??????
h++; //?????
}
if (h==1) //???????-1???
break; //????
}
for (i=i+1;i<=n-1;i++){ //?????-1?????????
if (b[i]!=-1){ //?b?????-1?
cout<<" "<<b[i]; //??????
h++; //?????
}
if (h==n-k) //?????????????????????????
break; //????
}
return 0;
}
|
13 | 6424 |
int a[20010];
void main()
{
int n,i,tmp,k,ii=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&tmp);
int j;
int flag = 0;
for(j=0;j<i;j++)
{
if(a[j]==tmp)
{
flag = 1;
}
}
if(flag == 0)
{
a[ii] = tmp;
ii++;
//printf("%d\n",tmp);
}
}
for(k=0;k<ii-1;k++)
{
printf("%d ",a[k]);
}
printf("%d",a[ii-1]);
}
|
13 | 6425 | int main()
{
int n,i,j,k;
int a[20000];
scanf("%d",&n);
for(i=0;i<n;i++)
{scanf("%d",&a[i]);
printf("\n");
}
printf("%d",a[0]);
for(i=1;i<n;i++)
{for(j=0,k=0;j<i;j++)
{if (a[i]==a[j])
k++;
}
if(k==0)
printf(" %d",a[i]);
}
printf("\n");
return 0;
} |
13 | 6426 | int main()
{
int n,a[20000],i,j,k=0;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
// a[i]>=10&&a[i]<100;
scanf("%d",&a[i]);
//a[i]>=10&&a[i]<100;
}
printf("%d",a[0]);
for(i=1;i<n;i++)
{
for(j=0;j<i;j++)
{
if(a[i]==a[j])
k=k+1;
}
if(k==0)
printf(" %d",a[i]);
k=0;
}
getchar();
getchar();
}
|
13 | 6427 | int main()
{
int n,a[20000]={0};
cin>>n;
int count=n;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=n;i++)
{
if(a[i]!=0)
{
for(int j=i+1;j<=n;j++)
if(a[j]==a[i]) {a[j]=0;count-=1;}
}
}
if(count>1)
{
int i;
for(i=1;i<=n;i++)
{
if(a[i]!=0)
{
cout<<a[i]<<' ';
count--;
}
if(count==1) break;
}
for(i=i+1;i<=n;i++)
if(a[i]!=0) cout<<a[i];
}
else
for(int i=1;i<=n;i++)
if(a[i]!=0) cout<<a[i];
return 0;
} |
13 | 6428 | void main()
{
int n,i;
int a[100000];
scanf("%d/n",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("%d",a[0]);
i=1;
while(i<n)
{
int j=0,x=0;
while(j<i)
{
if(a[i]==a[j])
{
x=1;
break;
}
j++;
}
if(x==0)
printf(" %d",a[i]);
i++;
}
}
|
13 | 6429 | int main(){
int a[10000]={0},t[10000]={0},s,b,c,k=0,i=0,n;
scanf("%d",&n);
printf("\n");
scanf("%d",&a[0]);
for(i=1;i<=n-1;i++)
{
scanf("%d",&a[i]);
for(b=0,c=0;b<=i-1;b++)
if(a[i]==a[b]) c=c+1;
if(c==0)
{t[k]=a[i];
k++;
}
}
if(k==0)printf("%d",a[0]);
if(k>0){
printf("%d ",a[0]);
for(s=0;s<=k-2;s++)
printf("%d ",t[s]);
printf("%d",t[k-1]);}
return 0;
} |
13 | 6430 | int main()
{
int n,b;
int m[20002];
int i=1;
int a=2;
int num;
scanf("%d",&n);
do
{
scanf("%d",&m[i]);
i++;
}while(i<=n);
if(n==1)
{printf("%d",m[1]);}
else
{
printf("%d",m[1]);
do
{
b=1;
do
{
num=0;
if(m[b]==m[a]){num++;break;}
else{b++;}
}while(b<a);
if(num==0){printf(" %d",m[a]);}
else{}
a++;
}while(a<=n);
}
return 0;
}
|
13 | 6431 |
int main()
{
int n;
int a[91];
int i;
for( i=0 ; i<91 ; i++ )
{
a[i]=0;
}
cin>>n;
cin>>i;
cout<<i;
a[i-10]=1;
while( n>0 )
{
n--;
int b;
cin>>b;
if( a[b-10]==0 )
{
cout<<' '<<b;
a[b-10]=1;
}
}
} |
13 | 6432 | int main ()
{
int n, x, count[91] = {0};
cin >> n;
cin >> x;
cout << x;
count[x - 10]++;
for (int i = 1; i <= n - 1; i++)
{
cin >> x;
if (count[x - 10] == 0)
cout << " " << x;
count[x - 10]++;
}
return 0;
}
|
13 | 6433 | /*
* 1000012730_26.cpp
* ????????
* Created on: 2010-10-29
* Author: ???
*/
int main(){
int n,i,m=1;
cin>>n; //????n
int a[n];
for(i=1;i<=n;i++) //??????a[i]
cin>>a[i];
cout<<a[1];
for(i=2;i<=n;i++)
{m=1; //???????????m
for(int j=i-1;j>0;j--)
if(a[i]==a[j])
m=0;
if(m==1) cout<<' '<<a[i];}
return 0;
}
|
13 | 6434 | int main()
{
int n,i,j,a[20000],flag=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
if(flag==0)
cout<<a[0];
flag=1;
for(j=0;j<i;j++)
{
if(a[j]==a[i])
break;
if(j==i-1&&a[j]!=a[i])
cout<<" "<<a[i];
}
}
return 0;
} |
13 | 6435 | int main()
{
int n,i,j,a[20000],b[20000];
scanf("%d",&n);
scanf("%d",&a[0]);
for(i=1;i<n;i++)
{
scanf("%d",&a[i]);
for(j=0;j<i;j++)
{
b[i]=a[i]-a[j];
if(b[i]==0)
break;
}
}
printf("%d",a[0]);
for(i=0;i<n;i++)
{
if(b[i]!=0)
printf(" %d",a[i]);
}
return 0;
} |
13 | 6436 |
void main()
{
int n,a[20001],t,i,m;
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for (i=0;i<n;i++)
{
m=1;
for(t=0;t<i;t++)
{
if(a[i]==a[t])
{
m=0;
}
}
if(m==1)
{
if(i>0)
{
printf(" ");
}
printf("%d",a[i]);
}
}
} |
13 | 6437 | int main(){
int n,i,j,k=1,a[20001],b[20001],f;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
if(i==0) b[0]=a[0];
f=1;
for(j=0;j<i;j++){
if(a[i]==a[j]){
f=0;
break;
}
}
if(f==1){
b[k]=a[i];k++;
}
}
for(i=1;i<k-1;i++){
printf("%d ",b[i]);
}
printf("%d",b[k-1]);
scanf("%d",&n);
return 0;
}
|
13 | 6438 | /*
* print different numbers.cpp
*
* Created on: 2013-10-28
* Author: kongwei
*/
int main()
{
int n;
cin>>n;
int array[n];//????
for(int i=0;i<=n-1;i++)//????
cin>>array[i];
cout<<array[0];//???array[0]
for(int i=1;i<=n-1;i++)//??????????
{
int g=0;//?????g,?????0
for(int j=0;j<=i-1;j++)//???????????????????????
if(array[i]==array[j])
g=g+1;
if(g==0)
cout<<" "<<array[i];
}
return 0;
} |
13 | 6439 | int main()
{
int a[20000],t,j,m,i,asd;
scanf("%d",&m);
for(i=0;i<m;i++)
{t=1;
scanf("%d",&a[i]);
if(i==0)
{printf("%d",a[i]);}
else if(i!=0)
{
for(j=0;j<i;j++)
{asd=a[i]-a[j];
if(asd==0)
{t=0;
break;}
}if(t==1)
printf(" %d",a[i]);
}
}
printf("\n");
return 0;
}
|
13 | 6440 | int main(){
int a[20000],n,i,j;
cin>>n;
for(i=0;i<n;i++){
cin>>a[i];
for(j=0;j<i;j++)
{
if(a[j]==a[i]) a[i]=0;
}
}
cout<<a[0];
for(i=1;i<n;i++) if(a[i]!=0) cout<<" "<<a[i];
return 0;
}
|
13 | 6441 | int main()
{
int a[10000],n,i,t,j,m;
scanf("%d/n",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("%d",a[0]);
for (i=1;i<=n-1;i++)
{
m=0;
for(j=0;j<=i-1;j++)
if(a[i]==a[j]) m=m+1;
if(m==0) printf(" %d",a[i]);
}
return 0;
} |
13 | 6442 | int main()
{
int n,a,i,j;
while(cin>>n)
{
char b[20000];
int a[20000];//????
for(i=0;i<n;i++)
cin>>a[i];
cin.getline(b,20000);//?????????????????
?????????????????
//
cout<<a[0];
for(i=1;i<n;i++)
{
for(j=0;j<i;j++)//????????????
if(a[i]==a[j])break;//????????????
if(j==i)
cout<<" "<<a[i];
}
cout<<endl;
}
return 0;} |
13 | 6443 | int main()
{
int n, m, num[20000], i, num_cout[20000], k, j;
cin >> n;
for (i = 0; i < n; i++)
{
cin >> num[i];
}
num_cout[0] = num[0];
k = 1;
for (i = 1; i < n; i++)
{
m = 0;
for (j = 0; j < k; j++)
{
if (num[i] == num_cout[j])
m++;
}
if (m == 0)
{
num_cout[k] = num[i];
k++;
}
}
for (i = 0; i < k - 1; i++)
{
cout << num_cout[i] << " ";
}
cout << num_cout[k - 1];
return 0;
} |
13 | 6444 | int main()
{
int A[20000],B[20000],n,i,j,k;
int flag;
int number=0;
j=0;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&A[i]);
}
for(i=0;i<n;i++)
{
flag=0;
for(k=0;k<i;k++)
{
if(A[k]==A[i])
{
flag=1;
break;
}
}
if(flag==0)
{
B[j]=A[i];
number=number+1;
j=j+1;
}
}
for(j=0;j<number;j++)
{
if(j==0)
{
printf("%d",B[j]);
}
else
{
printf(" %d",B[j]);
}
}
return 0;
}
|
13 | 6445 | main()
{
int n;
scanf("%d",&n);
int*p;
p=(int*)malloc(n*sizeof(int));
int i,j;
for(i=0;i<n;i++)
scanf("%d",&p[i]);
printf("%d",p[0]);
for(i=1;i<n;i++)
{
for(j=0;j<i;j++)
{
if(p[i]==p[j])
break;
}
if(j==i)
printf(" %d",p[i]);
}
getchar();
getchar();
getchar();
getchar();
getchar();
getchar();
}
|
13 | 6446 | int main()
{
int a[20000],b[20000];
int n,i,j,k=0;
scanf("%d",&n);
for (i=0;i<n;i++)
scanf("%d",&a[i]);
for (i=n-1;i>0;i--)
{
for (j=0;j<i;j++)
{
if (a[i]==a[j])
break;
if (j==i-1)
{
b[k]=a[i];
k++;
}
}
}
b[k]=a[0];
for (i=k;i>0;i--)
printf("%d ",b[i]);
printf("%d",b[0]);
return 0;
} |
13 | 6447 | void main()
{
int a[20000],b[20000];
int n,i,k,j,l,m,bn;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
b[0]=a[0];
m=0;
for(j=1;j<n;j++)
{
for(k=0,l=1;k<j;k++)
{
if(a[j]==a[k])
{
l=0;
break;
}
}
if(l!=0)
{
m+=1;
b[m]=a[j];
}
}
for(bn=0;bn<m;bn++)
{
printf("%d ",b[bn]);
}
printf("%d",b[m]);
} |
13 | 6448 | int main()
{
int n,i,k;
scanf("%d",&n);
int a[100]={0};
scanf("%d",&k);
a[k]=a[k]+1;
printf("%d",k);
for(i=2;i<=n;i++)
{
scanf("%d",&k);
a[k]=a[k]+1;
if(a[k]==1)
printf(" %d",k);
}
return 0;
}
|
13 | 6449 | int main()
{
int n,i,j;
scanf("%d",&n);
int a[n];
for (i=0;i<n;i++)
scanf("%d",&a[i]);
i=0;
while (i<n)
{ for (j=i+1;j<n;j++)
if (a[i]==a[j]) a[j]=0;
i++;}
printf("%d",a[0]);
i=1;
for (i=1;i<n;i++)
if (a[i]!=0) printf(" %d",a[i]);
} |
13 | 6450 | int main(){
int n,a[20001],i,j;
cin >> n;
for(i=0;i<n;i++){ //??????
cin >> a[i];
}
for(i=0;i<n;i++){
if(a[i]==0) continue;
for(j=i+1;j<n;j++){
if( a[i]==a[j]) a[j]=0; //????????0
}
}
int temp[20001],k=0;
for(i=0;i<n;i++){
if(a[i]!=0){
temp[k]=a[i]; //?temp??????????????
k++;
}
}
for(i=0;i<k-1;i++) cout << temp[i] << ' '; //?????????
cout << temp[k-1]<< endl;
return 0;
}
|
13 | 6451 | int main()
{
int n, a[30000], i, j, hash[30000];
cin>>n;
for( i = 1; i <= n; i++ )
{
cin>>a[i];
hash[i]=1;
}
cout<<a[1];
for( i = 2; i <= n; i++ )
{
for(j=1; j<i ; j++)
{
if(a[i]==a[j])
{
hash[i]=hash[i]*0;
}
else
{
hash[i]=hash[i];
}
}
}
for( i = 2; i <= n; i++ )
{
if(hash[i]==1)
cout<<" "<<a[i];
}
int b;cin>>b;
return 0;
}
|
13 | 6452 | /*
* ????shuzu.cpp
* ???00948343_??
* ?????2012/10/8
* ???????????
*/
int main(){
int n; //???????
cin >> n;
int a[n], i, j; //?????????
for (i=0;i<n;i++){
cin >> a[i]; //????
for (j=0;j<i;j++){ //????????
if (a[j]==a[i])
break;
}
if (j==i){ //????????????????
if (i!=0)
cout << ' ';
cout << a[i];
}
}
return 0;
}
|
13 | 6453 | int main(){
int n,i,k,t;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++)
for(k=i+1;k<n;k++)
while ((a[k]==a[i])&&(k<n)) //?a?i???????????
{for(t=k;t<n-1;t++) //???????
a[t]=a[t+1];
n--;}
for(i=0;i<n-1;i++)
cout<<a[i]<<" ";
cout<<a[n-1];
return 0;
}
|
13 | 6454 | int main()
{
int n, i, j;
int a[100000];
scanf("%d", &n);
for (i=0;i<n;i++)
{
scanf("%d", &a[i]);
}
for (i=1;i<n;i++)
{
for (j=0;j<i;j++)
{
if (a[i]==a[j])
a[i]=0;
}
}
printf("%d", a[0]);
for (i=1;i<n;i++)
{
if (a[i]!=0)
printf(" %d", a[i]);
}
}
|
13 | 6455 | void main()
{
int k,m,i,j,n;
int s1[20000],s2[20000];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&s1[i]);
for(i=n-1,m=0;i>=0;i--)
{k=0;
for(j=i-1;j>=0;j--)
{if(s1[i]==s1[j])
k++;}
if(k==0)
{s2[m]=s1[i];
m++;}
}
s2[m]='\0';
for(n=m-1;n>0;n--)
{printf("%d ",s2[n]);
}
printf("%d",s2[0]);
}
|
13 | 6456 | //??n????n???????????????10-100???
//???????????????????????????????????????????
//???2010?10?25
int main()
{
int n, b[91]={0}, i, k,counter=0, temp;//n:?????????????,temp:?????????b[90],??90???????????????10-100; i k??????;counter???
cin>>n;
for (i=1; i<=n; i++)//n???????
{
cin>>temp;
for (k=0; k<91; k++)//????????????
{
if (b[k]==temp )//????????
break;
}
if(k>=91)//????????????,???????????
{
b[counter]=temp;
counter++;//????,??1,?????counter-1??
}
}
for (k=0; k < counter-1; k++)//??????
{
cout<<b[k]<<" ";
}
cout<<b[counter-1]<<endl;//????,?????
return 0;
} |
13 | 6457 | //***************************************************************
//*???????????? *
//*? ????? *
//*?????2010.10.29. *
//*????????????? *
//***************************************************************
int main ()
{
int i, n; //i?????????????n????????
cin>>n;
int a[20000] = {0}; //????????20000????????0
for ( i = 0; i < n; i ++ )
{
cin>>a[i]; //????????
}
cout<<a[0]; //???????
int k, m; //??????k,m
for ( k = 1; k < n; k ++ )
{
for ( m = 0; m < k; m ++ ) //???????????????
{
if ( a[k] != a[m] )
continue;
else
break;
}
if ( m == k && a[k] != a[k-1] ) //??????????????????????
cout<<" "<<a[k]; //???????
}
return 0;
}
|
13 | 6458 | int main()
{
int n,a[20000]={'\0'},i=0,j=0,k=0,temp,count;
scanf("%d",&n);
scanf("%d",&a[0]);
printf("%d",a[0]);
for(i=1;i<=n-1;i++)
{
scanf("%d",&temp);
count=0;
for(j=0;j<=k;j++)
{
if(temp==a[j])
break;
else
count++;
}
if(count==k+1)
{
k++;
a[k]=temp;
}
}
for(i=1;a[i]!='\0';i++)
printf(" %d",a[i]);
} |
13 | 6459 | void main()
{
int m,n,a[20000],i,j;
j=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("%d",a[0]);
m=1;
if(n>1)
{
do
{
for(i=m-1;i>=0;i--)
{
if(a[m]==a[i])
j=j+1;
}
if(j==0)
printf(" %d",a[m]);
j=0;
m=m+1;
}while(m<n);
}
printf("\n");
} |
13 | 6460 | int main()
{
int n, i, j, num[20000] , st[91] , tot=0 ;
scanf("%d",&n);
for(i=0;i<n;i++)scanf("%d",&num[i]);
for( i=0 ; i<n ; i++ )
{
for( j=0 ; j<i ; j++ ) if(num[j]==num[i])break;
if( j==i ) st[++tot]=num[i];
}
for( i=1 ; i<tot ; i++ ) printf("%d ",st[i]);
printf("%d",st[tot]);
}
|
13 | 6461 | int main()
{
int n=0,x=0,a[100]={0},i=0;
cin>>n;
cin>>x;
cout<<x;
a[x-1]=1;
for(i=2;i<=n;i++)
{
cin>>x;
if(a[x-1]==0)
{
cout<<" "<<x;
a[x-1]=1;
}
}
return 0;
}
|
13 | 6462 | int check(int b[],int len,int x)
{
int i,flag=1;
for(i=0;i<len;i++)
{
if(b[i]==x)
{
flag=0;
return 0;
break;
}
}
if(flag)
return 1;
}
int main()
{
int j,i,n;
int a[20100],b[20100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("%d",a[0]);
b[0]=a[0];
j=1;
for(i=1;i<n;i++)
{
if(check(b,j,a[i]))
{
printf(" %d",a[i]);
b[j]=a[i];
j++;
}
}
return 0;
} |
13 | 6463 | int main()
{
int n,m[10000],i,j,x[10000],z=0,h=1;
scanf("%d\n",&n);
for(i=1;i<=n;i++)
scanf("%d",&x[i-1]);
m[0]=x[0];
for(i=2;i<=n;i++)
{z=0;
for(j=1;j<=i-1;j++)
if(x[j-1]==x[i-1])
z=1;
if(z==0) {m[h]=x[i-1];
h=h+1;}
}
for(i=0;i<=h-1;i++)
{printf("%d",m[i]);
if(i!=h-1) printf(" ");}
return 0;
}
|
13 | 6464 | void main()
{
int n,i,j,k,a[20001];
scanf("%d\n",&n);
for(i=0;i<n;i++){
scanf("%d",&a[i]);
for(j=0;j<i;j++)
if(a[i]==a[j]){
a[i]=0;
break;
}
}
for(k=0;k<n;k++){
if(a[k]){
if(!k)
printf("%d",a[k]);
else
printf(" %d",a[k]);
}
}
} |
13 | 6465 | int main()
{
int n,i=0,x,m=0,k=0,t=0;
cin>>n;
int shuzu[n];
for(i=0;i<n;i++)
{
cin>>x;
shuzu[i]=x;
}
for(m=0;m<n;m++)
{
if(m==0){cout<<shuzu[m];}
else
{
for(k=0;k<m;k++)
{
if (shuzu[m]!=shuzu[k]) t=1;
else {t=0;break;}
}
if(t==1) cout<<" "<<shuzu[m];
}
}
return 0;
}
|
13 | 6466 | int main()
{
int N;
scanf("%d",&N);
int a[N],b[N];
int i,j,k,n,m = 0,flag;
for(i = 0; i <= N; i++)
scanf("%d",&a[i]);
for(i = 0; i < N; i++)
{
flag = 1;
for(j = 1; j <= m; j++)
if(a[i] == b[j])
{
flag = 0;
break;
}
if(flag)
{
b[j] = a[i];
m++;
}
}
printf("%d",b[1]);
for(i = 2; i <= m; i++)
printf(" %d",b[i]);
}
|
13 | 6467 | /*
* homework1106.cpp
*
* Created on: 2012-11-5
* Author: wangyinzhi
*/
int main(){
int n,i,k;
cin>>n;
int a[n];
for(i=0;i<=n-1;i++){
cin>>a[i];//????
}
for(i=1;i<=n-1;i++){
for(k=0;k<=i-1;k++){
if(a[i]==a[k]){
a[i]=0;
break;//???????????????0
}
}
}
for(i=0;i<=n-1;i++){
if(a[i]!=0){
if(i==0){
cout<<a[i];
}
else cout<<" "<<a[i];//????0???????????
}
}
return 0;
} |
13 | 6468 | void main()
{int n,i,j,k,m=0;;
int a[20001];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n-1-m;i++)
for(j=i+1;j<n-m;)
if(a[j]==a[i])
{for(k=j;k<n-m;k++)
a[k]=a[k+1];
m++;}
else j++;
for(i=0;i<n-1-m;i++)
printf("%d ",a[i]);
printf("%d",a[n-m-1]);
}
|
13 | 6469 | int main()
{
int a[20001]={0};//????a[20001],??a[n]????0
int n=0;//?????n
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];//?n????
}
int b[20001]={0};//????b[20001],??b[n]????0
int c[20001]={0};//????c[20001],??c[n]????0
int l=1;//??l
for(int j=1;j<=n;j++)
{
for(int k=0;k<j;k++)
{
if(a[j]==a[k])
{
b[j]=1;
//????????,b[j]??
}
}
}
for(int p=1;p<=n;p++)
{
if(b[p]==0)
{
c[l]=a[p];
l=l+1;//?????????????????c[l]
}
}
for(int m=1;c[m]>0;m++)
{
if(c[m+1]>0)//?c[m]??????
cout<<c[m]<<" ";//??c[m]???
if(c[m+1]==0)//?c[m]?????
cout<<c[m]<<endl;//???c[m]
}
return 0;
}
|
13 | 6470 |
int main()
{
int a[20000],i,j,n;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("%d",a[0]);
for(i=0;i<n;i++)
for(j=0;j<n;j++)
{
if(a[i]==a[j]) break;
if(j==i-1)
{
printf(" ");
printf("%d",a[i]);
}
}
return 0;
} |
13 | 6471 |
int main()
{
int n;
int i;
int buf;
int appeared[110] = {0};
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &buf);
if (!appeared[buf]) {
if (i != 0) {
printf(" ");
}
printf("%d", buf);
appeared[buf] = 1;
}
}
return 0;
} |
13 | 6472 | /*
* unseennum.cpp
*
* Created on: 2013-11-5
* Author: ???
*/
int main()
{int a[20000];
int n,i,j,l,k;
cin>>n;
l=n;
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<l-1;i++)
{
for(j=i+1;j<l;j++)
{
if(a[i]==a[j])
{for(k=j;k<l-1;k++)
a[k]=a[k+1];
j--;
l--;
}
}
}
cout<<a[0];
for(i=1;i<l;i++)
cout<<' '<<a[i];
return 0;
}
|
13 | 6473 |
int main()
{
int n,i,j,k,l,a,b;
scanf("%d",&n);
int num[20000];
int res[20000];
for(i=0;i<n;i++)
scanf("%d",&num[i]);
b=0;
k=0;
for(i=0;i<n;i++)
{
a=num[i];
for(j=0;j<=i;j++)
{
if(i==j)
{
b=a;
continue;
}
if(a!=num[j])
b=a;
else
{
b=0;
break;
}
}
if(b!=0)
{
k++;
res[k]=b;
}
}
for(l=1;l<=k;l++)
{
if (l!=k)
printf("%d ",res[l]);
else
printf("%d",res[l]);
}
return 0;
}
|
13 | 6474 | /*
*shuchubuchongfushuzi.cpp
*?????n????n???????????????10-100???
*???????????????????????????????????????????
*Created on: 2012-11-11
*Author: ??
*/
int main() {
int n = 0;
int shuru[100000];
cin >> n;
for (int i = 0; i < n; i++) {//????
cin >> shuru[i];
if (getchar() == '\n')
break;
else
continue;
}
cout << shuru[0];
for (int i = 1; i < n; i++) {//??????
int jishu = 0;
for (int j = 0; j < i; j++) {
if (shuru[i] == shuru[j])
break;
else {
jishu++;
}
}
if (jishu == i)//????????
cout << ' ' << shuru[i];
else
continue;
}
return 0;
}
|
13 | 6475 | int main()
{
int N, c, b = 1;
cin >> N;
int a[20001];
for (int i = 1; i <= N; i ++)
cin >> a[i];
for (int m = 2; m <= N; m ++)
{
for (c = 1;c <= b; c ++)
{
if (a[m] == a[c]) break;
}
if (c == b + 1)
{
b ++;
a[b] = a[m];
}
}
cout << a[1];
for (int d = 2; d <= b; d ++)
cout << " " << a[d];
return 0;
} |
13 | 6476 | int main()
{
int a[20000];
int i,j,n,k;
k=0;
scanf("%d",&n);
n=n-1;
for(i=0;i<=n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
for(j=i+1;j<=n;j++)
if(a[j]==a[i]) a[j]=0;
}
printf("%d",a[0]);
for(i=1;i<=n;i++)
{
if(a[i]!=0)
{
printf(" %d",a[i]);
}
}
return 0;
} |
13 | 6477 | int main()
{
int c,a[20000],n,i,l=0,p,k=0,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
l=0;//l??????????????????
scanf("%d",&c);
for(j=0;j<k;j++)//??????????????????????
{
if (c==a[j])//?????????????????
l=l+1;
}
if(l==0)
{
a[k]=c;
k++;
}
}
for(i=0;i<k;i++)
{
if(i==0)
printf("%d",a[i]);
else
{
printf(" %d",a[i]);
}
}
getchar();
getchar();
}
|
13 | 6478 | int main()
{
int n,a[20000];
scanf("%d",&n);
int i,j;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("%d",a[0]);
for(i=1;i<n;i++)
{
for(j=0;j<i;j++)
{
if(a[i]==a[j])
break;
}
if(j==i)
printf(" %d",a[i]);
}
return 0;
} |
13 | 6479 | int main(){
int all,name[20000],input[20000],i,p,count,judge;
scanf("%d",&all);
count=0;
for(i=0;i<all;i++){name[i]=0;}
for(i=0;i<all;i++){scanf("%d",&input[i]);}
for(i=0;i<all;i++){
judge=0;
for(p=0;p<count;p++){if(name[p]==input[i]){judge=1;break;}}
if(judge==1){continue;}
name[count]=input[i];
count++;
}
printf("%d",name[0]);
for(i=1;i<count;i++){printf(" %d",name[i]);}
return 0;
} |
13 | 6480 | int main()
{
int i,j,n,p=0,m[20000];
scanf("%d\n",&n);
for(i=0;i<n;i++)
scanf("%d",&m[i]);
for(i=0;i<n;i++)
{
j=0;
while(j<i)
{
if(m[i]==m[j])
break;
j++;
}
if(j==i)
{
if((i<n)&&(i>0))
printf(" ");
printf("%d",m[i]);
p++;
}
}
return 0;
} |
13 | 6481 | int main()
{
int n,b,a[20000],i,j;
scanf("%d",&n);
scanf("%d",&a[0]);
printf("%d",a[0]);
for(i=1;i<n;i++)
{
scanf("%d",&b);
a[i]=b;
for(j=0;j<i;j++)
{
if(a[i]==a[j])
a[i]=0;
}
}
for(i=1;i<n;i++)
{
if(a[i]!=0)
printf(" %d",a[i]);
}
printf("\n");
return 0;
} |
13 | 6482 | // ???????
int main()
{
int n, a, i, j, k = 1, num[20000]; // ???????num[20000]?a????????i,j,k???????
cin >> n; // ??????
cin >> a;
num[0] = a; // ???????num[0]
for (i = 1; i < n; i++)
{
cin >> a; // ????
for (j = 0; j < k; j++)
{
if (a == num[j])
break; // ???????????????
}
if (j == k) // ??????
{
num[k] = a; // ????????
k = k + 1;
}
}
for (i = 0; i <= k - 2; i++)
cout << num[i] << " "; // ??????????????
cout << num[k - 1]; // ???????
return 0;
}
|
13 | 6483 | void main()
{
int n,l,i,j,x;
scanf("%d",&n);
l=0;
int a[20000];
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(j=0;j<n;j++)
{
for(i=(j+1);i<n;i++)
{
if(a[j]==a[i])
a[i]='*';
}
}
if(a[n-1]!='*')
{
for(i=0;i<n-1;i++)
{
if(a[i]!='*')
printf("%d ",a[i]);
}
printf("%d",a[n-1]);
}
else
{
for(i=n-1;i>0;i--)
{
if(a[i]=='*')l=l+1;
else break;
}
for(j=0;j<n-l-1;j++)
{
if(a[j]!='*')
printf("%d ",a[j]);
}
printf("%d",a[n-l-1]);
}
}
|
13 | 6484 | int main () {
int n,k;
int flag=0;
int i;
scanf("%d",&n);
int *shuzu=(int*)malloc(sizeof(int)*n);
for(i=0;i<n;i++){
scanf("%d",&shuzu[i]);
}
printf("%d",shuzu[0]);
for(i=1;i<n;i++){
for(k=0;k<i;k++){
if(shuzu[i]==shuzu[k]){
flag=1;
break;
}
}
if(flag==0){
printf(" %d",shuzu[i]);
}
flag=0;
}
free(shuzu);
return 0;
}
|
13 | 6485 | int main()
{
int u[20000];
int a,n,i,j,k,l;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&u[i]);
}
k=0;
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(u[i]==u[j])
{
u[j]=0;
}
}
}
for(i=0;i<n;i++)
{
if(u[i]!=0)
{
k++;
}
}
i=0;
l=0;
while(i<n)
{
if(u[i]!=0)
{
if(l<k-1)
{
printf("%d ",u[i]);
l++;
}
else
{
printf("%d",u[i]);
}
}
i++;
}
return 0;
}
|
13 | 6486 | /*
* practice.cpp
*???
* Created on: 2011-11-5
* Author: ???
*/
int main ()
{
int i,n,a[1000]={0},j,k,m;
cin>>n;
cin>>a[1];
for (i=2,m=2;m<=n;i++,m++)
{
cin>>a[i];
for (j=1;j<i;j++)
{
if (a[i]==a[j])
{
i--;
break;
}
}
}
cout<<a[1];
for (k=2;k<=i-1;k++)
cout<<' '<<a[k];
return 0;
}
|
13 | 6487 |
int main()
{
int n;
cin >> n;
int count[100] = {0}, num[90] = {0};
int i = 1, a, j = 0;
for (i; i <= n; i++)
{
cin >> a;
if (count[a] == 0)
{
num[j] = a;
j += 1;
}
count[a] = count[a] + 1;
}
i = 0;
for (i; i < j - 1; i++)
{
cout << num[i] << " ";
}
cout << num[j - 1] << endl;
return 0;
} |
13 | 6488 | /**
* ???1000012847
* ??????
* ???????????
* ?????n????n???????????????10-100???
* ???????????????????????????????????????????
*/
int main()
{
//??n????????a[20000]????????i?num??????count[20000]????????
int n , a[20000] ,i , num , count[20000] = {0};
cin >> n; //??????????n
for (i = 0; i < n; i ++)
{
cin >> a[i]; //????n??
num = a[i]; //?num??a[i]
count[num] ++; //num???1
if (i == 0) //???????????
cout << a[i];
else //????????
{
if (count[num] == 1) //??num???1????num
cout << " " << num;
}
}
cout << endl; //??????
return 0;
}
|
13 | 6489 | int BT(int x,int a[40000])
{
int b=0,c=0;
while(b<40000)
{
if(a[b]==x)
{
c=1;
break;
}
else
b++;
}
return c;
}
main()
{
int n,a[40000],i,b[40000],c;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<10001;i++)
b[i]=-1;
for(i=0,c=0;i<n;i++)
if(BT(a[i],b)==0)
{
if(c==0)
printf("%d",a[i]);
else
printf(" %d",a[i]);
b[c]=a[i];
c++;
}
getchar();
getchar();
} |
13 | 6490 | int main()
{
int n,i,a[20001]={0},j,l;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
for(l=(i+1);l<n;l++)
{
if(a[l]==a[i])
{
for(j=(l+1);j<n;j++)
{
a[j-1]=a[j];
}
l-=1;
n--;
}
}
}
for(i=0;i<n;i++)
{
if(i==0)
printf("%d",a[i]);
else
printf(" %d",a[i]);
}
return 0;
} |
13 | 6491 | int main()
{
int n;
int a[20000];
int i,j;
int t;
int l=1;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
if(n==1)
{
printf("%d",a[0]);
return 0;
}
printf("%d",a[0]);
t=n;
for(i=0;i<n;i++)
{
for(j=0;j<i;j++)
{
if(a[i]==a[j])
{
t=t-1;
break;
}
}
}
for(i=0;i<n;i++)
{
for(j=0;j<i;j++)
{
if(a[i]==a[j])
{
break;
}
else if(j==i-1&&l<t)
{
printf(" %d",a[i]);
}
}
}
return 0;
} |
13 | 6492 | main()
{
int m,n,i,j;
int a[20000];
int count=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
printf("%d",a[0]);
for(i=1;i<n;i++)
{
int count=0;
for(j=0;j<i;j++)
{
if(a[i]==a[j])
count++;
}
if(count==0)
printf(" %d",a[i]);
}
getchar();
getchar();
getchar();
getchar();
getchar();
}
|
13 | 6493 | int main()
{
int n;cin >> n;
int m = 0;
int a[20001];
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 2; i <= n; i++)
for (int j = i - 1; j >= 1; j--)
{
if (a[i] == a[j])
a[i] = 0;
}
cout << a[1];
for (int i = 2; i <= n; i++)
if (a[i] != 0)
cout << " " << a[i];
return 0;
} |
13 | 6494 |
int main()
{
int n,i,c;
int a[101]={0};
cin >>n;
cin>>c;
a[c]=1;
cout<<c;
while(cin>>c)
{
if(a[c]==0)
{
cout <<" "<<c;
a[c]=1;
}
}
//for (;;) ;
return 0;
}
|
13 | 6495 | int main()
{
int n,i=1,k;
cin>>n;
int a[20000]; //??????????
cin>>a[0]; //?????????????
while(cin>>a[i])
{
i++;
if(i==n) break;
} //??????????n???
cout<<a[0]; //???a[0]
i=1;
while(i<n)
{
int mid=0;
for(k=0;k<i;k++)
{
if(a[i]==a[k])
{
mid=1;break;} //?a[i]???????????????
}
if(mid==0)
cout<<" "<<a[i]; //???????a[i]
i++;
}
cout<<"\n";
return 0;
} |
13 | 6496 | /*
* practice.cpp
*
* Created on: 2014-1-4
* Author: 111
*/
int main()
{
int n;
cin >> n;
int str[20001];
for(int i=0;i<n;i++)
cin >> str[i];
int num =0;
for(int i=1;i<n-num;i++){
for(int j=0;j<i;j++)
if(str[j]==str[i]){
for(int k=i;k<n-1-num;k++)
str[k] = str[k+1];
num++;
//cout << num << endl;
i--;
break;
}
}
cout << str[0];
for(int i=1;i<n-num;i++)
cout << ' ' << str[i];
cout << endl;
return 0;
}
|
13 | 6497 | int a[100000];
int n;
void del_a(int x)
{
for(int i=x;i<n-1;i++)
{
a[i]=a[i+1];
}
a[n-1]=0;
n=n-1;
}
int main()
{
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i];
}
for(int i=1;i<n;i++)
{
for(int j=0;j<i;j++)
{
if(a[i]==a[j])
{
del_a(i);
i=i-1;
break;
}
}
}
for(int i=0;i<n-1;i++)
{
cout<<a[i]<<" ";
}
cout<<a[n-1];
return 0;
} |
13 | 6498 | //???????????
//?????? 1000012918
//???10.28
//???
int main()
{
int n, count[101] = {0}, num; //count[num]???num????????????0
cin >> n;
for (int i = 1; i <= n; i ++)
{
cin >> num;
if (count[num] == 0) //?????????
if (i == 1)
cout << num;
else
cout << " " << num;
count[num]++; //?????????1
}
return 0;
} |
13 | 6499 | int main ()
{
int n, t, i, j, m;
cin >> n;
int a[20000] = {0}; // ????
cin >> t;
cout << t;
m = 1; //m??????????
a[0] = t; //??????????
for (i = 2; i <= n; i++)
{
cin >> t;
for ( j = 0; j < m; j ++)
{
if ( a[j] == t) // ????????
break;
}
if ( j >= m ) // ????????????
{
cout << ' ' << t;
a[m] = t;
m ++;
}
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.