samklr

require "test/unit"

class World
  def initialize
   @cells = [[false, false, true],
             [false, true, false],
             [false, false, false],
           ]
  end

samklr

public void insert(E value)
      {
          SkipNode<E> x = header;  
          SkipNode<E>[] update = new SkipNode[MAX_LEVEL + 1];
  
          for (int i = level; i >= 0; i--) {

samklr

import spark.SparkContext
import SparkContext._

/**
 * A port of [[http://blog.echen.me/2012/02/09/movie-recommendations-and-more-via-mapreduce-and-scalding/]]
 * to Spark.
 * Uses movie ratings data from MovieLens 100k dataset found at [[http://www.grouplens.org/node/73]]
 */
object MovieSimilarities {

samklr

package com.mansur.scalding

import com.twitter.scalding._
import org.apache.lucene.search.spell._
import org.apache.mahout.common.distance.TanimotoDistanceMeasure
import org.apache.mahout.math.DenseVector
import org.apache.commons.math.util.MathUtils


/**

samklr

samklr

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;


public class Challenge2 {
  List <Arret> arretList = new ArrayList<Arret>();
  

samklr

s maximum pour trouver une solution : 240:00
  
	
La région Loire-Atlantique a décidé d'ouvrir une grande quantité de données publiques.

Parmi celles-ci, la liste des arrêts, horaires et circuits TAN (Transports de l'Agglomération Nantaise). La région veut mettre à disposition des utilisateurs TAN un outil permettant de calculer le chemin le plus court entre deux arrêts en utilisant le réseau TAN.
 

En entrée de votre programme sont fournies les données dont vous avez besoin, au format ASCII :​

samklr

# Skip lists are relatively new comers to the data structures scene (invented in the 90s).
# They differ from most data structures by being probabilistic rather than deterministic.
# 
# Search, insertion and deletion times are expected to be O(log n) with a very high probability.
#
# Skip lists are normal linked lists with additional layers that enable queries to *skip*
# elements. They are much simpler than other O(log n) structures like Red Black Trees
#
# The skip list supports inserting multiple values for the same key. Values will be stored
# in a list attached to that key. Even a single value will be stored in a list

samklr

    public synchronized int read() throws IOException {
      int result = in.read();
      if (result != -1) {
        pos++;
      }
      return result;
    }

samklr

bash-3.2$ elastic-mapreduce --create --name "Sample Recommender" \
>   --jar s3n://temp.cascading.org/sample/recommender.jar \
>     --arg s3n://temp.cascading.org/sample/en.stop \
>     --arg s3n://temp.cascading.org/sample/tweets/ \
>     --arg s3n://temp.cascading.org/sample/out/token \
>     --arg s3n://temp.cascading.org/sample/out/similarity
Created job flow j-2HA2BVCBJGMVX
bash-3.2$ elastic-mapreduce --list
j-2HA2BVCBJGMVX     STARTING                                                         Sample Recommender
   PENDING        Example Jar Step