#include <stdio.h>
//наивный алгоритм O(n^2)
int* unique_del(int* f, int *l){
int t, *p;
for(; f != l; ++f){
p = f + 1;
while(p < l){
if(*p == *f){
t = *(l - 1);
*(l - 1) = *p;
*p = t;
--p;
--l;
}
++p;
}
}
return l;
}
int main(void){
int* p, *e;
int A[] = { 1, 2, 2, 3, 1, 3, 4, 1, 3, 3, 5, 4, 6, 5 };
e = unique_del(A, A + sizeof(A)/sizeof(A[0]));
for(p = &A[0]; p != e; ++p)
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CgovL9C90LDQuNCy0L3Ri9C5INCw0LvQs9C+0YDQuNGC0LwgTyhuXjIpCmludCogdW5pcXVlX2RlbChpbnQqIGYsIGludCAqbCl7CglpbnQgdCwgKnA7Cglmb3IoOyBmICE9IGw7ICsrZil7CgkJcCA9IGYgKyAxOwoJCXdoaWxlKHAgPCBsKXsKCQkJaWYoKnAgPT0gKmYpewoJCQkJdCAgICAgICAgPSAqKGwgLSAxKTsKCQkJCSoobCAtIDEpID0gKnA7CgkJCQkqcCAgICAgICA9IHQ7CgkJCQktLXA7CgkJCQktLWw7CgkJCX0KCQkJKytwOwoJCX0KCX0KCXJldHVybiBsOwp9CgoKaW50IG1haW4odm9pZCl7CglpbnQqIHAsICplOwoKCWludCAgQVtdID0geyAxLCAyLCAyLCAzLCAxLCAzLCA0LCAxLCAzLCAzLCA1LCA0LCA2LCA1IH07CgoJZSA9IHVuaXF1ZV9kZWwoQSwgQSArIHNpemVvZihBKS9zaXplb2YoQVswXSkpOwoJZm9yKHAgPSAmQVswXTsgcCAhPSBlOyArK3ApCgkJcHJpbnRmKCIlZCAiLCAqcCk7CglyZXR1cm4gMDsKfQo=