superprismatic

Find three witty English sentences which can be interleaved to produce the sequence IGWRODGUMADESAREVEPRYGETFHIEARIANUBNGTLOEILUTOIFSMNOTBARTEHCILENGDSBLECAUTSETHENYISOTHMINGNETSSISMHOWESTARKDTHEARESOUNGLIGHT [/code] The interleaving may have overlaps, but only where the sayings involved have letters in common. Here is example solved problem of this type: Suppose the given string were [code] LAFTWHERYSEALLIHRSSAIPESHUNDAGINDDORNEATHDESALOKFTYINMHUOCREWILLHBRTESAIMEWSAYDTHANTDOBRVNEILINCGKSDMOKENT Then, three such sentences producing this are THESHIPSHUNGINTHESKYINMUCHTESAMEWAYTHATBRICKSDONT LAWYERSSPENDAGREATDEALOFTHEIRTIMESHOVELINGSMOKE AFTERALLISSAIDANDDONEALOTMOREWILLBESAIDTHANDONE [/code] The overlapped interleaving is: [code] T HE S H IP SHUN GIN TH ES K YINM U C H TESA MEW AY THA T BR I C KSD O NT LA W Y E RSS PE NDAG R EAT DE ALO FT H E I RT IME S H O V E LIN G S MOKE AFT ER ALLI SSAI DA NDDO NEA LO T M O REWILL B ESAI DTHAN DO NE LAFTWHERYSEALLIHRSSAIPESHUNDAGINDDORNEATHDESALOKFTYINMHUOCREWILLHBRTESAIMEWSAYDTHANTDOBRVNEILINCGKSDMOKENT

Find three witty English sentences which can be interleaved without overlap to produce the sequence NIIDNELOTEOINTYPHVINERGIISNCENTVEAVOFACURYEABSVERYETNHCUINGIEMSSCRAUPCKS [/code] Here is example solved problem of this type: Suppose the given string were [code] VIFAIDOOOREELILLIKSEENWHAACETFISUGITATDOGIHIELVAEFSROMTHPSTEELRAWPORFEETUAAVFUGELOLFTHYEONRTAHEIGESENWCRONGSIOMDPETEOFENT Then, then three such sentences producing this are VIOLENCEISTHELASTREFUGEOFTHEINCOMPETENT IFEELLIKEAFUGITIVEFROMTHELAWOFAVERAGES ADOORISWHATADOGISPERPETUALLYONTHEWRONGSIDEOF [/code] The interleaving is: [code] V I O L E N CE IS T H EL A ST R E FUGE O FTH EI N C OM PET ENT IF EE LLIK E A F UGIT I V EF ROMTH EL AW O F A V E R A GES A DO OR I S WH A T A DOGI S P E R P ETU A L L Y ON T H E W RONGSI D EOF VIFAIDOOOREELILLIKSEENWHAACETFISUGITATDOGIHIELVAEFSROMTHPSTEELRAWPORFEETUAAVFUGELOLFTHYEONRTAHEIGESENWCRONGSIOMDPETEOFENT

plainglazed has it! Nice going!

Interleave the three strings FOGIEMYONSNSASIASOGEHNONNSEFSWINKHKSN FORGVEMMNASLOFGIETHNOSESEFTHEWHHNTEYTLSENS RGIEMENNENSESFORGVEHENOEOHOEHOTHIEYAKSEE [/code] so that they may overlap only at letters they have in common and together they form a witty English sentence. This sentence also has the shortest possible length of any string made by overlapped interleaving of this kind. Here is example solved problem of this type: Suppose that the three strings were [code] SSNOAITAYINUITISLSRAVOHEKINDOPEMEUZZLEI SIOTWTTSBUTITSILUATIVEFEHEKIPBLMTHUZLES THIIAWITTYSYGUTTISLLSTTFETHEKIOFPROEMHPUZLE Each of these can be stretched out over 70 positions so that each of the 70 positions is covered by a letter from at least one of the three. Furthermore, letters at positions of overlap must agree: S SNO A I T AYIN U ITIS L S RA V O HEKINDO P EM E UZZLEI SI OT W TT S BUTIT SI LU ATIVE FE HEKI P BL MTH U ZLE S THI I AWITTYS Y G UT TIS LL ST T FETHEKI OFPRO EM H PUZ LE THISISNOTAWITTYSAYINGBUTITISILLUSTRATIVEOFETHEKINDOFPROBLEMTHEPUZZLEIS [/code] This 70-long string, although not unique, is as short as possible while fulfilling the requirements of the problem (with the exception of wit).

As xamdam points out, any one of these is the odd one out.

Less than 48

IT MESSESD IT UP A BIT BUT IF YOU COPPY AND PASTE IT IN A TXT. DOC. IT'LL EVEN OUT A BIT. You found a 48-long string. That's pretty good, but you can do better!

I tried Java compilation, I got the error: ---------- 1. ERROR in jan1.java (at line 1) public class Leapyear ^^^^^^^^ The public type Leapyear must be defined in its own file ---------- 1 problem (1 error)

Interleave the three 19-long strings MOTMMNEEITEAEOENANU HWOCOMNTSNWOLRYDGSI TETSOLEHRDHRDTPIDTY [/code] so that they may overlap only at letters they have in common and together they form the shortest possible string (not necessarily an English sentence). Here is example solved problem of this type: Suppose that the three strings were [code] HEGOOMOASUTYPOATHII EISPLLIHTOPRLMTHTSS RADEXAEFOTONTOEEFBE Each of these can be stretched out over 45 positions so that each of the 45 positions is covered by a letter from at least one of the three. Furthermore, letters at positions of overlap must agree: HE GO O MOASUTYPO A T HII EISPLL IH TO PRLM T HTSS RADE XA EF OTON T OEEFB E RADEISPLLXAIHEFGOTONPRLMOASUTYPOEEFBAHTSSHIIE [/code] This 45-long string, although not unique, is as short as possible while fulfilling the requirements of the problem.

Interleave the three 19-long strings MOTMMNEEITEAEOENANU HWOCOMNTSNWOLRYDGSI TETSOLEHRDHRDTPIDTY [/code] so that they don't overlap and together they form a 57-long string which is a good English sentence with the spaces collapsed out. Here is example solved problem of this type: Suppose that the three strings were [code] HEGOOMOASUTYPOATHII EISPLLIHTOPRLMTHTSS RADEXAEFOTONTOEEFBE Each of these can be stretched out over 57 positions so that they do not overlap and each of the 57 positions is used by at least one of them this way: HE GOO M O AS U T YP O A THI I EIS PL L I H T O PR L MTH T S S R A DEXA E F O T ONTO E E F B E HEREISAGOODEXAMPLEOFASOLUTIONTOTHETYPEOFPROBLEMTHATTHISIS [/code]

By the way, I couldn't compile your program. I got the following error: jan1.c:1: error: expected unqualified-id before ‘public’ With a different C compiler, I got this error: jan1.c:1: error: expected ‘=’, ‘,’, ‘;’, ‘asm’ or ‘__attribute__’ before ‘class’ I don't program in C or C++, so I don't know what the problem is. Can you help?

But 400 is a leap year. (sorry, I forgot to put this in my previous post)

You forgot to take into account that years 100, 200, and 300 are not leap years.

I was a bit too quick on the trigger!

KS, I think there should be 7 asterisks in the third line of asterisks.

Kevink is correct, at least for 3 families (I only checked that case).

Tuckleton is correct.

Oops! It really is