Comments - Codeforces

→ Pay attention

Before contest
Codeforces Round 1134 (Div. 4)
35:26:31
Register now »

→ Top rated

→ Top contributors

View all →

→ Find user

→ Recent actions

Detailed →

Comments

On Igor.Ivanich → USACO: Humble Numbers, 15 years ago

Thanks.

On Igor.Ivanich → USACO: Humble Numbers, 15 years ago

I've tried the way u said but getting TLE on test 8
My solution is here: http://pastebin.com/N5aFRt1g

Am I doing right or miss something?

On Igor.Ivanich → USACO: Humble Numbers, 15 years ago

Thanks for the reply, Could u please explain more?

On Igor.Ivanich → DP Problem, 15 years ago

@Alias: did u deleted ur comments? Because I've received an E-Mail
from Codeforces that you've commented on my blogpost, but I didn't find any!

On Igor.Ivanich → DP Problem, 15 years ago

Thanks brunoja for helping, Unfortunately I didn't get the idea, could u please
explain more.

On Igor.Ivanich → Find a Hamiltonian Cycle when each vertex of the graph has degree >= N / 2, 15 years ago

Thanks Seyed! :)

On Igor.Ivanich → Find a Hamiltonian Cycle when each vertex of the graph has degree >= N / 2, 15 years ago

Thanks for the response, Could u please explain more how do u update the cycle?

The only programming contests Web 2.0 platform

Server time: Nov/11/2026 06:08:30 (k1).

Desktop version, switch to mobile version.

Supported by