la 1 nu e intrebarea completa
2.
#include <iostream>
using namespace std;
int main()
{ int n,cn,ogl,i,v[20],k,z;
cin >> n;
cn=n;
for(i=1;i<=n;i++)
cin>>v[i];
for (i=1;i<=n;i++)
{ cn=v[i];
while (cn != 0)
{
ogl = ogl * 10 + cn % 10;
cn = cn / 10;
}
if (ogl==v[i]){ for (z =i; z <= n - 1; z++)
v[z] = v[z+1];
n = n - 1;}
}
for(i=1;i<=n;i++)
cout<<v[i]<<" ";
return 0;
}