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
tien0903: 2018-11-03 14:37:39

no need prinf and I make three mod =))

abhimanyu_1998: 2018-10-16 17:50:33

time limit exceeded for java submissions

karan_yadav: 2018-07-24 07:18:11

2D array does the trick :)

manjeet_: 2018-07-22 19:04:09

use Scanf Printf :-(

aman_sachin200: 2018-06-04 15:42:19

Good one....segment trees+lazy propagation!!:)

sajid006: 2018-05-05 06:19:25

Can it be solved without using lazy propagation?

dipankar12: 2018-03-19 12:18:17

Time limit of JAVA is not correct. Same code running in cpp with scanf and printf

coolio_1: 2018-02-28 19:19:37

AC in 1 go! Nice Problem! :D

ramini1996: 2018-02-03 13:48:51

Wrote 160 lines of code. AC in ONE GO !!!

amitboss: 2018-01-29 20:10:07

Ac in 1 go!
can use anything i.e, long long int or int

Last edit: 2018-01-29 20:13:06

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