100daysofcode/concate_bits.c at master · Davidportlouis/100daysofcode · GitHub

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
#include <stdio.h>
#include <math.h>
#define MAX 1000000

int int2bits(int *bits, int x)
{
    int k = 0;
    while (x != 0)
    {
        bits[k] = x % 2;
        x /= 2;
        k++;
    }
    return k;
}

long int bits2int(int *bits, int n)
{
    long int num = 0;
    int j = n;
    for (int i = 0; i < n; i++)
    {
        num += bits[j] * pow(2.0, (double)i);
        j--;
    }
    return num;
}

void merge(int *merged, int *bits_1, int *bits_2, int n_1, int n_2)
{
    int j = 0, k = 0, n = n_1 + n_2;
    for (int i = 1; i <= n; i++)
    {
        if (i % 2 != 0)
        {
            if (j < n_1)
            {
                merged[i] = bits_1[j];
                j++;
            }
            else
            {
                merged[i] = bits_2[k];
                k++;
            }
        }
        else if (i % 2 == 0)
        {
            if (k < n_2)
            {
                merged[i] = bits_2[k];
                k++;
            }
            else
            {
                merged[i] = bits_1[j];
                j++;
            }
        }
    }
}

int main(void)
{
    int x,y,bits_1[MAX], bits_2[MAX], n_1, n_2;
    scanf("%d %d",&x,&y);
    n_1 = int2bits(bits_1, x);
    n_2 = int2bits(bits_2, y);
    int merged_bits[n_1 + n_2];
    merge(merged_bits, bits_1, bits_2, n_1, n_2);
    printf("%ld", bits2int(merged_bits, n_1 + n_2));
    return 0;
}