2分法求 2^n 和 矩阵的n次方 转:http://blog.csdn.net/maiyuetong/article/details/6762206
[cpp] view
plaincopy
#include "stdafx.h"
#include
using namespace std;
//a^n
int f(int a, int n)
{
if(n == 0) return 1;
if(n == 1) return a;
i
转载
2015-06-15 16:33:08 ·
727 阅读 ·
0 评论