uva 10019 Funny Encryption Method

进制转换，找1的个数。

#include<iostream>#include<string.h>#include<stdio.h>#include<ctype.h>#include<cmath>using namespace std;int main(){    int n;    cin>>n;    while(n--)    {      int num;      cin>>num;      int b1=0;      for(int i=num;i;i/=2)      b1+=i%2;      cout<<b1<<" ";      int num1=0,b2=0;      for(int i=num,j=0;i;i/=10,j++)      num1+=(i%10)*(int)pow(16,(double)j);      for(int i=num1;i;i/=2)      b2+=i%2;      cout<<b2<<endl;    }    return 0;}