/*---------------------------- ×××求2的n次方的程序××× ----------------------------*/ #include #include #include using namespace std; void f(int n) { if(n) { const int number = 2; vector vec(1,number); int i = 1; while(i != n) { vector ::iterator iter = vec.begin(); vector ::iterator itd = vec.begin(); for(;itd != vec.end(); ++ itd) (*itd) *= 2; for(;iter != vec.end(); ++ iter) { vector ::iterator iter_ = iter + 1; if((iter_) != vec.end()) { if((*iter) > 10) { (*iter) = (*iter) % 10; (*(iter + 1)) ++; } } else if((*iter) >= 10) { (*iter) %= 10; vec.push_back(1); break; } } ++i; } vector ::iterator j = vec.end() - 1; while(j != vec.begin()) { cout << (*j)
一个关于2的n次方的代码(C++)
最新推荐文章于 2023-11-22 16:34:05 发布