//递归实现将十进制转化为二进制.cpp #include <iostream> using namespace std; long transform(int n) { int result; if(n==0) result=0; else if(n/2==0) result=1; else result=n%2+transform(n/2)*10; return result; } void main() { int n,m; cout<<"Please enter an integer:"; cin >>n; m=transform(n); cout<<n<<" into binary is "<<m<<endl; }