Comments
0

thanks man!
-19

where
0

lezgoOOooO
0

No no it does
0

can anyone please look into my submission: submission thank you
0

lol i do the same in leetcode haha
0

omg your heat map. consistency at peak
On icecuber → CSES DP section editorial, 3 years ago
0

Hi, have you seen array description problem in cses? Doesn't it feel like it can be solved without dp.

like this:

if(value==1 or value==m){
	answer = (answer*2)%1000000007;
	continue;
}else if(value==0){
	answer = (answer*3)%1000000007;
}
0

I am sorry. Thanks i blindly believed gfg editorial without reading furtherly.
0

hi can you please check with my code once i know i made it too much complex but i still used the same approach you mentioned. here it is
On Begzodbek_07 → Begzodbek To'ychiboyev, 3 years ago
0

Bro posted his English SI or sum

Just kidding all the best!
+1

Was there a typo in the post you guys made or is it actually being hold?

The first line of the post was this:

We will hold Toyota Programming Contest 2024#2（AtCoder Beginner Contest 341）.
On ayush370 → CLICK IF YOU'RE A NOOBIE, 3 years ago
0

everything a issue these days
+3

Sure, will do
+3

so the factors of x that are greater than sqrt(x) are just the same product we have seen before sqrt(x) but written vice versa?

like if we have seen (a*b) before square root it's the same numbers repeating again but in reverse like b*a?
0

unable to understand why they are doing this in div2B

if(n<=i){ ans=max(ans,x/i); }

edit: nvm for anyone with the same doubt check this explanation https://codeforces.me/blog/entry/125137?#comment-1111266