|
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
|
#include <stdio.h>
#include <string.h>
#include "auxiliar.h"
#include <math.h>
int bin2dec(char *bin)
{
int i;
int num = 0;
int length = strlen(bin);
int pos = length - 1;
char *aux = (char*) malloc(sizeof(char) * length);
strcpy(aux,bin);
normalize(&aux,1);
for(i = 0; i < length; i++)
{
if(aux[pos--])
{
num += pow(2,i);
}
}
free(aux);
return num;
}
int check_length(char **inputs, uint8_t num_inputs)
{
int i;
int length = strlen(inputs[0]);
for(i = 1; i < num_inputs-1; i++)
{
if(strlen(inputs[i]) != length)
{
return -1;
}
}
int sel_length = strlen(inputs[num_inputs-1]);
if(pow(2,sel_length) < (num_inputs-1))
{
return -1;
}
return length;
}
int main(int argc, char **argv)
{
int i;
if(argc != 2)
{
error();
}
char *input = argv[1];
if(!strcmp(input,"error"))
{
error();
}
char **inputs = comma_separate(input);
if(inputs == NULL)
{
error();
}
int num_inputs = num_occurrences(input,',');
int input_length = check_length(inputs,num_inputs);
if(input_length == -1)
{
error();
}
int selected = bin2dec(inputs[num_inputs-1]);
if(selected >= (num_inputs-1))
{
for(i = 0; i < input_length; i++)
{
printf("0");
}
}
else
{
char *result = inputs[selected];
printf("%s",result);
}
free_mem(inputs,num_inputs);
return 0;
}
|
