diff --git a/du1/README.md b/du1/README.md
new file mode 100644
index 0000000..c266b9f
--- /dev/null
+++ b/du1/README.md
@@ -0,0 +1 @@
+Na DU1 som použil Gemini a Copilot. Gemini mi pomohol s prekladom úlohy a vysvetlil, čo je Hornerova schema. Copilot mi dal predstavu o tom, ako previesť Hornerovu schemu do kódu.
diff --git a/du1/program b/du1/program
new file mode 100755
index 0000000..974bc45
Binary files /dev/null and b/du1/program differ
diff --git a/du1/program.c b/du1/program.c
new file mode 100644
index 0000000..43906cc
--- /dev/null
+++ b/du1/program.c
@@ -0,0 +1,46 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <ctype.h>
+#define LINE_SIZE 256
+
+int main() {
+char line[LINE_SIZE];
+
+int counter = 0;
+
+double x, kef, resultat = 0.0;
+
+
+if(fgets(line, sizeof(line), stdin) == NULL) {
+
+    return 1;
+}
+
+if (sscanf(line, "%lf", &x) != 1) {
+
+  printf("Invalid input for x.\n");
+  return 1;
+
+}
+while (fgets(line, sizeof(line), stdin) != NULL)
+
+{
+    if (line[0] == '\n' || line[0] == '\r') {
+
+        break;
+
+    }
+    if (sscanf(line, "%lf", &kef) == 1) {
+        resultat = resultat * x + kef;
+        counter = counter + 1;
+        
+    }
+    else {
+        printf("Invalid input for coefficient.\n");
+        return 1;
+    }
+}
+printf("Result: %.2f\n", resultat);
+return 0;
+}
\ No newline at end of file