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


hide comments
mushfiq123: 2024-09-10 09:15:17

Neftide game e asho prem kori

m_______7: 2024-04-12 19:33:28

I am getting WA on 9th Test case. Can anyone see what's wrong with this solution or suggest some sample test case please?
[Simes]: this is not the place for debugging code, use the forum. SPOJ doesn't work like that, don't assume you've got correct answers on cases 1 to 8.

Last edit: 2024-04-12 23:15:50
soumyo001: 2023-12-20 09:43:01

can anyone tell me the approach to solve it?

Last edit: 2023-12-20 10:08:02
mostafa_188: 2023-11-12 17:39:42

i got 21times TLE .But i never give up.
I will solve it .

drago_codes: 2023-02-01 06:36:05

Use shift operators for multiplying and dividing by 2.
Use Fast io instead of Scanner

Last edit: 2023-02-01 06:36:50
tomatim: 2022-11-26 06:53:06

Is lazy optimization necessary? getting TLE on testcase 8

rebel_roar: 2022-01-24 15:03:33

Same solution on codechef giving TLE. Are you guys encountering same problem or it just me ?

jrseinc: 2020-07-31 14:28:09

after 7 WA, 2TLE, and a single silly mistake finally AC!
use fast IO and int (instead of ll)

silent_1: 2020-06-16 13:45:19

https://www.codechef.com/problems/MULTQ3

manish_thakur: 2020-05-27 07:59:51

Use fast input output in c++


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