The Full Gene Sequence Rules and examples.
This Challenge is a replay opportunity of the 2000 GeneSeq Contest.
Brief Challenge statement: Given N segments of equal length, produce a single sequence of minimal length that must contain each individual segment. Repeated segments must occur at least once in the output Sequence. No rotations allowed.
The winning solution superbly exploited the features of strncmp.
Input: Segments % char array (N segments of equal length)
TCGG GCAG ATCG CAGC AATC
Output: Sequence % char
AATCGGCAGC
Scoring:
10*Time(sec) + 1000 *sum( Total_Lengths(i)/Original_Lengths(i)/Sequences) -1 )
Error downloading URL
Sum all integers from 1 to 2^n
5791 Solvers
Project Euler: Problem 1, Multiples of 3 and 5
1016 Solvers
swap sign sum & multiply castles
24 Solvers
Rotate and display numbered tile
216 Solvers
Matrix which contains the values of an other matrix A at the given locations.
188 Solvers