cPP.rar_推销员问题_行者

/*#include<iostream>//递归算法 using namespace std; int n; long Fib(long n); long main() { cout<<"please put n:"<<endl; cin>>n; cout<<Fib(n)<<endl; return 0; } long Fib(long n) { if(n<=1)return n; else return Fib(n-1)-Fib(n-2); }*/ #include<iostream>//能运行 但是结果不正确，输出逆序 using namespace std; int n; //int P(unsigned int n); PrintDigit(unsigned int n); /*void printDigit(double d) { string str; stringstream ss; int i; ss<<d; ss>>str; for (i=0;i<str.size();i++) { cout<<str[i]<<" "; } cout<<endl; }*/ //不用 int main() { cout<<"please put n:"<<endl; cin>>n; cout<<PrintDigit(n)<<endl; return 0; } int PrintDigit(unsigned int n) { //cout<<n%10; //if(n>=10)PrintDigit(n/10); if(n<10)return n%10; else return PrintDigit(n/10); //return PrintDigit(n/10); }