-
Notifications
You must be signed in to change notification settings - Fork 0
isoming/2016-2-Algorithm
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
##assignment01 - login getting total number of users logged-in the game during specified time on the specified days
Total logged-in user data come from login.inp and the result is saved in login.out.
##assignment02 - trio getting trio number of calculated fractions in the input flie
Numbers which would be used calculating fractions come from trio.inp and the result is saved in trio.out.
##assignment03 - bhi getting x, y location of stars from the input flie
if there are three stars in a group, the longest distance among them is the bhi.
This program finds the shortest bhi from all the stars from the bhi.inp and the shortest bhi is saved in bhi.out.
##assignment04 - eleccar getting distances of nodes and calculate the longest distance from the shortes paths.
The result distance and the path is printed in eleccar.out.
##assignment05 - board getting the largest sum of three cards set whose orders cannot be changed but the location can be changed.
The result score is printed in board.out.
##assignment06 - laundry getting the distances of nodes and calculate the longest time for visiting all of the nodes.
But it should be shorter than limited time T.
The result path is printed in laundry.inp.
##assignment08 - ngs get ngs string data and sort them using radix sort.
The result shows the most appeared ngs pattern and the count number of it.
##assignment09 - candle get graph nodes and distances as edge length.
The result shows meeting point that spends shortest time when 3 people come from selected 3 different nodes.
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published