3. feladat a, b befejezve

fordulo_2/Program/.vs/Program/v17/DocumentLayout.backup.json

@@ -28,7 +28,7 @@
               "RelativeDocumentMoniker": "Jatekos.cs",
               "ToolTip": "E:\\H\u00E1zi\\13.oszt\u00E1ly\\Neumann_Verseny\\fordulo_2\\Program\\Jatekos.cs",
               "RelativeToolTip": "Jatekos.cs",
-              "ViewState": "AgIAAAQAAAAAAAAAAAAiwCcAAAAvAAAAAAAAAA==",
+              "ViewState": "AgIAAAUAAAAAAAAAAAAAABAAAAAPAAAAAAAAAA==",
               "Icon": "ae27a6b0-e345-4288-96df-5eaf394ee369.000738|",
               "WhenOpened": "2025-03-05T17:40:39.379Z",
               "EditorCaption": ""
@@ -41,7 +41,7 @@
               "RelativeDocumentMoniker": "Program.cs",
               "ToolTip": "E:\\H\u00E1zi\\13.oszt\u00E1ly\\Neumann_Verseny\\fordulo_2\\Program\\Program.cs",
               "RelativeToolTip": "Program.cs",
-              "ViewState": "AgIAAM8AAAAAAAAAAAAAAOcAAABHAAAAAAAAAA==",
+              "ViewState": "AgIAAFAAAAAAAAAAAAAuwH4AAAANAAAAAAAAAA==",
               "Icon": "ae27a6b0-e345-4288-96df-5eaf394ee369.000738|",
               "WhenOpened": "2025-03-05T11:40:10.358Z",
               "EditorCaption": ""

fordulo_2/Program/.vs/Program/v17/DocumentLayout.json

@@ -28,7 +28,7 @@
               "RelativeDocumentMoniker": "Jatekos.cs",
               "ToolTip": "E:\\H\u00E1zi\\13.oszt\u00E1ly\\Neumann_Verseny\\fordulo_2\\Program\\Jatekos.cs",
               "RelativeToolTip": "Jatekos.cs",
-              "ViewState": "AgIAAAQAAAAAAAAAAAAiwCcAAAAvAAAAAAAAAA==",
+              "ViewState": "AgIAAAUAAAAAAAAAAAAAABAAAAAPAAAAAAAAAA==",
               "Icon": "ae27a6b0-e345-4288-96df-5eaf394ee369.000738|",
               "WhenOpened": "2025-03-05T17:40:39.379Z",
               "EditorCaption": ""
@@ -41,7 +41,7 @@
               "RelativeDocumentMoniker": "Program.cs",
               "ToolTip": "E:\\H\u00E1zi\\13.oszt\u00E1ly\\Neumann_Verseny\\fordulo_2\\Program\\Program.cs",
               "RelativeToolTip": "Program.cs",
-              "ViewState": "AgIAAOoAAAAAAAAAAADwv/UAAAAQAAAAAAAAAA==",
+              "ViewState": "AgIAAFAAAAAAAAAAAAAuwH4AAAAMAAAAAAAAAA==",
               "Icon": "ae27a6b0-e345-4288-96df-5eaf394ee369.000738|",
               "WhenOpened": "2025-03-05T11:40:10.358Z",
               "EditorCaption": ""

fordulo_2/Program/Jatekos.cs

@@ -38,5 +38,7 @@ namespace Program
 
         public int[] dobasokFull { get; set; }
         public int[] dontesekFull { get; set; }
+
+        public List<int[]> asztalok = new List<int[]>();
     }
 }

fordulo_2/Program/Program.cs

@@ -12,9 +12,164 @@ namespace Program
         static void Main(string[] args)
         {
             //Feladat1();
-            Feladat2();
+            //Feladat2();
+            Feladat3();
         }
 
+        static void Feladat3()
+        {
+            Dictionary<char, int> lookUpTable = new Dictionary<char, int>();
+
+            //csökkentett értékek, mert programozásban ugye nem egytől számolunk
+            lookUpTable.Add('A', 0);
+            lookUpTable.Add('E', 1);
+            lookUpTable.Add('I', 2);
+            lookUpTable.Add('O', 3);
+            lookUpTable.Add('U', 4);
+
+            char[,] tablazat = CreateAlphabetMatrix();
+
+            PrintMatrix(tablazat);
+
+            string path = @"..\..\..\Sources\szoveg.txt";
+            var data = File.ReadAllLines(path);
+
+            List<string> secretWords = new List<string>();
+
+            foreach (var line in data)
+            {
+                var currentWords = line.Split(' ');
+                foreach (var item in currentWords)
+                {
+                    secretWords.Add(item);
+                }
+            }
+
+            List<string> solvedWords = new List<string>();
+
+            bool coordsShouldSwitch = false;
+
+            foreach (var secret in secretWords)
+            {
+                List<char> solvedChars = new List<char>();
+                for (int i = 0; i < secret.Length; i+=2)
+                {
+                    if (coordsShouldSwitch)
+                    {
+                        int row = lookUpTable[secret[i + 1]];
+                        int col = lookUpTable[secret[i]];
+
+                        solvedChars.Add(tablazat[row, col]);
+                    } 
+                    else
+                    {
+                        int row = lookUpTable[secret[i]];
+                        int col = lookUpTable[secret[i + 1]];
+
+                        solvedChars.Add(tablazat[row, col]);
+                    }
+
+                    coordsShouldSwitch = !coordsShouldSwitch;
+                }
+
+                solvedWords.Add(new string(solvedChars.ToArray()));
+            }
+
+            // a feladat
+
+            foreach (var solved in solvedWords)
+            {
+                Console.WriteLine(solved);
+            }
+
+            int indexOfFirstWordWithQInIt = solvedWords.IndexOf(solvedWords.First(x => x.Contains('Q')));
+            int indexOfLastWordWithQInIt = solvedWords.IndexOf(solvedWords.Last(x => x.Contains('Q')));
+
+
+
+            //Console.WriteLine(solvedWords[indexOfFirstWordWithQInIt]);
+            //Console.WriteLine(solvedWords[indexOfLastWordWithQInIt]);
+
+            Console.WriteLine($"A szövegben lévő Q karakteres szavak közötti max távolság: {indexOfLastWordWithQInIt - indexOfFirstWordWithQInIt - 1}");
+
+            // b feladat
+
+            string pathToSzoveg2 = @"..\..\..\Sources\szoveg2.txt";
+            var szoveg2Data = File.ReadAllText(pathToSzoveg2);
+
+            char[] vowelsLookUp = { 'A', 'E', 'I', 'O', 'U' };
+
+            List<char> vowels = new List<char>();
+
+            foreach (char c in szoveg2Data)
+            {
+                if (vowelsLookUp.Contains(c))
+                {
+                    vowels.Add(c);
+                }
+            }
+
+            string feladatBString = new string(vowels.ToArray());
+
+            
+            
+            List<char> solvedCharsForFeladatB = new List<char>();
+            for (int i = 0; i < feladatBString.Length; i += 2)
+            {                
+                int row = lookUpTable[feladatBString[i]];
+                int col = lookUpTable[feladatBString[i + 1]];
+
+                solvedCharsForFeladatB.Add(tablazat[row, col]);
+                
+            }
+
+            Console.WriteLine(new string(solvedCharsForFeladatB.ToArray()));
+            
+            
+
+        }
+
+        static char[,] CreateAlphabetMatrix()
+        {
+            char[,] matrix = new char[5, 5];
+            List<char> alphabet = new List<char>();
+
+            // Add letters A-Z except for 'W'
+            for (char c = 'A'; c <= 'Z'; c++)
+            {
+                if (c != 'W')
+                {
+                    alphabet.Add(c);
+                }
+            }
+
+            // Fill the matrix with the alphabet
+            int index = 0;
+            for (int i = 0; i < 5; i++)
+            {
+                for (int j = 0; j < 5; j++)
+                {
+                    matrix[i, j] = alphabet[index];
+                    index++;
+                }
+            }
+
+            return matrix;
+        }
+
+        static void PrintMatrix(char[,] matrix)
+        {
+            for (int i = 0; i < matrix.GetLength(0); i++)
+            {
+                for (int j = 0; j < matrix.GetLength(1); j++)
+                {
+                    Console.Write(matrix[i, j] + " ");
+                }
+                Console.WriteLine();
+            }
+        }
+
+
         static void Feladat2()
         {
             string path = @"..\..\..\Sources\dobasok.txt";
@@ -224,32 +379,105 @@ namespace Program
             // e feladat
             foreach (var kor in korok)
             {
-                IntArrKiir(kor.dobasokFull);
-                IntArrKiir(kor.dontesekFull);
-                Console.WriteLine("---------");
+                List<int[]> asztalok = new List<int[]>();
+                List<int> currentAsztal = new List<int>();
+                List<int> currentDontesek = new List<int>();
+
+                int iter = 0;
+
+                while (iter < kor.dobasokFull.Length)
+                {
+                    while (currentAsztal.Count != 5)
+                    {
+                        currentAsztal.Add(kor.dobasokFull[iter]);
+                        currentDontesek.Add(kor.dontesekFull[iter]);
+
+                        iter++;
+                    }
+
+                    if (currentAsztal.Count == 5)
+                    {
+                        asztalok.Add(currentAsztal.ToArray());
+                        List<int> tempAsztal = new List<int>(currentAsztal);
+                        List<int> tempDontesek = new List<int>(currentDontesek);
+                        currentAsztal.Clear();
+                        currentDontesek.Clear();
+
+                        for (int i = 0; i < tempAsztal.Count; i++)
+                        {
+                            if (tempDontesek[i] == 1)
+                            {
+                                currentAsztal.Add((int)tempAsztal[i]);
+                                currentDontesek.Add(1);
+                            }
+                        }
+                    }
+                }
+
+                kor.asztalok = asztalok;
             }
 
-            Console.WriteLine(CountPairs(new int[] { 2, 2, 3, 3, 4 }));
+            int pairs = 0;
+
+            foreach (var kor in korok)
+            {
+                foreach (var asztal in kor.asztalok)
+                {
+                    foreach (var item in asztal)
+                    {
+                        Console.Write($"{item} ");
+                    }
+                    Console.WriteLine();
+
+                    pairs += CountPairs(asztal);
+                }
+                Console.WriteLine("-----");
+            }
+
+            Console.WriteLine($"Párok száma: {pairs}");
 
             
         }
 
-
-        static int GetAllPairs(List<int> dobasok, List<int> dontesek)
+        static void PopulateAsztal(Kor kor)
         {
-            int pairs = 0;
+            List<int[]> asztalok = new List<int[]>();
+            List<int> currentAsztal = new List<int>();
+            List<int> currentDontesek = new List<int>();
 
-            List<int> asztalok = new List<int>();
+            int iter = 0;
 
-            foreach (var dobas in dobasok)
+            while (iter != kor.dobasokFull.Length - 1)
             {
-                
+                while (currentAsztal.Count != 5)
+                {
+                    currentAsztal.Add(kor.dobasokFull[iter]);
+                    currentDontesek.Add(kor.dontesekFull[iter]);
+
+                    iter++;
+                }
+
+                if (currentAsztal.Count == 5)
+                {
+                    asztalok.Add(currentAsztal.ToArray());
+                    List<int> tempAsztal = currentAsztal;
+                    List<int> tempDontesek = currentDontesek;
+                    currentAsztal.Clear();
+                    currentDontesek.Clear();
+
+                    for (int i = 0; i < tempAsztal.Count; i++)
+                    {
+                        if (tempDontesek[i] == 1)
+                        {
+                            currentAsztal.Add((int)tempAsztal[i]);
+                            currentDontesek.Add(1);
+                        }
+                    }
+                }
             }
-
-
-            return pairs;
         }
 
+
         static int CountPairs(int[] dobasok)
         {
             int pairs = 0;

fordulo_2/Sources/szoveg.txt

@@ -0,0 +1,34 @@
+IEUIOIUAII OEOAOOUAII AOUIIEUIOI OOEOOU AAIIAUOU AIUIIOOOAUIAOUUAOUAUOI AAAOOEOAOEOOIAEOOIEE UAIEOEOU OIUAOIAI
+EAEOEAAUOIAOAUII IIIUEIAUOOOUOEAU EIEOEEUAEIAA OIIUOI UEOEUEUAOIIOAA IIEO IEAUOIAOIOAUIOEOOU AIUIIOOAEOIIAUOIOUAUII
+IAEOOOOUUA OUOEIOIAEOOAUAOIOU EUAUEIEOOU AUEEAUOOOUAAOO AAAIIAUAIIOOAAIO OOAAAOEOUAIO AUOU EEOIAAUEOEAOAA IEUAAIOUUAOO
+EOOIOUUAOIOAUAII AUOU IIAAIEUAOOAUAAOAAA AEAAIIAUOO AAIA AAOIOUUA EOAOOOAUII AOOIOEIIOEOO OEIO AEAAAUAIOEAEAUOO
+UAOUOEAAII AUEIAUOEEAUAIOOA IEOEEEAUIEAA AUOU EAUAIEOEOO AAIEOEOEAUAUOU AAAUAIOUIUIO AA AAAI OIAUOOOUUA AIEIAAOOOO
+AAOAOUAUOIOU OUAAIAEOOUEO OOIUIAEOUIOOUI AAOA IEOEOUUIOIAA OUUIOIEEUAUAIOOU OAUAOI IAIUOIUAEAEOAA IOUIOOOUOIAA OAUAOI
+OEIOIAAUAOOUUIOO IEEOIIAUOIAAUAIUOO AIAUOIAAAEOEOUAUOI EEOIAAUEOEAOAA AIUIIIIIIUOAIU OAEOAAII OEAO EUAUOIAUOIAAOUEOOO
+IOAUIEEIAA AAAIIAUAIIOOAAIO UAEEUAOU EUEOEUAAIIUAOO EAUAOIIIAUOIOUAUII OOAUII OOUAAO UAIOOEII AEAAAUAIOEAEAUOO AAOU
+OOAUIIOAUAOI AAUAEEUAUA AAEIEOIAOUUAOU OOAUOA AUEEAUOOOUAAOO OUUAAAII OIAUIA OUUAIEEIUAOO IEAUAIOUUAOO AAAUAIOUIUIO
+IIUIOIEAEO OEIOOUAUIOAOAUII AOAUEIIEUAIOOUAUOOAIUA AUOOOU EUEOOUAAUA EAAAUAIAEOEAUAOO AUIU OIIEIUOIAIAUOO UAEEUAOU
+OIAAII AUEIAUIIAUOIOUAUII UAIOOEII IAIUOIAOOEIIUAIOOUUAII AAIAAIAUIIOOAAOI IOUAOIAUAU AUOU OUEOOIAIOEAOAUIOOU IEUAIU
+OEIO AAOIIAUA OIUAEIIEAA OAUIOIOUAA OIAUIA AUOIEOII UEUAIE UAUAOEOOIIIUOA UEUIIEAUOUAOAAOU OAAUOIAUOO AOOIAAAUOOAUOIOU
+UIOIOIAAIOAU OIEOOOEO AA IOOEAEIE OOUIAOAAIEUAOO OOAUIIOAUAOI OEIOOUAUEEAUIO EIUAIOOAOIUAOIOEOU OIAUIA AUEIEOOU
+EOAAAIAUIEOEOO AEAAIAEOEIEOOOEOOO EAAUOOIAAU UAIEUAIIUAIOOUUAII UAIOIOAA IOUIIO OOAAAOEOUAIO UAEAAEEOIAEOOUUAIO
+IEAAIUIOAUUAOU OUEOOIAIOEAOAUIOOU IEUIOIUAII AAIEOEAIOUAUOU EAAUOOIAAU IIAAAUOIOEOO OOAUII OOAAEEOEOUOUEOOO OOUAAO
+UAEAAEEOIAEOOUUAIO UAOU IIAAOUOUEOOO UAOU AUIU IIUIOIEAEO AEAAAUAIOEAEAUOO OAIUEIIUIO EOOA UAEIOUIOEOIAEOUAOO
+OEAAIAUAEIEOOO IEOEEEAUIEAA OAAUOIAUOO IIIUEIAUOOOUOEAU AAIOOUAU OIAUIA OUOEIOIAEOOAUAOIOU IIAUOUUAOO IEUIOIUAII
+OEIO OUAUEIIEAUOO AEUAOOAIUA UEOEOUAAAU EIIUIOAUII EAOEIOOEAEAUOO EUAAIOEOAUOO UAIEOEOU UAEEUAOU IIAAIUEOIIUAOO
+IOOEOOOE IIUIOIEAEO OEIIAOAUIOAOOEAUOU IEUAIU UAEEUAOU EIAUIAOUAUOO EAEOEAAUOIAOAUII AEAUAUEEOEAAOU OOOEOU AAIIUAOU
+UAOU UIOIIAEO OOUAOOOAUAIOOAEOOOOOUA OAIOAUOUEOAUII EUAAIOEOAUOO AOEIAAOIUAOUIOAA AAAUOIAUAAIO OEIOOUAUIOAOAUII
+OOUAOOAIOEOAOEOU UEUAOOOUUI AA AUIEOUOIOEAIOEAUOO AAAUEEAUAU IEAUOIAOIOAUIOEOOU AAIA IOAUIEEIAA AEAAIAEOEIEOOOEO
+AUOU AOUAEIUEOEIOAAOI UAOIAAOU OIIUOI IIAAUAIOEOOO OOUIAOAAIEUAOO OUAUIIOAAUOO AAIEOEAIOUAAII UEOEOUAAAU
+EUAUOOOUOEAEAUIEAUII AAUAEEUAUA AIAUOIAAAEOEOUAUOI UAUA IIAAAUOIOEOO AEAUIOIIUAIOOUUAII IIAAOUOUEOOO AOOEAAII
+UEUAIE EUAUOOOUOEAEAUIEAUII UAOOOU IOAUIEEIAAII OAEIAAIAAUIOAAOU AUOU IOOEOOOE OOUAAO UAIEUAIIUAIOOUUAII
+OAIOAAUAOOUAIOOU UEUIIEAUOUAOAAOU IOOEOOOE AAOU IOOEAEIE UEUAIOUAIOAAOUOEOO UAIEUAIIUAIOOUUAII IIUIOIEAEO
+EUAUEI OAIOAUOUEOAUII EIAAIAUAOO OOUAAO OEIO AUIEEIAAIIAIUIOIAOAUIO IEAAAIAUOO UAOUOEAAII AAIA AOAAOAOEAEAUOO
+AEAUEIEOOO IOAAII OOAAEEEOOUOUOEOO IOUAOUOIAUII AAOIIAUA OOAUOA AEEIAAOIAOOEOU AOUAIOUAOO AAIAAIAUIIOOAAOI
+EAAAUAIAEOEAUAOO UEUAOOOUEOEAUAEIUAII AUAU OUUAIEEIUAOO AUAU OEAUAAII EEIOAAEUEOOAAA EUUAEIOAAUOUAAOUUA EOOA
+AEEIAAOIAOOEOU EIAAIAUAOO IIAAAUIAAUOIAAOO AUAU AAOIOUUA UAOU IEAAAIAUOO AOUAEIUEOEIOAAOI AOUAEIUEOEIOAAOI
+OIIUOI OOUAAO IIAUOUUAOO EOOI OOUAAO IOEOOOUAOO AUIOAAOU OAIOAAUAOOUAIOOU IEUAIU OEOAOOUAII OUUAIIAOUAOO AAOU
+IIOE AUEEAUOU EOOIOUUAOIOAUAII IUIOIOAAOIUA IEOEEEAUIEAA AOUIIOUAAI OAEOIAOUAUII UIAOOEIU OEAO AUIEEIAAIIAIUIOIAOAUIO
+AOOEEEOIEOOOOOOEII OIAAII EOOI IEOEAEUAOIUI UEUAIOUAIOAAOUOEOO AEAAIAEOEIEOOOEOOO OIOEOOAUOO EUEOOUAAUA IIAAOUOUEOOO
+IEOEEEAUIEAA AOUIIOUAAI UAEEUAOU OUAUEIIEAUOO OEAAIAUAEIEOOO AOOEAIOUUAII IIOE OAUIOIOUOUOEOUUIOI AOIUOOUAUAOIUA
+IEOEAEUAOIUI

fordulo_2/Sources/szoveg2.txt

@@ -0,0 +1 @@
+ITT ALUDT, AKI ELADOTT EGY UBORKAGYALUT. ITTHON CSUCSULOK. U.

fordulo_2/lorem.txt

@@ -0,0 +1,309 @@
+LOREM
+IPSUM
+DOLOR
+SIY
+AMEY
+CONSECTETUR
+ADIPISCING
+ELIT
+NUNC
+BIBENDUM
+MOLESTIE
+LIGULA
+NON
+VIVERRA
+MI
+HENDRERIY
+CONDIMENTUM
+CISTE
+TINCIDUNT
+VELIY
+EGESTAS
+ACCUMSAN
+SAPIEN
+UT
+GRAVIDA
+LECYUS
+INTERDUM
+EY
+MALESUADA
+FAMES
+AC
+ANTE
+IPSUM
+PRIMIS
+IN
+FAUCIBUS
+ETIAM
+ELEIFEND
+LIGULA
+EY
+FELIS
+ALIQUEY
+AUCYOR
+A
+AC
+NESTE
+CLASS
+APYENT
+YACIYI
+SOCIOSO
+AD
+LITORA
+TORGUENY
+PER
+CONUBIA
+NOSYRA
+PER
+INCEPTOS
+HIMENAEOS
+CURABITUR
+GRAVIDA
+COMMODO
+DIAM
+ID
+VENENAYIS
+NULLA
+ACCUMSAN
+EGET
+VIVAMUS
+FERMENTUM
+SEM
+SED
+ENIM
+FAUCIBUS
+AT
+SEMPER
+AUGUE
+ALICTET
+SED
+EGESTAS
+YUAM
+NEC
+TELLUS
+LUCYUS
+AUCYOR
+MORBI
+INYERDUM
+PELLENYESCE
+EST
+VIYAE
+FAUCIBUS
+EX
+RHONCUS
+EGET
+NAM
+ELEMENTUM
+ENIM
+CONDIMENYUM
+ACCUMSAN
+NERUE
+UT
+YINCIDUNY
+LEO
+IN
+ARCU
+NULLA
+PORYA
+NEC
+ENIM
+VEL
+EUISMOD
+VOLUTPAY
+PURUS
+PRAESENT
+ORNARE
+NISI
+A
+NIBH
+SODALES
+SEMPER
+INYEGER
+HENDRERIT
+NEC
+ELIY
+IACULIS
+FACILISIS
+FUSCE
+ELEMENYUM
+URNA
+NON
+SAPIEN
+EFFICIYUR
+LAOREET
+YINCIDUNY
+LOREM
+ALICYEY
+FUSCE
+MAURIS
+SEM
+SAGITYIS
+SED
+EFFICIYUR
+UY
+MATYIS
+UY
+EX
+MORBI
+FAUCIBUS
+DOLOR
+ID
+ULTRICIES
+IACULIS
+LIGULA
+PURUS
+MOLESTIE
+ANYE
+NEC
+TINCIDUNT
+MEYUS
+LOREM
+IN
+YELLUS
+FUSCE
+VITAE
+LOREM
+FINIBUS
+VARIUS
+ELIT
+EGET
+MAXIMUS
+NISI
+MORBI
+IMPERDIEY
+LEO
+EGET
+LECTUS
+BIBENDUM
+FEUGIAY
+SIT
+AMET
+ET
+ORCI
+SUSPENDISSE
+PREYIUM
+VARIUS
+PHARETRA
+AENEAN
+INYERDUM
+SUSCIPIT
+JUSTO
+A
+ULYRICIES
+AUGUE
+HENDRERIY
+AC
+NULLA
+FACILISI
+UT
+PULVINAR
+ERAT
+NON
+MAURIS
+SODALES
+YEMPUS
+ALICYAM
+VITAE
+VESTIBULUM
+AUGUE
+CURABITUR
+EU
+MAURIS
+FERMENYUM
+MATYIS
+DIAM
+VEL
+VESTIBULUM
+ESY
+NULLAM
+PLACERAY
+EY
+NISI
+SED
+ELEMENYUM
+PRAESENY
+VOLUTPAY
+NISI
+AY
+NIBH
+VENENATIS
+ELEMENYUM
+MORBI
+VEL
+PREYIUM
+LACUS
+SED
+IN
+ULLAMCORPER
+LACUS
+ETIAM
+AC
+DAPIBUS
+FELIS
+NAM
+SAGIYTIS
+RUYRUM
+ARCU
+SED
+BLANDIT
+PURUS
+ACCUMSAN
+FAUCIBUS
+VESYIBULUM
+EU
+TELLUS
+EU
+QUAM
+GRAVIDA
+VULPUTATE
+ID
+BLANDIT
+LACUS
+MAECENAS
+EU
+ANTE
+UY
+LACUS
+PULVINAR
+PULVINAR
+NON
+SED
+MEYUS
+IN
+SED
+RISUS
+ERAY
+PRAESENY
+LEO
+IPSUM
+TEMPUS
+AY
+MI
+EGEY
+INTERDUM
+ORNARE
+LIGULA
+DONEC
+DICTUM
+ODIO
+ID
+ULLAMCORPER
+DIGNISSIM
+NAM
+IN
+LIBERO
+VENENATIS
+FACILISIS
+RISUS
+VIYAE
+MATYIS
+LIGULA
+DONEC
+EGET
+YELLUS
+IACULIS
+DICYUM
+MI
+PORYTITOR
+POSUERE
+LIBERO

megoldasok.md

@@ -28,11 +28,11 @@
 ### 2. feladat
 - a: `14`
 - b: `alfa`
-- c: `1`
-- d: ``
-- e: ``
+- c: `6`
+- d: `4`
+- e: `98`
 
 ### 3. feladat
-- a: ``
-- b: ``
+- a: `213`
+- b: `KULDJPENZT`
 - c: ``