#pragma GCC optimize(3,"Ofast","inline") #pragma GCC optimize(2) #include #include #include #define Re register int #define F(x,a,b) for(Re x=a;x<=b;++x) #define LL long long using std::sort; const int N=5e4+3; int n,q,t,L,R,ip,fu,len,gs[N],pt[N],co[N];LL ans,gcd,fz[N],fm[N]; struct QAQ{int l,r,id;}Q[N]; inline void in(Re &x){ x=fu=0;char c=getchar(); while(c<'0'||c>'9')fu|=c=='-',c=getchar(); while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar(); x=fu?-x:x; } inline void sakura(Re p,Re x){ans-=(LL)gs[fu=co[p]]*gs[fu],gs[fu]+=x,ans+=(LL)gs[fu]*gs[fu];} inline bool cmp(QAQ a,QAQ b){return pt[a.l]==pt[b.l]?a.rQ[i].l)sakura(--L,1); while(RQ[i].r)sakura(R--,-1); ip=Q[i].id; if(Q[i].l==Q[i].r){fz[ip]=0,fm[ip]=1;continue;} fz[ip]=ans-(len=Q[i].r-Q[i].l+1); fm[ip]=(LL)len*(len-1); gcd=gcd_(fz[ip],fm[ip]),fz[ip]/=gcd,fm[ip]/=gcd; } F(i,1,q)printf("%lld/%lld\n",fz[i],fm[i]); }