bzoj 3211

线段树区间开方。。重写一遍就AC了，神马情况。。。。

#include<bits/stdc++.h>
#define inc(i,l,r) for(i=l;i<=r;i++)
#define dec(i,l,r) for(i=l;i>=r;i--)
#define inf 1e9
#define ll long long 
#define NM 100000+5
#define mem(a) memset(a,0,sizeof(a))
using namespace std;
int read(){
    int x=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
    return x*f;
}
struct info{
    ll s;
    int z;
    info(int x=0):s((ll)x),z(x<=1){}
}T[3*NM];
info operator+(const info&x,const info&y){
    info f;
    f.s=x.s+y.s;
    f.z=x.z&&y.z;
    return f;
}
int n,m,i,x,t,y;
void build(int i,int x,int y){
    int t=x+y>>1;
    if(x==y){
        T[i]=info(read());
        return;
    }
    build(i<<1,x,t);build(i<<1|1,t+1,y);
    T[i]=T[i<<1]+T[i<<1|1];
}
void cut(int i,int x,int y,int a,int b){
    int t=x+y>>1;
    if(b<x||y<a||T[i].z)return;
    if(x==y){
        T[i].s=(ll)sqrt(T[i].s);
        T[i].z=T[i].s<=1;
        return;
    }
    cut(i<<1,x,t,a,b);cut(i<<1|1,t+1,y,a,b);
    T[i]=T[i<<1]+T[i<<1|1];
}
ll sum(int i,int x,int y,int a,int b){
    int t=x+y>>1;
    if(b<x||y<a)return 0;
    if(a<=x&&y<=b)return T[i].s;
    return sum(i<<1,x,t,a,b)+sum(i<<1|1,t+1,y,a,b);
}
int main(){
    n=read();
    build(1,1,n);
    m=read();
    inc(i,1,m){
        t=read();x=read();y=read();
        if(t==1)printf("%lld
",sum(1,1,n,x,y));
        else cut(1,1,n,x,y);
    }
}