两种将十进制转换成二进制的算法

1.非递归算法

long long cnt = an;for (int j = 1; j <= 22; j++){vis[i][j] = (cnt & 1);cout << vis[i][j];cnt >>= 1;}puts("");

2.递归算法

void tentwo(long long x, int &i,int j){if (!x){i = 1;return;}tentwo(x / 2, i,j);cout << x%2 << " ";vis[j][i] = x % 2;i++;}