MULTQ3  Multiples of 3
There are N numbers a[0],a[1]..a[N  1].
Initally all are 0. You have to perform two types of operations :
1) Increase the numbers between indices A and B (inclusive) by 1.
This is represented by the command "0 A B"
2) Answer how many numbers between indices A and B (inclusive) are divisible by 3.
This is represented by the command "1 A B".
Input
The first line contains two integers, N and Q. Each of the next Q lines are either of the form "0 A B" or "1 A B" as mentioned above.
Output
Output 1 line for each of the queries of the form "1 A B" containing the required answer for the corresponding query.
Sample
Sample Input : 4 7 1 0 3 0 1 2 0 1 3 1 0 0 0 0 3 1 3 3 1 0 3 Sample Output : 4 1 0 2
Constraints
1 <= N <= 100000
1 <= Q <= 100000
0 <= A <= B <= N  1
hide comments
ab_biswas09:
20190301 21:59:07
AC IN ONE GO !! But nothing really to brag about 

kshubham02:
20190210 00:25:35
Why do setters keep such time limits which give AC or TLE on the basis of fast IO? If NlogN is expected complexity, then poorer algos (N^2 etc) will timeout even if they make the limit a little less stringent. 

ada107:
20190207 08:47:47
Tle in java, used fast i/o, any other way to resolve it? 

tien0903:
20181103 14:37:39
no need prinf and I make three mod =)) 

abhimanyu_1998:
20181016 17:50:33
time limit exceeded for java submissions


karan_yadav:
20180724 07:18:11
2D array does the trick :) 

manjeet_:
20180722 19:04:09
use Scanf Printf :( 

aman_sachin200:
20180604 15:42:19
Good one....segment trees+lazy propagation!!:) 

sajid006:
20180505 06:19:25
Can it be solved without using lazy propagation? 

dipankar12:
20180319 12:18:17
Time limit of JAVA is not correct. Same code running in cpp with scanf and printf 
Added by:  Varun Jalan 
Date:  20100912 
Time limit:  0.169s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS OBJC VB.NET 
Resource:  own problem 