MULTQ3  Multiples of 3
There are N numbers a[0], a[1] ... a[N  1]. Initially all are 0. You have to perform two types of operations :
 Increase the numbers between indices A and B (inclusive) by 1. This is represented by the command "0 A B"
 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
Input: 4 7 1 0 3 0 1 2 0 1 3 1 0 0 0 0 3 1 3 3 1 0 3 Output: 4 1 0 2
Constraints
1 ≤ N ≤ 100000
1 ≤ Q ≤ 100000
0 ≤ A ≤ B ≤ N  1
hide comments
Abhishek:
20130603 18:45:44
for optimized code use inline functions.. without it i was getting TLE.. 

savage:
20130602 14:40:05
Can't believe this, but this has been the first problem that I have faced where fast I/O and inline functions were the difference between AC and TLE .... guys go for fast I/O ... 

mpvd:
20130519 00:48:42
anything special about 9th test case .getting wrong answer at 9th test case??


:):
20130417 16:52:58
stupid lime limit 

ALI HASAN:
20130322 21:58:45
only one test case ? 

Ze0nC:
20130218 14:30:31
Is it possible to get AC with Python?


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 
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 