int main()
{
char choice;
int r, g, b;
choice = getchar();
if(choice == 'h')
{
hex_to_dec();
}
else
{
if(choice == 'd')
{
scanf("%d, %d, %d", &r, &g, &b);
printf("#");
dec_to_hex(r);
dec_to_hex(g);
dec_to_hex(b);
printf("\n");
}
else
{
return 0;
}
}
return 0;
}
//Functions to encrypt 2 Hex messages with XOR
//Take in 2 Hex arguments
//Xor them together to produce the encrypt message
//Algorithm:
//First compare size between msg and key
//If msg > key, repeat the key until msg = key
//encrypt every bytes then concatenate the out result
char* hex_xor( char *msg, char *key)
{
char* out;
int i;
char a[2];
char b[2];
int len = strlen(msg) + 1;
out = malloc((len)*sizeof(char));
memset(out, 0, (len)*sizeof(char));
//Functions to compare msg and key then modify key if needed
//
//Xor every char
while(msg[0]!='\0')
{
for(i=0; i<2; i++)
{
a[i] = msg[i];
b[i] = key[i];
}
a[1] = '\0';
b[1] = '\0';
out = strcat(out, dec_to_hex(int_xor(hex2int(a) ,hex2int(b))));
msg = msg + 1;
key = key + 1;
}
return out;
}
int main()
{
int n,i;
char hex[20];
scanf("%d",&n);
for(i=0; i<20; i++)
{
hex[i]='-';
}
int c=0,l;
while(!c)
{
dec_to_hex(n,hex);
for(i=0; hex[i]!='-'; i++);
l=i-1;
for(i=0; i<=l; i++,l--)
if(hex[i]!=hex[l])
{ c=0;
n++;
break;
}
else
{
c=1;
}
}
for(i=0; hex[i]!='-'; i++)
printf("%c",hex[i]);
return 0;
}
int param_direct_4(char *save, int i, int fd)
{
int k;
char *dest;
k = 0;
write(fd, " ", 1);
while (k < (DIR_SIZE - 1))
{
write(fd, "0x00 ", 5);
k++;
}
i += my_strlen(&save[i], SEPARATOR_CHAR);
dest = my_strncat(&save[i + 1], my_strlen(&save[i + 1], SEPARATOR_CHAR));
write(fd, "0x", 2);
if (my_getnbr(dest) < 10)
write(fd, "0", 1);
write(fd, dec_to_hex(my_getnbr(dest)), my_strlen(dest, '\0'));
return (i + 2);
}
int palindrome(int number)
{
int length,i,j;
*hex_number='\0';
dec_to_hex(number);
/* Defines where checking should start. It depends on the length: if it's an even or an odd number */
length=strlen(hex_number);
j=length/2;
i=length/2;
if((length-1)%2) i--;
while(hex_number[j]!='\0')
{
if(hex_number[i]!=hex_number[j]) return 0;
else
{
i--;
j++;
}
}
return 1;
}
