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 :

  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

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


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

hide comments
2014-04-03 20:38:40 nitesh kumar
got AC after faster I/O..
2014-01-22 16:38:51 अमूल्य
failing at 9th test case please share some test cases
2013-11-05 11:20:05 Shakil Ahmed
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
2013-09-21 15:05:04 Shreyans
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
2013-09-19 12:09:48 Akhilesh Anandh
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
2013-07-26 23:32:39 Haytham Breaka
no need for inline functions or getchar_unlocked() just optimized code will pass
2013-07-21 08:51:01 on the hell
i hate such time limits ...
2013-07-14 11:22:06 BLANKRK
finaly done!!! after lots of tle's ,WA's n runtym error's.....:P
2013-07-14 07:44:36 Erti-Chris Eelmaa
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.
2013-07-02 19:03:51 Chandan Singh
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 ?
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.