CF920F SUM and REPLACE

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: 1. REPLACE $ l $ $ r $ — for every  replace $ a_{i} $ with $ D(a_{i}) $ ; 2. SUM $ l $ $ r $ — calculate . Print the answer for each SUM query.

N/A

N/A