1、自从写了这个模板后,高精度变成了我最喜欢的题型之一哈哈~本题是求阶乘,以后千万要注意求阶乘的题目一定要事先保存然后递推,不然会TLE疯了的~
#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
using namespace std;
const int maxn=5000;
struct bign{
int len,s[maxn];
bign(){memset(s,0,sizeof(s));len=1;}
bign(int num){*this=num;}
bign(const char*num){*this=num;}
bign operator = (int num){
char s[maxn];
sprintf(s,"%d",num);
*this=s;
return *this;
}
bign operator = (const char*num){
len=strlen(num);
for(int i=0;i<len;i++) s[i]=num[len-i-1]-'0';
return *this;
}
string str()const{
string res="";
for(int i=0;i<len;i++) res=(char)(s[i]+'0')+res;
if(res=="") res="0";
return res;
}
bign operator +(const bign& b) const{
bign c;
c.len=0;
for(int i=0,g=0;g||i<max(len,b.len);i++){
int x=g;
if(i<len) x+=s[i];
if(i<b.len)x+=b.s[i];
c.s[c.len++]=x%10;
g=x/10;
}
return c;
}
void clean() {
while(len > 1 && !s[len-1]) len--;
}
bign operator * (const bign& b) {
bign c; c.len = len + b.len;
for(int i = 0; i < len; i++)
for(int j = 0; j < b.len; j++)
c.s[i+j] += s[i] * b.s[j];
for(int i = 0; i < c.len-1; i++){
c.s[i+1] += c.s[i] / 10;
c.s[i] %= 10;
}
c.clean();
return c;
}
bign operator - (const bign& b) {
bign c; c.len = 0;
for(int i = 0, g = 0; i < len; i++) {
int x = s[i] - g;
if(i < b.len) x -= b.s[i];
if(x >= 0) g = 0;
else {
g = 1;
x += 10;
}
c.s[c.len++] = x;
}
c.clean();
return c;
}
bool operator < (const bign& b) const{
if(len != b.len) return len < b.len;
for(int i = len-1; i >= 0; i--)
if(s[i] != b.s[i]) return s[i] < b.s[i];
return false;
}
bool operator > (const bign& b) const{
return b < *this;
}
bool operator <=(const bign& b) const{
return !(*this>b);
}
bool operator >=(const bign& b) const{
return !(*this<b);
}
bool operator !=(const bign& b) const{
return b<*this||*this<b;
}
bool operator ==(const bign& b) const{
return !(b<*this)&&!(*this<b);
}
};
istream& operator>>(istream &in,bign&x){
string s;
in>>s;
x=s.c_str();
return in;
}
ostream& operator<<(ostream &out,const bign&x){
out<<x.str();
return out;
}
bign f[1010];
int main(){
int n;
f[0]=1;
for(int i=1;i<=1000;i++)
f[i]=f[i-1]*i;
while(scanf("%d",&n)==1){
printf("%d!\n%s\n",n,f[n].str().c_str());
}
return 0;
}