Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //5. Cijeli u binarni
- #include <stdio.h>
- #include<math.h>
- int main()
- {
- int i, p = 0, E, reg[32];
- float a, r;
- printf("\nUpisite neki realni broj: ");
- scanf("%f", &a);
- //Nzb
- if (a < 0)
- {
- reg[0] = 1;
- a = abs(a);
- }
- else reg[0] = 0;
- //Eksponent
- if (a >= 2)
- {
- while (a >= 2)
- {
- p++;
- a /= 2;
- }
- }
- else if (a<1)
- {
- while (a < 1)
- {
- p--;
- a *= 2;
- }
- }
- E = 127 + p;
- for (i = 0; i<8; i++)
- {
- reg[8 - i] = E % 2;
- E /= 2;
- }
- //Mantisa
- if (a >= 1)
- r = a - 1;
- else r = a;
- for (i = 9; i<32; i++)
- {
- r = r * 2;
- if (r<1)
- reg[i] = 0;
- else
- {
- reg[i] = 1;
- r -= 1;
- }
- }
- //Ispis
- printf("\n\n");
- for (i = 0; i<32; i++)
- {
- printf("%d", reg[i]);
- if (i % 4 == 0)
- printf("\t");
- }
- printf("\n\n");
- return 0;
- }
- //4. Dekadski u binarni
- //int main()
- //{
- //
- // long int cijeliBroj, ostatak, rez;
- // int binaryNumber[100], i = 1, j;
- //
- // printf("Enter any decimal number: ");
- // scanf("%ld", &cijeliBroj);
- //
- // rez = cijeliBroj;
- //
- // while (rez != 0)
- // {
- // binaryNumber[i++] = rez % 2;
- // rez = rez / 2;
- // }
- //
- // printf("Equivalent binary value of decimal number %d: ", cijeliBroj);
- // for (j = i - 1; j> 0; j--)
- // printf("%d", binaryNumber[j]);
- //
- // return 0;
- //}
- //3. Binarni u dekadski
- #include<stdio.h>
- #include<math.h>
- int main()
- {
- int binarni[16], i, dekadski = 0, pom = 1;
- for (i = 0; i < 16; i++)
- {
- printf("Unesite %d znamenku binarnog broja: ", i + 1);
- scanf("%d", &binarni[i]);
- }
- if (binarni[0] == 1)
- pom = -1;
- for (i = 0; i < 16; i++)
- {
- if (binarni[i] == 0)
- binarni[i] = 1;
- else binarni[i] = 0;
- }
- do{
- if (binarni[16 - i] == 1)
- binarni[16 - i] = 0;
- else if (binarni[i] == 0)
- binarni[i] = 1;
- i++;
- } while (binarni[i] == 0);
- for (i = 0; i < 16; i++)
- {
- dekadski += binarni[i] * (pow(2, (double)(16 - i - 1)));
- }
- printf("\n %d\n", dekadski*pom);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement