//============================================================================
// Name : an_square.cpp a的n次方
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
using namespace std;
int multiply_recursive(int a,int n) {
if(n==1) {
return a;
}
if(n%2) {
int tmp = multiply_recursive(a,n/2);
return a*tmp*tmp;
}else {
int tmp = multiply_recursive(a,n/2);
return tmp*tmp;
}
}
void output(int *p,int n) {
for(int i=0;i<n;i++) {
cout<<p[i];
}
cout<<endl;
}
void multiply_non_recursive(int a,int n) {
int *b = new int[1024];
memset(b,0,sizeof(b));
b[1]=1;
int index=1;
for(int i=1;i<=n;i++) {
for(int j=1;j<=index;j++) {
b[j] *= a;
}
for(int j=1;j<=index;j++) {
int tmp = b[j]/10;
b[j] = b[j]%10;
if(tmp) {
//add to next index
b[j+1] += tmp;
// reach the end
if(j==index) {
index++;
break;
}
}
}
output(b,index+1);
}
for(int i=index;i>=1;i--) {
printf("%d",b[i]);
}
delete []b;
}
int main() {
int a=2,n=10;
cout<<multiply_recursive(a,n)<<endl;
multiply_non_recursive(a,n);
return 0;
// Name : an_square.cpp a的n次方
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
using namespace std;
int multiply_recursive(int a,int n) {
if(n==1) {
return a;
}
if(n%2) {
int tmp = multiply_recursive(a,n/2);
return a*tmp*tmp;
}else {
int tmp = multiply_recursive(a,n/2);
return tmp*tmp;
}
}
void output(int *p,int n) {
for(int i=0;i<n;i++) {
cout<<p[i];
}
cout<<endl;
}
void multiply_non_recursive(int a,int n) {
int *b = new int[1024];
memset(b,0,sizeof(b));
b[1]=1;
int index=1;
for(int i=1;i<=n;i++) {
for(int j=1;j<=index;j++) {
b[j] *= a;
}
for(int j=1;j<=index;j++) {
int tmp = b[j]/10;
b[j] = b[j]%10;
if(tmp) {
//add to next index
b[j+1] += tmp;
// reach the end
if(j==index) {
index++;
break;
}
}
}
output(b,index+1);
}
for(int i=index;i>=1;i--) {
printf("%d",b[i]);
}
delete []b;
}
int main() {
int a=2,n=10;
cout<<multiply_recursive(a,n)<<endl;
multiply_non_recursive(a,n);
return 0;
}
第一种用分治T(n)=O(logn),会溢出
第二种模拟,可以用来防止溢出:T(n)介于n与n^2之间