@cyrilverloop/codingame-configuration 1.6.0 → 1.7.0

package/config/medium/NeedleInAHaystack/input/04 - Large Heap.txt

@@ -0,0 +1,29 @@
+400 15
+einandjpantonetwoexamplesofunbalancedwilfequivalencearxiv14023842mathco2014alexanderbursteinandlouiswshapiropseudoinvolutionsintheriordangrouparxiv211211595mathco2021ntcameronrandomwalkstreesandextensionsofriordangrouptechniquesdissertationhowarduniversity2002naiomitcameronandasamoahnkwantaonsomepseudoinvolutionsintheriordangroupjournalofintegersequences820050537giuliocerbaiandersclaessonlucaferra
+riandeinarsteingrmssonsortingwithpatternavoidingstacksthe132machinearxiv200605692mathco2020gisangcheonstjinandlwshapiroacombinatorialequivalencerelationforformalpowerserieslinearalgebraanditsapplicationsvolume49115february2016pages123137jciglersomenicehankeldeterminantsarxiv11091449mathco2011johannciglerandchristiankrattenthalerhankeldeterminantsoflinearcombinationsofmomentsoforthogonalpolynomials
+arxiv200301676mathco2020jbcosgravethegaussfactorialmotzkinconnectionmapleworksheetchangesuffixtomwrdecastroalramrezandjlramrezapplicationsinenumerativecombinatoricsofinfiniteweightedautomataandgraphsarxiv13102449csdm2013jciglerhankeldeterminantsofsomepolynomialsequencespreprint2012colindefantmotzkinintervalsandvalidhookconfigurationsarxiv190410451mathco2019colindefanttroupescumulantsandstacksortin
+garxiv200411367mathco2020cdefantandkzhengstacksortingwithconsecutivepatternavoidingstacksarxiv200812297mathco2020edeutschandbesagancongruencesforcatalanandmotzkinnumbersandrelatedsequencesjnumtheory1172006191215rmdickaudelannoyandmotzkinnumbersrmdickauthe9pathsina4x4gridyundingandrosenarxducountinghumpsinmotzkinpathsarxivpreprintarxiv11092661mathco2011filippodisantoandthomaswiehesomeinstancesofasu
+bpermutationproblemonpatternavoidingpermutationsarxiv12106908mathco2012idolinkajeastaevangeloudfitzgeraldandnhamidempotentstatisticsofthemotzkinandjonesmonoidsarxiv150704838mathco2015idolinkajeastandrdgraymotzkinmonoidsandpartialbrauermonoidsarxiv151202279mathgr2015robertdonagheyrestrictedplanetreerepresentationsforfourmotzkincatalanequationsjcombintheoryseriesbvol22no21977pp114121robertdonagheyau
+tomorphismsoncatalantreesandbracketingsjournalofcombinatorialtheoryseriesbvol29no1august1980pp7590robertdonagheyandlouiswshapiromotzkinnumbersjcombintheoryseriesavol23no31977pp291301robertwdonleyjrbinomialarraysandgeneralizedvandermondeidentitiesarxiv190501525mathco2019ivanaurevigordolinkaandjameseastsandwichsemigroupsindiagramcategoriesarxiv191010286mathgr2019eseggerestricted3412avoidinginvolutio
+nscontinuedfractionschebyshevpolynomialsandenumerationsarxivmath0307050mathco2003sec8sbekhadandmyangproofsoflinearrecurrencesofcoefficientsofcertainalgebraicformalpowerseriesconjecturedintheonlineencyclopediaofintegersequences2017gennadyeremingeneratingfunctionfornaturalizedseriesthecaseoforderedmotzkinwordsarxiv200208067mathco2020gennadyereminnaturalizedbracketrowandmotzkintrianglearxiv200409866m
+athco2020gennadyereminwalkingintheoeisfrommotzkinnumberstofibonaccinumberstheshadowsofmotzkinnumbersarxiv210810676mathco2021jacksonevoniukstevenkleeandvanmagnanenumeratingminimallengthlatticepathsjintseq2120181836lucaferrariandemanuelemunarinienumerationofedgesinsomelatticesofpathsarxiv12036792mathco2012andjintseq1720141415pflajoletandrsedgewickanalyticcombinatorics2009seepages68and81rigobertoflre
+zleandrojunesandjoslramrezfurtherresultsonpathsinanndimensionalcubiclatticejournalofintegersequences2120181812juanbgilandjordanotirrellasimplebijectionforclassicalandenhancedknoncrossingpartitionsarxiv180609065mathco2018alsodiscretemathematics2019article111705doi101016jdisc2019111705samuelegiraudotreeseriesandpatternavoidanceinsyntaxtreesarxiv190300677mathco2019samuelegiraudothecombinatormandthemo
+ckingbirdlatticearxiv220403586mathco2022nilshaugtprellbergandgsiudemscalinginareaweightedgeneralizedmotzkinpathsarxiv160509643condmatstatmech2016nickolasheinandjiahuangmodularcatalannumbersarxiv150801688mathco20152016nickolasheinandjiahuangvariationsofthecatalannumbersfromsomenonassociativebinaryoperationsarxiv180704623mathco2018aoifehennessyastudyofriordanarrayswithapplicationstocontinuedfraction
+sorthogonalpolynomialsandlatticepathsphdthesiswaterfordinstituteoftechnologyoct2011cheynehombergerpatternsinpermutationsandinvolutionsastructuralandenumerativeapproacharxivpreprint14102657mathco2014andershyllengrenlettertonjasloaneoct041985andershyllengrenfourintegersequencesoct041985observesessentiallythata000984anda002426areinversebinomialtransformsofeachotherasarea000108anda001006inriaalgorithm
+sprojectencyclopediaofcombinatorialstructures50manuelkauersanddoronzeilbergercountingstandardyoungtableauxwithrestrictedrunsarxiv200610205mathco2020deknuthlettertolwshapirorkguynjasloanerpstanleyhwilfregardinga001006anda005043jan181989dmitryvkruchininandvladimirvkruchininageneratingfunctionforthediagonalt2nnintrianglesjournalofintegersequences1820151546marielouiselacknerandmwallneraninvitationtoan
+alyticcombinatoricsandlatticepathcountingpreprint2015jwlaymanthehankeltransformandsomeofitspropertiesjintegersequences420010115walorenzypontyandpcloteasymptoticsofrnashapesjournalofcomputationalbiology15120083163kmanesasapounakisitasoulasandptsikourasequivalenceclassesofballotpathsmodulostringsoflength2and3arxiv151001952mathco2015toufikmansourstatisticsondyckpathsjournalofintegersequences920060615
+toufikmansourrestricted132permutationsandgeneralizedpatternsarxivmath0110039mathco2001vmazorchukandbsteinbergdoublecatalanmonoidsarxiv11055313mathgr2011petermccallaandasamoahnkwantacatalanandmotzkinintegralrepresentationsarxiv190107092mathnt2019cammclemananderinmcnicholasgraphinvertibilityarxiv11083588mathco2011zhoushengmeiandsuijiewangpatternavoidanceofgeneralizedpermutationsarxiv180406265mathco2
+018dmerlinidgrogersrsprugnoliandmcverrionsomealternativecharacterizationsofriordanarrayscanadjmath491997301320tmotzkinthehypersurfacecrossratiobullamermathsoc511945976984heinrichniederhauseninversesofmotzkinandschroederpathsarxiv11053713mathco2011jcnovelliandjythibonnoncommutativesymmetricfunctionsandlagrangeinversionarxivmath0512570mathco20052006royosteandjorisvanderjeugtmotzkinpathsmotzkinpolyno
+12
+1-9
+a-z
+0-9,a-z
+5-9,p-z,b,c,d,f,5-9
+d-j,2-7
+c,o,d,i,n,g,a,m,e,2,0,2,4
+i,n,t,e,r,n,a,t,i,o,n,a,l,i,z,a,t,i,o,n
+z,e,r,o,0-1,o,n,e
+a,k,i,r,a,t,o,r,i,y,a,m,a,4-5
+b,a,r,o,q,u,e,a,n,t,h,r,o,p,o,m,o,r,p,h,i,z,e,d
+c-n,d-p,1-5,6-7
+h-i,j-k,l-m,2-5,3-9

package/config/medium/NeedleInAHaystack/input/05 - Larger Heap.txt

@@ -0,0 +1,33 @@
+500 19
+sepermutationofpc234n112nandzqisthenumberofcyclesofthepermutationqexamplea49indeedp34121324istheonlyinvolutionof1234withgenus0thisfollowseasilyfromthefactthatapermutationpof12nhasgenus0ifandonlyifthecycledecompositionofpgivesanoncrossingpartitionof12nandeachcycleofpisincreasingseelemma21ofthedulucqsimionreferencealsoredundantlyforp34121324wehavecp2341341241231432andsogp1241211emericdeutschmay292010letwijndenotewalksinn2whichsatisfythemultivariaterecurrencewijnwij1n1wi1jn1wi1j1n1withboundarycondi
+tionsw0001andwijn0ifiorjornis0thenansumi0nj0nwijnisthenumberofsuchwalksoflengthnpeterluschnymay212011anan1tendsto30asninfinity12cos2pinrelatingtolongestoddnregularpolygondiagonalsbywayofexamplen7usingthetridiagonalgeneratorcfcommentofjan072009forpolygonn7weextractann123x3matrix010111011withanevalof224697thelongestheptagondiagonalwithedge1asntendstoinfinitythediagonallengthstendto30theconvergentofthesequencegarywadamsonjun082011numberofn1lengthpermutationsavoidingthepattern132andthedottedpattern2
+3dot1jeanlucbarilmar072012numberofnlengthwordswoveralphabetabcsuchthatforeveryprefixzofwwehavezazbzcwherezxcountsthelettersxinwordzthea49wordsareaaaaaaabaabaabaaaabbababaabcabacabcaaloispheinzmay262012numberoflengthnrestrictedgrowthstringsrgsr1r2rnsuchthatr11rkkandrkrk1forexamplethe9rgsforn4are101010121201121012121230123112321234joergarndtapr162013numberoflengthnrestrictedgrowthstringsrgsr1r2rnsuchthatr10rkkandrkrk11forexamplethe9rgsforn4are000000020003000400220024003302220224joergarndtapr172013
+numberof42315276143avoidinginvolutionsinsnalexanderbursteinmar052014anisthenumberofincreasingunarybinarytreeswithnnodeswhohaveanassociatedpermutationavoids132formoreinformationaboutunarybinarytreeswithassociatedpermutationsseea245888mandariehlaug072014anisthenumberofinvolutionsonnavoidingthesinglepatternpwherepisanyoneofthe8classicalpatterns12341243143221342143321434124321alsonumberof3412241334123142341224133142avoidinginvolutionsonnbecauseeachofthese3setsactuallycoincideswiththe3412avoidinginvo
+lutionsonnthisisacompletelistofthe8singles2pairsand1tripleof4letterclassicalpatternswhoseinvolutionavoidersarecountedbythemotzkinnumbersseebarnabeietal2011referencedavidcallanaug272014fromtonyfosteriiijul282016startaseriescreatedusing2anan1hashankeltransformoff2noffset3fbeingthefibonaccibisectiona001906empiricalobservationaseriescreatedusing2an3an1an2givesthehankeltransformofsumk0nkfibonacci2koffset3a197649empiricalobservationendconjecture2nsumk1n2k1ak2isanintegerforeachpositiveintegernzhiweisun
+nov162017therubeyandstumpreferenceprovesarefinementofaconjectureofrenmarczinzikwhichtheystateasthenumberof2gorensteinalgebraswhicharenakayamaalgebraswithnsimplemodulesandhaveanorientedlineasassociatedquiverequalsthenumberofmotzkinpathsoflengthnericmschmidtdec162017numberofukequivalenceclassesofukasiewiczpathsukasiewiczpathsarepequivalentiffthepositionsofpatternpareidenticalinthesepathssergeykirgizovapr082018iftau1andtau2aretwodistinctpermutationpatternschosenfromtheset132231312thenanisthenumbero
+fvalidhookconfigurationsofpermutationsofn1thatavoidthepatternstau1andtau2colindefantapr282019numberofpermutationsoflengthnthataresortedtotheidentitybyaconsecutive321avoidingstackfollowedbyaclassical21avoidingstackcolindefantaug292020fromhelmutprodingerdec132020startanisthenumberofpathsinthefirstquadrantstartingat00andconsistingofnstepsfromtheinfiniteset11111213forexampledenotingu11d11dj1jforj2a4countsuuuuuuuduuud2uuud3uuduuudduud2uuduuududthisstepsetisinspiredby11111315suggestedbyemericdeutschar
+ound2000seeprodingerlinkthatcontainsabijectiontomotzkinpathsendnamedbydonaghey1977aftertheisraeliamericanmathematiciantheodoremotzkin19081970insloanesahandbookofintegersequences1973theywerecalledgeneralizedballotnumbersamirameldarapr152021numberofmotzkinnpathsanissplitintoa107587nnumberofevenmotzkinnpathsanda343386nnumberofoddmotzkinnpathsthevaluea107587na343386ncanbecalledtheshadowofanseea343773gennadyereminmay172021conjectureifpisaprimeoftheform6m1a002476thenap2isdivisiblebypcurrentlynocounter
+exampleexistsforp107personalcommunicationfromrobertgerbiczmodsuchpthisisequivalenttoa066796withcommenteverya066796nfroma066796p12toa066796p1isdivisiblebyprimepofform6m1sergebatalovfeb082022frompeterbalafeb102022startconjectures1forprimep1mod6andnr1anpr2a005717n1modpwherewetakea00571700tomatchbatalovsconjectureabove2forprimep5mod6andn1anp2a005773nmodp3forprimep3andk1anpkanmodpfor0npk34forprimep5andk2anpkanmodp2for0npk13endthehankeltransformofthissequencewitha0omittedgivestheperiod6sequence101101w
+hichisa010892withitsfirsttermomittedwhilethehankeltransformofthecurrentsequenceistheallonessequencea000012andalsoitistheuniquesequencewiththispropertywhichissimilartotheuniquehankeltransformpropertyofthecatalannumbersmichaelsomosapr172022referencesebarcuccirpinzaniandrsprugnolithemotzkinfamilypumaseravol21991no34pp249279fbergeronlfavreauanddkrobconjecturesontheenumerationoftableauxofboundedheightdiscretemathvol139no131995463468frbernhartcatalanmotzkinandriordannumbersdiscrmath204199973112rbojici
+candmdpetkovicorthogonalpolynomialsapproachtothehankeltransformofsequencesbasedonmotzkinnumbersbulletinofthemalaysianmathematicalsciences2015doi101007s4084001502493miklosbonaeditorhandbookofenumerativecombinatoricscrcpress2015pp24298618912alinbostancalculformelpourlacombinatoiredesmarcheshabilitationdirigerdesrechercheslaboratoiredinformatiquedeparisnorduniversitparis13december2017httpsspecfuninriafrbostanhdrpdfajbuautomatedcountingofrestrictedmotzkinpathsenumerativecombinatoricsandapplicationse
+ca122021articles2r12naiomicameronjemcleodreturnsandhillsongeneralizeddyckpathsjournalofintegersequencesvol1920161661lcarlitzsolutionofcertainrecurrencessiamjapplmath171969251259michaeldairykosamanthatynerlarapudwellandcaseywynnnoncontiguouspatternavoidanceinbinarytreeselectronjcombin192012no3paper2221ppmr2967227dedavenportlwshapiroandlcwoodsonthedoubleriordangrouptheelectronicjournalofcombinatorics1822012p33edeutschandlshapiroasurveyofthefinenumbersdiscretemath2412001241265tdoslicdsvrtananddvelj
+anenumerativeaspectsofsecondarystructuresdiscrmath28520046782tomislavdoslicanddarkoveljanlogarithmicbehaviorofsomecombinatorialsequencesdiscretemath3082008no1121822212mr24045442009j05019sdulucqandrsimioncombinatorialstatisticsonalternatingpermutationsjalgebraiccombinatorics81998169191mdziemianczukenumerationsofplanetreeswithmultipleedgesandraneylatticepathsdiscretemathematics3372014924wenjiefangapartialorderonmotzkinpathsdiscretemath3432020111802ipgouldenanddmjacksoncombinatorialenumerationwiley
+ny19835210nssgunyliandtmansour2binarytreesbijectionsandrelatedissuesdiscrmath308200812091221krishatchpresentationofthemotzkinmonoidseniorthesisunivcalsantabarbara2012httpccsmathucsbeduseniorthesiskrishatchpdfvjelinektoufikmansourandmshattuckonmultiplepatternavoidingsetpartitionsadvancesinappliedmathematicsvolume50issue2february2013pp292326hanakimandrpstanleyarefinedenumerationofhextreesandrelatedpolynomialshttpwwwmathmitedurstanpapershextreespdfpreprint2015skitaevpatternsinpermutationsandwordssp
+ringerverlag2011seep399tablea7akuznetsovetaltreesassociatedwiththemotzkinnumbersjcombintheorya761996145147tlengyelondivisibilitypropertiesofsomedifferencesofmotzkinnumbersannalesmathematicaeetinformaticae412013pp121136walorenzypontyandpcloteasymptoticsofrnashapesjournalofcomputationalbiology20081513163doi101089cmb20060153pieramanaraandclaudioperellicippothefinestructureof4321avoidinginvolutionsand321avoidinginvolutionspumavol222011227238httpwwwmatunisiitnewsitopumapublichtml222manaraperellicippo
+pdftoufikmansourrestricted132permutationsandgeneralizedpatternsannalsofcombin620026576toufikmansourmatthiasschorkandmarkshattuckcatalannumbersandpatternrestrictedsetpartitionsdiscretemath3122012no2029792991mr2956089tsmotzkinrelationsbetweenhypersurfacecrossratiosandacombinatorialformulaforpartitionsofapolygonforpermanentpreponderanceandfornonassociativeproductsbullamermathsoc541948352360jocelynquaintanceandharriskwongacombinatorialinterpretationofthecatalanandbellnumberdifferencetablesintegers13
+2013a29jriordanenumerationofplanetreesbybranchesandendpointsjcombintheorya231975214222asapounakisetalorderedtreesandtheinordertransversaldiscmath306200617321741asapounakisitasoulasandptsikourascountingstringsindyckpathsdiscretemath307200729092924eschroederviercombinatorischeproblemezfmathphys151870361376lwshapiroetaltheriordangroupdiscreteappliedmath341991229239markshattuckonthezerosofsomepolynomialswithcombinatorialcoefficientsannalesmathematicaeetinformaticae422013pp93101httpamiektfhunjasloane
+ahandbookofintegersequencesacademicpress1973includesthissequencenjasloaneandsimonplouffetheencyclopediaofintegersequencesacademicpress1995includesthissequencemichaelzspiveyandlauralsteilthekbinomialtransformsandthehankeltransformjournalofintegersequencesvol92006article0611rpstanleyenumerativecombinatoricscambridgevol21999seeproblem637alsoproblem716by3nprsteinandmswatermanonsomenewsequencesgeneralizingthecatalanandmotzkinnumbersdiscretemath261979261272zwsunconjecturesinvolvingarithmeticalsequence
+snumbertheoryarithmeticinshangrilaedsskanemitsuhzliandjyliuprocthe6thchinajapansemnumbertheoryshanghaiaugust15172011worldscisingapore2013pp244258httpmathnjueducnzwsun142ppdfchenyingwangpiotrmiskaandistvnmeztherderangementnumbersdiscretemathematics3407201716811692yingwangandguocexinaclassificationofmotzkinnumbersmodulo8electronjcombin2512018p154wenjinwoanacombinatorialproofofarecursiverelationofthemotzkinsequencebylatticepathsfibonacciquart402002no138wenjinwoanarecursiverelationforweightedmotzkin
+12
+a-z
+0-9
+0-4,5-9
+0-9,a-z
+m-z,k-n,1,9
+a,e,i,o,u,y
+a-j,6-9
+c-o,w-z,3,8
+n-w,c-j,1,4,5,9
+r-s,y-z,j-k,3
+d,v,z,7,b,f,k,n,q,8,y
+g-k,a-f,x-z,b-d

package/config/medium/NeedleInAHaystack/output/01 - Examples.txt

@@ -0,0 +1,11 @@
+8 14
+8 14
+8 14
+13 14
+3 4
+5 14
+5 14
+5 14
+4 4
+0 0
+14 14

package/config/medium/NeedleInAHaystack/output/02 - Digits.txt

@@ -0,0 +1,12 @@
+60 69
+70 74
+45 49
+139 142
+109 113
+41 43
+87 89
+46 48
+18 20
+155 157
+60 69
+60 69

package/config/medium/NeedleInAHaystack/output/03 - Mixed.txt

@@ -0,0 +1,10 @@
+1117 1972
+1556 1681
+1117 1972
+1117 1972
+341 413
+341 438
+1117 1972
+695 734
+1260 1308
+1916 1974

package/config/medium/NeedleInAHaystack/output/04 - Large Heap.txt

@@ -0,0 +1,12 @@
+5707 5768
+3084 3209
+3084 3209
+3084 3209
+609 658
+5587 5612
+2662 2673
+4923 4934
+1769 1804
+1889 1952
+609 658
+5693 5768

package/config/medium/NeedleInAHaystack/output/05 - Larger Heap.txt

@@ -0,0 +1,12 @@
+9274 9416
+8243 8300
+8243 8300
+9247 9409
+9261 9409
+5927 5936
+9239 9328
+9239 9328
+7838 7920
+9403 9457
+3670 3790
+9239 9328

package/config/medium/OneForHisNobs/code/CGCode.js

@@ -0,0 +1,14 @@
+const N = parseInt(readline());
+for (let i = 0; i < N; i++) {
+    var inputs = readline().split(' ');
+    for (let j = 0; j < 5; j++) {
+        const card = inputs[j];
+    }
+}
+for (let i = 0; i < N; i++) {
+
+    // Write an answer using console.log()
+    // To debug: console.error('Debug messages...');
+
+    console.log('handScore');
+}

package/config/medium/OneForHisNobs/code/CGCode.php

@@ -0,0 +1,18 @@
+<?php
+fscanf(STDIN, "%d", $N);
+for ($i = 0; $i < $N; $i++)
+{
+    $inputs = explode(" ", fgets(STDIN));
+    for ($j = 0; $j < 5; $j++)
+    {
+        $card = ($inputs[$j]);
+    }
+}
+for ($i = 0; $i < $N; $i++)
+{
+
+    // Write an answer using echo(). DON'T FORGET THE TRAILING \n
+    // To debug: error_log(var_export($var, true)); (equivalent to var_dump)
+
+    echo("handScore\n");
+}

package/config/medium/OneForHisNobs/config.json

@@ -0,0 +1,53 @@
+{
+    "path": "medium/OneForHisNobs",
+    "name": "One for his Nobs",
+    "alphanumName": "OneForHisNobs",
+    "link": "https://www.codingame.com/ide/puzzle/one-for-his-nobs",
+    "tests": [
+        {
+            "name": "Fifteens",
+            "alphanumName": "Fifteens",
+            "file": "01 - Fifteens.txt"
+        },
+        {
+            "name": "Runs",
+            "alphanumName": "Runs",
+            "file": "02 - Runs.txt"
+        },
+        {
+            "name": "Pairs",
+            "alphanumName": "Pairs",
+            "file": "03 - Pairs.txt"
+        },
+        {
+            "name": "Flushes",
+            "alphanumName": "Flushes",
+            "file": "04 - Flushes.txt"
+        },
+        {
+            "name": "One for his nobs",
+            "alphanumName": "OneForHisNobs",
+            "file": "05 - One for his nobs.txt"
+        },
+        {
+            "name": "Compound runs",
+            "alphanumName": "CompoundRuns",
+            "file": "06 - Compound runs.txt"
+        },
+        {
+            "name": "Big Hands",
+            "alphanumName": "BigHands",
+            "file": "07 - Big Hands.txt"
+        },
+        {
+            "name": "19 hand",
+            "alphanumName": "19Hand",
+            "file": "08 - 19 hand.txt"
+        },
+        {
+            "name": "Wikipedia hands",
+            "alphanumName": "WikipediaHands",
+            "file": "09 - Wikipedia hands.txt"
+        }
+    ]
+}

package/config/medium/OneForHisNobs/input/01 - Fifteens.txt

@@ -0,0 +1,6 @@
+5
+7H 8D TS 2H 4C
+5C TD KS 2H 4C
+6H AS 9C TS KH
+2C TS 3D 6S 8C
+2C TS 3D QH 8C

package/config/medium/OneForHisNobs/input/02 - Runs.txt

@@ -0,0 +1,4 @@
+3
+KC QH 7D AS JD
+TC JH QD KS 3D
+KS TC JH QD 9D

package/config/medium/OneForHisNobs/input/03 - Pairs.txt

@@ -0,0 +1,4 @@
+3
+AH AD 9H JC KS
+AH AD AS JC KS
+AH AD AS AC KS

package/config/medium/OneForHisNobs/input/04 - Flushes.txt

@@ -0,0 +1,4 @@
+3
+AD 2D 6D JD QS
+AD 2D 6D TD QD
+AD 2D 6D JS QD

package/config/medium/OneForHisNobs/input/05 - One for his nobs.txt

@@ -0,0 +1,2 @@
+1
+JS 6C 2D AS QS

package/config/medium/OneForHisNobs/input/06 - Compound runs.txt

@@ -0,0 +1,5 @@
+4
+TS TH JD QS AC
+TS TH JD QS KC
+TC TH TD JS QH
+TH JD JS QC QH

package/config/medium/OneForHisNobs/input/07 - Big Hands.txt

@@ -0,0 +1,6 @@
+5
+2H 2D 2S 2C 9S
+2H 6H 7H 8H 7D
+4H 4C 5S 5D 6S
+5H 5C 5D QH 5S
+5H 5C 5D JS 5S

package/config/medium/OneForHisNobs/input/08 - 19 hand.txt

@@ -0,0 +1,2 @@
+1
+AH 6S TC KS JD

package/config/medium/OneForHisNobs/input/09 - Wikipedia hands.txt

@@ -0,0 +1,8 @@
+7
+6D JH 4H 7C 5H
+5S 4S 7S 6H 5H
+TS 8D KC 8C 5H
+7S KD 9D 8H 3H
+TS 5S 4S 7C 3H
+7D 3D TH 5C 3H
+8C AS QH 2H 3H

package/config/medium/OneForHisNobs/output/01 - Fifteens.txt

@@ -0,0 +1,5 @@
+2
+4
+2
+2
+4

package/config/medium/OneForHisNobs/output/02 - Runs.txt

@@ -0,0 +1,3 @@
+3
+4
+5

package/config/medium/OneForHisNobs/output/03 - Pairs.txt

@@ -0,0 +1,3 @@
+2
+6
+12

package/config/medium/OneForHisNobs/output/04 - Flushes.txt

@@ -0,0 +1,3 @@
+4
+5
+0

package/config/medium/OneForHisNobs/output/05 - One for his nobs.txt

@@ -0,0 +1 @@
+1

package/config/medium/OneForHisNobs/output/06 - Compound runs.txt

@@ -0,0 +1,4 @@
+8
+10
+15
+16

package/config/medium/OneForHisNobs/output/07 - Big Hands.txt

@@ -0,0 +1,5 @@
+20
+20
+24
+28
+29

package/config/medium/OneForHisNobs/output/08 - 19 hand.txt

@@ -0,0 +1 @@
+0

package/config/medium/OneForHisNobs/output/09 - Wikipedia hands.txt

@@ -0,0 +1,7 @@
+9
+14
+6
+5
+7
+8
+5

package/config/medium/PartitionNumbers/code/CGCode.js

@@ -0,0 +1,9 @@
+const T = parseInt(readline());
+for (let i = 0; i < T; i++) {
+    const n = parseInt(readline());
+}
+
+// Write an answer using console.log()
+// To debug: console.error('Debug messages...');
+
+console.log('partitions');

package/config/medium/PartitionNumbers/code/CGCode.php

@@ -0,0 +1,11 @@
+<?php
+fscanf(STDIN, "%d", $T);
+for ($i = 0; $i < $T; $i++)
+{
+    fscanf(STDIN, "%d", $n);
+}
+
+// Write an answer using echo(). DON'T FORGET THE TRAILING \n
+// To debug: error_log(var_export($var, true)); (equivalent to var_dump)
+
+echo("partitions\n");

package/config/medium/PartitionNumbers/config.json

@@ -0,0 +1,43 @@
+{
+    "path": "easy/PartitionNumbers",
+    "name": "Partition Numbers",
+    "alphanumName": "PartitionNumbers",
+    "link": "https://www.codingame.com/ide/puzzle/partition-numbers",
+    "tests": [
+        {
+            "name": "Test 1",
+            "alphanumName": "test1",
+            "file": "01 - test 1.txt"
+        },
+        {
+            "name": "Test 2",
+            "alphanumName": "test2",
+            "file": "02 - test 2.txt"
+        },
+        {
+            "name": "Test 3",
+            "alphanumName": "test3",
+            "file": "03 - test 3.txt"
+        },
+        {
+            "name": "Test 4",
+            "alphanumName": "test4",
+            "file": "04 - test 4.txt"
+        },
+        {
+            "name": "Test 5",
+            "alphanumName": "test5",
+            "file": "05 - test 5.txt"
+        },
+        {
+            "name": "Test 6",
+            "alphanumName": "test6",
+            "file": "06 - test 6.txt"
+        },
+        {
+            "name": "Test 7",
+            "alphanumName": "test7",
+            "file": "07 - test 7.txt"
+        }
+    ]
+}

package/config/medium/PartitionNumbers/input/01 - test 1.txt

@@ -0,0 +1,2 @@
+1
+3

package/config/medium/PartitionNumbers/input/02 - test 2.txt

@@ -0,0 +1,3 @@
+2
+4
+5

package/config/medium/PartitionNumbers/input/03 - test 3.txt

@@ -0,0 +1,2 @@
+1
+0

package/config/medium/PartitionNumbers/input/04 - test 4.txt

@@ -0,0 +1,6 @@
+5
+3
+2
+1
+0
+4

package/config/medium/PartitionNumbers/input/05 - test 5.txt

@@ -0,0 +1,11 @@
+10
+5
+6
+7
+8
+9
+10
+11
+12
+13
+14

package/config/medium/PartitionNumbers/input/06 - test 6.txt

@@ -0,0 +1,16 @@
+15
+5
+7
+12
+15
+20
+25
+30
+35
+40
+45
+50
+55
+60
+65
+70

package/config/medium/PartitionNumbers/input/07 - test 7.txt

@@ -0,0 +1,16 @@
+15
+1
+0
+2
+50
+100
+75
+80
+85
+90
+95
+30
+35
+40
+45
+25

package/config/medium/PartitionNumbers/output/01 - test 1.txt

@@ -0,0 +1 @@
+3

package/config/medium/PartitionNumbers/output/02 - test 2.txt

@@ -0,0 +1,2 @@
+5
+7

package/config/medium/PartitionNumbers/output/03 - test 3.txt

@@ -0,0 +1 @@
+1

package/config/medium/PartitionNumbers/output/04 - test 4.txt

@@ -0,0 +1,5 @@
+3
+2
+1
+1
+5

package/config/medium/PartitionNumbers/output/05 - test 5.txt

@@ -0,0 +1,10 @@
+7
+11
+15
+22
+30
+42
+56
+77
+101
+135

package/config/medium/PartitionNumbers/output/06 - test 6.txt

@@ -0,0 +1,15 @@
+7
+15
+77
+176
+627
+1958
+5604
+14883
+37338
+89134
+204226
+451276
+966467
+2012558
+4087968

package/config/medium/PartitionNumbers/output/07 - test 7.txt

@@ -0,0 +1,15 @@
+1
+1
+2
+204226
+190569292
+8118264
+15796476
+30167357
+56634173
+104651419
+5604
+14883
+37338
+89134
+1958

package/config/medium/RiskOddsCalculator/code/CGCode.js

@@ -0,0 +1,7 @@
+const attack = parseInt(readline());
+const defense = parseInt(readline());
+
+// Write an answer using console.log()
+// To debug: console.error('Debug messages...');
+
+console.log('42.42%');

package/config/medium/RiskOddsCalculator/code/CGCode.php

@@ -0,0 +1,8 @@
+<?php
+fscanf(STDIN, "%d", $attack);
+fscanf(STDIN, "%d", $defense);
+
+// Write an answer using echo(). DON'T FORGET THE TRAILING \n
+// To debug: error_log(var_export($var, true)); (equivalent to var_dump)
+
+echo("42.42%\n");

package/config/medium/RiskOddsCalculator/config.json

@@ -0,0 +1,48 @@
+{
+    "path": "medium/RiskOddsCalculator",
+    "name": "Risk odds calculator",
+    "alphanumName": "RiskOddsCalculator",
+    "link": "https://www.codingame.com/ide/puzzle/risk-odds-calculator",
+    "tests": [
+        {
+            "name": "Minimal armies",
+            "alphanumName": "MinimalArmies",
+            "file": "01 - Minimal armies.txt"
+        },
+        {
+            "name": "Small armies, advantage attacker",
+            "alphanumName": "SmallArmiesAdvantageAttacker",
+            "file": "02 - Small armies, advantage attacker.txt"
+        },
+        {
+            "name": "Small armies, advantage defender",
+            "alphanumName": "SmallArmiesAdvantageDefender",
+            "file": "03 - Small armies, advantage defender.txt"
+        },
+        {
+            "name": "Small armies, balanced",
+            "alphanumName": "SmallArmiesBalanced",
+            "file": "04 - Small armies, balanced.txt"
+        },
+        {
+            "name": "Crushing endgame",
+            "alphanumName": "CrushingEndgame",
+            "file": "05 - Crushing endgame.txt"
+        },
+        {
+            "name": "Hail Mary",
+            "alphanumName": "HailMary",
+            "file": "06 - Hail Mary.txt"
+        },
+        {
+            "name": "Large, uncertain battle",
+            "alphanumName": "LargeUncertainBattle",
+            "file": "07 - Large, uncertain battle.txt"
+        },
+        {
+            "name": "Mother of all battles",
+            "alphanumName": "MotherOfAllBattles",
+            "file": "08 - Mother of all battles.txt"
+        }
+    ]
+}

package/config/medium/RiskOddsCalculator/input/01 - Minimal armies.txt

@@ -0,0 +1,2 @@
+1
+1

package/config/medium/RiskOddsCalculator/input/02 - Small armies, advantage attacker.txt

@@ -0,0 +1,2 @@
+3
+1

package/config/medium/RiskOddsCalculator/input/03 - Small armies, advantage defender.txt

@@ -0,0 +1,2 @@
+1
+2

package/config/medium/RiskOddsCalculator/input/04 - Small armies, balanced.txt

@@ -0,0 +1,2 @@
+2
+2

package/config/medium/RiskOddsCalculator/input/05 - Crushing endgame.txt

@@ -0,0 +1,2 @@
+14
+5

package/config/medium/RiskOddsCalculator/input/06 - Hail Mary.txt

@@ -0,0 +1,2 @@
+4
+9

package/config/medium/RiskOddsCalculator/input/07 - Large, uncertain battle.txt

@@ -0,0 +1,2 @@
+36
+41

package/config/medium/RiskOddsCalculator/input/08 - Mother of all battles.txt

@@ -0,0 +1,2 @@
+80
+97