Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
co_1
#include<stdio.h> void integer(int n) { if(n>0) printf("0"); else printf("1"); unsigned i; for (i = 1 << 30; i > 0; i = i / 2) { (n & i)? printf("1"): printf("0"); } } int binary(int n, int j) { /* int k; for (i--; i >= 0; i--) { k = n >> i; if (k & 1) printf("1"); else printf("0"); }*/ unsigned i; for (i = 1 << j-1; i > 0; i = i / 2) { (n & i)? printf("1"): printf("0"); } } typedef union { float f; struct { unsigned int mantissa : 23; unsigned int exponent : 8; unsigned int sign : 1; } field; } myfloat; int flo() { myfloat var; printf("\nEnter any float number: "); scanf("%f",&var.f); printf("%d ",var.field.sign); binary(var.field.exponent, 8); printf(" "); binary(var.field.mantissa, 23); printf("\n"); return 0; } typedef union { double d; struct { unsigned long long mantissa : 53; unsigned int exponent : 11; unsigned int sign : 1; } field; }Double; int doub() { Double dou; printf("Enter a double : "); scanf("%lf",&dou.d); printf("%d ",dou.field.sign); binary(dou.field.exponent, 11); printf(" "); binary(dou.field.mantissa, 53); return 0; } int main() { int a,b; char c; printf("Enter any integer: "); scanf("%d",&a); integer(a); flo(); doub(); printf("\nEnter any char : "); scanf("%c",&c); b=c; integer(b); return 0; }
run
|
edit
|
history
|
help
0
c program for hollow rhombus
conditional expression
swap_bitwise.c
intro coding hello world
open(): No such file or directory
Factorial Descompuesto en Potencias de Numeros Primos
CS HW2
PRÁCTICA DE QUICKSORT
2-dimension array got area by malloc()
InterviewDesk_Embedded