Dodanie D-Task

TaskD01/description.txt

@@ -0,0 +1,5 @@
+Write a program to find lines containing the word "Hamlet".
+Do use regular expressions.
+
+POINTS: 1
+DEADLINE: 2023-11-26 23:59:59

TaskD01/run.py

@@ -0,0 +1,13 @@
+import re
+import sys
+
+found_lines = []
+
+
+for line in sys.stdin:
+    if re.search(r'\bHamlet\b', line):
+        found_lines.append(line.strip())
+
+
+if found_lines:
+    print('\n'.join(found_lines), end='')

TaskD01/simple.exp

@@ -0,0 +1,2 @@
+Here comes Hamlet
+Hamlet Hamlet again

TaskD01/simple.in

@@ -0,0 +1,3 @@
+Here comes Hamlet
+ABC
+Hamlet Hamlet again

TaskD01/simple.out

@@ -0,0 +1,2 @@
+Here comes Hamlet
+Hamlet Hamlet again

TaskD02/description.txt

@@ -0,0 +1,7 @@
+Write a program to find lines containing the word "pies" separated by spaces.
+The word does not need to have space on the left if it is the line beginning or space on the right if it is line ending.
+Return line no matter of word "pies" casing.
+Do use regular expressions.
+
+POINTS: 1
+DEADLINE: 2023-11-26 23:59:59

TaskD02/run.py

@@ -0,0 +1,13 @@
+import re
+import sys
+
+found_lines = []
+
+for line in sys.stdin:
+    if re.search(r'\b\s*pies\s*\b', line, flags=re.IGNORECASE):
+        found_lines.append(line.strip())
+
+
+if found_lines:
+    print('\n'.join(found_lines), end='')
+

TaskD02/simple.exp

@@ -0,0 +1,3 @@
+Pies ma Ale
+Kot i pies to zwierzeta
+pies

TaskD02/simple.in

@@ -0,0 +1,5 @@
+Pies ma Ale
+Ala ma psa
+tu nic nie ma
+Kot i pies to zwierzeta
+pies

TaskD02/simple.out

@@ -0,0 +1,3 @@
+Pies ma Ale
+Kot i pies to zwierzeta
+pies

TaskD03/description.txt

@@ -0,0 +1,6 @@
+Write a program to find lines containing date from 1900 to 1999 in format '19XX r.' no matter what on the left or right of the expression.
+Note that part ' r.' is obligatory.
+Do use regular expressions.
+
+POINTS: 1
+DEADLINE: 2023-11-26 23:59:59

TaskD03/run.py

@@ -0,0 +1,14 @@
+import re
+import sys
+
+
+found_lines = []
+
+for line in sys.stdin:
+    if re.search(r'\b19\d{2}\s*r\.\b|\b\W19\d{2}\s*r\.\b|\b19\d{2}\s*r\.\W', line, flags=re.IGNORECASE):
+        found_lines.append(line.strip())
+
+
+if found_lines:
+    print('\n'.join(found_lines), end='')
+

TaskD03/simple.exp

@@ -0,0 +1,3 @@
+Kiedys byl 1934 r.
+Kiedys byl 1934 r.fsdfsdfsdf
+1934 r. to jakas data

TaskD03/simple.in

@@ -0,0 +1,5 @@
+Kiedys byl 1934 r.
+Kiedys byl 1934 r.fsdfsdfsdf
+Kiedys byl 1935 rok
+1934 r. to jakas data
+1934  to tez jakas data

TaskD03/simple.out

@@ -0,0 +1,3 @@
+Kiedys byl 1934 r.
+Kiedys byl 1934 r.fsdfsdfsdf
+1934 r. to jakas data

TaskD04/description.txt

@@ -0,0 +1,6 @@
+Write a program to find all maximum substrings of digits.
+Return only these substrings separated by spaces in their order.
+Do use regular expressions.
+
+POINTS: 2
+DEADLINE: 2023-11-26 23:59:59

TaskD04/run.py

@@ -0,0 +1,21 @@
+import re
+import sys
+
+def remove_non_digits(line):
+    
+    return re.sub(r'[^0-9\s]', '', line)
+
+
+processed_lines = []
+
+for line in sys.stdin:
+    processed_line = remove_non_digits(line)
+    processed_line = re.sub(r'^\s+|\s+$', '', processed_line)
+    processed_line = re.sub(r'\s+', ' ', processed_line)
+
+    digit_groups = re.findall(r'\d+', processed_line)
+    
+    if digit_groups:
+        processed_lines.append(' '.join(digit_groups))
+
+print('\n'.join(processed_lines), end='')

TaskD04/simple.exp

@@ -0,0 +1,4 @@
+34234 34 5
+34535
+34
+1992 1999

TaskD04/simple.in

@@ -0,0 +1,5 @@
+34234 34 dfd gfd 5
+34535
+fsdflskfjsdflk
+fsdkfj sdf34fdfd
+The company was established in 1992 from the merger of Authorware, Inc. (creators of the Authorware package) and MacroMind-Paracomp (producer of Macromind Director). In 1999, Macromedia purchased Allaire and its bi

TaskD04/simple.out

@@ -0,0 +1,4 @@
+34234 34 5
+34535
+34
+1992 1999