A lot of battleships of evil are arranged in a line before the battle. Our commander decides to use our secret weapon to eliminate the battleships. Each of the battleships can be marked a value of endurance. For every attack of our secret weapon, it could decrease the endurance of a consecutive part of battleships by make their endurance to the square root of it original value of endurance. During the series of attack of our secret weapon, the commander wants to evaluate the effect of the weapon, so he asks you for help.
You are asked to answer the queries that the sum of the endurance of a consecutive part of the battleship line.

Notice that the square root operation should be rounded down to integer.

10

1 2 3 4 5 6 7 8 9 10

5

0 1 10

1 1 10

1 1 5

0 5 8

1 4 8

Case #1:

19

7

6

这道题目测区间修改，但是不像加或减，开方不好处理，但是发现一个数开7 8次就变为1了，所以可以修改叶节点，然后求和就可以了。如果区间全是1，就不需要往下更新了

 #include <iostream>

 #include <stdio.h>

 #include <math.h>

 #include <string.h>

 #include <stdlib.h>

 #include <string>

 #include <vector>

 #include <set>

 #include <map>

 #include <queue>

 #include <algorithm>

 #include <sstream>

 #include <stack>

 using namespace std;

 #define FO freopen("in.txt","r",stdin);

 #define rep(i,a,n) for (int i=a;i<n;i++)

 #define per(i,a,n) for (int i=n-1;i>=a;i--)

 #define pb push_back

 #define mp make_pair

 #define all(x) (x).begin(),(x).end()

 #define fi first

 #define se second

 #define SZ(x) ((int)(x).size())

 #define debug(x) cout << "&&" << x << "&&" << endl;

 #define lowbit(x) (x&-x)

 #define mem(a,b) memset(a, b, sizeof(a));

 typedef vector<int> VI;

 typedef long long ll;

 typedef pair<int,int> PII;

 const ll mod=;

 const int inf = 0x3f3f3f3f;

 ll powmod(ll a,ll b) {ll res=;a%=mod;for(;b;b>>=){if(b&)res=res*a%mod;a=a*a%mod;}return res;}

 ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}

 //head

 const int maxn=;

 ll sum[maxn<<];

 int n,q;

 void pushup(int rt) {

     sum[rt]=sum[rt<<]+sum[rt<<|];

 }

 void build(int rt,int L,int R) {

     if(L==R) {

         scanf("%lld",&sum[rt]);

         return;

     }

     int mid=(L+R)>>;

     build(rt<<,L,mid);

     build(rt<<|,mid+,R);

     pushup(rt);

 }

 void updata(int rt,int L,int R,int l,int r) {

     if(L==R) {

         sum[rt]=sqrt(sum[rt]);

         return;

     }

     if(L>=l&&R<=r&&sum[rt]==(R-L+)) return;

     int mid=(L+R)>>;

     if(l<=mid) updata(rt<<,L,mid,l,r);

     if(r>mid) updata(rt<<|,mid+,R,l,r);

     pushup(rt);

 }

 ll query(int rt,int L,int R,int l,int r) {

     if(L>=l&&R<=r) return sum[rt];

     ll ans=;

     int mid=(L+R)>>;

     if(l<=mid) ans+=query(rt<<,L,mid,l,r);

     if(r>mid) ans+=query(rt<<|,mid+,R,l,r);

     pushup(rt);

     return ans;

 }

 int main() {

     int cur=;

     while(~scanf("%d",&n)) {

         build(,,n);

         scanf("%d",&q);

         int op,ll,rr;

         printf("Case #%d:\n",cur++);

         while(q--) {

             scanf("%d%d%d",&op,&ll,&rr);

             int l=min(ll,rr),r=max(ll,rr);

             if(op) printf("%lld\n",query(,,n,l,r));

             else updata(,,n,l,r);

         }

         printf("\n");

     }

 }