From 0ac9224655469a99a367869e9a36c39a44c72cb6 Mon Sep 17 00:00:00 2001 From: sijanec Date: Mon, 7 Dec 2020 00:29:25 +0100 Subject: =?UTF-8?q?nekaj=20=C4=87aral=20pri=20eulerju,=20ampak=20prete?= =?UTF-8?q?=C5=BEko..=20ju3?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- mat/euler/14/Makefile | 2 ++ mat/euler/14/a.out | Bin 0 -> 8432 bytes mat/euler/14/prog.c | 29 +++++++++++++++++++++++++++++ 3 files changed, 31 insertions(+) create mode 100644 mat/euler/14/Makefile create mode 100755 mat/euler/14/a.out create mode 100644 mat/euler/14/prog.c (limited to 'mat/euler/14') diff --git a/mat/euler/14/Makefile b/mat/euler/14/Makefile new file mode 100644 index 0000000..2def8af --- /dev/null +++ b/mat/euler/14/Makefile @@ -0,0 +1,2 @@ +default: + gcc prog.c diff --git a/mat/euler/14/a.out b/mat/euler/14/a.out new file mode 100755 index 0000000..8a10ce9 Binary files /dev/null and b/mat/euler/14/a.out differ diff --git a/mat/euler/14/prog.c b/mat/euler/14/prog.c new file mode 100644 index 0000000..bb0daf6 --- /dev/null +++ b/mat/euler/14/prog.c @@ -0,0 +1,29 @@ +#include +#include +#define COLLATZ(n) n % 2 == 0 ? n / 2 : 3 * n + 1 +int main (int argc, char ** argv) { + if (argc != 1+1) { + fprintf(stderr, "uporaba: %s \nprimer-najd. collatzova veriga pod zač. 1M: %s 1000000\n", argv[0], argv[0]); + return 1; + } + unsigned long int n = strtol(argv[1], NULL, 10); + unsigned long int c = 0; // števeC + unsigned long int a = 0; // verigA + unsigned long int m = 0; // maksimalna dolžina verige + unsigned long int z = 0; // trenutna Zmagovalna številka z najdaljšo verigo + for (; n >= 1; n--) { + // fprintf(stderr, "\rračunam... potrebnih še %lu iteracij.", n); // botlnck + a = n; + c = 1; + while (a != 1) { + a = COLLATZ(a); + c++; + } + if (c > m) { + m = c; + z = n; + } + } + fprintf(stdout, "\rkonec. najdaljša veriga se začne z %lu in ima %lu elementov.\n", z, m); + return 0; +} -- cgit v1.2.3