Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <stdio.h>
- #include <string.h>
- using namespace std;
- void PrintBiti(int n) {
- int b = sizeof(n) * 8;
- for(int i = b-1; i >= 0; i--)
- printf("%d", ((n >> i) & 1));
- }
- int main()
- {
- /*
- int n, x;
- printf("n = ");
- scanf("%d", &n);
- printf("%d\n", n << 3);
- printf("%d\n", n >> 2);
- printf("%d\n", (n << 3) + (n << 1));
- */
- /// LAB. 2
- /// 1
- /*
- int b = sizeof(n) * 8;
- for(int i = b-1; i >= 0; i--) {
- if(n & (1 << i)) printf("%d", 1);
- else printf("%d", 0);
- }
- printf("\n");
- for(int i = b-1; i >= 0; i--)
- printf("%d", ((n >> i) & 1));
- */
- /// 2
- /*
- printf("\n\nx = ");
- scanf("%d", &x);
- int aux;
- aux = ((x >> (n - 1)) & 1);
- printf("%d\t", aux);
- PrintBiti(aux);
- printf("\n");
- aux = ((x | (1 << (n - 1))));
- printf("%d\t", aux);
- PrintBiti(aux);
- printf("\n");
- aux = ((x & (255 - (1 << (n - 1)))));
- printf("%d\t", aux);
- PrintBiti(aux);
- printf("\n");
- aux = ((x ^ (1 << (n - 1))));
- printf("%d\t", aux);
- PrintBiti(aux);
- */
- /// 3
- /*
- int x, y, n, p;
- printf("x = "); scanf("%d", &x);
- printf("y = "); scanf("%d", &y);
- printf("n = "); scanf("%d", &n);
- printf("p = "); scanf("%d", &p);
- printf("\ny = \t");
- PrintBiti(y);
- y = (y & ((1 << n) - 1));
- printf("\ny = \t");
- PrintBiti(y);
- y = y << p;
- printf("\ny = \t");
- PrintBiti(y);
- printf("\nx = \t");
- PrintBiti(x);
- int aux = ((1 << n) - 1) << p;
- printf("\naux = \t");
- PrintBiti(aux);
- x = x & ~aux;
- printf("\nx = \t");
- PrintBiti(x);
- x = x | y;
- printf("\nx = \t");
- PrintBiti(x);
- */
- /// 4
- char n[10];
- printf("n = "); scanf("%d", &n);
- char Conv[16][5] = {
- "0000",
- "0001",
- "0010",
- "0011",
- "0100",
- "0101",
- "0110",
- "0111",
- "1000",
- "1001",
- "1010",
- "1011",
- "1100",
- "1101",
- "1110",
- "1111"
- };
- int len = strlen(n);
- for(int i = 0; i < len; i++) {
- if(i >= 0 && i <= 9)
- printf(Conv[i]);
- else
- printf(Conv[i + n[i] - 'A' + 1]);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement