Read more… (11 words)
Active In
International Olympiad in Informatics
Indian Computing Olympiad (ICO)
Unschooling & Open Learning
TED Talks
Competitive Programming
Space Enthusiasts
Artificial Intelligence
Psychology
Featured Contributions
NaN.
discussion
Free ticket (INOI 2014: India)
Problem in short: Given a weighted undirected graph with C nodes and F edges, find the distance between the nodes that are furthest away from each other. Here, distance = shortest-path distance. C <= 250, F <= 25,000.
Indian National Olympiad in Informatics (INOI) is ro...
Read more…(58 words)
reply in this discussion
NaN.
discussion
Bamboo Art (ZCO 2016: India)
Zonal Computing Olympiad is round 1 out of 3 (i.e. beginner) for selection into Indian IOI team. Check out the discussion responses for solution one hint at a time!
Read more…(30 words)
reply in this discussion
whats wrong with my code its giving wa for last test case
Read more… (14 words)
NaN.
discussion
Little Red Riding Hood (ZCO 2013: India)
Zonal Computing Olympiad is round 1 out of 3 (i.e. beginner) for selection into Indian IOI team. Check out the discussion responses for solution one hint at a time!
Read more…(30 words)
reply in this discussion
NaN.
discussion
Little Red Riding Hood (ZCO 2013: India)
Zonal Computing Olympiad is round 1 out of 3 (i.e. beginner) for selection into Indian IOI team. Check out the discussion responses for solution one hint at a time!
Read more…(30 words)
reply in this discussion
Read more… (16 words)
NaN.
discussion
Break Up (ZCO 2015: India)
Zonal Computing Olympiad is round 1 out of 3 (i.e. beginner) for selection into Indian IOI team.
Read more…(17 words)
reply in this discussion
NaN.
discussion
Break Up (ZCO 2015: India)
Zonal Computing Olympiad is round 1 out of 3 (i.e. beginner) for selection into Indian IOI team.
Read more…(17 words)
reply in this discussion
I want a hint for this problem. Which concept should be implemented?
Read more… (12 words)