this can be solved as follows..... if you consider that the 2n+1 is 11 them we can do the program as follows
main()
{
int a[11],i,j,ans;
for(i=0;i<11;i++)
scanf("%d",&a[i]);
for(i=0;i<11;i++)
{
for(j=0;j<11;j++)
{
if(i==j)
continue;
if(a[i]==a[j]
continue;
else
ans=a[j];
}
}
printf("%d",ans);
}
satisfied???
una_020 wrote:
> given an array of 2n+1 elemnts n of the elemnts having duplicates
> how
> do u find the number wihout having duplicate..? ?
>
