Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int iftool(char t)
- {
- switch (t) {
- case 0:
- return t = 0;
- break;
- //
- // ...
- //
- case 9:
- return t = 9;
- break;
- case 10:
- return t = 'A';
- break;
- case 11:
- return 'B';
- break;
- case 12:
- return t = ('C');
- break;
- case 13:
- return t = ('D');
- break;
- case 14:
- return t = ('E');
- break;
- case 15:
- return t = ('F');
- break;
- }
- }
- l=0;
- r=1;
- m=1;
- n=0;
- while (l<=k)
- {
- n=(n+(number[l]*r));
- if ( m%4==0 || l==k)
- {
- r=1;
- m=1;
- t=n;
- t=iftool(t);
- mas[x]=t;
- n=0;
- printf ("lol-%d",mas[x]);
- x++;
- }
- else
- {
- m++;
- r=r*2;
- }
- l++;
- }
- #include<iostream>
- #include<string>
- using namespace std;
- int main()
- {
- int a[] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15};
- string b[] = {"0","1","2","3","4","5","6","7","8","9"};
- string str = "";
- int x1,x2;
- cin >> x1;
- int z[8];
- for (int i = 0; i < 8;i++)
- {
- x2 = x1/16;
- z[i] = x1 - (x2*16);
- // cout << "x: " << x2 << "t"<< "z: " << z[i]<
- x1 = x2;
- }
- for (int j = 8, j2 = 0; j > 0; j--,j2++)
- {
- for(int n = 0; n < 16; n++)
- if (z[j] == a[n])
- {
- str = str + b[n];
- }
- }
- cout << str;
- cin.get();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement