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
Vaibhav Gosain: 2014-12-24 09:08:32

time limit is a little too tight ;-)

anonymous: 2014-07-03 01:14:13

same code AC in C++ gives tle in c...

GURVINDER SINGH: 2014-05-28 16:03:23

AC in first attempt no need of fast i/o

nitesh kumar: 2014-04-03 20:38:40

got AC after faster I/O..

अमूल्य: 2014-01-22 16:38:51

failing at 9th test case please share some test cases

Shakil Ahmed: 2013-11-05 11:20:05

Very interesting problem !
Unfortunately the time limit is also interesting :(

After 2 TLE got AC with faster IO.

Edit : No need to use inline function, Faster IO is enough .

Last edit: 2013-11-05 11:20:48
Shreyans: 2013-09-21 15:05:04

Getting WA in 9th case, though simple algorithm and though using fast I/P, O/P by fread and write after putting in buffer. Is there any tricky case?

Last edit: 2013-11-19 13:09:01
Akhilesh Anandh: 2013-09-19 12:09:48

Went from TLE to AC by inlining functions and using fast i/o. @ProblemSetter: I suggest increasing the time limit so that this does not need to be done.
EDIT: there is no need of inlining functions. Proper algorithm works fine just with fast i/o.

Last edit: 2014-05-23 00:59:00
Haytham Breaka: 2013-07-26 23:32:39

no need for inline functions or getchar_unlocked() just optimized code will pass

on the hell: 2013-07-21 08:51:01

i hate such time limits ...


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