PageSourceSearch

https://static.codingame.com/games.b5c67da7.js

js codingame.com collected 2026-10-01 08:43:09 UTC 10,742 bytes, 2 lines download raw bytes

1(self.webpackChunkcodingame=self.webpackChunkcodingame||[]).push([[5876],{44679:function(e){e.exports='<div class="games-level-header"> <div class="games-level-header_content"> <cg-content-details-breadcrumb ng-if="$ctrl.breadcrumbs" breadcrumb="$ctrl.breadcrumbs"> </cg-content-details-breadcrumb> <h1 ng-if="$ctrl.sectionTitle" class="games-level-header_title" translate="{{$ctrl.sectionTitle}}"> </h1> </div> </div> '},51956:function(e,s,t){"use strict";t.r(s),t.d(s,{default:function(){return C}});var n=t(74692),o=t.n(n),l=t(7025),i=t.n(l),a=t(49636),r=i().module("games",[a.default.name]),c=t(91765),u=t.n(c),z=t(80114),d=t.n(z),g=JSON.parse('{"games":{"descriptions":{"codegolf":{"easy":"Achieve the shortest possible source code by using language specific tricks","expert":"Solve these very hard puzzles and achieve the shortest possible source code by using language specific tricks","hard":"How good are you at programming? Challenge yourself on these hard puzzles and achieve the shortest possible source code by using language specific tricks","medium":"Discover new golf tricks by solving these medium level puzzles"},"bot-programming":"Build a smart bot to fight your opponents!","optimization":"Try to reach the best possible score, you\'ll get a ranking and you can improve your solution at anytime","puzzles":{"easy":"Improve your skills by solving algorithmic puzzles","expert":"Solve these very hard puzzles and become a legend. Just like Chuck Norris","hard":"How good are you at programming? Challenge yourself on these hard puzzles","medium":"Discover new tricks by solving these medium level puzzles"},"nextContest":"Compete for fun to win prizes"},"done":"Done","levels":{"bot-programming":"Bot programming","codegolf":"Code golf","easy":"Classic Puzzle - Easy","expert":"Classic Puzzle - Very Hard","hard":"Classic Puzzle - Hard","medium":"Classic Puzzle - Medium","codegolf-easy":"Code golf - Easy","codegolf-expert":"Code golf - Very Hard","codegolf-hard":"Code golf - Hard","codegolf-medium":"Code golf - Medium","multiplayer":"All multiplayer puzzles","optimization":"Optimization","training":"All puzzles","nextContest":"Next Contest"},"puzzleAchievements":"Puzzle achievements","puzzleOptimScore":"Optimization criteria value","puzzleOptionRank":"Rank","puzzleScore":"Puzzle score","sections":{"bestSuggestions":"Best suggestions","puzzlesComplete":"Completed","puzzlesInProgress":"In progress","puzzlesToStart":"To start"},"viewAll":"View all"}}'),p=JSON.parse('{"games":{"descriptions":{"codegolf":{"easy":"Améliorez votre niveau en résolvant des puzzles d’algorithmique. Faites le code source le plus court possible en utilisant les astuces des langages","expert":"Résolvez ces puzzles très difficiles et faites le code source le plus court possible en utilisant les astuces des langages","hard":"Quel est votre niveau de programmation ? Testez-vous sur ces puzzles difficiles et  et faites le code source le plus court possible en utilisant les astuces des langages","medium":"Découvrez des nouvelles astuces de golf en résolvant ces puzzles niveau moyen"},"bot-programming":"Concevez un bot intelligent pour battre vos adversaires !","optimization":"Tentez d\'obtenir le meilleur score possible, vous obtiendrez un classement et vous pourrez continuer à améliorer votre solution","puzzles":{"easy":"Améliorez votre niveau en résolvant des puzzles d’algorithmique","expert":"Résolvez ces puzzles très difficiles et devenez une légende. Comme Chuck Norris.","hard":"Quel est votre niveau de programmation ? Testez-vous sur ces puzzles difficiles","medium":"Découvrez des nouvelles astuces en résolvant ces puzzles niveau moyen"},"nextContest":"Jouez pour le fun et la gloire"},"done":"Terminé","levels":{"bot-programming":"Combats de Bots","codegolf":"Taille de code","easy":"Puzzle Classique - Facile","expert":"Puzzle Classique - Très difficile","hard":"Puzzle Classique - Difficile","medium":"Puzzle Classique - Moyen","codegolf-easy":"Taille de code - Facile","codegolf-expert":"Taille de code - Très difficile","codegolf-hard":"Taille de code - Difficile","codegolf-medium":"Taille de code - Moyen","multiplayer":"Tous les puzzles multijoueur","optimization":"Optimisation","training":"Tous les puzzles","nextContest":"Prochain Challenge"},"puzzleAchievements":"Succès du puzzle","puzzleOptimScore":"Valeur du critère d\'optimisation","puzzleOptionRank":"Rang","puzzleScore":"Score du puzzle","sections":{"bestSuggestions":"Suggestions","puzzlesComplete":"Fini","puzzlesInProgress":"En cours","puzzlesToStart":"À faire"},"viewAll":"voir tous"}}'),m=t(44679),f=t.n(m);r.component("gamesLevelHeader",{template:f(),bindings:{breadcrumbs:"<",sectionTitle:"<"}}),S.$inject=["$scope","codinGamerService","gameService","$q"],y.$inject=["$scope","gameService","codinGamerService","$q","$rootScope","challengeService"];const h="/";function v(e,s){e.configurePseudoMediaQueries=function(){e.sectionClass=s.findPseudoMediaQuery(o()(".container"))}}function b(e,s){const t={};
1return s.forEach(function(e){t[e.id]=e}),e.map(e=>({...e,...t[e.id]}))}var C=r.config(["$translateProvider",function(e){e.translations("en",g),e.translations("fr",p)}]).component("allGames",{template:u(),controller:y,bindings:{puzzleCategories:"<"}}).component("gamesByLevel",{template:d(),controller:S,bindings:{puzzleCategories:"<",puzzleLevel:"<"}});function y(e,s,t,n,o,l){let i;const a=this;function r(e){return 100===e.progressValue&&i[e.name].index<=10&&(i[e.name].index+=10),e}function c(e,s){return i[e.name].index-i[s.name].index}a.challengeService=l,a.$onInit=function(){const u=a.puzzleCategories;i=u.levels;const z=Object.keys(i);function d(o){const a=z.map(function(e){const t=i[e];return s[t.find](o)});n.all(a).then(function(e){const o=function(e){function s(e){let s=e.puzzlesInProgress.puzzles.slice(0,2),t=4-s.length;return s=s.concat(e.puzzlesToStart.puzzles.slice(0,t)),t=4-s.length,t&&(s=s.concat(e.puzzlesComplete.puzzles.slice(0,t)),t=4-s.length,t&&(s=s.concat(e.puzzlesInProgress.puzzles.slice(2,t+2)))),s}return function(t){const n=function(e){switch(e){case"multi":return"botprogramming";case"optim":return"optimization";case"tutorial":case"codegolf-easy":return"easy";case"codegolf-medium":return"medium";case"codegolf-hard":return"hard";case"codegolf-expert":return"expert";default:return e}}(t.level),o=e.levels[n];return{name:n,translationKey:"games.levels."+o.name,subTitleKey:o.subTitleKey,puzzles:s(t),progressValue:t.progress,viewAllUrl:(l=e.path,i=o.href??o.name,h+(l!==i?l+"/"+i:l))};var l,i}}(u),l=e.map(o).map(r).sort(c);return n.all(l.map(function(e){const n=e.puzzles.map(e=>e.id);return s.findProgressByIds(n,t.loggedUserId).then(s=>{e.puzzles=b(e.puzzles,s)})})).then(()=>l)}).then(s=>{if(e.puzzleSections=s,e.clashOfCodeTileEnabled=u.clashOfCode,e.nextContestTileEnabled=u.nextContest&&l.getVisibleChallengeExists(),!u.clashOfCode){const s=function(e){const s=[];return[e=>100!==e.validatorScore&&!e.communityCreation,e=>100!==e.validatorScore].forEach(t=>{const n=s.map(e=>e.id);e.forEach(e=>{const o=e.puzzles.filter(e=>!n.includes(e.id)).filter(t)[0];o&&s.length<2&&s.push(o)})}),s}(e.puzzleSections);s.length&&(e.bestSuggestions={name:"bestSuggestions",highlight:!0,translationKey:"games.sections.bestSuggestions",puzzles:s})}})}d(!1);const g=o.$on("languageUpdate",function(){d(!0)});e.$on("$destroy",function(){g()}),v(e,s)}}function S(e,s,t,n){const o=this;function l(e){switch(e){case"training":return"practice";case"multiplayer":return"compete";case"codegolf":return"codeGolfPuzzles";default:return e}}o.$onInit=function(){const i=o.puzzleLevel,a=o.puzzleCategories,r=a.levels[function(e){switch(e){case"bot-programming":return"botprogramming";case"codegolf-easy":return"easy";case"codegolf-medium":return"medium";case"codegolf-hard":return"hard";case"codegolf-expert":return"expert";default:return e}}(i)];o.navigationSectionTitle="games.levels."+r.name,o.navigationBreadcrumbs=["bot-programming","codegolf","optimization"].includes(o.puzzleLevel)?[]:[{url:"/"+a.path,name:l(a.path)}],t[r.find]().then(function(o){n.all(["puzzlesToStart","puzzlesComplete","puzzlesInProgress"].map(async function(n){const l=o[n].puzzles.map(e=>e.id);if(e[n]=function(e,s){const t=e[s];return t.translationKey="games.sections."+s,t}(o,n),l.length){const e=o[n].puzzles;return o[n].puzzles=[],t.findProgressByIds(l,s.loggedUserId).then(s=>{o[n].puzzles=b(e,s)})}})).then(()=>{e.puzzlesInProgress.puzzles.length?e.puzzlesInProgress.highlight=!0:e.puzzlesToStart.puzzles.length&&(e.puzzlesToStart.highlight=!0)}),v(e,t)})}}},80114:function(e){e.exports='<div id="games"> <games-level-header breadcrumbs="$ctrl.navigationBreadcrumbs" section-title="$ctrl.navigationSectionTitle"> </games-level-header> <div class="games_wrapper"> <div class="container" cg-resize="configurePseudoMediaQueries()"> <div class="content" ng-class="sectionClass"> <cg-puzzle ng-if="mainPuzzle" puzzle="mainPuzzle" size="\'large\'" class="one-column"> </cg-puzzle> <cg-puzzles-section ng-if="puzzlesInProgress.puzzles.length" section="puzzlesInProgress" section-class="sectionClass"> </cg-puzzles-section> <cg-puzzles-section ng-if="puzzlesToStart.puzzles.length" section="puzzlesToStart" section-class="sectionClass"> </cg-puzzles-section> <cg-puzzles-section ng-if="puzzlesComplete.puzzles.length" section="puzzlesComplete"> </cg-puzzles-section> </div> </div> </div> </div>'},91765:function(e){e.exports=' <div id="games"> <cg-navigation-subtabs></cg-navigation-subtabs> <div class="games_wrapper"> <div class="container" cg-resize="configurePseudoMediaQueries()"> <div class="content all-puzzles" ng-class="sectionClass"> <div class="content-tile-container" ng-if="nextContestTileEnabled || clashOfCodeTileEnabled"> <div ng-if="nextContestTileEnabled" class="content-tile">
1 <cg-puzzle-header new="$ctrl.challengeService.getUnseenChallengeCount() > 0" name="\'games.levels.nextContest\'" sub-title="\'games.descriptions.nextContest\'" href="\'/contests\'"> </cg-puzzle-header> <cg-contests-slideshow class="one-column" small="true" force-display="true"> </cg-contests-slideshow> </div> <div ng-if="clashOfCodeTileEnabled" class="content-tile"> <cg-puzzle-header name="\'clashOfCodeTile.title-clash\'" sub-title="\'clashOfCodeTile.title\'" href="\'/multiplayer/clashofcode\'"> </cg-puzzle-header> <cg-clash-of-code without-title="true" details="true" class="one-column"> </cg-clash-of-code> </div> </div> <cg-puzzles-section ng-if="bestSuggestions" section="bestSuggestions" section-class="sectionClass"> </cg-puzzles-section> <cg-puzzles-section ng-repeat="section in puzzleSections" section="section"> </cg-puzzles-section> </div> </div> </div> </div> '}}]);
2//# sourceMappingURL=games.b5c67da7.js.map

Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.