ACM 10019 - Funny Encryption Method

#include <stdio.h>

int hex[10] = {0, 1, 1, 2, 1, 2, 2, 3, 1, 2};

int hexCount(int n)
{
    int i = 0;
    for (; n; n /= 10)
        i += hex[n % 10];
    return i;
}

int decCount(int n)
{
    int i = 0;
    for (; n; n /= 2)
        i += n % 2;
    return i;
}
int main()
{
    int m, n;
    scanf("%d", &m);
    while (m --)
    {
        scanf("%d", &n);
        printf("%d %d\n", decCount(n), hexCount(n));
    }
    return 0;
}

回目錄
回首頁