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
uddhav:
20161102 16:18:05
using long long int gives tle on test 9. Same code with int gives AC !! 

pranavanurag:
20160827 09:37:05
If getting WA, check the way you are propagating laziness. Took me a day to debug.. Last edit: 20160827 10:04:44 

force_sust:
20160815 19:43:08
why its wa in test 9...??


ajay_5097:
20160523 19:38:37
IT felt so good !


epsilon:
20150826 13:48:38
thanks to vimarsh for fast i/o


karthik1997:
20150809 01:01:10
o(n) algo +fast i/o needed


shakaal:
20150112 22:03:25
truly teaches u the concept fastIO,lazy,segment tree and finally AC 

Eddy Cael:
20150107 21:02:11
No necesary fast I/O. I got AC with ordinary Segment Tree + Lazy + cin/cout in 4.60 s.


Deepanker Aggarwal:
20141231 01:40:47
Time Limit for languages like Java should be increased

Added by:  Varun Jalan 
Date:  20100912 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS OBJC VB.NET 
Resource:  own problem 