ANNOUNCEMENT

-
I moved all the posts from Codrspace, another blogging platform. Here is the link to my Codrspace blog (now no longer updated.) So don't think I wrote all these posts in a single day. Thank you.

😌

Comments

Post a Comment

Popular posts from this blog

USACO Training: Controlling Companies

-
 USACO Training: Controlling Companies (concom) Some companies are partial owners of other companies because they have acquired part of their total shares of stock. For example, Ford at one point owned 12% of Mazda. It is said that a company A controls company B if at least one of the following conditions is satisfied: Company A = Company B Company A owns more than 50% of Company B Company A controls K (K >= 1) companies denoted C 1 , ..., C K with each company C i owning x i % of company B and x 1 + .... + x K > 50%. Given a list of triples (i,j,p) which denote company i owning p% of company j, calculate all the pairs (h,s) in which company h controls company s. There are at most 100 companies. Write a program to read the list of triples (i,j,p) where i, j and p are positive integers all in the range (1..100) and find all the pairs (h,s) so that company h controls company s. My 1st Method I enumerated the amount of companies to find pairs in whi...
Read more

USACO 2018 January Contest, Gold Problem 1. MooTube

-
USACO January 2018 - MooTube Problem Statement In his spare time, Farmer John has created a new video-sharing service, which he names MooTube. On MooTube, Farmer John's cows can record, share, and discover many amusing videos. His cows already have posted  N  videos ( 1 ≤ N ≤ 100 , 000 ), conveniently numbered  1 … N . However, FJ can't quite figure out how to help his cows find new videos they might like. FJ wants to create a list of "suggested videos" for every MooTube video. This way, cows will be recommended the videos most relevant to the ones they already watch. FJ devises a metric of "relevance," which determines, as the name suggests, how relevant two videos are to each other. He picks  N − 1  pairs of videos and manually computes their pairwise relevance. Then, FJ visualizes his videos as a network, where each video is a node and the  N − 1  pairs of videos he manually considered are connected. Conveniently, FJ has picked his  N...
Read more

POJ 3258: River Hopscotch

-
POJ 3258: River Hopscotch Problem Statement River Hopscotch Time Limit:  2000MS Memory Limit:  65536K Total Submissions:  16105 Accepted:  6765 Description Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, straight river with a rock at the start and another rock at the end,  L  units away from the start (1 ≤  L  ≤ 1,000,000,000). Along the river between the starting and ending rocks,  N  (0 ≤  N  ≤ 50,000) more rocks appear, each at an integral distance  D i  from the start (0 <  D i  <  L ). To play the game, each cow in turn starts at the starting rock and tries to reach the finish at the ending rock, jumping only from rock to rock. Of course, less agile cows never make it to the final rock, ending up instead in the river. Farmer John is proud of his cow...
Read more