Introduction
Contest performance talk
The first algorithm is called "Can Place Flowers". It took Julia almost 50 minutes to pass the online judge. First Julia tried to use recursive function and then she figured out it was too much work after 20 minutes. And then she chose to use iterative solution, but it took her another 20 minutes to fix bugs in her writing.
The second algorithm is called "Construct string from binary tree". It took Julia only 20 minutes to write the solution and she passed the online judge.
The third algorithm is called "Find Duplicate File in System", Julia only had 20 minutes, she wrote the code but she could not finish in 20 minutes. After the contest, she just wrote another 5 minutes, she could not believe that the code was easy to work on as well.
So the performance of her third weekly contest is here.
The second algorithm is called "Construct string from binary tree". It took Julia only 20 minutes to write the solution and she passed the online judge.
The third algorithm is called "Find Duplicate File in System", Julia only had 20 minutes, she wrote the code but she could not finish in 20 minutes. After the contest, she just wrote another 5 minutes, she could not believe that the code was easy to work on as well.
So the performance of her third weekly contest is here.
No comments:
Post a Comment