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
BLANKRK:
20130714 11:22:06
finaly done!!! after lots of tle's ,WA's n runtym error's.....:P 

ErtiChris Eelmaa:
20130714 07:44:36
Don't use long long's(not that you need, but I copy/pasted solution from my previous problem, and forget to change them)  costed me few TLE's. 

Chandan Singh:
20130702 19:03:51
getting tle at 9th test case, i have used getchar_unlocked for faster i/o anything else i can do to get rid of tle ? 

jalaj:
20130607 09:05:33
no need of fast i/o.. 

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?

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 