Let D(x) be the number of positive divisors of a positive integer x. For example, D(2) = 2 (2 is divisible by 1 and 2), D(6) = 4 (6 is divisible by 1, 2, 3 and 6).
You are given an array a of n integers. You have to process two types of queries:
- REPLACE l r — for every
replace ai with D(ai);
- SUM l r — calculate
.
Print the answer for each SUM query.
The first line contains two integers n and m (1 ≤ n, m ≤ 3·105) — the number of elements in the array and the number of queries to process, respectively.
The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 106) — the elements of the array.
Then m lines follow, each containing 3 integers ti, li, ri denoting i-th query. If ti = 1, then i-th query is REPLACE li ri, otherwise it's SUM liri (1 ≤ ti ≤ 2, 1 ≤ li ≤ ri ≤ n).
There is at least one SUM query.
For each SUM query print the answer to it.
7 6
6 4 1 10 3 2 4
2 1 7
2 4 5
1 3 5
2 4 4
1 5 7
2 1 7
output
30
13
4
22
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 7;
int a[maxn];
int cnt[maxn];
struct node
{
int l,r;
long long sum,mx;
}tree[maxn<<2];
void init()
{
for(int i=1;i<maxn;i++)
for(int j=i;j<maxn;j+=i) cnt[j]++;
}
void push_up(int pos)
{
tree[pos].sum=tree[pos<<1].sum+tree[pos<<1|1].sum;
tree[pos].mx=max(tree[pos<<1].mx,tree[pos<<1|1].mx);
}
void build(int pos,int l,int r)
{
tree[pos].l=l; tree[pos].r=r;
tree[pos].sum=tree[pos].mx=0;
if(l==r)
{
tree[pos].sum=a[l];
tree[pos].mx=a[l];
}
else
{
int mid=(l+r)>>1;
build(pos<<1,l,mid);
build(pos<<1|1,mid+1,r);
push_up(pos);
}
}
void update(int pos,int l,int r)
{
if(tree[pos].mx<=2) return;
int L=tree[pos].l,R=tree[pos].r;
if(L==R)
{
tree[pos].sum=tree[pos].mx=cnt[tree[pos].mx];
return;
}
int mid=(L+R)>>1;
if(mid>=l) update(pos<<1,l,r);
if(mid<r) update(pos<<1|1,l,r);
push_up(pos);
}
long long query(int pos,int l,int r)
{
int L=tree[pos].l,R=tree[pos].r;
if(l<=L&&R<=r)
return tree[pos].sum;
if(L==R)
return tree[pos].sum;
int mid=(L+R)>>1;
long long ans=0;
if(mid>=l) ans+=query(pos<<1,l,r);
if(mid<r) ans+=query(pos<<1|1,l,r);
return ans;
}
int main()
{
init();
int n,q;
scanf("%d%d",&n,&q);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
build(1,1,n);
while(q--)
{
int op,l,r;
scanf("%d%d%d",&op,&l,&r);
if(op==1)
update(1,l,r);
else
{
long long ans=query(1,l,r);
printf("%I64d\n",ans);
}
}
return 0;
}