Comments
0

hello can you explain the logic behind the memory optimised code :-

for(int i = 0; i<(1<<N); ++i) F[i] = A[i]; for(int i = 0;i < N; ++i) for(int mask = 0; mask < (1<<N); ++mask){ if(mask & (1<<i)) F[mask] += F[mask^(1<<i)]; }
0

Deleted
On 300iq → Grakn Forces -- Editorial, 6 years ago
+3

can someone explain the editorial of B?
+3

Thanks!
+3

Can you please elaborate your solution?
0

Thanks,this really helped!
0

can you please explain your approach why you are taking difference pairs and how it is leading to max sum?
0

hey can anyone explain the editorial of problem E in detail?
0

Yes I got it thanks!
0

hey can anyone tell me why are we doing --pref[max(r1, r2) + 1] in problem D? also why are we calculating prefix sums?
0

Thanks!
0

can anyone please explain the editorial of problem 1336B — Xenia and Colorful Gems?

I am not able to understand it?