### AlimA's blog

By AlimA, 9 years ago,

Hi everyone.

My code for problem Little Elephant and LCM has got WA on test 9. My algorithm is a bit different from the editorial.

Can you help me?

Thx all :)

Read more »

• +6

By AlimA, 9 years ago,

Hi.

Can you say when is the next contest?

Wish to be a.s.a.p.

thx :)

Read more »

• -17

By AlimA, 9 years ago,

Hi all

My code for the problem Numbers has got TLE. I think my code should be fast enough but... . Can anyone find my mistake or give some hints to me? I don't wanna look at the tutorial. :)

Thx all :)

Read more »

• +2

By AlimA, 9 years ago,

Hi all :)

For this problem, I used ternary search to find the best point on the west for each point on the east. The best point a[j] for a specific point b[i], is the point which makes the shortest path between the villages and goes from b[i]. Then, the minimum among these numbers, is the answer. Using ternary search is appropriate because the distance between the villages using the specific point b[i] and the points on the left, make an unimodal function.

But, My code for probelem "Building Bridge" has got RE.

I couldn't understand where the problem is. This is my code. Can anyone help me?

Read more »

• -5

By AlimA, 9 years ago,

Hi all.

I tried to solve problem #304 of acm.sgu.ru using dp. But my code got runtime error on test 9. I found what the mistake was, but I could not fix it.

Can anyone help me? I have explained completely in the code what the problem is.

This is my code : CODE

thanks :)

Read more »

• +8

By AlimA, 9 years ago,

Hi everyone

I got WA on test 5 for problem #151.

This is my code.

Can anyone help me?

UPD: after month I tried to code this problem again, but again WA on test 5 ! :( This is my new code. Can you help me? Thx in advance :).

Read more »

• +2

By AlimA, 9 years ago,

Hello everybody.

My code for problem 229A has got Time limits. My solution is completely like the authors solution, but I could not fix the problem. Can anyone help me? This is my code : CODE

Read more »

• +1