64,282
社区成员
发帖
与我相关
我的任务
分享
int format_num(const char* str_)
{
int len = strlen(str_);
int sum = 0;
for(int j = 0; j != len; ++j)
{
int num = str_[len - j - 1] - 'A' + 1;
for(int k = 0; k != j; ++k)
{
num = 26 * num;
}
sum += num;
}
std::cout <<"十进制:"<< sum << std::endl;
//十进制转八进制自己算吧。。
return sum;
}
int main(int argc, char* argv[])
{
int temp = 712;
for(int i = 0; i != 728; ++i)
{
temp = (temp * 712) % 10000;
}
printf("%04d",temp);
return 0;
}
int main(int argc, char* argv[])
{
int temp = 712;
for(int i = 0; i != 728; ++i)
{
temp = (temp * 712) % 10000;
}
printf("%04d",temp);
return 0;
}
#include <iostream>
using namespace std;
int* big_num_power(int* a, int len_a, int n, int len_r)//计算数组a的n次幂,要求n>=0,保证len_r的长度足够保存结果
{
int *r = new int[len_r];
int *b = new int[len_r];
int i;
for(i=0; i<len_r-1; ++i)
{
r[i] = 0;
b[i] = 0;
}
r[len_r-1] = 1;
b[len_r-1] = 0;
int len_b = 1;
int *temp;
while(n--!=0)
{
for(i=len_a-1; i>=0; --i)
{
int j;
for(j=len_r-1; j>=len_r-len_b; --j)
{
b[i+j-(len_a-1)] += a[i]*r[j];
}
}
for(i=len_r-1; i>0; --i)
{
if(b[i]>=10)
{
b[i-1] += b[i]/10;
b[i] %= 10;
}
}
for(i=0; b[i]==0; ++i);
len_b = len_r-i;
temp = r;
r = b;
b = temp;
for(i=0; i<len_r; ++i)
{
b[i] = 0;
}
}
delete[] b;
return r;
}
int main()
{
int a[] = {7,1,2};
int len_a = sizeof(a)/sizeof(int);
int len_r = 2500;
int *r = big_num_power(a, len_a, 729, len_r);
for(int i=0; i<len_r; ++i)
{
cout<<r[i];
}
cout<<endl;
return 0;
}
#include <iostream>
#include <iostream.h>
void main()
{
int result=1;
for(int i=0;i<729;i++)
{
result=result*712;
if(result>=10000)
result=result%10000;
}
cout<<result<<endl;
}