Skip to content

Solution Project Euler 5 #149

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Solution Project Euler 5 #149

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
4a6e318
Solution Project Euler 5
Pinarzaimoglu Oct 22, 2019
93d7ee7
README.md
Pinarzaimoglu Oct 31, 2019
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Binary file added C/05.SmallestMultiple/.problem5.c.swp
View file
Open in desktop
Binary file not shown.
13 changes: 13 additions & 0 deletions C/05.SmallestMultiple/problem5.c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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;
}

2 changes: 1 addition & 1 deletion README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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- >
Expand Down