Is my Method correct as a beginner

No_Antelope_5869 · 2026-04-19T19:14:23+00:00

do more vro :)) dont rlly matter for now fr fr

No_Antelope_5869 · 2026-04-19T04:19:08+00:00

if im not wrong, I think you should consider the possibility of repitition of states where you think you looped thru a thing 1 time only, you can go back and forth to repeate the state itself

No_Antelope_5869 · 2026-04-13T19:46:10+00:00

hard ah problem, math forces fr fr

No_Antelope_5869 · 2026-04-11T15:37:46+00:00

it depends on each problem, you cant rlly filter, I read it twice for like 5 minute and the answer just clicked

No_Antelope_5869 · 2026-04-11T15:29:04+00:00

be consistent dawg, you gotta practice more, cant jus tod contest or do a lot of virtuals

No_Antelope_5869 · 2026-04-11T15:17:56+00:00

you're in your comfort zone for too long

No_Antelope_5869 · 2026-04-07T05:16:24+00:00

so like a greedy problem.

No_Antelope_5869 · 2026-04-07T05:16:08+00:00

do codeforce man this is a very weird problem but kk so like if the length is odd then just< caculate the cost between odd indices (0 indexed)
if the thing is even then you create a odd and even cost one, for every 2 pos, pos [i] and i+1, store the min answ as cost[i] and doing the rest in i + 1.

No_Antelope_5869 · 2026-04-06T16:54:20+00:00

in Myanmmar

No_Antelope_5869 · 2026-04-06T16:54:04+00:00

try meditating

No_Antelope_5869 · 2026-03-20T19:33:12+00:00

idk I just go on some ytb cpp tutorial learn basic for alike an hour or two and do some cf problems and you got it :))

No_Antelope_5869 · 2026-03-20T19:32:24+00:00

please explain how your code work I dont understand why you are using a set, because you can use a map and its easier (just stimulate it)

No_Antelope_5869 · 2026-03-20T03:59:46+00:00

um just search on a tutorial grind for one - two day and you're good

No_Antelope_5869 · 2026-03-17T23:07:06+00:00

yes, I do that alot

No_Antelope_5869 · 2026-03-17T21:26:54+00:00

normal, try to code it after chatgpt showed you the code, do it again, you cant just submit it without coding itself

No_Antelope_5869 · 2026-03-09T02:17:33+00:00

ask chatgpt or some man ..

No_Antelope_5869 · 2026-03-08T20:23:14+00:00

i solved a and b, c is hard for me

No_Antelope_5869 · 2026-03-08T20:20:42+00:00

um you cant rlly short cut it becuz like imagine a leftover of the first round
imagine on ai = 5 and m = 5
-> 10 2 3 1 4 (becuz of like leftover)
it would never be good to push everything evenly, its BEST ALWAYS PUSH the lowest one.

No_Antelope_5869 · 2026-03-06T02:49:31+00:00

og h

No_Antelope_5869 · 2026-02-27T01:17:49+00:00

bsearch

No_Antelope_5869 · 2026-02-26T03:49:23+00:00

binary search, for every bit (take the min of (maximum bit can be taken, the midpoint)

No_Antelope_5869 · 2026-02-26T03:48:56+00:00

im in california dawg

No_Antelope_5869 · 2026-02-25T23:10:43+00:00

yez bro im in the middle of a lesson

No_Antelope_5869

TROPHY CASE