Competitive Programming Community | CommonLounge

Competitive Programming

22204 members.

SPOJ + CodeForces + CodeChef + TopCoder + TIMUS + WCIPEG + A2OJ + CodeJam + HackerRank + ... + ACM ICPC

Invite Members

Show community info

Ask a question or start a poll…

Link

Poll

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

Total numbers having frequency k in a given range

How to find total numbers having frequency=kin a particular range(l,r) in a given array. There are total 10^5 queries of formatl,rand each query is built on the basis of previous query's answer. In particular, after each query we incrementlby the result of the query, swappinglandrifl>r. Note that0<=a[i]<=10^9. Total elements in array isn=10^5.

Sample Input:

5 2 3             #n,k,q
7 6 6 5 5         #array (a)
0 4               #query1
3 0               #query2
4 1               #query3

Sample Output:

2               #ans to query1
1               #ans to query2
1               #ans to query3

Read more…(75 words)

Category: Competitive Programming

NaN.

discussion

[Codechef COOK82C] Hussain Set

Problem in short:

Hussain has a multiset of integers. In every move Hussain removes a maximum number from this multiset and divides it by 2 (integer division, which is rounded down) , and re-inserts it into the multiset.

Answer Q Queries, i-th query denoted by Q[i]. You must tell the number Hussain will be dividing in the Q[i]-th move (after Q[i]-1 moves in particular).

Constraints: N, Q <= 10^6. Elements of multiset are less than 2^63 (signed long long)

Read more…(80 words)

https://codechef.com/problems/COOK82C

Category: Competitive Programming

Top comments in this discussion

Someone please help me, what's wrong with this code ?

import java.util.*;
public class Main {
    public static void main(String[] args){

Read more… (10 words)

Read more (10 words)

Kushan Mehta14w

My solution in C++ using 2 queues.

for (ll i = 1; i <= max_index; ++i) {
        if (!ar1.empty()) {
            if (ar2.empty() || ar1.front() > ar2.front()) {

Read more… (7 words)

Read more (7 words)

Abhijeet Srivastava17w

Why would a O(N) = N*log N solution give TLE when N=10^6....???

O(N=10^6) = (6*10^6) < (2*10^8)

Read more… (17 words)

Read (17 words)

Show 56 more
comments

NaN.

Q&A session

Q&A Session with Sumeet Varma

Codeforces India #1

Ended

This Q&A Session has now ended but

Sumeet may still answer new questions

Hey there! I’m Sumeet Varma. I am extremely interested in Algorithms and Data Structures and so I do a lot of competitive programming. I am also a big fan of Counter-Strike, Politics and reading random answers on Quora.

My team (FruitSalad) came 1st in ACM ICPC ‘17 Kharagpur Regionals, 2nd in Kolkata Regionals and 7th in India Finals and we have qualified for World Finals. Also, I have been Red on Codeforces and the highest rated Indian programmer on Codeforces, Hackerrank and Topcoder in the past.

Currently, I am doing an internship at Directi (Bangalore) as a part of my project for final semester at DA-IICT, Gandhinagar.

Ask me anything!

Moderator note: We are very excited to host Sumeet for a Q&A session! He has a max rating of 2515 on Codeforces and 2173 on TopCoder, and you can see the graph going up consistently over the last 2.5 years. It's time to find out more about the person behind ...

Read more…(190 words)

Category: Competitive Programming

Top comments in this discussion

Charles Kiondo21w

Hi,am Charles from Tanzania I want to ask you if there is any application needed to perform pyhon learning

Read more… (19 words)

Read (19 words)

Manish PathakCompetitive Programm… · 33w

Hi! I have a question that i am not able to figure out.

We have two numbers N and D

and we can do two operations i.e.

1.N=N+D

Read more… (53 words)

Read (53 words)

Sachin Goyal39w

Hi Sumeet,

Currently I am preparing for the placements. I started coding just a couple of months ago. I still can't solve problems o...

Read more… (52 words)

Read (52 words)

Show 158 more
comments

NaN.

discussion

Q&A regarding Facebook internship application

Shiv Pratap Singh asked me a bunch of questions about the Facebook internship application. I can't be 100% sure about the application specifics, but 95% certain based on my past experiences.

Shiv: I am in 2nd year in my college and next semester I will be looking for internships. I saw from your linkedin profile you interned at FB. I gave FB Hacker Cup first time and qualified upto 2nd round. Can you help me for that in any way?

Keshav: FB likes people who are active in CP and perform well. Just submit your resume on their website. If you know anyone in FB (same college, etc), contact them and tell them you submitted your resume. But you don't need to do more than that. Just need to submit resume and tell someone inside the company to make sure it gets looked at. If they come to your campus, that would be the better place to do it.

Shiv: So, you also performed in hackercup to get internship? I have 1856 rating on CF just -44 from purple. I think my CP skills are good because CodeNation organized their Internship challeng...

Read more…(511 words)

Category: Competitive Programming

Top comments in this discussion

Muhammad Saad41w

Looking forward to reading more. Great post. Much thanks again. Cool.

writing a college resume

Read more… (15 words)

Read more (15 words)

Muhammad Saad41w

Looking forward to reading more. Great post. Much thanks again. Cool.<a href="https://marvelous-reviews.com/tips-for-writing-a-college-resume/">writing a college resume</a>

Read more… (15 words)

Read more (15 words)

List of Top 20 Resume Writing Services of 2017 They will help you create a perfect resume and Facebook will not to refuse you in internship.

Read more… (26 words)

Read more (26 words)

Show 1 more
comment

NaN.

discussion

How to get internship at Amazon, Microsoft?

What are the requirements and where and how to practice for internship at big giants like Amazon, Google, Microsoft.

And what should the resume look like to make the shortlist for these companies?

Read more…(33 words)

Category: Competitive Programming

Top comments in this discussion

Sir, these are secondary things to concern, I need to know from where and how I get an opportunity to sit for interviews in these tech giants

Read more… (27 words)

Read (27 words)

Aivy DebnathSimple woman · 2y

Thank you for sharing this

Read more… (5 words)

Read (5 words)

Yuvraj Singla2y

Top resources for practice :

Geeksforgeeks (Pay special attention to latest company interview questions/experiences)

Interviewbit (If you are good at programming, great ...

Read more… (219 words)

Read more (219 words)

Show 2 more
comments

NaN.

discussion

[UVA 11721] Instant View Of Big Bang

Problem in Short:

There are N star systems in the space, connected by M wormholes. Each wormhole can teleport you from a system A to system B (you cannot teleport in the opposite direction).

Each wormhole has a fixed time shift T (negative or positive). If it's positive it will take you from system A to system B and you will land T years after. If T is negative, it will take you from A to B and land T years before (in the past).

You are asked to determine the star systems such that for each of them, you can start a journey there and keep traveling in the past (via wormholes) infinitely, so you can watch the Big Bang :)

Constraints: N <= 1000, M <= 2000

Read more…(131 words)

UVa Online Judge

https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=2768

Category: Competitive Programming

Top comments in this discussion

This problem took me a lot of time (even after reading the hints!). If you're stuck, consider not making the same mistakes I did.

Please note:

#1) The output is supposed to be in INCREASING order...

Read more… (365 words)

Read more (365 words)

Thanks! Your verbally refined insights were very useful to me.

Read more… (10 words)

Read (10 words)

Sahil Malhotra42w

I fail to understand, why in line 29 and 37, the condition inside for loop is j <= e?

Shouldn't it be j < edg.size();

Read more… (25 words)

Read (25 words)

Show 16 more
comments

Load More