-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsumPower.cc
133 lines (117 loc) · 2.16 KB
/
sumPower.cc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
#include <iostream>
#include <string>
#include <math.h>
#include <sstream>
using namespace std;
int main(){
int max,base;
cout<<"enter what base: ";
cin>>base;
cout<<"enter "<<base<<" to what power: ";
cin>>max;
int sum[max*base+4];
//int prod[200];//maybe use array of longs
long size=0;//applies to sum
int* num1 = new int[max*base+4];
int* num2 = new int[max*base+4];
num1[0]=1;//accumulator
long size1=1;
long size2 = 0;
int temp = base;
while(temp > 0){
num2[size2] = temp%10;
temp = temp/10;
size2++;
}
for(int i=0;i<max*base+4;i++){
sum[i]=0;
}
if(max == 0){
goto sum;
}
else{
if(max % 2 == 0) {
max /= 2;
goto square;
}
else {
max -= 1;
goto mult;
}
}
square://squares num2
for(int i=0;i<size2;i++){
for(int j=0;j<size2;j++){
sum[i+j]+=num2[j]*num2[i];//ones digits are in column 0
}
}
//cout<<sum[0]<<endl;
size=size2+size2-1;
for(int i=0;i<size;i++){
sum[i+1]+=sum[i]/10;
num2[i]=sum[i]%10;
sum[i]=0;
}
if(sum[size]!=0){
num2[size]=sum[size];
sum[size]=0;
size2=size+1;
}else{
size2=size;
}
if(max == 0){
goto sum;
}
else{
if(max % 2 == 0) {
max /= 2;
goto square;
}
else {
max -= 1;
goto mult;
}
}
mult://if a=base and b=exp then multiplies accumulater so that it ends up
//equal to (a^b)/(a^2^c) such that 2^c < b for some integer c
for(int i=0;i<size2;i++){
for(int j=0;j<size1;j++){
sum[i+j]+=num1[j]*num2[i];//ones digits are in column 0
}
}
size=size1+size2-1;
for(int i=0;i<size;i++){
sum[i+1]+=sum[i]/10;
num1[i]=sum[i]%10;
sum[i]=0;
}
if(sum[size]!=0){
num1[size]=sum[size];
sum[size]=0;
size1=size+1;
}else{
size1=size;
}
if(max == 0){
goto sum;
}
else{
if(max % 2 == 0) {
max /= 2;
goto square;
}
else {
max -= 1;
goto mult;
}
}
sum:
long tsum=0;
for(int i=size1-1;i>=0;i--)
tsum+=num1[i];
cout<<tsum<<endl;
cout<<"elapsed time: "<<(double)clock()/CLOCKS_PER_SEC<<endl;
delete [] num1;
delete [] num2;
return 0;
}