Вывод чисел в двоичном виде

#include <stdio.h>
 
 
void bin(long unsigned int k, long unsigned int size)
{
    long unsigned int i;
 
 
    for (i = size * 8; i > 0; --i) {
        printf("%d", (k & (1 << (i-1))) ? 1 : 0);
    }
    printf("\n");
}
 
 
 
 
int
main(void)
{
    long unsigned int lu;
    unsigned int u;
    int i;
    char c;
 
    printf("sizeof(long unsigned int) = %lu\n", sizeof(long unsigned int));
    printf("sizeof(int) = %lu\n", sizeof(int));
    printf("sizeof(char) = %lu\n", sizeof(char));
    printf("sizeof(unsigned int) = %lu\n", sizeof(unsigned int));
    for (i = -5; i < 6; ++i) {
        printf("(int) %i\n", i);
        bin(i, sizeof(i));
    }
    u = 1;
    printf("unsigned int %u\n", u);
    bin(u, sizeof(u));
    c = -2;
    printf("char %d\n", c);
    bin(c, sizeof(c));
    lu = 1;
    printf("long unsigned int %lu\n", lu);
    bin(lu, sizeof(lu));
    return 0;
}

for(i=0; i<8*size; i++) {
 c = (k&1);
 printf("%d", c);
 k = (k>>1);
}

void bin( unsigned long long k )
{
    for ( int i = 0; i < 64; i++ ) {
        printf( "%d", (k & 0x8000000000000000ULL) ? 1 : 0 );
        k <<= 1;
    }
    printf("\n");
}

char c = -1;

#include <stdio.h>
#include <limits.h>
 
#define bindump(ptr, size) ({ \
    unsigned long n = (size) * CHAR_BIT; \
    while ( n ) \
        printf("%d", ( *(ptr) >> --n ) & 1); \
})
 
int main(void) {
    char c1 = 1, c2 = -1;
    int i1 = 1, i2 = -1;
    long l1 = 1L, l2 = -1L;
    unsigned long ul = 1UL;
    long long ll1 = 1LL, ll2 = -1LL;
    unsigned long long ull = 1ULL;
    
    printf("C1: ");
    bindump(&c1, sizeof(char));
    printf("\nC2: ");
    bindump(&c2, sizeof(char));
    printf("\nI1: ");
    bindump(&i1, sizeof(int));
    printf("\nI2: ");
    bindump(&i2, sizeof(int));
    printf("\nL1: ");
    bindump(&l1, sizeof(long));
    printf("\nL2: ");
    bindump(&l2, sizeof(long));
    printf("\nUL: ");
    bindump(&ul, sizeof(long));
    printf("\nLL1: ");
    bindump(&ll1, sizeof(long long));
    printf("\nLL2: ");
    bindump(&ll2, sizeof(long long));
    printf("\nULL: ");
    bindump(&ull, sizeof(long long));
    printf("\n");
    
    return 0;
}

printf("%d", (k & ((long unsigned int)1 << (i-1))) ? 1 : 0);