UVa/10019 - Funny Encryption Method.cpp at master · rmzn17/UVa · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
#include <iostream>
#include<stdlib.h>
#include <cstdio>
#include<sstream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define vc vector<int>
#define pb push_back
#define pf printf
#define mxpq priority_queue<int>
#define mnpq priority_queue<int,vector<int>,compare>
#define ms(a) memset(a,0,sizeof(a));
#define input(s) getline(cin,s);
#define mpii map<int,int>
#define mpsi map<string,int>
#define str string s;
#define sz size();
#define ln strlen(s);
#define gcd(x,y)  __gcd(x,y)
#define lcm(a,b) (a*(b/gcd(a,b)))
#define mn2(a, b) (a<b?a:b)
#define mn3(a, b, c) mn2(a, mn2(b, c))
#define mn4(a, b, c, d) mn2(a, mn2(b, mn2(c, d)))
#define mx2(a, b) (a>b?a:b)
#define mx3(a, b, c) mx2(a, mx2(b, c))
#define mx4(a, b, c, d) mx2(a, mx2(b, mx2(c, d)))
#define max 1000001
#define Pinf 99999999999
#define Ninf -99999999999
#define PI acos(-1)
#define MOD 1000000007

using namespace std;

int one[1000];

int decimal_binary(int n)
{
    int ones=0,i=0;
    while(n>0)
    {
        one[i]=n%2;
        i++;
        n=n/2;
    }
    for(int j=i-1; j>=0; j--)
    {
        if(one[j]==1)
            ones++;
    }
    return ones;
}

int Hexa_binary(int n )
{
    int one=0;
    while(n!=0)
    {
        int mod=n%10;
        if(mod==1)
            one++;

        if(mod==2)
            one++;
        if(mod==3)
            one+=2;

        if(mod==4)
            one++;

        if(mod==5)
            one+=2;
        if(mod==6)
            one+=2;
        if(mod==7)
            one+=3;
        if(mod==8)
            one+=1;
        if(mod==9)
            one+=2;
        n=n/10;
    }
    return one;
}


int main()
{
    int tc,i,number;
    scanf("%d",&tc);
    while(tc--)
    {
        scanf("%d",&number);
        int a=decimal_binary(number);
        int b=Hexa_binary(number);
        printf("%d %d\n",a,b);
    }
    return 0;
}