Emplopi
From Algopedia
/*
Nume program : emplopi.c
Nume concurent : Stefan Nitu
*/
#include <stdio.h>
#include <stdlib.h>
int v[30];
int main(){
int i, xr, n, max, m;
char c;
scanf("%d", &v[0]);
c=getchar();
i=1;
max=v[0]; m=0; xr=v[0];
while(c!='\n'){
scanf("%d", &v[i]);
c=getchar();
xr=xr^v[i];
i++;
}
n=i;
i=0;
if(xr==0){
while (v[i]==0)
i++;
v[i]=v[i]-1;
}
else{
while((v[i]^xr)>v[i])
i++;
v[i]=v[i]^xr;
}
printf("%d", v[0]);
for(i=1;i<n;i++)
printf(" %d", v[i]);
printf("\n");
return 0;
}