But there’s no proof that your height is 164 cm.

Egypt, El shorouk academy

Team name: El Gharbia Lmokafa7t Eldokhan

Mn6fy

Mostafa__Fouad

-Satrix-

any hints for the easy version ?

Yeah I got the same solution but it was too late, thanks for responding <3

Is your solution about taking the whole range from i to n, except for some suffix like from i to n-1 or n-2, and finding the largest possible value?

How to solve G?

can you provide the link to the problem

Valorant

imaginary friend ?

are you atheist

obviously

How to solve K ?

my idea was ..say i have the answer of node 6 which is ( 6*1 + 1*2 )

and now i want to calculate the answer of node 10

then it will be ans[10]=(10*1 + ans[6])

but here ans[6] has to be ( 6*2 + 1*3 not 6*1 + 1*2 )

how to do this efficiently?

Congrats bakry ❤

Auto comment: topic has been updated by Mostafa__Fouad (previous revision, new revision, compare).

ok thank you Bro

is there a way to solve D with a sparse table

can someone explain the solution for problem C

Blog owner waiting

took me an hour trying to understand C

bad problem statement

how could i know ?

Problem A: why does this code 168868045 gives me wrong answer in 13 with GNU C++20 (64)

while the exact same code gives me accepted with GNU C++14 168869739

not my fault i guess !!

i didn't know that , it's my fault iam sorry for that

Hello MikeMirzayanov, My solutions for Educational Codeforces Round 132 (Rated for Div. 2) has been Skipped due the coincides with solutions El_king00,the two accounts are mine (this account and El_king00) i don't know if that thing is a violation of the rules or not but these solutions are made by me (implemented and submitted by me )the only difference that i added my name at the beginning of the solution submitted in this account
i didn't cheat or copied someone else's code , Your solution 165168953 for the problem 1709B significantly coincides with solutions El_king00/165168729, Mostafa__Fouad/165168953.

pretty sure

Manchester is Blue