view 2017/day06/app.d @ 33:bc652fa0a645

Move all solutions to per-day subdirs
author Jordi Gutiérrez Hermoso <jordigh@octave.org>
date Tue, 09 Jan 2018 21:50:37 -0500
parents 2017/day06.d@94a2bb2aad6a
children
line wrap: on
line source

import std.algorithm: map;
import std.conv: to;
import std.array: array;
import std.range: enumerate;
import std.stdio;
import std.algorithm: maxElement;

auto redistribute(numType)(numType[] membank) {
  auto max = membank.enumerate.maxElement!"a.value";
  membank[max.index] = 0;
  for(auto idx = 0; idx < max.value; idx++) {
    auto circ_idx = (max.index + idx + 1) % membank.length;
    membank[circ_idx]++;
  }
  return membank;
}

auto waitForDupe(numType)(numType[] membank) {
  numType steps = 1;
  auto seen = [membank.idup: steps];
  writeln(membank);
  while( membank.redistribute !in seen) {
    seen[membank.idup] = steps;
    steps++;
  }

  return [steps, steps - seen[membank]];
}

void main(string[] args) {
  auto membank = args[1..$].map!(to!int).array;
  writeln(waitForDupe(membank));
}