题目大意:
求a^b-b^a的值(a,b<=100)
裸高精度
//Lib
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<ctime>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<queue>
using namespace std;
//Macro
#define rep(i,a,b) for(int i=a,tt=b;i<=tt;++i)
#define rrep(i,a,b) for(int i=a,tt=b;i>=tt;--i)
#define erep(i,e,x) for(int i=x;i;i=e[i].next)
#define irep(i,x) for(__typedef(x.begin()) i=x.begin();i!=x.end();i++)
#define read() (strtol(ipos,&ipos,10))
#define sqr(x) ((x)*(x))
#define pb push_back
#define PS system("pause");
typedef long long ll;
typedef pair<int,int> pii;
const int oo=~0U>>1;
const double inf=1e20;
const double eps=1e-6;
string name="",in=".in",out=".out";
//Var
struct Bnum
{
static const int limit=10000;
int num[2008],len;bool flag;
int& operator[](int i){return num[i];}
Bnum(){memset(num,0,sizeof num);len=0;flag=false;}
Bnum(int x){memset(num,0,sizeof num);len=1;num[len]=x;flag=false;}
friend bool operator <(Bnum &a,Bnum &b)
{
if(a.len!=b.len)return a.len<b.len;
rrep(i,a.len,1)
if(a[i]!=b[i])return a[i]<b[i];
return false;
}
friend Bnum operator -(Bnum &x,Bnum &y)
{
Bnum *a=&x,*b=&y;
int len=max(a->len,b->len);Bnum c;
if(x<y)swap(a,b),c.flag=true;
rep(i,1,len)
{
c[i]+=(*a)[i]-(*b)[i];
if(c[i]<0){c[i+1]--;c[i]+=limit;}
}
while(!c[len])len--;
c.len=len;
return c;
}
friend Bnum operator *(Bnum &a,Bnum &b)
{
int len=a.len+b.len-1;Bnum c;
rep(i,1,a.len)rep(j,1,b.len)
{
c[i+j-1]+=a[i]*b[j];
c[i+j]+=c[i+j-1]/limit;
c[i+j-1]%=limit;
}
while(c[len+1])len++;
c.len=len;
return c;
}
void Print()
{
if(flag)printf("-");
printf("%d",num[len]);
rrep(i,len-1,1)printf("%04d",num[i]);
puts("");
}
}x,y,t;
int a,b;
Bnum power(Bnum &a,int b)
{
if(b==0)return 1;
Bnum ret=power(a,b>>1);ret=ret*ret;
if(b&1)ret=ret*a;
return ret;
}
void Work()
{
scanf("%d%d",&a,&b);
t=a;x=power(t,b);
t=b;y=power(t,a);
x=x-y;
x.Print();
}
int main()
{
// freopen((name+in).c_str(),"r",stdin);
// freopen((name+out).c_str(),"w",stdout);
// Init();
Work();
return 0;
}