Linux Distribution Collection
It was since my junior high school, I dedicate a lot of time and effects to collect various distributions of Linux.
The followings are hunted:
RedHat Linux
Whitebox Linux
Yellow Dog Linux
To be continued....
2008年6月23日星期一
Brain Storming
Brain Storming
It is always joyful to realize that I am thinking by myself!
Never let others to think for you.
Here is two web sites which is very suitable and challenge for my level!
Problem of the Week
Harvard University
As stated in the title, those problems are very time consuming.
http://www.physics.harvard.edu/academics/undergrad/problems.html
Puzzle Toad
Carnegie Mellon University
Puzzles of Computer Science
http://www.cs.cmu.edu/puzzle/index.html
Those two should keep me busy for a while!
It is always joyful to realize that I am thinking by myself!
Never let others to think for you.
Here is two web sites which is very suitable and challenge for my level!
Problem of the Week
Harvard University
As stated in the title, those problems are very time consuming.
http://www.physics.harvard.edu/academics/undergrad/problems.html
Puzzle Toad
Carnegie Mellon University
Puzzles of Computer Science
http://www.cs.cmu.edu/puzzle/index.html
Those two should keep me busy for a while!
2008年6月21日星期六
Selected Problem By Linus
Selected Problem By Linus
From Problem of the Week Department of Physics at Harvard University
Another Question is selected from a anynomous blog, it is somehow similar with those problem could be solved using PERT(Program Evaluation and Review Technique), but the difference is that this problem acquires multiply programs, therefore the whole question is more difficult. It is rather harder to come out with a feasible algorithm.
The problem states:
There are n projects in total, and every project has multiply steps to finish. Every step is marked and there will be k people to work on those projects.
The rules are following: every person can finish one step at a time, and every step is specified to one person. The project should be completed within strict order. Therefore step 2 can not be completed until step 1 is completed. If a person finishes his work, he can immediately be assigned to another work.
The problem ask you to find a optimized solution.
Input:
2 3 (indicates there are 2 projects and 3 people)
3 1 2 2 3 3 5(project 1 is composed by 3 steps, the first step consumes 2 hour and must be completed by person 1, the second step consumes 3 hours and must be completed by person 2, the third step consumes 5 hours and must be completed by person 3)
2 2 3 3 2(project 2 is composed by 2 steps, the first step consumes 3 hours and must be completed by person 2, the second step consumes 2 hours and must be completed by person 3)
Output:
11(the minimum hour required to finish all 2 projects)
From Problem of the Week Department of Physics at Harvard University
Another Question is selected from a anynomous blog, it is somehow similar with those problem could be solved using PERT(Program Evaluation and Review Technique), but the difference is that this problem acquires multiply programs, therefore the whole question is more difficult. It is rather harder to come out with a feasible algorithm.
The problem states:
There are n projects in total, and every project has multiply steps to finish. Every step is marked and there will be k people to work on those projects.
The rules are following: every person can finish one step at a time, and every step is specified to one person. The project should be completed within strict order. Therefore step 2 can not be completed until step 1 is completed. If a person finishes his work, he can immediately be assigned to another work.
The problem ask you to find a optimized solution.
Input:
2 3 (indicates there are 2 projects and 3 people)
3 1 2 2 3 3 5(project 1 is composed by 3 steps, the first step consumes 2 hour and must be completed by person 1, the second step consumes 3 hours and must be completed by person 2, the third step consumes 5 hours and must be completed by person 3)
2 2 3 3 2(project 2 is composed by 2 steps, the first step consumes 3 hours and must be completed by person 2, the second step consumes 2 hours and must be completed by person 3)
Output:
11(the minimum hour required to finish all 2 projects)
订阅：
博文 (Atom)