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 :
 Increase the numbers between indices A and B (inclusive) by 1. This is represented by the command "0 A B"
 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
karan_yadav:
20180724 07:18:11
2D array does the trick :) 

manjeet_:
20180722 19:04:09
use Scanf Printf :( 

aman_sachin200:
20180604 15:42:19
Good one....segment trees+lazy propagation!!:) 

sajid006:
20180505 06:19:25
Can it be solved without using lazy propagation? 

dipankar12:
20180319 12:18:17
Time limit of JAVA is not correct. Same code running in cpp with scanf and printf 

coolio_1:
20180228 19:19:37
AC in 1 go! Nice Problem! :D


ramini1996:
20180203 13:48:51
Wrote 160 lines of code. AC in ONE GO !!! 

amitboss:
20180129 20:10:07
Ac in 1 go!


atulbi:
20180124 17:17:26
Same problem on codechef giving TLE , while AC in one go on SPOJ 

shiv2111:
20180120 15:56:24
easy peasy : 
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 