problem statement: https://codeforces.me/problemset/problem/1977/B language of my code: C my submission: https://codeforces.me/contest/1977/submission/315178770

my code:

include <stdio.h>

include <stdlib.h>

int bin(int arr[], int x) { int i; for (i = 0; x != 0; i++) { arr[i] = x % 2; x = x / 2; } return i; } int main() { int t; long long int x;

scanf("%d", &t);
for (int j = 0; j < t; j++)
{
    int arr[35];
    scanf("%lld", &x);
    int n;
    int flag = 0;
    n = bin(arr, x);
    for (int i = 1; i < n; i++)
    {

        if (arr[i] * arr[i - 1] != 0 && flag == 0)
        {
            flag++;
            arr[i - 1] = -1;
            if (i == n - 1)
            {
                arr[i] = 0;
                arr[i + 1] = 1;
                n++;break;``

            }
        }
        else if (flag != 0 && arr[i] == arr[i - 1])
        {
            arr[i - 1] = 0;
            if (i == n - 1)
            {
                arr[i] = 0;
                arr[i + 1] = 1;
                n++;break;

            }
        }
        else if (arr[i] != arr[i - 1] && flag != 0)
        {
            flag = 0;
            arr[i] = 1;
            arr[i - 1] = 0;
        }
    }

    printf("%d\n", n);
    for (int i = 0; i < n; i++)
    {
        printf("%d ", arr[i]);
    }
    printf("\n");
}

}

there is no nesting in any loop, and any loop runs atmost 32 times, why is my code exceeding time limit of 1 second??