diff --git a/C/05.SmallestMultiple/.problem5.c.swp b/C/05.SmallestMultiple/.problem5.c.swp
new file mode 100644
index 0000000..0f802c1
Binary files /dev/null and b/C/05.SmallestMultiple/.problem5.c.swp differ
diff --git a/C/05.SmallestMultiple/problem5.c b/C/05.SmallestMultiple/problem5.c
new file mode 100644
index 0000000..78c2d49
--- /dev/null
+++ b/C/05.SmallestMultiple/problem5.c
@@ -0,0 +1,13 @@
+#include <stdio.h>
+  
+int main(){
+    while(1){
+        if( i%11==0 && %12==0 && i%13==0 && i%14==0 && i%15==0 && i%16==0 && i%17==0 && i%18==0 && i%19==0 && i%20==0){
+            printf("\n%d\n", i);
+            return 0;
+        }
+        i++;
+    }
+    return 0;
+}
+
diff --git a/README.md b/README.md
index e5f2edf..a5ca2f8 100644
--- a/README.md
+++ b/README.md
@@ -5,7 +5,7 @@
 Project Euler is a series of challenging problems that require mathematical and programming skills. Somebody who enjoys learning new area of mathematics, project Euler is going to be a fun journey.
 
 ## How to contribute?
-- Fork this repository.
+- Fork this repository .
 - Make a directory with the format `problem_number.problem_statement` in the directory of the language you're solving.
 ```
 For example if you are solving Problem no 1 in java- >