CP noobs

noob today, pro tommorow(?)

Share this communityInvite Members

Post something interesting…

Link

Poll

Quiz

Tutorial

Course

Commonlounge is a community of learners who learn together. Get started with the featured resources above, ask questions and discuss related stuff with everyone.

1.

discussion

DP help!!!by Bhuwan Chandra

Hey guys! I am able to understand dp algorithms but unable to implement them. Any help.

For e.g. - http://www.geeksforgeeks.org/weighted-job-scheduling/

Read more…(20 words)

Copied

2.

discussion

Time complexity of Dijkstra?by Soumyadeep Roy

what is the time and space complexity of Dijkstra's algorithm? In the wikipedia article it's given that if the priority queue is implemented as a binary heap,then time complexity is bounded by O( (E+V) log(V)). This makes sense,but also somewhere I have seen it's given O ( Elog(V)). I'm wondering which is more precise. I suspect the former one is more precise. What do u say guys?? Any answer will be appreciated.

Read more…(72 words)

Copied

3.

discussion

My experience with ICO prep series #1by Bhuwan Chandra

**Y**esterday night I went to the nearby cyber cafe to attend the first programming contest of my life. But I had to complete the contest in 1/3 time as the cyber cafe was about to get closed by 9:00 p.m.(Don't have PC at home, this I am writing from my school lab.).

Made a new codechef account for the same purpose, settled myself on a computer with 20 mins to go for the contest.

The wait ended and and the problems flashed on the screen.

Started the first problem with full excitement. The problem was set by Udit Sanghi, and the problem statement started with something bad about schools(What else did you expected) which on one go I understood it is unsolvable for me, atleast in the given time constraints. Went for the another problem "Ant in a Box", Ahhh this was the problem I came for, but the genius inside me thought that following formulas are same

P(E) = sqrt(l^2+b^2+h^2)

Read more…(255 words)

Copied

4.

discussion

BY

Not Understanding This Problem Statementby Brad Yuan

Here it is:

It says that for test case 4 4, it should be 5. Shouldn't it just be 4 though? (WWWW, WWRR, RWWR, RRWW) ?

Read more…(27 words)

Copied

5.

discussion

BY

How can I optimize this?by Brad Yuan

So on the CF Problem Fox and Names I'm getting something like this:

"Memory limit exceeded on test 15124 ms 262100 KB"

This is weird because I looked at other solutions that do basically the EXACT same thing as me (topological sort) and they passed just fine.

Here's the problem: CF

Here's my solution: [C++] My solution

WTF is happening?

Read more…(60 words)

Copied

6.

discussion

Can't understand this basic problem
http://codeforces.com/problemset/problem/548/Bby Bhuwan Chandra

The problem is asking for consecutive 1's. In a row there are only two maximum 1 but in the sample the output is 3/4.

Read more…(24 words)

Copied

Load More

Ready to join our community?

Sign up below to automatically get notified of new courses, get **reminders** to finish ones you subscribe to, and **bookmark** lessons to read later.

Continue with Facebook

— OR —

Your Full Name

Email address

I have an account. Log in instead

By signing up, you agree to our Terms and our Privacy Policy.

Popular Courses

New Courses

About Us

Get in touch

Copyright 2016-18, Compose Labs Inc. All rights reserved.