<commit_before>{
 "metadata": {
  "name": "",
  "signature": "sha256:ee8dc09c03ec1ddaf60bbf8a777dd5616132d3ad247add5227bdea5ccdfd7582"
 },
 "nbformat": 3,
 "nbformat_minor": 0,
 "worksheets": [
  {
   "cells": [
    {
     "cell_type": "heading",
     "level": 1,
     "metadata": {},
     "source": [
      "TD 4B : Code Jam (correction)"
     ]
    },
    {
     "cell_type": "markdown",
     "metadata": {},
     "source": [
      "**Plan**\n",
      "\n",
      "* [Probl\u00e8me de recouvrement](#recouv)\n",
      "* [D\u00e9coupage intelligent d'une base de donn\u00e9es](#decoup)"
     ]
    },
    {
     "cell_type": "markdown",
     "metadata": {},
     "source": [
      "<h3 id=\"recouv\">Probl\u00e8me de recouvrement</h3>"
     ]
    },
    {
     "cell_type": "markdown",
     "metadata": {},
     "source": [
      "Le probl\u00e8me est tir\u00e9 de [Google Jam 2008, round 1A](https://code.google.com/codejam/contest/32016/dashboard#s=p0).\n",
      "\n",
      "On consid\u00e8re deux tableaux $v=(v_1,..., v_n)$ et $w=(w_1,...,w_n)$. On souhaite le minimum : $$\\min_{\\sigma,\\sigma'} \\sum_{i=1}^{n} v_{\\sigma(i)} w_{\\sigma'(i)}$$ o\u00f9 $\\sigma,\\sigma'$ sont deux permutations de l'ensemble $[[1,...,n]]$.\n",
      "\n",
      "**Premi\u00e8re solution :**\n",
      "\n",
      "Elle est inspir\u00e9 de la [distance d'\u00e9dition](http://fr.wikipedia.org/wiki/Distance_de_Levenshtein). Si on doit recouvrir l'ensemble des entiers $[[0,n]]$$, on passe en revue tous les intervalles qui inclut 0. On construit deux tableaux :\n",
      "\n",<commit_msg>documentation<commit_after>{
 "metadata": {
  "name": "",
  "signature": "sha256:6b2a31c0423b0b2adc93e2858f2921353b44bdd1e8ecaf25bd69635065d63f01"
 },
 "nbformat": 3,
 "nbformat_minor": 0,
 "worksheets": [
  {
   "cells": [
    {
     "cell_type": "heading",
     "level": 1,
     "metadata": {},
     "source": [
      "TD 4B : Code Jam (correction)"
     ]
    },
    {
     "cell_type": "markdown",
     "metadata": {},
     "source": [
      "**Plan**\n",
      "\n",
      "* [Probl\u00e8me de recouvrement](#recouv)\n",
      "* [D\u00e9coupage intelligent d'une base de donn\u00e9es](#decoup)"
     ]
    },
    {
     "cell_type": "markdown",
     "metadata": {},
     "source": [
      "<h3 id=\"recouv\">Probl\u00e8me de recouvrement</h3>"
     ]
    },
    {
     "cell_type": "markdown",
     "metadata": {},
     "source": [
      "Le probl\u00e8me est tir\u00e9 de [Google Jam 2008, round 1A](https://code.google.com/codejam/contest/32016/dashboard#s=p0).\n",
      "\n",
      "On consid\u00e8re deux tableaux $v=(v_1,..., v_n)$ et $w=(w_1,...,w_n)$. On souhaite le minimum : $$\\min_{\\sigma,\\sigma'} \\sum_{i=1}^{n} v_{\\sigma(i)} w_{\\sigma'(i)}$$ o\u00f9 $\\sigma,\\sigma'$ sont deux permutations de l'ensemble $[[1,...,n]]$.\n",
      "\n",
      "**Premi\u00e8re solution :**\n",
      "\n",
      "Elle est inspir\u00e9 de la [distance d'\u00e9dition](http://fr.wikipedia.org/wiki/Distance_de_Levenshtein). Si on doit recouvrir l'ensemble des entiers $[[0,n]]$, on passe en revue tous les intervalles qui inclut 0. On construit deux tableaux :\n",
      "\n",
{'fraction_non_alphanumeric': 0.21200631911532386, 'fraction_numerical': 0.06034755134281201, 'mean_word_length': 2.7467455621301777, 'pattern_counts': {'":': 40, '<': 7, '<?xml version=': 0, '>': 7, 'https://': 2, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '3133634', 'n_tokens_mistral': 1385, 'n_tokens_neox': 1259, 'n_words': 239}