← Playground

Update AdventOfCode26.cpp

f82cc36422d760fb574bc5f0bdfcc9425a8c8ddd · darakna · Jan 16, 2016 18:25

+8 −34 · 1 file changed

• AdventOfCode26.cpp +8 −34

diff --git a/AdventOfCode26.cpp b/AdventOfCode26.cpp
index 6dded3e..5ae5865 100644
--- a/AdventOfCode26.cpp
+++ b/AdventOfCode26.cpp
@@ -4,47 +4,21 @@
 #include "stdafx.h"
 #include<iostream>
 #include<cstdint> // for int64_t
-#include <algorithm> // for std::find
-#include <iterator> // for std::begin, std::end
 
-void temp()
-{
-	for (int64_t i = 0; i <= 6; i++)
-	{
-		for (int64_t j = 0; j <= i; j++)
-		{
-			std::cout << "next" << " ";
-			//next++;
-		}
-		std::cout << std::endl;
-	}
-}
-int64_t find_position(int64_t *array, int64_t size_arr, int64_t value)
-{
-	std::cout << "In ";
-	for (int64_t i = 0; i < size_arr; i++)
-	{
-		if (array[i] == value)return i;
-	}
-	return -1;
-}
+
 int main()
 {
-	int64_t start = 20151125, multiply = 252533, divisor = 33554393, next = 0, lines, columns;
-	int64_t pos = 0;
-	int64_t* numbers = new int64_t[33554394];
-	memset(numbers, 0, 33554394*sizeof(int64_t));
-	numbers[0] = 20151125;
-	for (int64_t i = 1; i < divisor; i++)
+	int64_t start = 20151125, multiply = 252533, divisor = 33554393, next = 0, lines = 2947, columns = 3029, ord = 0;
+
+	ord = ((lines + columns-2)*(lines + columns-1))/2 + columns-1;
+	next = start;
+	for (int64_t i = 1; i <= ord; i++)
 	{
-		next = numbers[i - 1];
 		next = next * multiply;
 		next = next % divisor;
-		pos = find_position(numbers, i, next);
-		if(pos!= -1)std::cout << pos << std::endl;
-		numbers[i] = next;
-	}
 
+	}
+	std::cout << next << std::endl;
 
     return 0;
 }