I was looking at solution 810236 from hpfdf and also other users, who only for every query "add l r d" do a for loop from l to r and make at most two update operations in a BIT.

Why does this work? I think something like this would do more than 10

^{9}operations.
what exactly is almost lucky number? sorry if it is stupid but sb pls answer

It is a condition given in the problem statements of codeforces beta round 91. If you read any problem statement from this round I hope you will understand.

I think that because of this condition:

The operations are such that after all additions the array won't have numbers that would exceed 10^{4}Can you please provide testcase 26 of A problem

799

i am also stuck in the same test case and i think it is wrong ie 799 in problem https://codeforces.com/problemset/problem/122/A

Hello! For 799 the answer would be "YES" because it is divisible by 47 which is a lucky number. The question asks that it should be divisible by any lucky number and not necessarily just 4 or 7. Hope this helps.

I think if code give "YES" for 141(input) then it will also work fine for test case 26(799).

141/47=3

141 is not lucky 47 is lucky

141 gets evenly divided by 47