Program.cs 2.9 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
  1. using System;
  2. using System.IO;
  3. using System.Linq;
  4. using System.Text;
  5. namespace D18._1
  6. {
  7. class Program
  8. {
  9. static void Main(string[] args)
  10. {
  11. const int len = 100;
  12. string input = ParseFile(args[0]);
  13. for (int i = 0; i < 100; ++i)
  14. input = Step(len, input);
  15. int litOn = input.Count(c => c == '#');
  16. Console.WriteLine($"The answer is : {litOn}");
  17. }
  18. private static string ParseFile(string arg)
  19. {
  20. var sb = new StringBuilder();
  21. using (var file = File.OpenText(arg))
  22. {
  23. while (true)
  24. {
  25. var line = file.ReadLine();
  26. if (line == null) break;
  27. sb.Append(line);
  28. }
  29. }
  30. string input = sb.ToString();
  31. return input;
  32. }
  33. private static string Step(int len, string input)
  34. {
  35. int edgeDetector = 0;
  36. int totalSize = len * len;
  37. int lastLineDetector = len * (len - 1);
  38. int lastColumn = len - 1;
  39. var stepb = new StringBuilder();
  40. for (int i = 0; i < totalSize; ++i)
  41. {
  42. char state = input[i];
  43. char nstate = state;
  44. int onNeighbors = DetectNeoghbors(len, input, edgeDetector, lastLineDetector, lastColumn, i);
  45. if (state == '#')
  46. {
  47. if (onNeighbors != 2 && onNeighbors != 3) nstate = '.';
  48. }
  49. else
  50. {
  51. if (onNeighbors == 3) nstate = '#';
  52. }
  53. stepb.Append(nstate);
  54. edgeDetector = edgeDetector == lastColumn ? 0 : edgeDetector + 1;
  55. }
  56. return stepb.ToString();
  57. }
  58. private static int DetectNeoghbors(int len, string input, int edgeDetector, int lastLineDetector, int lastColumn, int i)
  59. {
  60. int onNeighbors = 0;
  61. bool onFirstLine = i < len;
  62. bool onLastLine = i >= lastLineDetector;
  63. if (edgeDetector > 0) onNeighbors += input[i - 1] == '#' ? 1 : 0;
  64. if (edgeDetector < lastColumn) onNeighbors += input[i + 1] == '#' ? 1 : 0;
  65. if (onFirstLine == false) onNeighbors += input[i - len] == '#' ? 1 : 0;
  66. if (onLastLine == false) onNeighbors += input[i + len] == '#' ? 1 : 0;
  67. if (onFirstLine == false && edgeDetector > 0) onNeighbors += input[i - len - 1] == '#' ? 1 : 0;
  68. if (onFirstLine == false && edgeDetector < lastColumn) onNeighbors += input[i - len + 1] == '#' ? 1 : 0;
  69. if (onLastLine == false && edgeDetector > 0) onNeighbors += input[i + len - 1] == '#' ? 1 : 0;
  70. if (onLastLine == false && edgeDetector < lastColumn) onNeighbors += input[i + len + 1] == '#' ? 1 : 0;
  71. return onNeighbors;
  72. }
  73. }
  74. }