进制位数

HDU2097 - Sky数

---

http://acm.hdu.edu.cn/showproblem.php?pid=2097

---

#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <string>#include <algorithm>#include <cmath>#include <queue>#include <stack>#include <vector>#include <set>using namespace std;const int inf=0x3f3f3f3f;int a;vector <int>point;int sky(int x,int y){    int sum = 0;    point.clear();    while (x)    {        point.push_back(x % y);        x /= y;    }    int len = point.size();    for (int i = 0;i < len;i ++)        sum += point[i];    return sum;}int main(){    while (cin >> a && a)    {        if (sky(a,10) == sky(a,12) && sky(a,10) == sky(a,16))            printf("%d is a Sky Number.\n",a);        else            printf("%d is not a Sky Number.\n",a);    }    return 0;}