arthur.thompson.jr
BAN USERCould you explain what you mean by envelop? The question mentions disks that intersect, so there may be disks that are enveloped by others yet share no points. Am I missing something here?
- arthur.thompson.jr February 28, 2013The second solution is not clear to me, can you explain a bit further, also can you describe if its an improvement over the first solution?
- arthur.thompson.jr February 26, 2013Total no. of points is 56.
max points any team can ge is 14
No. of points someone can make to be sure of a playoff spot is 12.
56/12 = 4, so if 4 teams get 12 points then there are only 8 points left for the others to get into the playoffs which is not possible.
56/11 = 4, so if 4 teams get 11points then there are 12 points left for the other teams to get, thus if one of those teams wins all games against those not making 11 points then it will have 12 points.
thus the minimum amount of points that guarantees a playoff spot is 12.
I may not be seeing everything here, please let me know if i am
I am thinking that an insertion sort type solution where each character in string 2 is used to find a match in string 1 and swap the match into the next most important position.
int j=0;
int next = 0;
while(next<n && j<m){ //where n is the length of string 1 and m is the length of string 2
for(int i=next; i<n; i++){
if(string1[i] == string2[j]){
if(i != next){
swap(string1, i, next);
}
next++;
}
j++
}
}
@Zythum42 its any shared point, thank you.
- arthur.thompson.jr February 28, 2013