logo

adventofcode

Code used to solve https://adventofcode.com/, one branch per year git clone https://hacktivis.me/git/adventofcode.git

day3.1.ha (1484B)

    

  1. // SPDX-FileCopyrightText: 2022 Haelwenn (lanodan) Monnier <contact+adventofcode@hacktivis.me>
  2. // SPDX-License-Identifier: BSD-3-Clause
  4. use bufio;
  5. use os;
  6. use io;
  7. use fmt;
  8. use strings;
  9. use ascii;
  11. fn getline() ([]u8 | void) = {
  12. 	return match(bufio::scanline(os::stdin)) {
  13. 	case let l: []u8 =>
  14. 		yield l;
  15. 	case io::EOF =>
  16. 		yield void;
  17. 	case let e: io::error =>
  18. 		fmt::fatal("day3.1: {}", io::strerror(e));
  19. 	};
  20. };
  22. export fn main() void = {
  23. 	let scores: []u32 = [];
  25. 	for(true) {
  26. 		let line1 = match(getline()) {
  27. 		case let l: []u8 => yield strings::fromutf8(l);
  28. 		case => break;
  29. 		};
  30. 		let line2 = match(getline()) {
  31. 		case let l: []u8 => yield strings::fromutf8(l);
  32. 		case => break;
  33. 		};
  34. 		let line3 = match(getline()) {
  35. 		case let l: []u8 => yield strings::fromutf8(l);
  36. 		case => break;
  37. 		};
  39. 		let i = strings::iter(line1);
  40. 		let common = ' ': rune;
  41. 		for(true) {
  42. 			let dup = match(strings::next(&i)) {
  43. 			case let r: rune => yield r;
  44. 			case void => break;
  45. 			};
  47. 			if(strings::contains(line2, dup)) {
  48. 				if(strings::contains(line3, dup)) {
  49. 					common = dup;
  50. 					break;
  51. 				};
  52. 			};
  53. 		};
  55. 		let score = if(ascii::islower(common)) {
  56. 			yield (common: u32)-('a': u32)+1;
  57. 		} else {
  58. 			yield (common: u32)-('A': u32)+27;
  59. 		};
  61. 		let common = strings::fromrunes([common]);
  63. 		fmt::printfln("{}, {}", common, score)!;
  65. 		append(scores, score);
  66. 	};
  68. 	let final = 0u32;
  69. 	for(let i = 0z; i < len(scores); i += 1) {
  70. 		final += scores[i];
  71. 	};
  73. 	fmt::printfln("Score: {}", final)!;
  74. };