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
Gary Ye:
20130210 20:33:08
The time limit is indeed really strict.


gourav:
20121219 07:22:46
piece of cake if you have done atleast one question on segment tree ;) 

npsabari:
20121211 17:46:55
<No spoilers in comments> Last edit: 20121212 07:45:33 

stranger:
20121029 13:28:14
TLE. i am just tired of problems where io is almost always the only thing that you should care about 

Ashok:
20120831 10:38:28
used getchar_unlocked instead of scanf, still getting tle. 

gourav:
20120826 17:54:14
do we need to use segment tree or something like that 

Amit:
20120822 09:24:40
@Bruno : Thanks ( scanf > getchar_unlocked() ) 

Rohit:
20120710 11:31:34
gettinngg tle help!! 

Rishi Mukherje:
20120509 18:35:12
Why not increase time limit for languages like python? 

Bruno Adami:
20111013 20:23:14
The time limit is 1 second? o.O, the best solutions are greater than that!

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 